*----*    MuPAD 2.0.0 -- The Open Computer Algebra System
  /|   /|
 *----* |    Copyright (c)  1997 - 2000  by SciFace Software
 | *--|-*                   All rights reserved.
 |/   |/
 *----*      Licensed to:   Nicolas M. Thiery

>> read("testDegreeBounds.mu"): compTGroupF(6,7,0):quit

            proc InvariantRingTransitiveGroup(n, i, p) ... end
Info: Computation of the invariant ring of the 7th transitive permutation \
group on 6 variables in characteristic 0.
Info: Module GLIP version 0.4 ready. Type GLIP::doc(); for usage informati\
on.
Info: ====================================================================\
==========
Info: Computation of a minimal generating set using SAGBI+linear algebra.
Info: Version: $Id: comphead.mu,v 1.2 2001/03/21 17:51:40 nthiery Exp $
Date: Wed May 2 19:58:20 CEST 2001
Host: giulia3.medicis.polytechnique.fr
Info: ====================================================================\
==========
Info: degreeBound: from the dimension of the space: 15
Info: secondaryInvariantsSeries: Computation from cycle types
Info: secondaryInvariantsSeries: working on cycletype, [0, 1, 0, 1, 0, 0]
Info: secondaryInvariantsSeries: working on cycletype, [6, 0, 0, 0, 0, 0]
Info: secondaryInvariantsSeries: working on cycletype, [0, 0, 2, 0, 0, 0]
Info: secondaryInvariantsSeries: working on cycletype, [2, 2, 0, 0, 0, 0]
Info: degreeBound: enhancement from the degrees of the primary invariants:\
 13
Info: Constructing a minimal generating set at degree 0
Info: No generators at degree 0
Info: Constructing a minimal generating set at degree 1
Info: Constructing the initial poset at degree 1
Info: Generating the full matrix of decomposable invariants by iterating t\
hrough all 1 initial monomials
.
Info: Applying Gauss Elimination

Info: Extracting initial monomials that are not hit
Info: Dim: 1 Skiped: 0 Char Col: 0 Mgs: 1
Info: 1	30	2829665	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 1:
	 Date: Wed May 2 19:58:21 CEST 2001
Info:   Time: 30 ms
Info:   Memory: 2862 ko.
Info:   S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0)
Info:   Minimal generators: 1
Info:   --------------------------------------
Info: 	 [1, 0, 0, 0, 0, 0]
Info:   --------------------------------------
Info: Constructing a minimal generating set at degree 2
Info: Constructing the initial poset at degree 1
Info: Constructing the initial poset at degree 2
Info: Generating the full matrix of decomposable invariants by iterating t\
hrough all 3 initial monomials
...
Info: Applying Gauss Elimination

Info: Extracting initial monomials that are not hit
Info: Dim: 3 Skiped: 1 Char Col: 0 Mgs: 2
Info: 2	0	2862433	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 2:
	 Date: Wed May 2 19:58:21 CEST 2001
Info:   Time: 10 ms
Info:   Memory: 2862 ko.
Info:   S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0)
Info:   Minimal generators: 2
Info:   --------------------------------------
Info: 	 [1, 0, 0, 1, 0, 0]
Info: 	 [1, 1, 0, 0, 0, 0]
Info:   --------------------------------------
Info: Constructing a minimal generating set at degree 3
Info: Constructing the initial poset at degree 3
Info: Generating the full matrix of decomposable invariants by iterating t\
hrough all 6 initial monomials
......
Info: Applying Gauss Elimination

Info: Extracting initial monomials that are not hit
Info: Dim: 6 Skiped: 3 Char Col: 0 Mgs: 3
Info: 3	10	2862433	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 3:
	 Date: Wed May 2 19:58:21 CEST 2001
