tw@gogo:~/vec> reduce 120000000
Loading image file :/usr/local/reduce37d/lisp/psl/linux/red/reduce.img 
REDUCE Development Version, 14-May-2003 ...

1: load "~/red/src5/crack",v3tools$

********************************************************************
* Please note the following conventions to use these routines:     *
* - Vectors are denoted by a single character and products         *
*   (A,Bx(Cx(Dx...))) by single identifiers ABCD... . For example, *
*   scalar products (A,B) by AB, triple products (A,BxC) by ABC,   *
*   (A,Bx(CxD)) by ABCD and so on. For scalar and triple products  *
*   only those versions are used for which letters are sorted      *
*   alphabetically, for example, AB, ABU but not BA, AUB or BUA.   *
* - Any non-vectorial variable starts with the two characters !&.  *
* - For further comments see the beginning of this file and the    *
*   files v3tools.tex and v3tools.tst.                             *
********************************************************************

2: in "v3tools.tst"$

0 = 0

0 = 0

0 = 0

Conversion into component form: 0 = 0

Conversion into vector form: 0 = 0

==========================================================

                                             2
One partition of input: ab*abu*uu*(aa*bb - ab )
Generating specific permutations of products of the vectors aaaabbbbuuu.
8400 permutations generated.
Applying another filter, 6160 are left.
At a first look 61 seem to be non-equivalent.
shortened expression:
abauuubbaab


Conversion into extended vector form: 0 = 0

Conversion into standard vector form: 0 = 0

Conversion into component form: 0 = 0

==========================================================

                                        2     2
One partition of input: aa*bb*vv - aa*bv  - ab *vv + 2*ab*av*bv
shortened expression:
   2     2
abv  + av *bb


Shortening of standard vector form: 0 = 0

Time: 295310 ms  plus GC time: 5670 ms

Poisson bracket in components: 0 = 0

Time: 6150 ms  plus GC time: 560 ms

Poisson bracket in vector form: 0 = 0

Time: 2980 ms

Poisson bracket in vector form: 0 = 0

Time: 100 ms

Poisson bracket in vector form: 0 = 0

Time: 260 ms

Generation of vector products: ok.

Generation of vector products with weights: ok.

Check of a computed first integral: 0 = 0$

Equivalence check with FI6: 0 = 0$

Check of a computed first integral: 0 = 0$
The expression in question is functionally dependent on
the list of expressions {p_1,p_2,...} in the following way:
 - arbcomplex(4)*p_2*p_3*p_4**2*p_6 - arbcomplex(4)*p_2*p_6**3 - arbcomplex(4)*
p_3*p_5*p_6**2 + arbcomplex(3)*p_3*p_5*p_6**2 - arbcomplex(2)*p_2*p_3*p_4**2*p_6
 - arbcomplex(1)*p_7$

Known first integral.$

3: