Ensure more tests pass with gap --bare

tst/testbugfix/00008.tst

@@ -5,7 +5,7 @@ gap> EulerianFunction( CyclicGroup(6), 1 );
 2
 gap> EulerianFunction( CyclicGroup(5), 1 );
 4
-gap> g:=SmallGroup(1,1);;
+gap> g:=TrivialGroup(IsPcGroup);;
 gap> ConjugacyClassesSubgroups(g);;
 gap> g:=Group([ (3,5), (1,3,5) ]);;
 gap> MaximalSubgroups(g);;

tst/testinstall/ctbl.tst

@@ -443,19 +443,19 @@ gap> HasIsIrreducibleCharacter( TrivialCharacter( SymmetricGroup( 4 ) ) );
 true
 
 # concurring 'Irr' methods
-gap> G:= PcGroupCode( 221729, 24 );;
+gap> G:= DirectProduct(CyclicGroup(4), DihedralGroup(6));;
 gap> IsSupersolvable( G );
 true
 gap> Irr( G );;
 gap> InfoText( OrdinaryCharacterTable( G ) );
 "origin: Baum-Clausen Algorithm"
-gap> G:= PcGroupCode( 221729, 24 );;
+gap> G:= DirectProduct(CyclicGroup(4), DihedralGroup(6));;
 gap> IsSupersolvable( G );
 true
 gap> IrrConlon( G );;  Irr( G );;
 gap> InfoText( OrdinaryCharacterTable( G ) );
 "origin: Conlon's Algorithm"
-gap> G:= PcGroupCode( 221729, 24 );;
+gap> G:= DirectProduct(CyclicGroup(4), DihedralGroup(6));;
 gap> IrrDixonSchneider( G );;  Irr( G );;
 gap> InfoText( OrdinaryCharacterTable( G ) );
 "origin: Dixon's Algorithm"

tst/testinstall/ctblmaps.tst

@@ -3,8 +3,7 @@ gap> START_TEST( "ctblmaps.tst" );
 
 # `ConsiderStructureConstants` can unexpectedly exclude all candidates.
 # (Benjamin Sambale found examples for that.)