Info:   Time: 10 ms
Info:   Memory: 2862 ko.
Info:   S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0)
Info:   Minimal generators: 3
Info:   --------------------------------------
Info: 	 [1, 1, 0, 0, 0, 1]
Info: 	 [1, 1, 0, 1, 0, 0]
Info: 	 [1, 1, 1, 0, 0, 0]
Info:   --------------------------------------
Info: Constructing a minimal generating set at degree 4
Info: Constructing the initial poset at degree 4
Info: Generating the full matrix of decomposable invariants by iterating t\
hrough all 11 initial monomials
......pp.....
Info: Applying Gauss Elimination
[5:2].
Info: Extracting initial monomials that are not hit
Info: Dim: 11 Skiped: 7 Char Col: 2 Mgs: 2
Info: 4	30	2862433	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 4:
	 Date: Wed May 2 19:58:21 CEST 2001
Info:   Time: 30 ms
Info:   Memory: 2862 ko.
Info:   S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0)
Info:   Minimal generators: 2
Info:   --------------------------------------
Info: 	 [1, 1, 0, 1, 1, 0]
Info: 	 [1, 1, 1, 1, 0, 0]
Info:   --------------------------------------
Info: Constructing a minimal generating set at degree 5
Info: Constructing the initial poset at degree 5
Info: Generating the full matrix of decomposable invariants by iterating t\
hrough all 18 initial monomials
.............pp....p.
Info: Applying Gauss Elimination
[12:2]..
Info: Extracting initial monomials that are not hit
Info: Dim: 18 Skiped: 14 Char Col: 3 Mgs: 1
Info: 5	40	2878817	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 5:
	 Date: Wed May 2 19:58:21 CEST 2001
Info:   Time: 50 ms
Info:   Memory: 2878 ko.
Info:   S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0)
Info:   Minimal generators: 1
Info:   --------------------------------------
Info: 	 [1, 1, 1, 1, 1, 0]
Info:   --------------------------------------
Info: Constructing a minimal generating set at degree 6
Info: Constructing the initial poset at degree 6
Info: Generating the full matrix of decomposable invariants by iterating t\
hrough all 32 initial monomials
..................pp....pp.p.p.p.p..p.p..p.
Info: Applying Gauss Elimination
[17:2][21:2][22:2][23:2][24:2][25:2][27:2][28:2][29:2][30:2].
Info: Extracting initial monomials that are not hit
Info: Dim: 32 Skiped: 21 Char Col: 11 Mgs: 0
Info: 6	80	2895201	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 6:
	 Date: Wed May 2 19:58:22 CEST 2001
Info:   Time: 80 ms
Info:   Memory: 2895 ko.
Info:   S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0)
Info:   Minimal generators: 0
Info: Constructing a minimal generating set at degree 7
Info: Constructing the initial poset at degree 7
Info: Generating the full matrix of decomposable invariants by iterating t\
hrough all 48 initial monomials
..........................pp.p..pp...p...pp.p....p.p.pp.p..p.p.p.p
Info: Applying Gauss Elimination
[25:2][26:2][28:2].[31:2][34:2][35:2][39:2][40:2][41:3][42:4][43:2].[45:3][46:2][47:2]Info: Extracting initial monomials that are not hit
Info: Dim: 48 Skiped: 32 Char Col: 16 Mgs: 0
Info: 7	140	2911585	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 7:
	 Date: Wed May 2 19:58:22 CEST 2001
Info:   Time: 140 ms
Info:   Memory: 2911 ko.
Info:   S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0)
Info:   Minimal generators: 0
Info: Constructing a minimal generating set at degree 8
Info: Constructing the initial poset at degree 8
Info: Generating the full matrix of decomposable invariants by iterating t\
hrough all 75 initial monomials
.................................pp.....p........p.p.....p.ppp.p..pp.p..p.\
p.p.p.p...pp..p.p.pp..pp..p.p
Info: Applying Gauss Elimination
[32:2][37:2][45:2][46:2][51:2][52:4][53:3][54:3][55:4][56:2][58:2].[60:2][61:2][62:2][65:5][67:4][68:3][69:3][70:5][71:6][72:5][73:2][74:5]Info: Extracting initial monomials that are not hit
Info: Dim: 75 Skiped: 51 Char Col: 24 Mgs: 0
Info: 8	230	2993505	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 8:
	 Date: Wed May 2 19:58:22 CEST 2001
