*----*    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(8,4,0):quit

            proc InvariantRingTransitiveGroup(n, i, p) ... end
C/C++ Debugger interface is active. Debugger: 'ddd', Process: 2976
C/++ debugger name is set to ´gdb´Info: Computation of the invariant ring of the 4th transitive permutation \
group on 8 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 21:17:14 CEST 2001
Host: giulia1.medicis.polytechnique.fr
Info: ====================================================================\
==========
Info: degreeBound: from the dimension of the space: 28
Info: secondaryInvariantsSeries: Computation from cycle types
Info: secondaryInvariantsSeries: working on cycletype, [8, 0, 0, 0, 0, 0, \
0, 0]
Info: secondaryInvariantsSeries: working on cycletype, [0, 4, 0, 0, 0, 0, \
0, 0]
Info: secondaryInvariantsSeries: working on cycletype, [0, 0, 0, 2, 0, 0, \
0, 0]
Info: degreeBound: enhancement from the degrees of the primary invariants:\
 26
Info: degreeBound: enhancement from the size of the group: 6
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 21:17:17 CEST 2001
Info:   Time: 30 ms
Info:   Memory: 2829 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, 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 7 initial monomials
.......
Info: Applying Gauss Elimination

Info: Extracting initial monomials that are not hit
Info: Dim: 7 Skiped: 1 Char Col: 0 Mgs: 6
Info: 2	10	2829665	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 2:
	 Date: Wed May 2 21:17:17 CEST 2001
Info:   Time: 20 ms
Info:   Memory: 2829 ko.
Info:   S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0)
Info:   Minimal generators: 6
Info:   --------------------------------------
Info: 	 [1, 0, 0, 0, 0, 0, 1, 0]
Info: 	 [1, 0, 0, 0, 0, 1, 0, 0]
Info: 	 [1, 0, 0, 0, 1, 0, 0, 0]
Info: 	 [1, 0, 0, 1, 0, 0, 0, 0]
Info: 	 [1, 0, 1, 0, 0, 0, 0, 0]
Info: 	 [1, 1, 0, 0, 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 15 initial monomials
...............
Info: Applying Gauss Elimination

Info: Extracting initial monomials that are not hit
Info: Dim: 15 Skiped: 7 Char Col: 0 Mgs: 8
Info: 3	20	2846049	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 3:
	 Date: Wed May 2 21:17:17 CEST 2001
Info:   Time: 20 ms
Info:   Memory: 2846 ko.
Info:   S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0)
Info:   Minimal generators: 8
Info:   --------------------------------------
Info: 	 [1, 0, 1, 0, 1, 0, 0, 0]
Info: 	 [1, 0, 1, 1, 0, 0, 0, 0]
Info: 	 [1, 1, 0, 0, 0, 0, 1, 0]
Info: 	 [1, 1, 0, 0, 0, 1, 0, 0]
Info: 	 [1, 1, 0, 0, 1, 0, 0, 0]
Info: 	 [1, 1, 0, 1, 0, 0, 0, 0]
Info: 	 [1, 1, 1, 0, 0, 0, 0, 0]
Info: 	 [2, 0, 0, 0, 0, 0, 0, 1]
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 48 initial monomials
..........pp.pp.pp.pp.pp...pp.pp.p.p...p.p.p...p.p...p................
Info: Applying Gauss Elimination
[9:2][10:2][11:2][12:2][13:2].[16:2][17:2][18:2][19:2][22:2][23:2][24:2][25:2][27:2][28:2][29:2][31:2][32:2][35:2][40:2].
Info: Extracting initial monomials that are not hit
Info: Dim: 48 Skiped: 14 Char Col: 22 Mgs: 12
Info: 4	130	2911585	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 4:
	 Date: Wed May 2 21:17:17 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: 12
