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

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

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

Info: Extracting initial monomials that are not hit
Info: Dim: 10 Skiped: 5 Char Col: 0 Mgs: 5
Info: 3	10	2829665	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 3:
	 Date: Wed May 2 19:57:43 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: 5
Info:   --------------------------------------
Info: 	 [1, 0, 1, 0, 0, 1]
Info: 	 [1, 0, 1, 0, 1, 0]
Info: 	 [1, 1, 0, 1, 0, 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 24 initial monomials
........pp.pp..p..p..pp...p......
Info: Applying Gauss Elimination
[7:2][8:2][9:2][10:2][12:2][14:2][16:2][17:2].
Info: Extracting initial monomials that are not hit
Info: Dim: 24 Skiped: 11 Char Col: 9 Mgs: 4
Info: 4	50	2846049	#Stats: degree,time(ms),mem(bytes)
Info: Statistics for degree 4:
	 Date: Wed May 2 19:57:43 CEST 2001
Info:   Time: 50 ms
Info:   Memory: 2846 ko.
Info:   S-Pairs: 0 (+ 0 normalf->0 + 0 reduction->0 + 0 non-lcm->0)
Info:   Minimal generators: 4
Info:   --------------------------------------
Info: 	 [1, 1, 0, 1, 1, 0]
Info: 	 [1, 1, 1, 0, 0, 1]
Info: 	 [1, 1, 1, 0, 1, 0]
Info: 	 [2, 0, 0, 0, 1, 1]
Info:   --------------------------------------
Info: Total time: 510 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:43 CEST 2001
Host: giulia3.medicis.polytechnique.fr
Info: ====================================================================\
==========
Info: Total time: 0 ms