Info:   Time: 230 ms
Info:   Memory: 2993 ko.
Info:   S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0)
Info:   Minimal generators: 0
Info: Constructing a minimal generating set at degree 9
Info: Constructing the initial poset at degree 9
Info: Generating the full matrix of decomposable invariants by iterating t\
hrough all 111 initial monomials
.............................................................pp.p.....pp..\
..........p.p.p.pp.p.p.p.p.p..p.pp..p.p.p.pp.pp.pp.pp..p.p.p.p....p.p.p.p.\
p
Info: Applying Gauss Elimination
[60:2][61:2][66:2][78:2][79:2].[81:2][82:2][83:2].[85:2][86:2][88:2][89:3][90:3][91:3][92:2][93:3][94:4][95:4][96:6][97:2][98:6][99:2][100:2][101:2]..[106:6][107:5][108:3][109:5][110:5]Info: Extracting initial monomials that are not hit
Info: Dim: 111 Skiped: 78 Char Col: 33 Mgs: 0
Info: 9	370	3059041	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 9:
	 Date: Wed May 2 19:58:23 CEST 2001
Info:   Time: 370 ms
Info:   Memory: 3059 ko.
Info:   S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0)
Info:   Minimal generators: 0
Info: Constructing a minimal generating set at degree 10
Info: Constructing the initial poset at degree 10
Info: Generating the full matrix of decomposable invariants by iterating t\
hrough all 160 initial monomials
..........................................................................\
...................pp......pp....p.....pp.p....pp...pp.p......pp......p.p.\
p.p.p.p.pp.p.ppp..p.p.p..p.p.p.p.pp..p.p.p.pp.p.pp.p.p..p.p.p
Info: Applying Gauss Elimination
[92:2][98:2].[102:2][107:3][108:2][112:2][115:4][116:2][122:2][128:2][129:2][130:2][131:3][132:2][133:2][134:4][135:3][136:4]...[141:5][142:6][143:6][144:4][145:7][146:6][147:8][148:2][149:2][150:2][151:5][152:4][153:9][154:6].[157:7][158:10][159:6]Info: Extracting initial monomials that are not hit
Info: Dim: 160 Skiped: 120 Char Col: 40 Mgs: 0
Info: 10	580	3157345	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 10:
	 Date: Wed May 2 19:58:24 CEST 2001
Info:   Time: 580 ms
Info:   Memory: 3157 ko.
Info:   S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0)
Info:   Minimal generators: 0
Info: Constructing a minimal generating set at degree 11
Info: Constructing the initial poset at degree 11
Info: Generating the full matrix of decomposable invariants by iterating t\
hrough all 224 initial monomials
..........................................................................\
..................................pp..............p.....................p.\
p..........pp..p.p.p.p.ppp....pp.pp...p.p.p.p.ppp.p.p.p.....pp..pp......p.\
pp........p..p.p.pp.p.pp..p.p.p.p.pp.pp.p.p.p..p.p.pp.pp..p.p.p.p.p
Info: Applying Gauss Elimination
[107:2][121:2][142:2][143:2][153:2][155:2][156:2][157:2][158:2][159:3][162:2][163:5][164:2][167:2].[169:2][170:2][171:3][172:2].[174:4][176:6][179:3][181:5][187:2][188:4][196:5][198:4][199:3][200:5][201:2][202:8][203:7].[205:3][206:2][207:2][208:9][209:11][210:5]..[213:10][214:4][215:5][216:10][217:11][218:9].[220:2][221:2][222:10][223:10]Info: Extracting initial monomials that are not hit
Info: Dim: 224 Skiped: 171 Char Col: 53 Mgs: 0
Info: 11	840	3288417	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 11:
	 Date: Wed May 2 19:58:25 CEST 2001
