passagemath-gap-pkg-semigroups 10.6.30__cp310-cp310-macosx_13_0_arm64.whl

gap/pkg/semigroups/tst/standard/ideals/ideals.tst

@@ -0,0 +1,380 @@
+#############################################################################
+##
+#W  standard/ideals/ideals.tst
+#Y  Copyright (C) 2016-2022                              James D. Mitchell
+##
+##  Licensing information can be found in the README file of this package.
+##
+#############################################################################
+##
+
+#@local A, I, J, S, T, acting, ideals, regular, x, y, z
+gap> START_TEST("Semigroups package: standard/ideals/ideals.tst");
+gap> LoadPackage("semigroups", false);;
+
+# The tests in this file do not attempt to test every line in ideals.gi
+# since that file needs to be completely rewritten.
+
+#
+gap> SEMIGROUPS.StartTest();
+
+# Test SupersemigroupOfIdeal
+gap> S := RegularBooleanMatMonoid(3);;
+gap> I := SemigroupIdeal(S, 
+>                        Matrix(IsBooleanMat, 
+>                               [[1, 1, 1], [1, 0, 1], [1, 1, 1]]));
+<semigroup ideal of 3x3 boolean matrices with 1 generator>
+gap> J := MinimalIdeal(I);
+<simple semigroup ideal of 3x3 boolean matrices with 1 generator>
+gap> SupersemigroupOfIdeal(I) = S;
+true
+gap> SupersemigroupOfIdeal(J) = S;
+true
+gap> Parent(J) = I;
+true
+
+# Test PrintString
+gap> S := RegularBooleanMatMonoid(3);;
+gap> I := SemigroupIdeal(S, 
+>                        Matrix(IsBooleanMat, 
+>                               [[1, 1, 1], [1, 0, 1], [1, 1, 1]]));
+<semigroup ideal of 3x3 boolean matrices with 1 generator>
+gap> PrintString(I);
+"\>\>SemigroupIdeal(\< \>Monoid( \>\>\>Matrix(\<\>IsBooleanMat\<, \>[\>\>[0, 1\
+, 0]\<, \<\>\>[1, 0, 0]\<, \<\>\>[0, 0, 1]\<\<]\<)\<\>\>\>Matrix(\<\>IsBoolean\
+Mat\<, \>[\>\>[0, 1, 0]\<, \<\>\>[0, 0, 1]\<, \<\>\>[1, 0, 0]\<\<]\<)\<\<, \>\
+\>\>Matrix(\<\>IsBooleanMat\<, \>[\>\>[1, 0, 0]\<, \<\>\>[0, 1, 0]\<, \<\>\>[1\
+, 0, 1]\<\<]\<)\<\<, \>\>\>Matrix(\<\>IsBooleanMat\<, \>[\>\>[1, 0, 0]\<, \<\>\
+\>[0, 1, 0]\<, \<\>\>[0, 0, 0]\<\<]\<)\<\<\<\> )\<,\< \>\>\>Matrix(\<\>IsBoole\
+anMat\<, \>[\>\>[1, 1, 1]\<, \<\>\>[1, 0, 1]\<, \<\>\>[1, 1, 1]\<\<]\<\< )\<"
+
+# Test ViewString
+gap> S := RegularBooleanMatMonoid(1);;
+gap> I := MinimalIdeal(S);
+<group of 1x1 boolean matrices>
+gap> IsTrivial(I);
+true
+gap> I;
+<trivial group of 1x1 boolean matrices>
+gap> S := SymmetricInverseMonoid(3);;
+gap> MinimalIdeal(S);
+<partial perm group of rank 0>
+gap> S := RegularBooleanMatMonoid(3);;
+gap> x := Matrix(IsBooleanMat, [[1, 1, 1], [1, 1, 1], [1, 1, 1]]);;
+gap> I := SemigroupIdeal(S, x);
+<semigroup ideal of 3x3 boolean matrices with 1 generator>
+gap> IsZeroSimpleSemigroup(I);
+true
+gap> I;
+<0-simple regular semigroup ideal of size 50, 3x3 boolean matrices with
+  1 generator>
+gap> x := Matrix(IsBooleanMat, [[0, 1, 0], [1, 0, 1], [1, 1, 0]]);;
+gap> I := SemigroupIdeal(S, x);
+<semigroup ideal of 3x3 boolean matrices with 1 generator>
+gap> IsRegularSemigroup(I);
+false
+gap> I;
+<non-regular semigroup ideal of size 428, 3x3 boolean matrices with
+  1 generator>
+gap> S := SymmetricInverseMonoid(3);;
+gap> x := PartialPerm([1, 2]);;
+gap> I := SemigroupIdeal(S, x);
+<inverse partial perm semigroup ideal of rank 3 with 1 generator>
+gap> I := SemigroupIdeal(S, S);
+<inverse partial perm semigroup ideal of rank 3 with 5 generators>
+gap> Size(I);
+34
+gap> I;
+<inverse partial perm semigroup ideal of size 34, rank 3 with 5 generators>
+gap> IsMonoid(I);
+false
+
+# Test \. (for accessing generators)
+gap> S := RegularBooleanMatMonoid(3);;
+gap> I := SemigroupIdeal(S, S.1, S.2);;
+gap> I.1 = S.1;
+true
+gap> I.2 = S.2;
+true
+gap> I.3;
+Error, the 2nd argument (a positive integer) exceeds the number of generators \
+of the 1st argument (an ideal)
+
+# Test \= for semigroup ideals
+gap> S := RegularBooleanMatMonoid(3);;
+gap> I := SemigroupIdeal(S, S.1, S.2);;
+gap> J := SemigroupIdeal(S, S.1, S.2, S.3);;
+gap> I = J;
+true
+gap> J = I;
+true
+gap> I := SemigroupIdeal(FullBooleanMatMonoid(3), S.1, S.2);;
+gap> I = J;
+false
+
+# Test \= for semigroup and semigroup ideal
+gap> S := RegularBooleanMatMonoid(3);;
+gap> I := SemigroupIdeal(S, S.1, S.2);;
+gap> S = I;
+true
+gap> I = S;
+true
+gap> I := SemigroupIdeal(FullBooleanMatMonoid(3), S.1, S.2);;
+gap> I = S;
+false
+gap> S = I;
+false
+gap> I := SemigroupIdeal(FullBooleanMatMonoid(3), S.1, S.2);;
+gap> GeneratorsOfSemigroup(I);;
+gap> I = S;
+false
+gap> S = I;
+false
+gap> S = MinimalIdeal(S);
+false
+
+# Test SemigroupIdeal (the function)
+gap> SemigroupIdeal("a");
+Error, there must be 2 or more arguments
+gap> S := RegularBooleanMatMonoid(1);;
+gap> SemigroupIdeal(S);
+Error, there must be 2 or more arguments
+gap> S := Semigroup([[Z(2)]]);
+<trivial group with 1 generator>
+gap> SemigroupIdeal(S, S.1);
+<commutative inverse semigroup ideal with 1 generator>
+gap> S := RegularBooleanMatMonoid(2);;
+gap> I := SemigroupIdeal(S, [S.1, S.2]);
+<semigroup ideal of 2x2 boolean matrices with 2 generators>
+gap> J := SemigroupIdeal(S, I, S.3);
+<semigroup ideal of 2x2 boolean matrices with 3 generators>
+gap> I := SemigroupIdeal(S, [S.1, S.2], rec());
+<semigroup ideal of 2x2 boolean matrices with 2 generators>
+gap> I := SemigroupIdeal(S, MaximalDClasses(S)[1]);
+<semigroup ideal of 2x2 boolean matrices with 2 generators>
+gap> I := SemigroupIdeal(S, []);
+Error, the 2nd argument is not a combination of generators, lists of generator\
+s, nor semigroups
+gap> SemigroupIdeal();
+Error, there must be 2 or more arguments
+gap> SemigroupIdeal(S, NullDigraph(2));
+Error, invalid arguments
+
+# Test SemigroupIdealByGenerators
+gap> S := RegularBooleanMatMonoid(1);;
+gap> T := RegularBooleanMatMonoid(2);;
+gap> SemigroupIdeal(S, T.1);
+Error, the 2nd argument (a mult. elt. coll.) do not all belong to the semigrou\
+p
+
+# Test SemigroupIdealByGeneratorsNC
+gap> S := FullTransformationMonoid(3);;
+gap> I := SemigroupIdeal(S, S.1, rec(regular := true));
+<regular transformation semigroup ideal of degree 3 with 1 generator>
+gap> S := GLM(3, 2);;
+gap> I := SemigroupIdeal(S, S.3);
+<regular semigroup ideal of 3x3 matrices over GF(2) with 1 generator>
+gap> IsMatrixOverFiniteFieldSemigroup(I);
+true
+gap> S := PartitionMonoid(3);;
+gap> I := SemigroupIdeal(S, S.3);
+<regular bipartition *-semigroup ideal of degree 3 with 1 generator>
+gap> HasIsStarSemigroup(I) and IsStarSemigroup(I);
+true
+gap> S := RegularBooleanMatMonoid(3);;
+gap> IsRegularSemigroup(S);
+false
+gap> I := SemigroupIdeal(S, S.1);
+<semigroup ideal of 3x3 boolean matrices with 1 generator>
+gap> S := Semigroup(FullTransformationMonoid(3));;
+gap> I := SemigroupIdeal(S, S.1);;
+
+# Test MinimalIdealGeneratingSet
+gap> S := FullTransformationMonoid(3);;
+gap> I := SemigroupIdeal(S, S);
+<regular transformation semigroup ideal of degree 3 with 4 generators>
+gap> MinimalIdealGeneratingSet(I);
+[ IdentityTransformation ]
+gap> I := SemigroupIdeal(S, S.1);
+<regular transformation semigroup ideal of degree 3 with 1 generator>
+gap> MinimalIdealGeneratingSet(I);
+[ Transformation( [ 2, 3, 1 ] ) ]
+gap> S := RegularBooleanMatMonoid(3);;
+gap> I := SemigroupIdeal(S, 
+>  Matrix(IsBooleanMat, [[1, 1, 1], [1, 1, 0], [1, 0, 1]]),
+>  Matrix(IsBooleanMat, [[1, 1, 1], [1, 1, 0], [0, 0, 1]]),
+>  Matrix(IsBooleanMat, [[1, 0, 0], [0, 1, 1], [1, 0, 1]]),
+>  Matrix(IsBooleanMat, [[1, 1, 0], [1, 0, 0], [1, 0, 1]]),
+>  Matrix(IsBooleanMat, [[0, 0, 1], [0, 0, 1], [0, 1, 0]]),
+>  Matrix(IsBooleanMat, [[1, 0, 0], [0, 0, 0], [0, 0, 1]]),
+>  Matrix(IsBooleanMat, [[1, 0, 1], [0, 1, 1], [1, 1, 1]]),
+>  Matrix(IsBooleanMat, [[1, 1, 0], [0, 0, 1], [1, 1, 1]]),
+>  Matrix(IsBooleanMat, [[1, 0, 1], [0, 0, 0], [0, 1, 0]]),
+>  Matrix(IsBooleanMat, [[0, 1, 1], [0, 1, 1], [1, 0, 1]]));
+<semigroup ideal of 3x3 boolean matrices with 10 generators>
+gap> MinimalIdealGeneratingSet(I);
+[ Matrix(IsBooleanMat, [[0, 1, 0], [1, 0, 1], [1, 1, 0]]), 
+  Matrix(IsBooleanMat, [[1, 0, 0], [1, 1, 0], [1, 0, 1]]) ]
+
+# Test InversesOfSemigroupElementNC
+gap> S := RegularBooleanMatMonoid(3);;
+gap> I := SemigroupIdeal(S, 
+>  Matrix(IsBooleanMat, [[1, 1, 1], [1, 1, 0], [1, 0, 1]]),
+>  Matrix(IsBooleanMat, [[1, 1, 1], [1, 1, 0], [0, 0, 1]]),
+>  Matrix(IsBooleanMat, [[1, 0, 0], [0, 1, 1], [1, 0, 1]]),
+>  Matrix(IsBooleanMat, [[1, 1, 0], [1, 0, 0], [1, 0, 1]]),
+>  Matrix(IsBooleanMat, [[0, 0, 1], [0, 0, 1], [0, 1, 0]]),
+>  Matrix(IsBooleanMat, [[1, 0, 0], [0, 0, 0], [0, 0, 1]]),
+>  Matrix(IsBooleanMat, [[1, 0, 1], [0, 1, 1], [1, 1, 1]]),
+>  Matrix(IsBooleanMat, [[1, 1, 0], [0, 0, 1], [1, 1, 1]]),
+>  Matrix(IsBooleanMat, [[1, 0, 1], [0, 0, 0], [0, 1, 0]]),
+>  Matrix(IsBooleanMat, [[0, 1, 1], [0, 1, 1], [1, 0, 1]]));;
+gap> x := Matrix(IsBooleanMat, [[1, 0, 1], [0, 1, 0], [1, 0, 1]]);;
+gap> AsSet(InversesOfSemigroupElement(I, x));
+[ Matrix(IsBooleanMat, [[0, 0, 0], [0, 1, 0], [0, 0, 1]]), 
+  Matrix(IsBooleanMat, [[0, 0, 0], [0, 1, 0], [1, 0, 0]]), 
+  Matrix(IsBooleanMat, [[0, 0, 0], [0, 1, 0], [1, 0, 1]]), 
+  Matrix(IsBooleanMat, [[0, 0, 1], [0, 1, 0], [0, 0, 0]]), 
+  Matrix(IsBooleanMat, [[0, 0, 1], [0, 1, 0], [0, 0, 1]]), 
+  Matrix(IsBooleanMat, [[1, 0, 0], [0, 1, 0], [0, 0, 0]]), 
+  Matrix(IsBooleanMat, [[1, 0, 0], [0, 1, 0], [1, 0, 0]]), 
+  Matrix(IsBooleanMat, [[1, 0, 1], [0, 1, 0], [0, 0, 0]]), 
+  Matrix(IsBooleanMat, [[1, 0, 1], [0, 1, 0], [1, 0, 1]]) ]
+
+# Test IsCommutativeSemigroup
+gap> x := Transformation([13, 4, 1, 2, 14, 14, 7, 12, 4, 9, 2, 14, 5, 14, 13,
+> 18, 15, 8, 18, 9]);;
+gap> y := Transformation([13, 15, 7, 18, 4, 2, 8, 12, 10, 7, 8, 11, 12, 12, 17,
+> 6, 13, 9, 16, 13]);;
+gap> T := DirectProduct(Semigroup(x), Semigroup(y));
+<commutative transformation semigroup of size 45, degree 40 with 13 
+ generators>
+gap> z := Transformation([14, 2, 14, 4, 14, 14, 7, 14, 2, 4, 4, 14, 14, 14, 14,
+> 14, 14, 14, 14, 4, 32, 31, 28, 28, 31, 32, 32, 31, 31, 28, 32, 28, 31, 31, 28,
+> 28, 32, 32, 31, 32]);;
+gap> I := SemigroupIdeal(T, z);;
+gap> IsCommutativeSemigroup(I);
+true
+gap> S := RegularBooleanMatMonoid(3);;
+gap> I := SemigroupIdeal(S, 
+> [Matrix(IsBooleanMat, [[0, 1, 0], [1, 0, 1], [1, 1, 0]]), 
+>  Matrix(IsBooleanMat, [[1, 0, 0], [1, 1, 0], [1, 0, 1]])]);;
+gap> IsCommutativeSemigroup(I);
+false
+gap> T := Semigroup(T);
+<transformation semigroup of degree 40 with 13 generators>
+gap> I := SemigroupIdeal(T, z);;
+gap> IsCommutativeSemigroup(I);
+true
+gap> T := Semigroup(T);
+<transformation semigroup of degree 40 with 13 generators>
+gap> I := SemigroupIdeal(T, z);;
+gap> IsCommutativeSemigroup(T);
+true
+gap> IsCommutativeSemigroup(I);
+true
+
+#Test IsTrivial
+gap> S := Semigroup(Matrix(IsBooleanMat, [[1, 1], [1, 1]]));
+<commutative semigroup of 2x2 boolean matrices with 1 generator>
+gap> I := SemigroupIdeal(S, S.1);
+<commutative semigroup ideal of 2x2 boolean matrices with 1 generator>
+gap> IsTrivial(S);
+true
+gap> IsTrivial(I);
+true
+
+# IsFactorisableInverseMonoid
+gap> S := UniformBlockBijectionMonoid(4);
+<inverse block bijection monoid of degree 4 with 3 generators>
+gap> I := SemigroupIdeal(S, S.1);
+<inverse bipartition semigroup ideal of degree 4 with 1 generator>
+gap> IsFactorisableInverseMonoid(I);
+true
+gap> I := MinimalIdeal(I);
+<bipartition group of degree 4>
+gap> IsFactorisableInverseMonoid(I);
+true
+
+# IsFactorisableInverseMonoid
+gap> S := SymmetricInverseMonoid(5);;
+gap> I := MinimalIdeal(S);;
+gap> IsFactorisableInverseMonoid(I);
+true
+gap> J := InverseMonoid(I);;
+gap> I = J;
+true
+gap> IsFactorisableInverseMonoid(J);
+true
+
+# Test Ideals method
+gap> S := Semigroup([Transformation([5, 3, 1, 5, 3]),
+>                    Transformation([4, 3, 1, 5, 5]),
+>                    Transformation([1, 5, 5, 4, 2])]);;
+gap> ideals := Ideals(S);;
+gap> Size(ideals);
+17
+gap> IsDuplicateFreeList(ideals);
+true
+gap> S := TrivialSemigroup(IsBlockBijectionSemigroup);;
+gap> ideals := Ideals(S);;
+gap> Size(ideals);
+1
+gap> Size(ideals[1]);
+1
+gap> A := AlternatingGroup(100);;
+gap> ideals := Ideals(S);;
+gap> Size(ideals);
+1
+gap> S := Semigroup([
+>           Bipartition([[1, 2, -1, -4], [3, -5], [4], [5, -2], [-3]]), 
+>           Bipartition([[1, 2, 4, -3, -5], [3, -4], [5, -1, -2]]),
+>           Bipartition([[1, 2, 5, -3, -4], [3, 4, -1, -2], [-5]])]);;
+gap> ideals := Ideals(S);;
+gap> Size(ideals);
+179
+
+# MultiplicativeZero
+gap> S := FreeSemigroup(2);;
+gap> I := SemigroupIdeal(S, S.1);;
+gap> IsTrivial(I);
+false
+gap> MultiplicativeZero(I);
+fail
+gap> S := FreeSemigroup(2);;
+gap> I := SemigroupIdeal(S, S.2 * S.1);;
+gap> MultiplicativeZero(I);
+fail
+gap> S := SymmetricInverseMonoid(3);;
+gap> I := SemigroupIdeal(S, PartialPerm([2, 1]));;
+gap> MultiplicativeZero(I);
+<empty partial perm>
+
+# IsMultiplicativeZero
+gap> S := SingularTransformationMonoid(3);;
+gap> S := Semigroup(S, rec(acting := false));;
+gap> IsMultiplicativeZero(S, IdentityTransformation);
+false
+gap> GeneratorsOfSemigroup(S);;
+gap> IsMultiplicativeZero(S, Transformation([1, 1, 1]));
+false
+gap> S := Semigroup(SymmetricInverseSemigroup(3), rec(acting := false));
+<partial perm monoid of rank 3 with 4 generators>
+gap> S := SemigroupIdeal(S, PartialPerm([2]),
+> rec(acting := false));;
+gap> GeneratorsOfSemigroup(S);;
+gap> IsMultiplicativeZero(S, EmptyPartialPerm());
+true
+gap> IsMultiplicativeZero(S, PartialPerm([1, 2, 3]));
+false
+gap> S := SemigroupIdeal(SymmetricInverseSemigroup(3), PartialPerm([2]));;
+gap> IsMultiplicativeZero(S, EmptyPartialPerm());
+true
+
+# SemigroupIdeal bad input
+gap> SemigroupIdeal("bananas", "bananas");
+Error, the 1st argument is not a semigroup
+
+#
+gap> SEMIGROUPS.StopTest();
+gap> STOP_TEST("Semigroups package: standard/ideals/ideals.tst");