Info:   --------------------------------------
Info: 	 [1, 0, 1, 0, 1, 0, 1, 0]
Info: 	 [1, 0, 1, 1, 0, 1, 0, 0]
Info: 	 [1, 1, 0, 0, 0, 1, 1, 0]
Info: 	 [1, 1, 0, 0, 1, 0, 1, 0]
Info: 	 [1, 1, 0, 0, 1, 1, 0, 0]
Info: 	 [1, 1, 0, 1, 0, 0, 1, 0]
Info: 	 [1, 1, 1, 0, 0, 0, 0, 1]
Info: 	 [1, 1, 1, 0, 0, 0, 1, 0]
Info: 	 [1, 1, 1, 0, 0, 1, 0, 0]
Info: 	 [1, 1, 1, 0, 1, 0, 0, 0]
Info: 	 [2, 0, 0, 0, 0, 0, 1, 1]
Info: 	 [2, 0, 1, 0, 0, 0, 0, 1]
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 99 initial monomials
...............pp......pp.....pp....pp...pp..pp..p.p.p.p.p..p.pppp.pppp.pp\
p.ppp.p..ppp.ppp.ppp...ppp.ppp...ppp.......pp.pp.p...p.pp.................\
..........
Info: Applying Gauss Elimination
[14:2][20:2][25:2][29:2][32:2][34:2].[36:2][37:3][38:3][39:3][40:3]..[43:4][44:4][45:4][46:4].[49:5][50:4][51:5][52:7][54:5][55:4][56:7][58:5][59:7][61:7][65:9][66:2][67:9][68:6][70:8][71:2][72:4].[74:8][75:2].[78:2][79:9][80:6][81:9][82:10][83:6][84:2][85:5][86:8][87:8][88:9][89:6][90:2][91:5].[93:2].Info: Extracting initial monomials that are not hit
Info: Dim: 99 Skiped: 37 Char Col: 57 Mgs: 5
Info: 5	340	2977121	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 5:
	 Date: Wed May 2 21:17:18 CEST 2001
Info:   Time: 350 ms
Info:   Memory: 2977 ko.
Info:   S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0)
Info:   Minimal generators: 5
Info:   --------------------------------------
Info: 	 [1, 1, 1, 0, 0, 1, 1, 0]
Info: 	 [1, 1, 1, 0, 1, 1, 0, 0]
Info: 	 [1, 1, 1, 1, 0, 0, 0, 1]
Info: 	 [1, 1, 1, 1, 0, 0, 1, 0]
Info: 	 [2, 0, 1, 0, 0, 0, 1, 1]
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 227 initial monomials
....................................pp.p......pp......pppp.....pppp....ppp\
p...pppp..pppp............pppp....pppp.pp.pp.ppp.pp.ppp...pp...p..pp.pp.pp\
p.p.pp.ppp.pp.ppp...pp..p..pp.ppp.p.ppp...pp.p..ppp...p..p.pp.pp.pp.pp.p.p\
.pp.pp.pp..p.pp.pp..p.pp..p..pp.pp.p.p.p.pp.pppppp.pppppp.ppppp.pp.pp.pppp\
p.pppppp.p.p.pppp.p.p.p.p.p.p..p.ppp.ppp..p.ppp..p..p.p..p.ppp..p..p..p...\
p.p.p..p.p..p..p.p..p.p.....p..p..p....................
Info: Applying Gauss Elimination
[35:2][36:2][42:3][48:4][53:4][57:4][60:4][62:4][63:3][74:4][78:4][79:2][80:2][81:4][82:2][83:4][84:3][86:2][89:2][91:2][92:2][93:4][94:2][95:2][96:4][97:2][98:4][99:3][101:2][103:2][105:2][106:4][107:2][108:4][109:3][111:2][112:2][114:4][115:3][117:2][118:3][119:3][120:9][121:9][122:9][123:9][124:3][125:3][126:7][127:6][128:7][129:14][130:9][131:9][132:9][133:14][134:12][135:9][136:14][137:12][138:14][139:16][140:16][141:16][142:16][143:4][144:3][145:8][146:9][147:9][148:25][149:3][150:8][151:8][152:25][153:4][154:10][155:25][156:4][157:25][158:7][159:4][160:3][161:9][162:2][163:22][164:23][165:24][166:4][167:22][168:22][169:6][170:22][171:7][172:4][173:9][174:12][175:21][176:31][177:4][178:22][179:7][180:13][181:12][182:30][183:13][184:2][185:3][186:2][187:3][188:2][189:2][190:18][191:2][192:27][193:24][194:26][195:36].[197:18][198:42][199:18][200:32][201:18][202:2][203:41][204:18][205:42].[207:42][208:35][209:26][210:41][211:6][212:6][213:35][214:42][215:43][216:43][217:6][218:40][219:15][220:18][221:48][222:46][223:34][224:43][225:28][226:41]Info: Extracting initial monomials that are not hit
Info: Dim: 227 Skiped: 78 Char Col: 149 Mgs: 0
Info: 6	1040	3239265	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 6:
	 Date: Wed May 2 21:17:20 CEST 2001
Info:   Time: 1 s 40 ms
Info:   Memory: 3239 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: 1 s 990 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 21:17:20 CEST 2001
Host: giulia1.medicis.polytechnique.fr
Info: ====================================================================\
==========
Info: Total time: 0 ms