Info:   Time: 840 ms
Info:   Memory: 3288 ko.
Info:   S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0)
Info:   Minimal generators: 0
Info: Constructing a minimal generating set at degree 12
Info: Constructing the initial poset at degree 12
Info: Generating the full matrix of decomposable invariants by iterating t\
hrough all 313 initial monomials
..........................................................................\
..........................................................................\
................................ppp.p.........pp.........p................\
..........p.p.p....p.p.p..p.pp........p.p.p.ppp..p..ppp.pp.p.p.p.p.p.pp.pp\
.pp.pp.pp.p..p.p.p.p.p.pp.p.p.pp.p....p..pp.pp.....p.p.p...p.p.p.p.p.p.p.p\
.pp..p.pp.p.pp.p.p..p.p.p.p.p.p
Info: Applying Gauss Elimination
[179:3][180:2][189:2][198:2][224:3][225:3].[230:2][231:2].[234:3][235:2][243:3][244:3][245:2][246:4][248:4][249:4][250:7][251:5][252:6][253:2][254:4][255:4][256:3][257:5][258:5][259:5][260:8][261:3][262:2][263:6][264:7][265:2][266:6][267:6].[269:2][270:6][271:3][272:4][273:5][274:5][277:2][279:9][280:7][285:5][286:6][287:5][290:6][291:6][292:5][293:8][294:11][295:7][296:10][297:13][298:13][299:15][300:6][301:7][302:7][303:15][304:11][305:6][306:2][307:8][308:15][309:15][310:17][311:7][312:16]Info: Extracting initial monomials that are not hit
Info: Dim: 313 Skiped: 241 Char Col: 72 Mgs: 0
Info: 12	1370	3534177	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 12:
	 Date: Wed May 2 19:58:26 CEST 2001
Info:   Time: 1 s 370 ms
Info:   Memory: 3550 ko.
Info:   S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0)
Info:   Minimal generators: 0
Info: Constructing a minimal generating set at degree 13
Info: Constructing the initial poset at degree 13
Info: Generating the full matrix of decomposable invariants by iterating t\
hrough all 420 initial monomials
..........................................................................\
..........................................................................\
..........................................................................\
.................................pp..........pp.....p.pp.............ppp.p\
.p.p.......pp....ppp.p..........pp..pp......p....................p.p.p..p.\
pp.p.p.p..p.pp....p.p.p.p..pp.p..p.p.pp...p.p.p.p.p.pp.p.pp.ppp.pp.pp..pp.\
p.p.p.p.p.pp.p.p.p.p.pp.p.p.p.p.p.pp..p..p..p.pp....p.p.p.p.p.pp..p.pp..p.\
p.p.p.p.p
Info: Applying Gauss Elimination
[254:2][264:2].[269:2][270:2][283:5][284:2][285:2][286:2][293:2][297:6][298:3][308:2][310:2][316:2][336:4][337:3]..[341:5][342:2][343:2][344:6][346:5][347:2]...[354:3][356:4][357:2][359:2][360:2][361:4][363:7][364:6][365:2][366:4][367:5][368:3][369:4][370:4][371:10][372:7][373:13][374:8][375:10][376:12][377:13][378:2][379:2][380:2][381:6][382:3][383:2][384:5][385:12][386:8][387:9][388:12][389:10]...[393:4][394:7][395:4][397:2][399:3][400:7][404:2][405:17][406:16][407:19][408:8][409:11][410:13][411:14][412:21][413:18][414:20][415:2][416:7][417:16][418:13][419:21]Info: Extracting initial monomials that are not hit
Info: Dim: 420 Skiped: 334 Char Col: 86 Mgs: 0
Info: 13	2000	3845473	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 13:
	 Date: Wed May 2 19:58:28 CEST 2001
Info:   Time: 2 s 0 ms
Info:   Memory: 3845 ko.
Info:   S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0)
Info:   Minimal generators: 0
Info: Updating the degreeBound to 5 which is optimal!
Info: Total time: 6 s 170 ms
Info: ====================================================================\
==========
Info: Computation of a minimal generating set using SAGBI+linear algebra.
Info: Version: $Id: comphead.mu,v 1.2 2001/03/21 17:51:40 nthiery Exp $
Date: Wed May 2 19:58:28 CEST 2001
Host: giulia3.medicis.polytechnique.fr
Info: ====================================================================\
==========
Info: Total time: 0 ms