gap/pkg/semigroups/tst/standard/libsemigroups/cong.tst

@@ -0,0 +1,310 @@
+#############################################################################
+##
+#W  standard/libsemigroups/cong.tst
+#Y  Copyright (C) 2022                                     James Mitchell
+##
+##  Licensing information can be found in the README file of this package.
+##
+#############################################################################
+##
+
+#@local C, D, F, I, R, S, T, cong, hom, t, u
+gap> START_TEST("Semigroups package: standard/libsemigroups/cong.tst");
+gap> LoadPackage("semigroups", false);;
+
+# Set info levels and user preferences
+gap> SEMIGROUPS.StartTest();
+
+# LibsemigroupsCongruenceConstructor for transf. semigroup
+gap> S := Semigroup(Transformation([1, 1, 2]));
+<commutative transformation semigroup of degree 3 with 1 generator>
+gap> LibsemigroupsCongruenceConstructor(S);
+function( arg1, arg2 ) ... end
+gap> S := Semigroup(ConstantTransformation(17, 2));
+<commutative transformation semigroup of degree 17 with 1 generator>
+gap> LibsemigroupsCongruenceConstructor(S);
+function( arg1, arg2 ) ... end
+gap> S := Semigroup(ConstantTransformation(65537, 2));
+<commutative transformation semigroup of degree 65537 with 1 generator>
+gap> LibsemigroupsCongruenceConstructor(S);
+function( arg1, arg2 ) ... end
+
+# LibsemigroupsCongruenceConstructor for pperm semigroup
+gap> S := Semigroup(PartialPerm([1, 2, 5]));
+<commutative partial perm semigroup of rank 3 with 1 generator>
+gap> LibsemigroupsCongruenceConstructor(S);
+function( arg1, arg2 ) ... end
+gap> S := Semigroup(PartialPerm([1 .. 17]));
+<trivial partial perm group of rank 17 with 1 generator>
+gap> LibsemigroupsCongruenceConstructor(S);
+function( arg1, arg2 ) ... end
+gap> S := Semigroup(PartialPerm([1 .. 65537]));
+<trivial partial perm group of rank 65537 with 1 generator>
+gap> LibsemigroupsCongruenceConstructor(S);
+function( arg1, arg2 ) ... end
+
+# LibsemigroupsCongruenceConstructor for a bmat semigroup
+gap> S := Semigroup(Matrix(IsBooleanMat, [[0, 0], [0, 0]]),
+>                   Matrix(IsBooleanMat, [[1, 1], [0, 1]]));
+<semigroup of 2x2 boolean matrices with 2 generators>
+gap> LibsemigroupsCongruenceConstructor(S);
+function( arg1, arg2 ) ... end
+gap> S := Semigroup(
+> Matrix(IsBooleanMat, [[0, 0, 0, 1, 1, 1, 0, 1, 0], [0, 0, 1, 1, 0, 0, 1, 1, 0],
+>       [0, 1, 0, 1, 0, 1, 0, 1, 0], [1, 0, 0, 0, 1, 1, 0, 0, 0], [1, 0, 0, 0, 1, 1, 0, 1, 1],
+>       [0, 0, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 0, 0, 0, 1, 0], [0, 1, 1, 0, 0, 0, 1, 0, 0],
+>       [1, 0, 0, 1, 1, 1, 1, 0, 1]]));
+<commutative semigroup of 9x9 boolean matrices with 1 generator>
+gap> LibsemigroupsCongruenceConstructor(S);
+function( arg1, arg2 ) ... end
+
+# LibsemigroupsCongruenceConstructor for other matrix over semiring
+gap> S := Semigroup(Matrix(IsMinPlusMatrix, [[-2, 2], [0, -1]]),
+>                   Matrix(IsMinPlusMatrix, [[0, 0], [1, -3]]));
+<semigroup of 2x2 min-plus matrices with 2 generators>
+gap> LibsemigroupsCongruenceConstructor(S);
+function( arg1, arg2 ) ... end
+gap> S := Semigroup(Matrix(IsMaxPlusMatrix, [[-2, 2], [0, -1]]),
+>                   Matrix(IsMaxPlusMatrix, [[0, 0], [1, -3]]));
+<semigroup of 2x2 max-plus matrices with 2 generators>
+gap> LibsemigroupsCongruenceConstructor(S);
+function( arg1, arg2 ) ... end
+
+# LibsemigroupsCongruenceConstructor for bipartition semigroup
+gap> S := PartitionMonoid(2);
+<regular bipartition *-monoid of size 15, degree 2 with 3 generators>
+gap> LibsemigroupsCongruenceConstructor(S);
+function( arg1, arg2 ) ... end
+
+# LibsemigroupsCongruenceConstructor for pbr semigroup
+gap> S := FullPBRMonoid(1);
+<pbr monoid of degree 1 with 4 generators>
+gap> LibsemigroupsCongruenceConstructor(S);
+function( arg1, arg2 ) ... end
+
+# LibsemigroupsCongruence for a congruence on a semigroup with CanUseLibsemigroupsFroidurePin
+gap> S := FullBooleanMatMonoid(2);
+<monoid of 2x2 boolean matrices with 3 generators>
+gap> C := SemigroupCongruence(S, [[S.1, S.3]]);
+<2-sided semigroup congruence over <regular monoid 
+ of size 16, 2x2 boolean matrices with 3 generators> with 1 generating pairs>
+gap> LibsemigroupsCongruence(C);;  # Can't test output because it contains the memory address
+
+# LibsemigroupsCongruence for a congruence on a fp semigroup
+gap> S := FreeSemigroup(2);
+<free semigroup on the generators [ s1, s2 ]>
+gap> C := SemigroupCongruence(S, [[S.1, S.2]]);
+<2-sided semigroup congruence over <free semigroup on the generators 
+[ s1, s2 ]> with 1 generating pairs>
+gap> LibsemigroupsCongruence(C);;
+
+# LibsemigroupsCongruence for a congruence on a semigroup with CanUseGapFroidurePin
+gap> S := FreeBand(2);
+<free band on the generators [ x1, x2 ]>
+gap> C := SemigroupCongruence(S, [[S.1, S.2]]);
+<2-sided semigroup congruence over <free band on the generators 
+[ x1, x2 ]> with 1 generating pairs>
+gap> LibsemigroupsCongruence(C);;
+gap> C := LeftSemigroupCongruence(S, [[S.1, S.2]]);
+<left semigroup congruence over <free band on the generators [ x1, x2 ]> with 
+1 generating pairs>
+gap> LibsemigroupsCongruence(C);;
+
+# CongruenceWordToClassIndex
+gap> S := FreeBand(2);
+<free band on the generators [ x1, x2 ]>
+gap> C := LeftSemigroupCongruence(S, [[S.1, S.2]]);
+<left semigroup congruence over <free band on the generators [ x1, x2 ]> with 
+1 generating pairs>
+gap> CongruenceWordToClassIndex(C, [1, 2, 1, 2, 1, 2, 1, 1, 1, 1]);
+1
+gap> CongruenceWordToClassIndex(C, EvaluateWord([S.1, S.2],
+> [1, 2, 1, 2, 1, 2, 1, 1, 1, 1]));
+1
+
+# CongruenceLessNC
+gap> S := FreeBand(2);
+<free band on the generators [ x1, x2 ]>
+gap> C := LeftSemigroupCongruence(S, [[S.1, S.2]]);
+<left semigroup congruence over <free band on the generators [ x1, x2 ]> with 
+1 generating pairs>
+gap> CongruenceLessNC(C, S.1, S.2);
+false
+gap> EquivalenceRelationLookup(C);
+[ 1, 1, 1, 1, 1, 1 ]
+gap> CongruenceLessNC(C, S.2, S.1);
+false
+gap> NrEquivalenceClasses(C);
+1
+gap> C := RightSemigroupCongruence(S, [[S.1, S.2]]);
+<right semigroup congruence over <free band on the generators 
+[ x1, x2 ]> with 1 generating pairs>
+gap> CongruenceLessNC(C, S.1, S.2);
+false
+gap> EquivalenceRelationLookup(C);
+[ 1, 1, 1, 1, 1, 1 ]
+gap> CongruenceLessNC(C, S.2, S.1);
+false
+gap> S := FreeSemigroup(2);
+<free semigroup on the generators [ s1, s2 ]>
+gap> C := SemigroupCongruence(S, [[S.1, S.2]]);
+<2-sided semigroup congruence over <free semigroup on the generators 
+[ s1, s2 ]> with 1 generating pairs>
+gap> NrEquivalenceClasses(C);
+infinity
+gap> CongruenceLessNC(C, S.2, S.1);
+false
+gap> C := SemigroupCongruence(S, [[S.1, S.2], [S.1 * S.2, S.2 * S.1], [S.1 ^ 10, S.1]]);
+<2-sided semigroup congruence over <free semigroup on the generators 
+[ s1, s2 ]> with 3 generating pairs>
+gap> CongruenceLessNC(C, S.2, S.1);
+false
+gap> NrEquivalenceClasses(C);
+9
+
+# CongruenceTestMembershipNC
+gap> S := FreeBand(2);
+<free band on the generators [ x1, x2 ]>
+gap> C := LeftSemigroupCongruence(S, [[S.1, S.2]]);
+<left semigroup congruence over <free band on the generators [ x1, x2 ]> with 
+1 generating pairs>
+gap> CongruenceTestMembershipNC(C, S.1 ^ 4, S.1 * S.2 ^ 3 * S.1 ^ 3 * S.2 ^ 2 * S.1 ^ 2);
+true
+gap> EquivalenceRelationLookup(C);
+[ 1, 1, 1, 1, 1, 1 ]
+gap> CongruenceTestMembershipNC(C, S.1 ^ 4, S.1 * S.2 ^ 3 * S.1 ^ 3 * S.2 ^ 2 * S.1 ^ 2);
+true
+gap> S := FreeSemigroup(2);
+<free semigroup on the generators [ s1, s2 ]>
+gap> C := SemigroupCongruence(S, [[S.1, S.2]]);
+<2-sided semigroup congruence over <free semigroup on the generators 
+[ s1, s2 ]> with 1 generating pairs>
+gap> CongruenceTestMembershipNC(C, S.1 ^ 4, S.1 * S.2 ^ 3 * S.1 ^ 3 * S.2 ^ 2 * S.1 ^ 2);
+false
+gap> CongruenceTestMembershipNC(C, S.1 ^ 4, S.1 * S.2 ^ 3);
+true
+
+# EquivalenceRelationPartition
+gap> S := FreeBand(2);
+<free band on the generators [ x1, x2 ]>
+gap> C := LeftSemigroupCongruence(S, [[S.1, S.2]]);
+<left semigroup congruence over <free band on the generators [ x1, x2 ]> with 
+1 generating pairs>
+gap> EquivalenceRelationPartition(C);
+[ [ x1, x2, x1x2, x2x1, x1x2x1, x2x1x2 ] ]
+gap> T := AsSemigroup(IsBooleanMatSemigroup, S);
+<semigroup of size 6, 7x7 boolean matrices with 2 generators>
+gap> C := LeftSemigroupCongruence(T, [[T.1, T.2]]);
+<left semigroup congruence over <semigroup of size 6, 7x7 boolean matrices 
+ with 2 generators> with 1 generating pairs>
+gap> EquivalenceRelationPartition(C);
+[ [ Matrix(IsBooleanMat, [[1, 0, 0, 0, 0, 0, 0], [0, 0, 0, 1, 0, 0, 0], 
+          [0, 0, 0, 0, 1, 0, 0], [0, 0, 0, 1, 0, 0, 0], 
+          [0, 0, 0, 0, 1, 0, 0], [0, 0, 0, 1, 0, 0, 0], [1, 0, 0, 0, 0, 0, 0]]
+          ), 
+      Matrix(IsBooleanMat, [[0, 0, 1, 0, 0, 0, 0], [0, 1, 0, 0, 0, 0, 0], 
+          [0, 0, 1, 0, 0, 0, 0], [0, 0, 0, 0, 0, 1, 0], 
+          [0, 0, 1, 0, 0, 0, 0], [0, 0, 0, 0, 0, 1, 0], [0, 1, 0, 0, 0, 0, 0]]
+          ), 
+      Matrix(IsBooleanMat, [[0, 0, 1, 0, 0, 0, 0], [0, 0, 0, 0, 0, 1, 0], 
+          [0, 0, 1, 0, 0, 0, 0], [0, 0, 0, 0, 0, 1, 0], 
+          [0, 0, 1, 0, 0, 0, 0], [0, 0, 0, 0, 0, 1, 0], [0, 0, 1, 0, 0, 0, 0]]
+          ), 
+      Matrix(IsBooleanMat, [[0, 0, 0, 0, 1, 0, 0], [0, 0, 0, 1, 0, 0, 0], 
+          [0, 0, 0, 0, 1, 0, 0], [0, 0, 0, 1, 0, 0, 0], 
+          [0, 0, 0, 0, 1, 0, 0], [0, 0, 0, 1, 0, 0, 0], [0, 0, 0, 1, 0, 0, 0]]
+          ), 
+      Matrix(IsBooleanMat, [[0, 0, 0, 0, 1, 0, 0], [0, 0, 0, 1, 0, 0, 0], 
+          [0, 0, 0, 0, 1, 0, 0], [0, 0, 0, 1, 0, 0, 0], 
+          [0, 0, 0, 0, 1, 0, 0], [0, 0, 0, 1, 0, 0, 0], [0, 0, 0, 0, 1, 0, 0]]
+          ), 
+      Matrix(IsBooleanMat, [[0, 0, 1, 0, 0, 0, 0], [0, 0, 0, 0, 0, 1, 0], 
+          [0, 0, 1, 0, 0, 0, 0], [0, 0, 0, 0, 0, 1, 0], 
+          [0, 0, 1, 0, 0, 0, 0], [0, 0, 0, 0, 0, 1, 0], [0, 0, 0, 0, 0, 1, 0]]
+          ) ] ]
+
+# \< for congruence classes
+gap> S := FreeBand(2);
+<free band on the generators [ x1, x2 ]>
+gap> C := LeftSemigroupCongruence(S, [[S.1, S.1 ^ 10]]);
+<left semigroup congruence over <free band on the generators [ x1, x2 ]> with 
+0 generating pairs>
+gap> AsSSortedList(EquivalenceClasses(C));
+[ <left congruence class of x1>, <left congruence class of x2>, 
+  <left congruence class of x2x1>, <left congruence class of x1x2>, 
+  <left congruence class of x1x2x1>, <left congruence class of x2x1x2> ]
+gap> D := LeftSemigroupCongruence(S, [[S.1, S.2 ^ 10]]);
+<left semigroup congruence over <free band on the generators [ x1, x2 ]> with 
+1 generating pairs>
+gap> EquivalenceClasses(D)[1] < EquivalenceClasses(C)[1];
+false
+
+# \< method doesn't apply
+gap> I := SemigroupIdealByGenerators(FullTransformationSemigroup(4),
+> [Transformation([1, 2, 2, 2])]);;
+gap> cong := ReesCongruenceOfSemigroupIdeal(I);;
+gap> hom := HomomorphismQuotientSemigroup(cong);;
+gap> T := Range(hom);;
+gap> IsSemigroup(T);
+true
+gap> Size(T);
+169
+gap> u := Image(hom, Transformation([1, 1, 1, 1]));
+<2-sided congruence class of Transformation( [ 1, 2, 2, 2 ] )>
+gap> t := Image(hom, Transformation([2, 1, 2, 3]));
+<2-sided congruence class of Transformation( [ 2, 1, 2, 3 ] )>
+gap> u < t;
+true
+
+# EquivalenceClasses for a congruence with infinitely many classes
+gap> S := FreeSemigroup(2);
+<free semigroup on the generators [ s1, s2 ]>
+gap> C := SemigroupCongruence(S, [[S.1, S.2]]);
+<2-sided semigroup congruence over <free semigroup on the generators 
+[ s1, s2 ]> with 1 generating pairs>
+gap> EquivalenceClasses(C);
+Error, the argument (a congruence) must have a finite number of classes
+gap> EquivalenceRelationLookup(C);
+Error, the argument (a 2-sided congruence) must have finite range
+
+# ImagesElm
+gap> S := FreeBand(2);
+<free band on the generators [ x1, x2 ]>
+gap> C := LeftSemigroupCongruence(S, [[S.1, S.1 ^ 10]]);
+<left semigroup congruence over <free band on the generators [ x1, x2 ]> with 
+0 generating pairs>
+gap> ImagesElm(C, S.1);
+[ x1 ]
+gap> F := FreeSemigroup(2);
+<free semigroup on the generators [ s1, s2 ]>
+gap> R := [[F.1, F.2], [F.1 * F.2 * F.1, F.2 * F.1], [F.1 ^ 10, F.1]];
+[ [ s1, s2 ], [ s1*s2*s1, s2*s1 ], [ s1^10, s1 ] ]
+gap> S := F / R;
+<fp semigroup with 2 generators and 3 relations of length 20>
+gap> C := SemigroupCongruence(S, []);
+<universal semigroup congruence over <trivial group with 2 generators>>
+gap> ImagesElm(C, S.1 ^ 10);
+[ s1 ]
+
+#
+gap> F := FreeSemigroup(3);
+<free semigroup on the generators [ s1, s2, s3 ]>
+gap> R := [[F.1 * F.2, F.2 * F.1], [F.1 * F.3, F.3 * F.1], [F.1 ^ 2, F.1],
+>          [F.1 * F.3, F.1], [F.3 * F.1, F.1], [F.2 * F.3, F.3 * F.2], 
+>          [F.2 ^ 3, F.2], [F.2 * F.3, F.2], [F.3 * F.2, F.2]];
+[ [ s1*s2, s2*s1 ], [ s1*s3, s3*s1 ], [ s1^2, s1 ], [ s1*s3, s1 ], 
+  [ s3*s1, s1 ], [ s2*s3, s3*s2 ], [ s2^3, s2 ], [ s2*s3, s2 ], [ s3*s2, s2 ] 
+ ]
+gap> S := F / R;
+<fp semigroup with 3 generators and 9 relations of length 34>
+gap> C := SemigroupCongruence(S, [[S.1, S.2]]);
+<2-sided semigroup congruence over <fp semigroup with 3 generators and 
+  9 relations of length 34> with 1 generating pairs>
+gap> ImagesElm(C, S.1);
+[ s1, s2, s1*s2, s2^2, s1*s2^2 ]
+gap> ImagesElm(C, S.3);
+[ s3 ]
+
+#
+gap> SEMIGROUPS.StopTest();
+gap> STOP_TEST("Semigroups package: standard/libsemigroups/cong.tst");