*----* 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(7,5,0):quit proc InvariantRingTransitiveGroup(n, i, p) ... end C/C++ Debugger interface is active. Debugger: 'ddd', Process: 4764 C/++ debugger name is set to ´gdb´Info: Computation of the invariant ring of the 5th transitive permutation \ group on 7 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 20:30:54 CEST 2001 Host: giulia3.medicis.polytechnique.fr Info: ====================================================================\ ========== Info: degreeBound: from the dimension of the space: 21 Info: secondaryInvariantsSeries: Computation from cycle types Info: secondaryInvariantsSeries: working on cycletype, [1, 1, 0, 1, 0, 0, \ 0] Info: secondaryInvariantsSeries: working on cycletype, [1, 0, 2, 0, 0, 0, \ 0] Info: secondaryInvariantsSeries: working on cycletype, [3, 2, 0, 0, 0, 0, \ 0] Info: secondaryInvariantsSeries: working on cycletype, [7, 0, 0, 0, 0, 0, \ 0] Info: secondaryInvariantsSeries: working on cycletype, [0, 0, 0, 0, 0, 0, \ 1] Info: degreeBound: enhancement from the degrees of the primary invariants:\ 18 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 2977121 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 1: Date: Wed May 2 20:31:05 CEST 2001 Info: Time: 30 ms Info: Memory: 2977 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] 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 2977121 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 2: Date: Wed May 2 20:31:05 CEST 2001 Info: Time: 0 ms Info: Memory: 2977 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, 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 2977121 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 3: Date: Wed May 2 20:31:05 CEST 2001 Info: Time: 10 ms Info: Memory: 2977 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, 0] Info: [1, 1, 1, 0, 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 7 initial monomials ....... Info: Applying Gauss Elimination Info: Extracting initial monomials that are not hit Info: Dim: 7 Skiped: 5 Char Col: 0 Mgs: 2 Info: 4 10 2977121 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 4: Date: Wed May 2 20:31:06 CEST 2001 Info: Time: 10 ms Info: Memory: 2977 ko. Info: S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0) Info: Minimal generators: 2 Info: -------------------------------------- Info: [1, 1, 1, 0, 0, 1, 0] Info: [1, 1, 1, 1, 0, 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 11 initial monomials ........... Info: Applying Gauss Elimination Info: Extracting initial monomials that are not hit Info: Dim: 11 Skiped: 9 Char Col: 0 Mgs: 2 Info: 5 20 2993505 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 5: Date: Wed May 2 20:31:06 CEST 2001 Info: Time: 20 ms Info: Memory: 2993 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, 0] Info: [2, 1, 1, 0, 1, 0, 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 19 initial monomials .............pp....p.. Info: Applying Gauss Elimination [12:2].. Info: Extracting initial monomials that are not hit Info: Dim: 19 Skiped: 14 Char Col: 3 Mgs: 2 Info: 6 60 3009889 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 6: Date: Wed May 2 20:31:07 CEST 2001 Info: Time: 60 ms Info: Memory: 3009 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, 0] Info: [2, 1, 1, 1, 0, 0, 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 29 initial monomials ................pp....p..p...p.p..p. Info: Applying Gauss Elimination [15:2]...... Info: Extracting initial monomials that are not hit Info: Dim: 29 Skiped: 20 Char Col: 7 Mgs: 2 Info: 7 140 3042657 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 7: Date: Wed May 2 20:31:09 CEST 2001 Info: Time: 150 ms Info: Memory: 3042 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, 1] Info: [2, 2, 1, 0, 1, 1, 0] 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 44 initial monomials ................................pp..p..p.p.p.p..p.p..p Info: Applying Gauss Elimination [31:2][33:2][35:2][36:2][37:2][38:2][40:2][41:2].. Info: Extracting initial monomials that are not hit Info: Dim: 44 Skiped: 34 Char Col: 10 Mgs: 0 Info: 8 180 3075425 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 8: Date: Wed May 2 20:31:10 CEST 2001 Info: Time: 180 ms Info: Memory: 3075 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 66 initial monomials .............................................pp....p.pp..p....p.p.p.p.p.p.\ pp...p.p Info: Applying Gauss Elimination [44:2][48:2][49:2][51:3][52:2][55:2][56:2][57:2][58:2][59:2][60:2][61:3][62:2]... Info: Extracting initial monomials that are not hit Info: Dim: 66 Skiped: 50 Char Col: 16 Mgs: 0 Info: 9 320 3091809 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 9: Date: Wed May 2 20:31:12 CEST 2001 Info: Time: 320 ms Info: Memory: 3091 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 96 initial monomials ......................................................pp...p...p.pp....p.p\ .p....p.pp...pp....p.p.pp.p.p.p.p.p.p.p.p.p.p.p.p.p.p.p Info: Applying Gauss Elimination [53:2][56:2][59:2][60:2][64:2][65:2][66:3][70:2][71:3][73:3][74:2][75:3][78:2][79:2][80:4][81:3][82:4][83:4][84:4][85:4].[87:2][88:4][89:4][90:3][91:4][92:4][93:4][94:4][95:4]Info: Extracting initial monomials that are not hit Info: Dim: 96 Skiped: 66 Char Col: 30 Mgs: 0 Info: 10 820 3173729 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 10: Date: Wed May 2 20:31:14 CEST 2001 Info: Time: 820 ms Info: Memory: 3173 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 136 initial monomials ..........................................................................\ .............pp.ppp..p........p.p.p.p.p.p.pp..p..p.p.p....p.p.p.pp.p.pp..p\ .p..p.pp.p.p.p..p.p.p.p.p.p.p Info: Applying Gauss Elimination [86:2][87:3][89:3][92:3][97:2][98:3][99:2][100:2][101:3][102:3][103:3][105:3][107:2][108:3][109:3][113:2][114:2][115:4][116:4][117:5][118:2][119:3][120:2][121:4][123:2][124:5][125:5][126:4][127:5][128:5][129:5][130:5][131:5][132:4][133:4][134:4][135:5]Info: Extracting initial monomials that are not hit Info: Dim: 136 Skiped: 99 Char Col: 37 Mgs: 0 Info: 11 1140 3288417 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 11: Date: Wed May 2 20:31:16 CEST 2001 Info: Time: 1 s 140 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 193 initial monomials ..........................................................................\ ........................pp................p..........pp..p......p..p.p..p.\ p.......pp.p.ppp..p..pp..p.....p.p.p.p.pp.p.p.p.p.p.p.p.p.p.pp..p.p.p.p.p.\ pp.p.pp...p..p.p.pp..p.p.p.p Info: Applying Gauss Elimination [97:2][113:2][123:3][125:3][131:3][133:3][134:2][136:3][137:3][144:4][145:3][146:4][148:4][149:5][150:4][152:5][153:4][157:4][158:3][159:5][160:2][161:3][162:4][163:4][164:4][165:4][166:5][167:5][168:4][169:4][170:5][171:2][173:4][174:5][175:5][176:5][177:4][178:6][179:6][180:9][181:4][182:7][183:4][185:6][186:7][187:7][188:4][189:7][190:6][191:7][192:7]Info: Extracting initial monomials that are not hit Info: Dim: 193 Skiped: 142 Char Col: 51 Mgs: 0 Info: 12 1800 3452257 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 12: Date: Wed May 2 20:31:19 CEST 2001 Info: Time: 1 s 800 ms Info: Memory: 3452 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 265 initial monomials ..........................................................................\ ..................................................................pp...p..\ ....p..p.p..p.........p...p.pp.p...p....p.p.p.p.p..p..p...p.p..p..p.....pp\ .p.pp..pp..p.....p.p.p.p.p.pp.p.p..p..p.....p.p.pp.p.p.p.p.p.ppp..p.pp.p..\ .p.p.p.p.p.p.p.p.p.p.p.p.pp..p.p.p.p.pp.p.pp.p..p.p.p.p.p Info: Applying Gauss Elimination [139:2][142:2][148:2][150:2][151:2][153:2][162:2][165:2][166:3][167:2][170:2][174:2][175:2][176:2][177:2][178:2][180:2][182:2][185:2][186:2][188:2][190:2][195:3][196:2][197:4][199:2][201:2][206:3][207:4][208:5][209:2][210:5][211:6][212:2][213:4][215:3][216:6][217:3][222:5][223:3][224:7].[226:5][227:4][228:6][229:2][230:8][231:8][232:4][233:7][234:2][235:8][237:3][238:6][239:8][240:5][241:3][242:8][243:6][244:6][245:7][246:8][247:7][248:7][249:8][251:5][252:7][253:7][254:7][255:8][256:9][257:11][258:10][259:9][260:3][261:9][262:10][263:9][264:10]Info: Extracting initial monomials that are not hit Info: Dim: 265 Skiped: 186 Char Col: 79 Mgs: 0 Info: 13 3150 3698017 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 13: Date: Wed May 2 20:31:23 CEST 2001 Info: Time: 3 s 150 ms Info: Memory: 3698 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 14 Info: Constructing the initial poset at degree 14 Info: Generating the full matrix of decomposable invariants by iterating t\ hrough all 361 initial monomials ..........................................................................\ ..........................................................................\ ...pp......p.....p.........p.............p...p....p........p..p......p....\ ..p..p.p..p...p.....p.p.p..p.pp.p..pp.p......p.p.p.p.p..p.p..p.pp.p.....p.\ p.p.p.p.p.p.p.p.p.p.p.p.p..p.p.p.p...p.p...p.p.p.pp.p.pp...pp...pp.....p.p\ .p.p.pp.p.p.pp.pp.p...p.p.p.p.p.pp.p.p.p.p.p.p.pp.p..p..p.p.p.p.p.p.p.p.p.\ p.p.pp.p.p.p.p.p.p.p.p.p.pp.p..p.p.p.p.p.p.p.pp..p.p Info: Applying Gauss Elimination [150:2][156:2][161:2][170:2][183:2][186:2][190:2][198:2][200:2][206:2][212:2][214:2][215:2][217:2][220:2][225:2][226:2][227:2][229:2][230:3][231:2][233:2][234:2][240:2][241:3][242:3][243:3][244:3][246:3][247:3][249:3][250:2][251:2][256:2][257:2][258:2][259:2][260:2][261:3][262:3][263:3][264:3][265:4][266:2][267:2][268:2][269:4][271:2][272:3][273:3][274:3].[278:2][281:3][282:4][283:3][284:5][285:3][286:4][288:5][289:4][290:6][292:3][297:2][298:2][299:2][300:2][301:7][302:2][303:5][304:6][305:8][306:5][309:2][310:7][311:7][312:9][313:9][314:7][315:5][316:9][317:9][318:6][319:10][320:9][321:5][322:8][324:5][325:5][326:2][327:2][328:6][329:7][330:6][331:4][332:8][333:10][334:9][335:10][336:7][337:12][338:9][339:2][340:11][341:10][342:10][343:11][344:9][345:12][346:10][347:13][348:12][349:5][350:6][351:9][352:11][353:11][354:12][355:12][356:12][357:13][358:12][359:12][360:10]Info: Extracting initial monomials that are not hit Info: Dim: 361 Skiped: 237 Char Col: 124 Mgs: 0 Info: 14 5450 4025697 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 14: Date: Wed May 2 20:31:29 CEST 2001 Info: Time: 5 s 450 ms Info: Memory: 4025 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 15 Info: Constructing the initial poset at degree 15 Info: Generating the full matrix of decomposable invariants by iterating t\ hrough all 485 initial monomials ..........................................................................\ ..........................................................................\ ..........................................................................\ ..........................................................................\ ..........................................pp.pppp..pp...p...p...........pp\ ....pp.p.p..pp.....p.p.p.p.p.p.p.p.p.p.pp..p.......p....p.p...p.p....p.p.p\ ...p....p.p.p.p.pp.p.p.pp.pp.pp.p...pp.p...p..p...p.p...pp.pp.p.pp...p.p.p\ .p.p.p.p.p.p.pp.p.p.p.p.p.p.p.p.p.p.p.p.p.p.p.p.p.p.p.p.p.p.pp..p.p.p.p.p.\ p.p.p Info: Applying Gauss Elimination [337:2][338:4][340:3][343:5][346:2][347:5][357:2][361:2][362:2][363:5][365:6][370:3][371:3][372:2][373:4][374:3][375:2][376:5][377:3][378:5][379:5][380:2][382:5][389:2][393:4][394:6][397:6][398:4][402:6][403:4][404:4][407:2][411:7][412:3][413:4][414:4][415:6][416:2][417:7][418:8][419:10][420:2][421:7][423:4][424:4][425:10][426:11][428:2][430:2][433:2].[437:10][438:11][439:6][440:12][443:10][444:11][445:9][446:11][447:11][448:12][449:12][450:11][451:10][452:14][453:8][454:13][455:15][456:14][457:11][458:13][459:2][460:13][461:3][462:2][463:12][464:12][465:15][466:8][467:14][468:11][469:10][470:15][471:15][472:16][473:13][474:16][475:16][476:16][477:16][478:16][479:16][480:15][481:16][482:14][483:16][484:16]Info: Extracting initial monomials that are not hit Info: Dim: 485 Skiped: 388 Char Col: 97 Mgs: 0 Info: 15 4970 4451681 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 15: Date: Wed May 2 20:31:35 CEST 2001 Info: Time: 4 s 970 ms Info: Memory: 4451 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 16 Info: Constructing the initial poset at degree 16 Info: Generating the full matrix of decomposable invariants by iterating t\ hrough all 643 initial monomials ..........................................................................\ ..........................................................................\ ..........................................................................\ ..........................................................................\ ..........................................................................\ .....pp...pp.................................p..................p.........\ ................pp..pp...............p.......p.p..p.p..p...p.........p.p..\ p.pp.pp.p.ppp..p.ppppp..pp.p..ppp.pp.p.p..p.pp..............pp.p.p.p.pp.p.\ ..p.p.p.p.p.p.p.p.p.pp.p.p.p.p.p.p.p.p...p.p.p.p.p.p.p..p.p.p.p.p.p.p.p.p.\ ..p.p.p.p.p.p.p.p.p.p.pp.pp.pp.pppp..pp.p...p.pp..p...p.p..p.p.p.pp.pp..p.\ p.p.p.pp..p.p.p.p.p.p.pp..p.p.p.p.p.p.p.p.p.p.p.p.p.p.p.p.p.p Info: Applying Gauss Elimination [374:2][377:2][410:2][428:2][453:4][455:5][470:5][477:4][478:3][480:4][481:4][483:2][486:4][495:4][496:4][498:5][499:5][500:6][501:3][502:6][504:2][505:10][507:2][508:5][509:8][510:6][511:2][512:5][513:6][515:2][516:8][517:6][518:8][530:3][531:5][532:7][533:2][534:12][535:8][538:5][539:6][540:8][541:5][542:8][543:9][544:13][545:5][546:8][547:10][548:8][549:8][550:9][551:11][552:9][553:12][554:2][555:3][558:2][559:6][560:2][561:2][562:8][563:9][564:12][566:9][567:9][568:9][569:6][570:5][571:11][572:8][573:2][574:2][577:9][578:10][579:15][580:13][581:2][582:12][583:13][584:18][585:10][586:13][587:2][588:17][589:10][590:19][591:19][592:4][593:4][594:10][595:16][596:4][597:11][598:22][599:21][602:2][603:2][605:9][606:12][607:2][608:19][609:20][611:17][612:19][613:20][614:15][615:15][616:21][617:21][618:22][619:21][620:22][621:22][622:19][623:23][624:24][625:23][626:22][627:22][628:21][629:14][630:21][631:23][632:23][633:23][634:23][635:24][636:24][637:21][638:23][639:24][640:23][641:24][642:24]Info: Extracting initial monomials that are not hit Info: Dim: 643 Skiped: 508 Char Col: 135 Mgs: 0 Info: 16 7860 4975969 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 16: Date: Wed May 2 20:31:44 CEST 2001 Info: Time: 7 s 870 ms Info: Memory: 4975 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 17 Info: Constructing the initial poset at degree 17 Info: Generating the full matrix of decomposable invariants by iterating t\ hrough all 841 initial monomials ..........................................................................\ ..........................................................................\ ..........................................................................\ ..........................................................................\ ..........................................................................\ ..........................................................................\ ...............................................................pp...ppp...\ .p................p..p.......p.p..p.p..p............p...p...p....pp...p.pp\ .p...pp...p.p..............p..p.p.p...p.p..p.p..p.p.p.p..p.p..p........p..\ p........p.p..p..p..p..p........p...pp.p.pp..p..ppp..pp.p.............p.p.\ p.p....p.p.p.p.p.p.p..p.p.pp.p.p..p....p.pp.....p.p.p.p.p.pp.p.p.pp.p.p.pp\ pp..p.p..p.pp.pp.pp..p.pppp...pp.ppp.p.p.p...p..........p.p.p.p.p.p..p.p.p\ .p.p.pp.p.p.p.pp.p.p.p.p.p.p.p.p.p.p.p.p..p.p.p.p.p.p.p.p.p.pp..p..p.p.p.p\ .p.p.p.p.p.p.p.p.p.p.pp.pp.p.pp.pp.pp...p.p...p.p.p.p.pp.p.p.p.p.pp..p.p.p\ .p.p.p.p.p.p.p.p.p.p.p.p Info: Applying Gauss Elimination [506:2][509:4][513:3][529:2][531:4][538:3][539:3][541:3][542:2][544:2][556:3][559:2][562:2][566:5][569:2][570:4][571:2][574:4][577:4][578:3][592:3][594:2][595:5][596:4][599:3][600:2][602:3][603:2][605:2][606:2][607:2][608:2][610:3][611:3][613:2][621:2][623:3][631:3][632:4][634:3][636:2][638:3][640:3][648:2][651:6][652:4][653:5][655:2][657:6][659:7][660:6][673:2][674:4][675:2][676:6][680:6][681:8][682:5][683:10][684:10][685:4][686:8][688:6][689:8][690:9][691:5][692:8][694:3][697:9][698:9][699:2].[705:3][706:2].[708:3][709:3][710:11][711:7][712:4][713:6][714:7][715:12][717:7][718:14][719:11][720:10][721:6][722:9][723:13][725:2][726:17][727:16][728:13][729:13][730:15][731:2][732:8][733:13][734:12][736:12][737:16][746:4][747:3][748:2][749:5][750:16][751:9][753:13][754:15][755:11][756:17][757:15][758:13][759:13][760:8][761:12][762:20][763:9][764:17][765:20][766:14][767:16][768:16][769:2][770:3][771:2][772:9][773:11][774:2][776:5][777:13][778:15][779:16][780:16][781:16][782:13][783:18][784:17][785:3][787:3][789:12][790:5][791:20][792:17][793:15][794:17][795:18][796:19][797:21][798:20][799:20][800:24][801:18][802:21][803:20][804:22][805:24][806:23][807:28][808:3][809:23][810:23][811:24][812:24][815:4][816:10][817:10][818:21][819:22][820:24][821:26][822:24][823:24][824:27][825:27][826:29][827:28][828:25][829:29][830:28][831:27][832:29][833:26][834:29][835:26][836:28][837:29][838:29][839:29][840:29]Info: Extracting initial monomials that are not hit Info: Dim: 841 Skiped: 650 Char Col: 191 Mgs: 0 Info: 17 12330 5693333 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 17: Date: Wed May 2 20:31:58 CEST 2001 Info: Time: 12 s 330 ms Info: Memory: 5693 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 18 Info: Constructing the initial poset at degree 18 Info: Generating the full matrix of decomposable invariants by iterating t\ hrough all 1093 initial monomials ..........................................................................\ ..........................................................................\ ..........................................................................\ ..........................................................................\ ..........................................................................\ ..........................................................................\ ..........................................................................\ ..............................pp..................p..........p............\ ...p....................................p.......p...p.....................\ p......................p..p...............p................p..p.p.....p.p.\ .p...p....p......p...p..p..p...pp...p.pp.p..pp.pp...pp.p................p.\ p..p.p.....p.p.p.p.p.p.p..p.p..p.p.....ppp.p......p.p..p.p.p..p.p.p.p.p..p\ .p.ppp.p.p..pp...p.pp.p.p.p..p.pp.p..p.p.........p...p.p.p..p.p.p.p.p.p..p\ .p.p.p.p.p.p....p..p.p...p.p......p.p.p.p.p.p..pp.p.pp.....pp...pp.p......\ .p.p..p.p.p.p.p.p..pp.p.p.pp...ppp.ppp..p.pp..........p.p..p.p...p.p.p.p.p\ .p.p.p.p.p.p.p.p.p..p.p.p.p.p.ppp.p.......p.p.p.p.p.p.p.p.p.pp.p.p.p.p.p.p\ .p.ppp.p.p.ppp..p.p.p.p.pp.pppp...p.p.p.pp.p.p.....p.p..p.p.p.p.p.p.p.p.pp\ .p.p.p.p.p.p.p.p.p.p.p.p.p.p.p.p.p.p.p.pp.p.pp.pp.p..p.p.p.p.p.p.p.p.p.p.p\ .p.p.p.p.p.ppp.p.pp...p.p.p.p.p.p.p.p.pp..p.p.p.p.p.p.p.p.p Info: Applying Gauss Elimination [547:2][565:2][575:2][590:2][626:2][633:2][636:2][657:2][679:2][681:2][696:2][712:2][714:2][715:2].[721:2][723:2].[730:2][736:2][739:2][741:2][743:2][746:2].[750:4].[753:2][754:4][757:5][758:4].[775:2][777:3][778:4][783:4][784:5][785:5][786:3][787:2][788:2][789:5][791:5][792:3][794:2][795:2][800:3][801:2][807:2][808:2][810:2][811:2][812:2][814:4][815:2][816:4][817:5][818:2][820:3][821:3][822:5][823:2][824:4][826:4][829:7][830:8][831:4][832:4][833:2][835:2][836:5][837:4][839:5][840:6][849:3][852:4][853:5][854:2][856:4][857:5][858:4][859:2][860:5][861:3][863:2][864:2][865:2][866:4][867:3][868:5][869:4][873:2][875:3][876:4].[880:2][886:4][887:6][888:5][889:5][890:4][891:5][893:7][894:5][895:7][899:9][900:5][901:9][903:4][904:10][911:2][912:2][914:2][915:3][916:5][917:3][918:3][919:6][921:8][922:5][923:8][924:7][927:13][928:15][930:6][931:14][941:2][942:3][944:8][945:12][948:9][949:8][950:17][951:16][952:10][953:13][954:16][955:18][956:15][957:15][958:17][959:5][960:12][961:17][963:5][964:16][965:9][966:16][967:15][968:7][969:18][974:17][976:2].[978:8][979:8][980:5][981:6][982:6][983:6][984:11][985:19][986:2][987:5][988:18][989:19][990:15][991:8][992:11][993:19][994:7][995:10][996:21][997:13][998:12][999:22][1000:20][1001:18][1002:23][1003:24][1004:25][1006:21][1007:31][1008:19][1009:24][1010:18][1011:21][1012:26].[1017:3][1019:5][1020:10][1021:26][1022:20][1023:26][1024:23][1025:22][1026:25][1027:21][1028:19][1029:23][1030:22][1031:26][1032:28][1033:21][1034:19][1035:9][1036:20][1037:18][1038:15][1039:23][1040:25][1041:25][1042:24][1043:25][1044:24][1045:24][1046:23][1047:29][1048:23][1049:24][1050:2][1051:2][1053:21][1054:25][1055:17][1056:31][1057:28][1058:31][1059:26][1060:29][1061:31][1062:32][1063:32][1064:31][1065:33][1066:33][1067:26][1068:32][1069:36][1070:31][1071:36][1072:30][1073:35][1074:31].[1076:5][1077:14][1078:32][1079:36][1080:34][1081:33][1082:34][1083:35][1084:35][1085:32][1086:35][1087:36][1088:36][1089:35][1090:36][1091:36][1092:36]Info: Extracting initial monomials that are not hit Info: Dim: 1093 Skiped: 830 Char Col: 263 Mgs: 0 Info: 18 18870 6731697 #Stats: degree,time(ms),mem(bytes) Info: Statistics for degree 18: Date: Wed May 2 20:32:17 CEST 2001 Info: Time: 18 s 870 ms Info: Memory: 6731 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: 57 s 640 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 20:32:18 CEST 2001 Host: giulia3.medicis.polytechnique.fr Info: ====================================================================\ ========== Info: Total time: 0 ms