*----*    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,11,0):quit

            proc InvariantRingTransitiveGroup(n, i, p) ... end
Info: Computation of the invariant ring of the 11th 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:57: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, [2, 0, 0, 1, 0, 0]
Info: secondaryInvariantsSeries: working on cycletype, [0, 3, 0, 0, 0, 0]
Info: secondaryInvariantsSeries: working on cycletype, [2, 2, 0, 0, 0, 0]
Info: secondaryInvariantsSeries: working on cycletype, [6, 0, 0, 0, 0, 0]
Info: secondaryInvariantsSeries: working on cycletype, [4, 1, 0, 0, 0, 0]
Info: secondaryInvariantsSeries: working on cycletype, [0, 0, 2, 0, 0, 0]
Info: secondaryInvariantsSeries: working on cycletype, [0, 0, 0, 0, 0, 1]
Info: degreeBound: enhancement from the degrees of the primary invariants:\
 12
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:57: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	10	2862433	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 2:
	 Date: Wed May 2 19:57: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 5 initial monomials
.....
Info: Applying Gauss Elimination

Info: Extracting initial monomials that are not hit
Info: Dim: 5 Skiped: 3 Char Col: 0 Mgs: 2
Info: 3	10	2862433	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 3:
	 Date: Wed May 2 19:57: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, 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 10 initial monomials
......pp....
Info: Applying Gauss Elimination
[5:2].
Info: Extracting initial monomials that are not hit
Info: Dim: 10 Skiped: 6 Char Col: 2 Mgs: 2
Info: 4	20	2862433	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 4:
	 Date: Wed May 2 19:57:21 CEST 2001
Info:   Time: 20 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 15 initial monomials
...........pp....
Info: Applying Gauss Elimination
[10:2].
Info: Extracting initial monomials that are not hit
Info: Dim: 15 Skiped: 12 Char Col: 2 Mgs: 1
Info: 5	40	2895201	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 5:
	 Date: Wed May 2 19:57:22 CEST 2001
Info:   Time: 40 ms
Info:   Memory: 2895 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 27 initial monomials
................pp...pp..p.p.p.p..p.
Info: Applying Gauss Elimination
[15:2][18:2].[20:2][21:2][22:2][23:2]..
Info: Extracting initial monomials that are not hit
Info: Dim: 27 Skiped: 17 Char Col: 9 Mgs: 1
Info: 6	70	2895201	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 6:
	 Date: Wed May 2 19:57:22 CEST 2001
Info:   Time: 70 ms
Info:   Memory: 2895 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, 1]
Info:   --------------------------------------
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 38 initial monomials
......................pp.p..pp...pp.p...p.p.pp..p.p.p
Info: Applying Gauss Elimination
[21:2][22:2][24:2].[27:2][28:2][31:2][32:2][33:3][34:3].[36:2][37:2]Info: Extracting initial monomials that are not hit
Info: Dim: 38 Skiped: 25 Char Col: 13 Mgs: 0
Info: 7	110	2944353	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 7:
	 Date: Wed May 2 19:57:22 CEST 2001
Info:   Time: 110 ms
Info:   Memory: 2944 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 60 initial monomials
............................pp...p.......p.p...p.ppp.pp..p..p.p...pp..p.p.\
pp..p.p.p
Info: Applying Gauss Elimination
[27:2][30:2][37:2][38:2][41:2][42:4][43:4][44:3][45:3][47:2][48:2][51:4][53:4][54:3][55:3][56:4][57:4][58:2][59:4]Info: Extracting initial monomials that are not hit
Info: Dim: 60 Skiped: 41 Char Col: 19 Mgs: 0
Info: 8	190	2977121	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 8:
	 Date: Wed May 2 19:57:22 CEST 2001
Info:   Time: 190 ms
Info:   Memory: 2977 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 84 initial monomials
.................................................pp.p...pp.........p.p.pp.\
p.p.p.pp..p.p.p.pp.pp.pp..p.p...p.p.p.p
Info: Applying Gauss Elimination
[48:2][49:2][52:2][61:2][62:2][63:2][64:2][65:2][66:2][67:3][68:3][69:3][70:2][71:3][72:4][73:4][74:5][75:6][76:2][77:2][80:4][81:4][82:3][83:5]Info: Extracting initial monomials that are not hit
Info: Dim: 84 Skiped: 60 Char Col: 24 Mgs: 0
Info: 9	300	3026273	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 9:
	 Date: Wed May 2 19:57:23 CEST 2001
Info:   Time: 300 ms
Info:   Memory: 3026 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 122 initial monomials
..........................................................................\
pp.pp...pp....pp.p....pp..pp.........p.p.pp..p.p.pp.pp.p.p.p.p.p.pp..p.p.p\
.pp.pp.p..p.p.p
Info: Applying Gauss Elimination
[73:2][74:2][77:2].[81:4][82:3][86:2][88:5][97:3][98:3][99:4][100:4][101:2][102:2][103:5][104:6]..[107:2][108:5][109:7][110:7][111:7][112:2][113:2][114:2][115:6][116:8].[119:8][120:10][121:7]Info: Extracting initial monomials that are not hit
Info: Dim: 122 Skiped: 90 Char Col: 32 Mgs: 0
Info: 10	450	3108193	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 10:
	 Date: Wed May 2 19:57:24 CEST 2001
Info:   Time: 450 ms
Info:   Memory: 3108 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: No generators at degree 11
Info: Constructing a minimal generating set at degree 12
Info: Constructing the initial poset at degree 11
Info: Constructing the initial poset at degree 12
Info: Generating the full matrix of decomposable invariants by iterating t\
hrough all 229 initial monomials
..........................................................................\
..............................................................ppp.p....pp.\
....p....................pp.p.p.p..p.p....p.p.p.p.p.ppp.pp.pp..pp.p.p.p.p.\
p.pp.pp.pp..p.p.p...p..pp.pp.....p...p.p.p.p.p.p.pp..p.p.pp.p.p.p.p.p.p.p.\
p
Info: Applying Gauss Elimination
[135:3][136:2][140:2][145:2][165:2][166:3][167:3].[170:2][171:2][175:2][176:2][177:3][178:3][179:2][180:4][181:2][182:6][183:3][184:7][185:6][186:2][187:4][188:4][189:3][190:4][191:5][192:6][193:5][194:2][195:2][196:2][199:2][201:8][202:8][207:2][210:6][211:6][212:5][213:3][214:7][215:8][216:11][217:10][218:13][219:3][220:4][221:11][222:3][223:4][224:9][225:6][226:14][227:4][228:12]Info: Extracting initial monomials that are not hit
Info: Dim: 229 Skiped: 174 Char Col: 55 Mgs: 0
Info: 12	1180	3321185	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 12:
	 Date: Wed May 2 19:57:25 CEST 2001
Info:   Time: 1 s 180 ms
Info:   Memory: 3321 ko.
Info:   S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0)
Info:   Minimal generators: 0
Info: Updating the degreeBound to 6 which is optimal!
Info: Total time: 2 s 880 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:57:25 CEST 2001
Host: giulia3.medicis.polytechnique.fr
Info: ====================================================================\
==========
Info: Total time: 0 ms