*----* 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,5,0):quit proc InvariantRingTransitiveGroup(n, i, p) ... end Info: Computation of the invariant ring of the 5th 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:54 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, 0, 2, 0, 0, 0] Info: secondaryInvariantsSeries: working on cycletype, [6, 0, 0, 0, 0, 0] Info: secondaryInvariantsSeries: working on cycletype, [3, 0, 1, 0, 0, 0] Info: secondaryInvariantsSeries: working on cycletype, [0, 3, 0, 0, 0, 0] Info: secondaryInvariantsSeries: working on cycletype, [0, 0, 0, 0, 0, 1] Info: degreeBound: enhancement from the degrees of the primary invariants:\ 14 Info: degreeBound: enhancement from the size of the group: 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 10 2796897 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 1: Date: Wed May 2 19:57:55 CEST 2001 Info: Time: 10 ms Info: Memory: 2813 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 2813281 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 2: Date: Wed May 2 19:57:55 CEST 2001 Info: Time: 10 ms Info: Memory: 2813 ko. Info: S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0) Info: Minimal generators: 2 Info: -------------------------------------- Info: [1, 0, 1, 0, 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 2829665 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 3: Date: Wed May 2 19:57:55 CEST 2001 Info: Time: 10 ms Info: Memory: 2829 ko. Info: S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0) Info: Minimal generators: 3 Info: -------------------------------------- Info: [1, 0, 1, 0, 1, 0] Info: [1, 1, 1, 0, 0, 0] Info: [2, 0, 0, 0, 1, 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 12 initial monomials ......pp...... Info: Applying Gauss Elimination [5:2]. Info: Extracting initial monomials that are not hit Info: Dim: 12 Skiped: 7 Char Col: 2 Mgs: 3 Info: 4 30 2862433 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 4: Date: Wed May 2 19:57:55 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: 3 Info: -------------------------------------- Info: [1, 1, 1, 0, 1, 0] Info: [1, 1, 1, 1, 0, 0] Info: [2, 1, 0, 0, 1, 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 20 initial monomials ........pp..pp....p.p.pp...p. Info: Applying Gauss Elimination [7:2][9:2]....[15:2].. Info: Extracting initial monomials that are not hit Info: Dim: 20 Skiped: 9 Char Col: 9 Mgs: 2 Info: 5 50 2878817 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 5: Date: Wed May 2 19:57:55 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: 2 Info: -------------------------------------- Info: [1, 1, 1, 1, 1, 0] Info: [2, 1, 0, 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 37 initial monomials ...........pp....pp...pp.ppp.p...p.p.p.p.p.p...p.pp.p...p. Info: Applying Gauss Elimination [10:2][14:2].[17:2][18:3][19:3][21:4][22:4][23:4][24:4][25:2][26:2][27:4][28:3].[30:2][31:2][32:3][33:2].Info: Extracting initial monomials that are not hit Info: Dim: 37 Skiped: 15 Char Col: 20 Mgs: 2 Info: 6 120 2895201 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 6: Date: Wed May 2 19:57:56 CEST 2001 Info: Time: 120 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, 1, 0, 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 56 initial monomials ....................pp..ppp...pp.....pp.ppp.p..p.p..p.p.p.p.pppp.pp.pp..p.\ p.p.p.p..p..pp..p.p Info: Applying Gauss Elimination [19:2][21:3][24:2].[29:2][30:4][31:3].[33:4][34:3][35:3][36:5][37:2][38:2][39:2][40:6][41:2][42:3][43:5][44:6]..[47:2][48:8][49:4][50:5][51:2][52:8][53:6][54:2][55:3]Info: Extracting initial monomials that are not hit Info: Dim: 56 Skiped: 25 Char Col: 31 Mgs: 0 Info: 7 240 2960737 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 7: Date: Wed May 2 19:57:56 CEST 2001 Info: Time: 240 ms Info: Memory: 2960 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 90 initial monomials ..........................pp.........pp.pp.pp.p.pppp.p......ppp.pp.pp..p.p\ .p.p.p.p.pp.p..p.p.p.p.pp.p.pppp.pp.pp.pp....p..p.p.p.pp.p.pp.ppp..p.p.pp.\ .p..p.p.p Info: Applying Gauss Elimination [25:2][34:2][35:2][36:2][37:2][38:4][39:6][45:3][46:5][47:3][48:3][49:3][50:3][51:3][52:3][53:2][54:2][55:5][56:5][57:4][58:6][59:3][60:3][61:3][62:8][63:4][64:8][65:11][66:7][67:16][68:5][69:4][70:6][71:12][72:13][73:5][74:3][75:5][76:4][77:3][78:7][79:14][80:10][81:3][82:6][83:9][84:7][85:13][86:6][87:9][88:6][89:8]Info: Extracting initial monomials that are not hit Info: Dim: 90 Skiped: 38 Char Col: 52 Mgs: 0 Info: 8 450 3059041 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 8: Date: Wed May 2 19:57:57 CEST 2001 Info: Time: 450 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 9 Info: Constructing the initial poset at degree 9 Info: Generating the full matrix of decomposable invariants by iterating t\ hrough all 133 initial monomials ........................................pp.......pp..pppp....pp.......pp..\ pp.p.ppp.p.....p.pp..p.ppp.ppp.pp.pp.ppp.pp..pp.p.p.p...p.ppp.pp.pp..pp.p.\ p.p.p.p.p.pp.pp.p.pp...p.p.p.p.p.ppp.p.ppp.pp.p.pp.ppp.p.....p.p.p.p.pp.pp\ .p.p.p.p..p Info: Applying Gauss Elimination [39:2][46:2][48:4][52:2].[59:2][61:3][62:3][63:4][64:5][65:5][69:2][70:3][72:2][73:4][74:4][75:7][76:4][77:9][78:6][79:4][80:10][81:3][82:2][83:3][86:3][87:5][88:2][89:4][90:4][91:7]...[95:4][96:6][97:4][98:8][99:8][100:12][101:15][102:6][103:11][104:12][105:3][106:12][107:13][108:12][109:10][110:6][111:21][112:19][113:13][114:21][115:25][116:23][117:15][118:24][119:8][120:24][121:3][122:9][123:3][124:6][125:6][126:9].[128:28][129:11][130:21][131:17][132:7]Info: Extracting initial monomials that are not hit Info: Dim: 133 Skiped: 61 Char Col: 72 Mgs: 0 Info: 9 710 3190113 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 9: Date: Wed May 2 19:57:58 CEST 2001 Info: Time: 710 ms Info: Memory: 3190 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 197 initial monomials ......................................................ppp............pp..p\ p.p..........pp.p.pp.p.ppppp.p.........ppp.ppp.pp..p.p.p.p.p...p.p.pp.p...\ p.p.pp.p.ppp.ppp.ppp.p..p.p.pp.ppp...ppp..p.p.p.p.p..p.p.pp.ppp.ppp.pppp.p\ p.pp.ppp.pp.ppp.pp..ppp..p.p.p.p.p.p.pp.p.pp.pp..p.p.p.p.p.p.p.pp.p.ppp..p\ .pp.p...p.p.pp.p.pp.p.p.p.ppp.pp.p.ppp..pp...p.pp.p.p.p.p.p Info: Applying Gauss Elimination [53:3][65:2][67:2][68:2][78:3][79:2][80:2][81:2][82:5][83:3][92:3][93:6][94:3][95:3][96:3][97:4][98:4][99:2][100:4][103:2][104:2][105:4][106:4][109:2][110:2][111:3][112:2][113:4][114:4][115:5][116:5][117:3][118:5][119:5][120:10][121:11][122:8][123:15][124:11][125:12][126:4][127:2][128:4][129:3][130:3][132:2][133:4][134:2][135:7][136:6][137:5][138:5][139:8][140:8][141:15][142:15][143:5][144:19][145:21][146:22][147:6][148:21][149:6][150:3][151:22][152:4][153:2][154:22][155:8][156:7][157:26][158:3][159:22][160:7][161:14][162:5][163:6][164:8][165:17][166:14][167:28][168:24][169:34][170:32][171:30][172:34][173:17][174:19][175:26][176:21][177:23][178:28][179:30][180:30][181:27][182:35][183:23][184:32][185:45][186:30][187:40][188:41][189:37][190:24][191:26][192:22][193:27][194:38][195:42][196:41]Info: Extracting initial monomials that are not hit Info: Dim: 197 Skiped: 87 Char Col: 110 Mgs: 0 Info: 10 1200 3403105 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 10: Date: Wed May 2 19:57:59 CEST 2001 Info: Time: 1 s 200 ms Info: Memory: 3403 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 276 initial monomials ..........................................................................\ ..........pp..........pp..ppppp.....pp............pp.p..........pp.pp.pp.p\ .pp.pp.pp.ppppp.p.p....p..........ppp.pp.ppp.pp..ppppp.pp..ppp.p.p.p...p..\ .p.ppp.pp.pp..ppp.p.p..p.p.p.p.p..pp.pp.p..pp.p.p.p.p.p.p.pp.p.pp.pp.p.ppp\ .pp.ppp.ppppp.p.pp.ppppp.p...p.p.p..ppp.p..p.p.p.p.p.p.p.p.p.p.pp.p.ppp.p.\ pp.pppp.pppp.ppp.ppp.pppp.p..pp.pp..p.p.p.p.p.p.p.p.pp.p.p.p.pp.p.pp..p.p.\ ppp..pp..pp..p.p.p.ppp.p.pp.p.pp..pp.pp.p..p.p.p Info: Applying Gauss Elimination [83:2][93:2][95:5][100:2].[112:2][113:2][123:2][124:3][125:3][126:3][127:2][128:2][129:4][130:6][131:4][132:5][136:2][146:4][147:3][148:5][149:5][151:11][152:6][153:4][154:13][155:4][156:2][157:4][160:4][163:3][164:5][165:2][166:5][167:4][168:9]...[173:3][174:2][175:4][176:3][178:7][179:5][180:8][181:9][182:12][183:5][184:4][185:5][186:6][187:4][188:3][189:5][190:6][191:5][192:8][193:9][194:10][195:10][196:10][197:8][198:13][199:11][200:16][201:29][202:14][203:14][204:18][205:18][206:10][207:18][208:25][209:31][210:29][211:34][212:8][213:4][214:36][215:4][216:8][217:6][218:4][219:37][220:3][221:7][222:7][223:4][224:7][225:36][226:15][227:28][228:10][229:15][230:18][231:40][232:31][233:27][234:19][235:43][236:4][237:7][238:2][239:4][240:7][241:4][242:7][243:4][244:10].[246:13][247:10][248:36][249:34][250:47][251:35][252:28][253:34][254:49][255:28][256:63][257:44][258:45][259:53][260:50][261:50][262:11][263:59][264:4][265:39][266:64][267:59][268:31][269:51][270:60][271:36][272:32][273:4][274:6][275:42]Info: Extracting initial monomials that are not hit Info: Dim: 276 Skiped: 135 Char Col: 141 Mgs: 0 Info: 11 1860 3747169 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 11: Date: Wed May 2 19:58:01 CEST 2001 Info: Time: 1 s 860 ms Info: Memory: 3747 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 391 initial monomials ..........................................................................\ ............................ppp...............pp.............p.....pp.pp..\ ..............pp...pp.p.ppppppp.p............ppp.pppp.pp..p.p.p.p.p.p.....\ p.p..........ppp..pp.p.pp.p.p.pppp.p.pp.....p....p..p.pp..p...ppp.ppp.pp.p\ ppp.ppp.ppp.ppp.pp.p.ppppp.ppp.pp..ppppp.p.p.p.p.p.p..p.p......p.pp.p...pp\ pp.pp.pp.ppp.ppp.pppp.pp..ppppp..p.p.p.p.p.p..p.p.pp.p.pp.pp..p.p.p.p.p.p.\ p.p.p.p.p.pp.ppp.pp.p.p.ppp.pp...pp.p.p.p.p.p.p.p.p.pp.p.p.pp.p.ppppp.ppp.\ p.pp.ppp.pp.p.pppp.ppp.pp.pp.pppp.pppp.pp.pp.....p.p..p..p.p.p.p.p.p.p.p.p\ .p.p.p.pp.pppp.p.p.pp.pp.pppp.pppp.ppp..pp.p.p.p.p.p.p.p.p.p.p.p.pppp..p.p\ p..p.p.pp.p..p.p.pp..p.p.p.p.p.p.p.p Info: Applying Gauss Elimination [101:3][116:2][129:2][134:2][135:2][151:3][154:2][155:2][156:7][157:3][169:3][170:8][171:3][172:4][173:3][174:4][175:4][176:4][177:2][178:4][183:2][184:2][194:4][196:3][197:3][198:5][199:3][200:3][201:6][202:5][203:10][204:8][208:2][212:2][214:2][215:3][217:3][220:4][221:4][222:3][223:5][224:11][225:4][226:10][227:14][228:4][229:14][230:9][231:12][232:5][233:17][234:15][235:3][236:2][237:6][238:3][239:3][241:2][242:6][248:4][249:2][250:4][253:5][254:4][255:10][256:8][257:17][258:11][259:5][260:8][261:23][262:23][263:5][264:4][265:8][266:3][267:2][268:7][270:4][271:4][272:2][273:2][274:10][275:7][276:8][277:4][278:2][279:4][280:6][281:8][282:8][283:12][284:3][285:6][286:6][287:11][288:16][289:14][290:9][291:5][292:30][293:23][294:29][295:11][296:21][297:14][298:15][299:6][300:12][301:9][302:12][303:13][304:6][305:15][306:27][307:20][308:8][309:21][310:10][311:18][312:38][313:7][314:34][315:40][316:41][317:44][318:22][319:53][320:45][321:46][322:23][323:57][324:44][325:63][326:43][327:34][328:52][329:22][330:66][331:60][332:52][333:54][334:48][335:31][336:12][337:17][338:4][339:12][340:30][341:9][342:12][343:19][344:9][345:12][346:10][347:8][348:23][349:11][350:39][351:13][352:48][353:27][354:56][355:27][356:58][357:45][358:6][359:9][360:4][361:9][362:9][363:9][364:2][365:51][366:37][367:73][368:21][369:40][370:79][371:62][372:52][373:62][374:74][375:81][376:81][377:90][378:89][379:98][380:29][381:43][382:49][383:13][384:53][385:13][386:90][387:79][388:90][389:9][390:10]Info: Extracting initial monomials that are not hit Info: Dim: 391 Skiped: 192 Char Col: 199 Mgs: 0 Info: 12 3020 4222305 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 12: Date: Wed May 2 19:58:04 CEST 2001 Info: Time: 3 s 30 ms Info: Memory: 4222 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 526 initial monomials ..........................................................................\ ..........................................................................\ ..........pp.............pp..pppppp......pp..........................pp...\ pp..pp.pp.p....................pp.p.pp..p.pp.pp.pp.ppppppp.p.pp....p......\ ...........ppp.pp.ppp.pp..ppppppp.pp..pppp.p.p.p...p...p...p.ppp.pp.pp..pp\ pp.p.p...p...p.p..p..p.pp.p...p.p.p.p.p.p.p.pp.pp.p.pp.p..pppp.ppp.pp.pppp\ p.p..p.p.pp.ppp.p.ppp.ppp.p...ppppp.p..p.p.p.p.p..p.p..p.p..p.p..pp.p.pp.p\ p.ppp.ppp.p.p.p.pppp.ppp.pp.pp.pppp.ppp.ppp.ppppp.ppp.pppp.pppp.pp..pppppp\ p.pp..pp.p.p.p.p.p.p.p.p.p.p.p..p.p.p...p.ppp.p.pp.ppp.pp.pp.ppp.ppp.p..pp\ pp.ppp..p.p.p.p.p.p.p.p.p.p.p.pp.p.p.p.p.p.p.p.p.p.p.ppp.p.p.pp.pp.p.pp.pp\ ppp..p.pp.p.ppp...p.p.p.p.p.p.p.p.p.p.p.pppp.p.p.ppp.p.p.p.pp.ppp.p.ppp.pp\ ppp.pp.ppp.pp.ppp.p.pp.pppp.ppp.ppp.pp.p......p..p.p.p.p.p.p.p.p.ppp.p.p.p\ .p.p.ppp.p.ppp.ppp..p.p.p.p.p.p.pp..p.ppp.p.p..p.p.p.p.p.p.p Info: Applying Gauss Elimination [157:2][170:2][172:6][178:2].[204:2][207:2][209:2][210:2][211:3][231:3][232:2][233:3][235:2][236:2][237:2][238:3][239:8][240:4][241:11][245:2][262:4][263:3][264:5][265:5][267:14][268:6][269:4][270:16][271:5][272:2][273:5][276:3][279:3][282:3][283:5][284:2][285:6][286:4][287:11]...[295:2][296:2][298:2][300:2][301:6][302:6][305:2][306:2][307:2][308:2][309:2][310:2][311:2][312:4][313:3][314:2][315:3][316:2][318:5][319:6][320:4][321:6][322:7][323:4][324:6][325:6][326:10][327:6][328:8][329:16][330:14][331:15][332:20][333:17][334:17][335:29][336:23][337:18][338:2][339:22][340:4][341:3][343:2][344:22][346:23][347:3][349:2][350:2][352:4][353:6][354:4][355:3][356:23][357:6][358:4][359:3][360:5][361:7][362:4][363:22][364:28][365:12][366:32][367:28][368:15][369:10][370:20][371:18][372:14][373:22][374:40][375:36][376:28][377:37][378:10][379:5][380:35][381:4][382:16][383:6][384:3][385:39][386:2][387:5][388:12][390:3][391:37][392:2][395:7][396:4][397:8][398:36][399:14][400:8][401:2][402:50][403:17][404:53][405:26][406:35][407:11][408:36][409:5][410:40][411:5][412:3][413:6][414:3][415:3][416:11][417:5][418:8][419:6][420:13]..[423:11][424:36][425:31][426:13][427:21][428:27][429:30][430:32][431:26][432:6][433:15][434:15][435:22][436:31][437:24][438:44][439:36][440:44][441:57][442:68][443:76][444:84][445:44][446:30][447:35][448:44][449:20][450:29][451:50][452:44][453:35][454:34][455:41][456:60][457:46][458:27][459:48][460:65][461:66][462:41][463:22][464:17][465:55][466:61][467:35][468:50][469:77][470:90][471:64][472:64][473:45][474:94][475:47][476:92][477:118][478:85][479:108][480:59][481:71][482:49][483:31][484:93][485:70][486:96][487:17][488:53][489:10][490:19][491:5][492:36][493:41][494:44][495:11][496:16][497:42][498:38][499:105][500:51][501:10][502:115][503:115][504:28][505:26][506:5][507:8][508:3][509:21][510:102][511:64][512:83][513:108][514:70][515:69][516:139][517:86][518:81][519:113][520:109][521:44][522:61][523:31][524:45][525:70]Info: Extracting initial monomials that are not hit Info: Dim: 526 Skiped: 264 Char Col: 262 Mgs: 0 Info: 13 4720 4894049 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 13: Date: Wed May 2 19:58:09 CEST 2001 Info: Time: 4 s 720 ms Info: Memory: 4894 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: 12 s 890 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:09 CEST 2001 Host: giulia3.medicis.polytechnique.fr Info: ====================================================================\ ========== Info: Total time: 10 ms