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

            proc InvariantRingTransitiveGroup(n, i, p) ... end
Info: Computation of the invariant ring of the 12th 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:26 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, [2, 2, 0, 0, 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, [1, 0, 0, 0, 1, 0]
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	10	2878817	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 1:
	 Date: Wed May 2 19:57:27 CEST 2001
Info:   Time: 10 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, 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 2 initial monomials
..
Info: Applying Gauss Elimination

Info: Extracting initial monomials that are not hit
Info: Dim: 2 Skiped: 1 Char Col: 0 Mgs: 1
Info: 2	0	2878817	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 2:
	 Date: Wed May 2 19:57:27 CEST 2001
Info:   Time: 0 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, 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 4 initial monomials
....
Info: Applying Gauss Elimination

Info: Extracting initial monomials that are not hit
Info: Dim: 4 Skiped: 2 Char Col: 0 Mgs: 2
Info: 3	10	2878817	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 3:
	 Date: Wed May 2 19:57:27 CEST 2001
Info:   Time: 10 ms
Info:   Memory: 2878 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 6 initial monomials
......
Info: Applying Gauss Elimination

Info: Extracting initial monomials that are not hit
Info: Dim: 6 Skiped: 5 Char Col: 0 Mgs: 1
Info: 4	0	2878817	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 4:
	 Date: Wed May 2 19:57:27 CEST 2001
Info:   Time: 0 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, 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 10 initial monomials
..........
Info: Applying Gauss Elimination

Info: Extracting initial monomials that are not hit
Info: Dim: 10 Skiped: 8 Char Col: 0 Mgs: 2
Info: 5	20	2878817	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 5:
	 Date: Wed May 2 19:57:27 CEST 2001
Info:   Time: 20 ms
Info:   Memory: 2878 ko.
Info:   S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0)
Info:   Minimal generators: 2
Info:   --------------------------------------
Info: 	 [1, 1, 1, 1, 1, 0]
Info: 	 [2, 1, 1, 0, 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 17 initial monomials
............pp....p.
Info: Applying Gauss Elimination
[11:2]..
Info: Extracting initial monomials that are not hit
Info: Dim: 17 Skiped: 12 Char Col: 3 Mgs: 2
Info: 6	50	2895201	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 6:
	 Date: Wed May 2 19:57:27 CEST 2001
Info:   Time: 50 ms
Info:   Memory: 2895 ko.
Info:   S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0)
Info:   Minimal generators: 2
Info:   --------------------------------------
Info: 	 [1, 1, 1, 1, 1, 1]
Info: 	 [2, 2, 0, 1, 1, 0]
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 24 initial monomials
........................
Info: Applying Gauss Elimination

Info: Extracting initial monomials that are not hit
Info: Dim: 24 Skiped: 23 Char Col: 0 Mgs: 1
Info: 7	30	2895201	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 7:
	 Date: Wed May 2 19:57:27 CEST 2001
Info:   Time: 30 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: 	 [2, 2, 1, 1, 0, 1]
Info:   --------------------------------------
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 36 initial monomials
.............................pp.p...p.p.p.p
Info: Applying Gauss Elimination
[28:2][29:2].....
Info: Extracting initial monomials that are not hit
Info: Dim: 36 Skiped: 29 Char Col: 7 Mgs: 0
Info: 8	90	2944353	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 8:
	 Date: Wed May 2 19:57:28 CEST 2001
Info:   Time: 90 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 9
Info: Constructing the initial poset at degree 9
Info: Generating the full matrix of decomposable invariants by iterating t\
hrough all 53 initial monomials
........................................pp.pp...p.pp...p..p.p.p.p
Info: Applying Gauss Elimination
[39:2][40:2][43:2][44:3][45:3][46:2][47:2].....
Info: Extracting initial monomials that are not hit
Info: Dim: 53 Skiped: 41 Char Col: 12 Mgs: 0
Info: 9	150	2977121	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 9:
	 Date: Wed May 2 19:57:28 CEST 2001
Info:   Time: 150 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 10
Info: Constructing the initial poset at degree 10
Info: Generating the full matrix of decomposable invariants by iterating t\
hrough all 74 initial monomials
......................................................pp.p...p..p.p.pp...p\
p.p.p..p.p.p.p.p.p
Info: Applying Gauss Elimination
[53:2][54:2][57:2][59:2][60:2][61:3][62:2][64:2][65:3][66:3][67:2][68:2][69:2][70:2][71:2][72:2][73:2]Info: Extracting initial monomials that are not hit
Info: Dim: 74 Skiped: 57 Char Col: 17 Mgs: 0
Info: 10	250	3026273	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 10:
	 Date: Wed May 2 19:57:28 CEST 2001
Info:   Time: 250 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 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 141 initial monomials
..........................................................................\
.............................pp....pp...pp...p.p.p..pp.ppp.ppp.p...p.p.p.p\
.p.p.p.p.p.p.p.p.pp..p.p.p.p.p
Info: Applying Gauss Elimination
[102:2][106:2][109:2][112:2][113:2][114:2][116:3][117:5][118:4][119:6][120:4][121:6][122:4][123:5][124:5][125:4][126:7][127:5][128:7][129:5][130:5][131:5][132:5][133:6][134:8][135:2][136:7][137:6][138:7][139:7][140:4]Info: Extracting initial monomials that are not hit
Info: Dim: 141 Skiped: 110 Char Col: 31 Mgs: 0
Info: 12	700	3140961	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 12:
	 Date: Wed May 2 19:57:29 CEST 2001
Info:   Time: 700 ms
Info:   Memory: 3140 ko.
Info:   S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0)
Info:   Minimal generators: 0
Info: Updating the degreeBound to 7 which is optimal!
Info: Total time: 1 s 780 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:29 CEST 2001
Host: giulia3.medicis.polytechnique.fr
Info: ====================================================================\
==========
Info: Total time: 0 ms