Adapt semigroups test to filter changes

gap-system · Dec 12, 2016 · 70ea675 · 70ea675
1 parent 24ff211
commit 70ea675
Showing 1 changed file with 5 additions and 37 deletions.
diff --git a/tst/testinstall/semigrp.tst b/tst/testinstall/semigrp.tst
@@ -288,58 +288,38 @@ gap>
 #T# Checking for correct non-removal of one from generating sets in
 # SemigroupByGenerators JDM
 gap> S := Semigroup(PartialPerm([1]));
-<trivial partial perm group of rank 1 with 1 generator>
+<trivial partial perm monoid of rank 1 with 1 generator>
 gap> GeneratorsOfSemigroup(S);
 [ <identity partial perm on [ 1 ]> ]
 gap> GeneratorsOfMonoid(S);
 [ <identity partial perm on [ 1 ]> ]
-gap> GeneratorsOfGroup(S);
-[ <identity partial perm on [ 1 ]> ]
 gap> GeneratorsOfInverseSemigroup(S);
 [ <identity partial perm on [ 1 ]> ]
 gap> GeneratorsOfInverseMonoid(S);
 [ <identity partial perm on [ 1 ]> ]
 gap> S := Semigroup(IdentityTransformation);
-<trivial transformation group of degree 0 with 1 generator>
+<trivial transformation monoid of degree 0 with 1 generator>
 gap> GeneratorsOfSemigroup(S);
 [ IdentityTransformation ]
 gap> GeneratorsOfMonoid(S);
 [ IdentityTransformation ]
-gap> GeneratorsOfGroup(S);
-[ IdentityTransformation ]
-gap> GeneratorsOfInverseSemigroup(S);
-[ IdentityTransformation ]
-gap> GeneratorsOfInverseMonoid(S);
-[ IdentityTransformation ]
 
 #T# Checking for correct non-removal of one from generating sets in
 # MonoidByGenerators JDM
 gap> S := Monoid(PartialPerm([1]));
-<trivial partial perm group of rank 1 with 1 generator>
+<trivial partial perm monoid of rank 1 with 1 generator>
 gap> S := Monoid(PartialPerm([1]));
-<trivial partial perm group of rank 1 with 1 generator>
+<trivial partial perm monoid of rank 1 with 1 generator>
 gap> GeneratorsOfSemigroup(S);
 [ <identity partial perm on [ 1 ]> ]
 gap> GeneratorsOfMonoid(S);
 [ <identity partial perm on [ 1 ]> ]
-gap> GeneratorsOfGroup(S);
-[ <identity partial perm on [ 1 ]> ]
-gap> GeneratorsOfInverseSemigroup(S);
-[ <identity partial perm on [ 1 ]> ]
-gap> GeneratorsOfInverseMonoid(S);
-[ <identity partial perm on [ 1 ]> ]
 gap> S := Monoid(IdentityTransformation);
-<trivial transformation group of degree 0 with 1 generator>
+<trivial transformation monoid of degree 0 with 1 generator>
 gap> GeneratorsOfSemigroup(S);
 [ IdentityTransformation ]
 gap> GeneratorsOfMonoid(S);
 [ IdentityTransformation ]
-gap> GeneratorsOfGroup(S);
-[ IdentityTransformation ]
-gap> GeneratorsOfInverseSemigroup(S);
-[ IdentityTransformation ]
-gap> GeneratorsOfInverseMonoid(S);
-[ IdentityTransformation ]
 
 #T# Checking for correct non-removal of one from generating sets in
 # InverseSemigroupByGenerators JDM
@@ -349,20 +329,12 @@ gap> GeneratorsOfSemigroup(S);
 [ <identity partial perm on [ 1 ]> ]
 gap> GeneratorsOfMonoid(S);
 [ <identity partial perm on [ 1 ]> ]
-gap> GeneratorsOfGroup(S);
-[ <identity partial perm on [ 1 ]> ]
-gap> GeneratorsOfInverseSemigroup(S);
-[ <identity partial perm on [ 1 ]> ]
-gap> GeneratorsOfInverseMonoid(S);
-[ <identity partial perm on [ 1 ]> ]
 gap> S := InverseSemigroup(IdentityTransformation);
 <trivial transformation group of degree 0 with 1 generator>
 gap> GeneratorsOfSemigroup(S);
 [ IdentityTransformation ]
 gap> GeneratorsOfMonoid(S);
 [ IdentityTransformation ]
-gap> GeneratorsOfGroup(S);
-[ IdentityTransformation ]
 gap> GeneratorsOfInverseSemigroup(S);
 [ IdentityTransformation ]
 gap> GeneratorsOfInverseMonoid(S);
@@ -376,8 +348,6 @@ gap> GeneratorsOfSemigroup(S);
 [ <identity partial perm on [ 1 ]> ]
 gap> GeneratorsOfMonoid(S);
 [ <identity partial perm on [ 1 ]> ]
-gap> GeneratorsOfGroup(S);
-[ <identity partial perm on [ 1 ]> ]
 gap> GeneratorsOfInverseSemigroup(S);
 [ <identity partial perm on [ 1 ]> ]
 gap> GeneratorsOfInverseMonoid(S);
@@ -388,8 +358,6 @@ gap> GeneratorsOfSemigroup(S);
 [ IdentityTransformation ]
 gap> GeneratorsOfMonoid(S);
 [ IdentityTransformation ]
-gap> GeneratorsOfGroup(S);
-[ IdentityTransformation ]
 gap> GeneratorsOfInverseSemigroup(S);
 [ IdentityTransformation ]
 gap> GeneratorsOfInverseMonoid(S);