-gap> if TestPackageAvailability("ctbllib") <> fail and
->       LoadPackage("ctbllib", false) <> fail then
+gap> if IsPackageMarkedForLoading( "ctbllib", "" ) then
 >      s:= CharacterTable( "2.A6" );;
 >      t:= CharacterTable( "Co3" );;
 >      maps:= [ [ 1, 2, 8, 4, 11, 4, 13, 18, 18, 9, 22, 9, 22 ],

tst/testinstall/ctblmono.tst

@@ -96,6 +96,8 @@ gap> TestMonomial( irr[2] );
 rec( comment := "whole group is monomial", isMonomial := true )
 gap> IsMonomial( irr[2] );
 true
+
+#
 gap> irr:= Irr( SL(2,3) );;
 gap> chi:= First( irr, x -> x[1] = 3 );;
 gap> TestMonomialQuick( chi );
@@ -104,6 +106,8 @@ gap> TestMonomial( chi );
 rec( comment := "codegree is prime power", isMonomial := true )
 gap> IsMonomial( chi );
 true
+
+#@if IsPackageMarkedForLoading( "smallgrp", "" )
 gap> irr:= Irr( SmallGroup( 120, 15 ) );;
 gap> chi:= First( irr, x -> x[1] = 3 and
 >                           Length( ClassPositionsOfKernel( x ) ) = 2 );;
@@ -121,6 +125,9 @@ gap> TestMonomial( chi );
 rec( comment := "induced from monomial Hall subgroup", isMonomial := true )
 gap> IsMonomial( chi );
 true
+#@fi
+
+#
 gap> g:= DirectProduct( AlternatingGroup(5), SymmetricGroup(3),
 >                       SymmetricGroup(3) );;
 gap> chi:= First( Irr( g ), x -> x[1] = 2 and
@@ -131,6 +138,8 @@ gap> TestMonomial( chi );
 rec( comment := "kernel factor group is supersolvable", isMonomial := true )
 gap> IsMonomial( chi );
 true
+
+#@if IsPackageMarkedForLoading( "smallgrp", "" )
 gap> irr:= Irr( SmallGroup( 144, 31 ) );;
 gap> chi:= First( irr, x -> x[1] = 6 );;
 gap> TestMonomialQuick( chi );
@@ -139,6 +148,9 @@ gap> TestMonomial( chi );
 rec( comment := "kernel factor group is monomial", isMonomial := true )
 gap> IsMonomial( chi );
 true
+#@fi
+
+#
 gap> irr:= Irr( SL(2,3) );;
 gap> chi:= First( irr, x -> x[1] = 2 );;
 gap> TestMonomialQuick( chi );
@@ -147,6 +159,8 @@ gap> TestMonomial( chi );
 rec( comment := "quasiprimitive character", isMonomial := false )
 gap> IsMonomial( chi );
 false
+
+#
 gap> irr:= Irr( AlternatingGroup( 5 ) );;
 gap> chi:= First( irr, x -> x[1] = 5 );;
 gap> TestMonomialQuick( chi );
@@ -166,6 +180,8 @@ gap> TestMonomial( chi, true ).comment;
 "lattice checked"
 gap> IsMonomial( chi );
 false
+
+#@if IsPackageMarkedForLoading( "smallgrp", "" )
 gap> irr:= Irr( SmallGroup( 96, 204 ) );;
 gap> chi:= First( irr, x -> x[1] = 4 );;
 gap> TestMonomialQuick( chi );
@@ -174,6 +190,9 @@ gap> TestMonomial( chi ).comment;
 "induced from 'character'"
 gap> IsMonomial( chi );
 true
+#@fi
+
+#@if IsPackageMarkedForLoading( "smallgrp", "" )
 gap> chi:= First( Irr( SmallGroup( 144, 31 ) ), x -> x[1] = 4 );;
 gap> TestMonomialQuick( chi );
 rec( comment := "no decision by cheap tests", isMonomial := "?" )
@@ -183,6 +202,9 @@ gap> TestMonomial( chi, true ).comment;
 "induced from 'character'"
 gap> IsMonomial( chi );
 true
+#@fi
+
+#
 gap> chi:= 0 * [ 1 .. NrConjugacyClasses( S4 ) ];;
 gap> chi[1]:= Size( S4 );;
 gap> chi:= ClassFunction( S4, chi );;
@@ -193,13 +215,16 @@ gap> TestMonomial( chi, true ).comment;
 gap> IsMonomial( chi );
 true
 gap> TestMonomialUseLattice:= TestMonomialUseLattice_Orig;;
+
+#@if IsPackageMarkedForLoading( "smallgrp", "" )
 gap> chi:= First( Irr( SmallGroup( 48, 28 ) ), x -> x[1] = 4 );;
 gap> TestMonomialQuick( chi );
 rec( comment := "no decision by cheap tests", isMonomial := "?" )
 gap> TestMonomial( chi ).comment;
 "induced from 'character'"
 gap> IsMonomial( chi );
 true
+#@fi
 
 ##
 gap> TestMonomialQuick( S4 );
@@ -214,6 +239,8 @@ gap> TestMonomial( Sl23 );
 rec( comment := "list Delta( G ) contains entry > 1", isMonomial := false )
 gap> IsMonomial( Sl23 );
 false
+
+#@if IsPackageMarkedForLoading( "smallgrp", "" )
 gap> g:= SmallGroup( 96, 204 );;
 gap> TestMonomialQuick( g );
 rec( comment := "no decision by cheap tests", isMonomial := "?" )
@@ -239,13 +266,18 @@ gap> TestMonomial( g );
 rec( comment := "was already stored", isMonomial := true )
 gap> IsMonomial( g );
 true
+#@fi
+
+#
 gap> g:= AlternatingGroup( 5 );;
 gap> TestMonomialQuick( g );
 rec( comment := "non-solvable group", isMonomial := false )
 gap> TestMonomial( g );
 rec( comment := "non-solvable group", isMonomial := false )
 gap> IsMonomial( g );
 false
+
+#@if IsPackageMarkedForLoading( "smallgrp", "" )
 gap> g:= SmallGroup( 56, 10 );;
 gap> TestMonomialQuick( g );
 rec( comment := "group order is monomial", isMonomial := true )
@@ -274,6 +306,7 @@ gap> TestMonomial( g );
 rec( comment := "Sylow abelian by supersolvable group", isMonomial := true )
 gap> IsMonomial( g );
 true
+#@fi
 
 ##
 gap> TestSubnormallyMonomial( S4 );

tst/testinstall/ctblsolv.tst

@@ -1,7 +1,7 @@
 #@local G, pair, mth, all, rks, tbl
 gap> START_TEST("ctblsolv.tst");
 
-##
+#@if IsPackageMarkedForLoading( "smallgrp", "" )
 gap> CharacterDegrees( SmallGroup( 256, 529 ) );
 [ [ 1, 8 ], [ 2, 30 ], [ 4, 8 ] ]
 gap> for pair in [ [ 18, 3 ], [ 27, 3 ], [ 36, 7 ], [ 50, 3 ], [ 54, 4 ] ] do
@@ -11,18 +11,19 @@ gap> for pair in [ [ 18, 3 ], [ 27, 3 ], [ 36, 7 ], [ 50, 3 ], [ 54, 4 ] ] do
 >        Error( IdGroup( G ) );
 >      fi;
 >    od;
+#@fi
 
 ##
 gap> mth:= [];;
 gap> G:= AbelianGroup( [ 2, 3, 5 ] );;
 gap> Add( mth, ApplicableMethod( CharacterDegrees, [ G ] ) );
 gap> CharacterDegrees( G ) = [ [ 1, 30 ] ];
 true
-gap> G:= SmallGroup( 24, 12 );;  Irr( G );;
+gap> G:= SymmetricGroup(IsPcGroup, 4);;  Irr( G );;
 gap> Add( mth, ApplicableMethod( CharacterDegrees, [ G ] ) );
 gap> CharacterDegrees( G ) = [ [ 1, 2 ], [ 2, 1 ], [ 3, 2 ] ];
 true
-gap> G:= SmallGroup( 24, 12 );;  CharacterTable( G );;
+gap> G:= SymmetricGroup(IsPcGroup, 4);;  CharacterTable( G );;
 gap> Add( mth, ApplicableMethod( CharacterDegrees, [ G ] ) );
 gap> CharacterDegrees( G ) = [ [ 1, 2 ], [ 2, 1 ], [ 3, 2 ] ];
 true
@@ -34,7 +35,7 @@ gap> G:= Group( [ [ E(3) ] ], [ [ E(4) ] ] );;
 gap> Add( mth, ApplicableMethod( CharacterDegrees, [ G ] ) );
 gap> CharacterDegrees( G ) = [ [ 1, 12 ] ];
 true
-gap> G:= SmallGroup( 24, 12 );;  # hier: auch überaufl.!!!
+gap> G:= SymmetricGroup(IsPcGroup, 4);;  # hier: auch überaufl.!!!
 gap> Add( mth, ApplicableMethod( CharacterDegrees, [ G ] ) );
 gap> CharacterDegrees( G ) = [ [ 1, 2 ], [ 2, 1 ], [ 3, 2 ] ];
 true

tst/testinstall/grp/basic.tst

@@ -271,10 +271,10 @@ true
 #
 # dicyclic groups
 #
-gap> IdGroup(DicyclicGroup(4));
-[ 4, 1 ]
-gap> IdGroup(DicyclicGroup(IsFpGroup,4));
-[ 4, 1 ]
+gap> StructureDescription(DicyclicGroup(4));
+"C4"
+gap> StructureDescription(DicyclicGroup(IsFpGroup,4));
+"C4"
 gap> DicyclicGroup(8);
 <pc group of size 8 with 3 generators>
 gap> DicyclicGroup(IsPcGroup,8);
@@ -340,10 +340,12 @@ gap> for n in [ 4, 12, 20, 24 ] do
 >        Error( "gen. quat. group?" );
 >      fi;
 >    od;
+#@if IsPackageMarkedForLoading( "smallgrp", "" )
 gap> Number( AllSmallGroups( [  1 .. 32 ], IsDicyclicGroup ) );
 8
 gap> Number( AllSmallGroups( [  1 .. 32 ], IsGeneralisedQuaternionGroup ) );
 3
+#@fi
 
 #
 gap> Q:= DicyclicGroup( 20 );;

tst/testinstall/grpfp.tst

@@ -162,13 +162,17 @@ false
 Error, the f.p. group <G> is not finite
 
 # RWS for G2(3) and S_6(2)
+#@if IsPackageMarkedForLoading( "primgrp", "" )
 gap> g:=SimpleGroup("G2(3)");;
 gap> hom:=IsomorphismFpGroupForRewriting(g);;
 gap> m:=Image(IsomorphismFpMonoid(Image(hom)));;
 gap> F:=m!.rewritingSystem;;;
 gap> ReducedForm(F,UnderlyingElement(
 > Product(GeneratorsOfMonoid(m){[1,3..19]})));
 w1*B5*b6*b7*B8*w2*b1*B3*B4*b5*b6*b7
+#@fi
+
+#
 gap> g:=SimpleGroup("S6(2)");;
 gap> hom:=IsomorphismFpGroupForRewriting(g);;
 gap> m:=Image(IsomorphismFpMonoid(Image(hom)));;

tst/testinstall/grpmat.tst

@@ -86,8 +86,10 @@ gap> TrivialSubgroup( GL(2, 2) );
 <matrix group of size 1>
 
 # The following should take less than a second.
+#@if IsPackageMarkedForLoading( "primgrp", "" )
 gap> Length( LowIndexSubgroups( GL(2,5), 50 ) ) = 31;
 true
+#@fi
 
 # 'NiceMonomorphism' behaves well w.r.t. 'ConstructingFilter'
 gap> G:= SP( 4, 2 );;

tst/testinstall/grppc.tst

@@ -137,7 +137,7 @@ gap> List( sys, Size );
 [ 4, 7 ]
 gap> List(sys,i->Length(AsList(i)));
 [ 4, 7 ]
-gap> G := SmallGroup( 144, 183 );;
+gap> G := DirectProduct(SymmetricGroup(IsPcGroup, 3), SymmetricGroup(IsPcGroup, 4));;
 gap> F := FittingSubgroup( G );;
 gap> S := SylowSubgroup( F, 2 );;
 gap> Display(Image(IsomorphismPcGroup(S)));
@@ -166,7 +166,7 @@ gap> RepresentativeAction(G,x,x^2)<>fail;
 true
 gap> RepresentativeAction(G,x,x^2);
 f1*f2
-gap> g := SmallGroup(243,27);;
+gap> g := PcGroupCode(14055476799225975, 243);; # = SmallGroup(243,27)
 gap> AsSet(Omega(g,3,1)) = Set(Filtered(g, g -> IsOne(g^3)));
 true
 gap> AsSet(Omega(g,3,2)) = Set(Filtered(g, g -> IsOne(g^9)));

tst/testinstall/interpreter.tst

@@ -39,8 +39,10 @@ gap> QUIT;
 #
 # help system
 #
+#@if IsPackageMarkedForLoading( "gapdoc", "" )
 gap> ?qwert_asdf
 Help: no matching entry found
+#@fi
 
 #
 # function call with options

tst/testinstall/mapphomo.tst

@@ -86,7 +86,7 @@ gap> One( hom );
 fail
 
 # Check that group homomorphisms created by a function can compute preimages.
-gap> for G in [ SymmetricGroup(5), SmallGroup( 24, 12 ), GL(2,3) ] do
+gap> for G in [ SymmetricGroup(5), DihedralGroup(8), GL(2,3) ] do
 >      hom:= GroupHomomorphismByFunction( G, G, x -> x );
 >      PreImagesRepresentative( hom, G.1 );
 >    od;

tst/testinstall/matblock.tst

@@ -138,7 +138,7 @@ gap> MinimalPolynomial( R, m2 ) = MinimalPolynomial( R, MatrixByBlockMatrix( m2
 true
 
 # Groups that consist of block matrices
-gap> G:= SmallGroup( 24, 12 );;
+gap> G:= SymmetricGroup(IsPcGroup, 4);;
 gap> H:= SylowSubgroup( G, 2 );;
 gap> reps:= IrreducibleRepresentations( H );;
 gap> ind:= InducedRepresentation( reps[5], G );;

tst/testinstall/meatauto.tst

@@ -12,7 +12,7 @@ gap> SMTX_NullspaceEqns(e);
 #
 # MTX.BasisModuleEndomorphisms
 #
-gap> G:=SmallGroup(24, 3);;
+gap> G:=SL(2, 3);;
 gap> p:=NextPrimeInt(100);;
 gap> M:=RegularModule(G, GF(p))[2];;
 gap> MTX.BasisModuleEndomorphisms(M);
@@ -44,7 +44,7 @@ gap> MTX.BasisModuleEndomorphisms(M);
 #
 # MTX.HomogeneousComponents
 #
-gap> G:=SmallGroup(24, 3);;
+gap> G:=SL(2, 3);;
 gap> p:=NextPrimeInt(100);;
 gap> M:=RegularModule(G, GF(p))[2];;
 gap> hc := MTX.HomogeneousComponents(M);;

tst/testinstall/meataxe.tst

@@ -77,8 +77,10 @@ gap> M2:=TensorProductGModule(M,M);
 rec( IsOverFiniteField := true, dimension := 9, field := GF(2), 
   generators := [ <an immutable 9x9 matrix over GF2>, 
       <an immutable 9x9 matrix over GF2> ], isMTXModule := true )
-gap> IdGroup(MTX.ModuleAutomorphisms(M2));
-[ 1344, 11301 ]
+gap> G:=MTX.ModuleAutomorphisms(M2);
+<matrix group of size 1344 with 9 generators>
+gap> StructureDescription(G);
+"PSL(3,2) x D8"
 gap> cf:=MTX.CompositionFactors(M2);;
 gap> ForAll(cf, MTX.IsAbsolutelyIrreducible);
 true
@@ -138,8 +140,8 @@ false
 
 #
 gap> M2:=First(MTX.CompositionFactors(M), m -> m.dimension = 4);;
-gap> IdGroup(MTX.ModuleAutomorphisms(M2));
-[ 48, 2 ]
+gap> StructureDescription(MTX.ModuleAutomorphisms(M2));
+"C48"
 gap> MTX.IsIndecomposable(M2);
 true
 gap> MTX.IsAbsolutelyIrreducible(M2);

tst/testinstall/opers/FittingSubgroup.tst

@@ -15,11 +15,12 @@ gap> G := CyclicGroup(IsPcGroup, 12);;
 gap> IsIdenticalObj(G, FittingSubgroup(G));
 true
 
-#
+#@if IsPackageMarkedForLoading( "smallgrp", "" )
 gap> List(AllSmallGroups(60), g -> Size(FittingSubgroup(g)));
 [ 30, 30, 30, 60, 1, 15, 15, 15, 20, 30, 30, 30, 60 ]
 gap> ForAll(AllSmallGroups(60), g -> IsNormal(g, FittingSubgroup(g)));
 true
+#@fi
 
 #
 gap> g := SL(2,5);;