  i i i i i i i       ooooo    o        ooooooo   ooooo   ooooo
  I I I I I I I      8     8   8           8     8     o  8    8
  I  \ `+' /  I      8         8           8     8        8    8
   \  `-+-'  /       8         8           8      ooooo   8oooo
    `-__|__-'        8         8           8           8  8
        |            8     o   8           8     o     8  8
  ------+------       ooooo    8oooooo  ooo8ooo   ooooo   8

Copyright (c) Bruno Haible, Michael Stoll 1992, 1993
Copyright (c) Bruno Haible, Marcus Daniels 1994-1997
Copyright (c) Bruno Haible, Pierpaolo Bernardi, Sam Steingold 1998
Copyright (c) Bruno Haible, Sam Steingold 1999-2000
Copyright (c) Sam Steingold, Bruno Haible 2001-2006

Welcome to the BERGMAN system. (v. 1.001)
NIL

NIL NEW TEST 1:simple commutative 
("NEW TEST 1:simple commutative ") 

NIL simple commutative 
("simple commutative ") 
NIL algebraic form input> 
T 
#\X  - All is OK (I hope). Now you may (e. g.):
   - kill bergman with (QUIT); or
   - interrupt bergman with ^Z; or
   - clear the memory with (CLEARIDEAL), and run a new (SIMPLE).

NIL Cleaning the variables

NIL 

NIL NEW TEST 2:simple noncommutative
("NEW TEST 2:simple noncommutative") 
NIL 
NIL algebraic form input> 
T  - All is OK (I hope). Now you may (e. g.):
   - kill bergman with (QUIT); or
   - interrupt bergman with ^Z; or
   - clear the memory with (CLEARIDEAL), and run a new (SIMPLE).

NIL Cleaning the variables

NIL 

NIL NEW TEST 3:ncpbhgroebner
("NEW TEST 3:ncpbhgroebner") 
6 algebraic form input> 
T 
WARNING: DEFUN/DEFMACRO: redefining macro RECEVAL in
         /home/guests/sveta/b1001/lap/clisp/unix/hseries.fas, was defined in
         top-level
WARNING: DEFUN/DEFMACRO: redefining macro RECEVLIS in
         /home/guests/sveta/b1001/lap/clisp/unix/hseries.fas, was defined in
         top-level
WARNING: DEFUN/DEFMACRO: redefining macro VECTPLUS in
         /home/guests/sveta/b1001/lap/clisp/unix/hseries.fas, was defined in
         top-level
WARNING: DEFUN/DEFMACRO: redefining macro TDEGREECALCULATEPBSERIES in
         /home/guests/sveta/b1001/lap/clisp/unix/hseries.fas, was defined in
         top-level
WARNING: DEFUN/DEFMACRO: redefining macro INVERT-FPSERIES-STEP in
         /home/guests/sveta/b1001/lap/clisp/unix/hseries.fas, was defined in
         top-level
WARNING: DEFUN/DEFMACRO: redefining macro CALCTOLIMIT in
         /home/guests/sveta/b1001/lap/clisp/unix/hseries.fas, was defined in
         top-level
WARNING: DEFUN/DEFMACRO: redefining macro REVERTSERIESCALC in
         /home/guests/sveta/b1001/lap/clisp/unix/hseries.fas, was defined in
         top-level
WARNING: DEFUN/DEFMACRO: redefining macro REMLASTSERIESCALC in
         /home/guests/sveta/b1001/lap/clisp/unix/hseries.fas, was defined in
         top-level
WARNING: DEFUN/DEFMACRO: redefining macro ALGOUTLIST in
         /home/guests/sveta/b1001/lap/clisp/unix/hseries.fas, was defined in
         top-level
WARNING: DEFUN/DEFMACRO: redefining macro DEGREEPBSERIESDISPLAY in
         /home/guests/sveta/b1001/lap/clisp/unix/hseries.fas, was defined in
         top-level
WARNING: DEFUN/DEFMACRO: redefining macro CLEARPBSERIES in
         /home/guests/sveta/b1001/lap/clisp/unix/hseries.fas, was defined in
         top-level
WARNING: DEFUN/DEFMACRO: redefining macro SETHSERIESMINIMUMDEFAULT in
         /home/guests/sveta/b1001/lap/clisp/unix/hseries.fas, was defined in
         top-level
WARNING: DEFUN/DEFMACRO: redefining macro SETHSERIESMINIMA in
         /home/guests/sveta/b1001/lap/clisp/unix/hseries.fas, was defined in
         top-level
WARNING: DEFUN/DEFMACRO: redefining macro GETHSERIESMINIMUM in
         /home/guests/sveta/b1001/lap/clisp/unix/hseries.fas, was defined in
         top-level
WARNING: DEFUN/DEFMACRO: redefining macro GETHSERIESMINIMA in
         /home/guests/sveta/b1001/lap/clisp/unix/hseries.fas, was defined in
         top-level
WARNING: DEFUN/DEFMACRO: redefining macro CLEARHSERIESMINIMA in
         /home/guests/sveta/b1001/lap/clisp/unix/hseries.fas, was defined in
         top-level
WARNING: DEFUN/DEFMACRO: redefining macro FACTALGADDITIONALRELATIONS in
         /home/guests/sveta/b1001/lap/clisp/unix/modinout.fas, was defined in
         top-level
WARNING: DEFUN/DEFMACRO: redefining macro HOCHADDITIONALRELATIONS in
         /home/guests/sveta/b1001/lap/clisp/unix/modinout.fas, was defined in
         top-level
WARNING: DEFUN/DEFMACRO: redefining macro RENEWSERIES in
         /home/guests/sveta/b1001/lap/clisp/unix/sermul.fas, was defined in
         top-level
WARNING: DEFUN/DEFMACRO: redefining macro CALCMODHSERIES in
         /home/guests/sveta/b1001/lap/clisp/unix/sermul.fas, was defined in
         top-level
% No. of Spolynomials calculated until degree 2: 0
% No. of ReducePol(0) demanded until degree 2: 0
% Time: 200

% No. of Spolynomials calculated until degree 3: 2
% No. of ReducePol(0) demanded until degree 3: 0
% Time: 224

% No. of Spolynomials calculated until degree 4: 8
% No. of ReducePol(0) demanded until degree 4: 5
% Time: 248

NIL Cleaning the variables

NIL 

NIL NEW TEST 4:Commutative Hilbert series
("NEW TEST 4:Commutative Hilbert series") 
T 
NIL 
7 algebraic form input> 
T 
#\X 
NIL Cleaning the variables

NIL 

NIL NEW TEST 5: Hilbert series interrupt strategy: commutative
("NEW TEST 5: Hilbert series interrupt strategy: commutative") 
ORDINARY 
T 
NIL algebraic form input> 
T 
#\X  - All is OK (I hope). Now you may (e. g.):
   - kill bergman with (QUIT); or
   - interrupt bergman with ^Z; or
   - clear the memory with (CLEARIDEAL), and run a new (SIMPLE).

NIL Cleaning the variables

NIL 
MINHILBLIMITS 

NIL NEW TEST 6: Weights handling: commutative
("NEW TEST 6: Weights handling: commutative") 
NIL 
NIL algebraic form input> 
T  - All is OK (I hope). Now you may (e. g.):
   - kill bergman with (QUIT); or
   - interrupt bergman with ^Z; or
   - clear the memory with (CLEARIDEAL), and run a new (SIMPLE).

NIL 
(1 1 2) Cleaning the variables

NIL 

NIL NEW TEST 7: Weights handling: non-commutative
("NEW TEST 7: Weights handling: non-commutative") 
NIL 
6 
NIL algebraic form input> 
T  - All is OK (I hope). Now you may (e. g.):
   - kill bergman with (QUIT); or
   - interrupt bergman with ^Z; or
   - clear the memory with (CLEARIDEAL), and run a new (SIMPLE).

NIL 
(1 1 2) Cleaning the variables

NIL 

NIL NEW TEST 8: Eliminating ordering: Groebner basis
("NEW TEST 8: Eliminating ordering: Groebner basis") 
NIL 
6 algebraic form input> 
T  - All is OK (I hope). Now you may (e. g.):
   - kill bergman with (QUIT); or
   - interrupt bergman with ^Z; or
   - clear the memory with (CLEARIDEAL), and run a new (SIMPLE).

NIL 
NIL Cleaning the variables

NIL 

NIL NEW TEST 9: modulehseries
("NEW TEST 9: modulehseries") 
10 
2 algebraic form input> 
T +23*z^2
+106*z^3
+489*z^4
+2256*z^5
+10408*z^6
algebraic form input> 
T +23*z^2
+105*z^3
+478*z^4
+2175*z^5
+9896*z^6

Here is (1-H)^(-1) for Hilbert series H of the module

   +1
   +2*t^1
  +10*t^2
  +45*t^3
 +204*t^4
 +928*t^5
+4222*t^6
Here is the Hilbert series H of the module
  +2*t^1
  +6*t^2
 +13*t^3
 +28*t^4
 +64*t^5
+149*t^6

NIL Cleaning the variables

NIL 

NIL NEW TEST 10: Anick trivial
("NEW TEST 10: Anick trivial") 
"../../test_bergman/clisp/anick_tm.out" 
4 algebraic form input> 
T 
#\X The Anick resolution initialization...
B(1,1)=2
The Anick resolution initialization done.
Calculating the Anick resolution in degree 2...
B(1,1)=2
B(2,2)=2
    0   1   2
  +----------
0 | 1   2   2
1 | -   -
Printing the results ...
Printing is done.
end of Calculations.
Calculating the Anick resolution in degree 3...
B(1,1)=2
B(2,2)=2
B(3,3)=1
    0   1   2   3
  +--------------
0 | 1   2   2   1
1 | -   -   -
2 | -   -
Printing the results ...
Printing is done.
end of Calculations.
Calculating the Anick resolution in degree 4...
B(1,1)=2
B(2,2)=2
B(3,3)=1
B(3,4)=1
B(4,4)=1
    0   1   2   3   4
  +------------------
0 | 1   2   2   1   1
1 | -   -   -   1
2 | -   -   -
3 | -   -
Printing the results ...
Printing is done.
end of Calculations.


NIL 
NIL Printing the results ...
Printing is done.

NIL Closing the streams.Cleaning the variables

NIL 

NIL NEW TEST 11: Modulebettinumbers
("NEW TEST 11: Modulebettinumbers") 
"../../test_bergman/clisp/modbtn.out" 
*** We turn on the MODULE mode

4 
1 algebraic form input> 
T The Anick resolution initialization...
B(0,0)=1
The Anick resolution initialization done.
Calculating the module Anick resolution in degree 2...
B(0,0)=1
B(1,1)=1
    0   1   2
  +----------
0 | 1   1
1 | -
end of Calculations.
Calculating the module Anick resolution in degree 3...
B(0,0)=1
B(1,1)=1
B(2,2)=1
    0   1   2   3
  +--------------
0 | 1   1   1
1 | -   -
2 | -
end of Calculations.

Groebner basis is finite.
If you want to continue calculations until the maximal degree
type (CALCULATEANICKRESOLUTIONTOLIMIT (GETMAXDEG))

NIL Calculating the module Anick resolution in degree 4...
B(0,0)=1
B(1,1)=1
B(2,2)=1
B(3,3)=1
    0   1   2   3   4
  +------------------
0 | 1   1   1   1
1 | -   -   -
2 | -   -
3 | -
end of Calculations.
Calculating the module Anick resolution in degree 5...
B(0,0)=1
B(1,1)=1
B(2,2)=1
B(3,3)=1
B(4,4)=1
    0   1   2   3   4   5
  +----------------------
0 | 1   1   1   1   1
1 | -   -   -   -
2 | -   -   -
3 | -   -
4 | -
end of Calculations.

NIL Printing the results ...
Printing is done.

NIL Closing the streams.Cleaning the variables

NIL 

NIL NEW TEST 12: Factor-algebra 
("NEW TEST 12: Factor-algebra ") 
"../../test_bergman/clisp/fact.out" 
5 algebraic form input> 
T The Anick resolution initialization...
B(0,0)=1
The Anick resolution initialization done.
Calculating the module Anick resolution in degree 2...
B(0,0)=1
B(1,1)=2
    0   1   2
  +----------
0 | 1   2
1 | -
end of Calculations.
Calculating the module Anick resolution in degree 3...
B(0,0)=1
B(1,1)=2
B(1,2)=1
B(2,2)=1
    0   1   2   3
  +--------------
0 | 1   2   1
1 | -   1
2 | -
end of Calculations.
Calculating the module Anick resolution in degree 4...
B(0,0)=1
B(1,1)=2
B(1,2)=1
B(2,2)=1
B(2,3)=2
    0   1   2   3   4
  +------------------
0 | 1   2   1   -
1 | -   1   2
2 | -   -
3 | -
end of Calculations.
Calculating the module Anick resolution in degree 5...
B(0,0)=1
B(1,1)=2
B(1,2)=1
B(2,2)=1
B(2,3)=2
B(3,4)=1
    0   1   2   3   4   5
  +----------------------
0 | 1   2   1   -   -
1 | -   1   2   1
2 | -   -   -
3 | -   -
4 | -
end of Calculations.
Calculating the module Anick resolution in degree 6...
B(0,0)=1
B(1,1)=2
B(1,2)=1
B(2,2)=1
B(2,3)=2
B(3,4)=1
    0   1   2   3   4   5
  +----------------------
0 | 1   2   1   -   -
1 | -   1   2   1
2 | -   -   -
3 | -   -
4 | -
end of Calculations.
Calculating the module Anick resolution in degree 7...
B(0,0)=1
B(1,1)=2
B(1,2)=1
B(2,2)=1
B(2,3)=2
B(3,4)=1
    0   1   2   3   4   5
  +----------------------
0 | 1   2   1   -   -
1 | -   1   2   1
2 | -   -   -
3 | -   -
4 | -
end of Calculations.
Calculating the module Anick resolution in degree 8...
B(0,0)=1
B(1,1)=2
B(1,2)=1
B(2,2)=1
B(2,3)=2
B(3,4)=1
    0   1   2   3   4   5
  +----------------------
0 | 1   2   1   -   -
1 | -   1   2   1
2 | -   -   -
3 | -   -
4 | -
end of Calculations.


NIL 
NIL Printing the results ...
Printing is done.

NIL Closing the streams.Cleaning the variables

NIL 

NIL NEW TEST 13: Betti numbers for two modules
("NEW TEST 13: Betti numbers for two modules") 
"../../test_bergman/clisp/two.out" 
*** We turn on the TWOMODULES mode

8 
1 
1 algebraic form input> 
T The Anick resolution initialization (for two modules)...
The Anick resolution initialization done.
Calculating the module Anick resolution in degree 2...
B(0,0)=1
    0   1   2
  +----------
0 | 1
end of Calculations.

Groebner basis is finite.
If you want to continue calculations until the maximal degree
type (CALCULATEANICKRESOLUTIONTOLIMIT (GETMAXDEG))

NIL Calculating the module Anick resolution in degree 3...
B(0,0)=1
    0   1   2
  +----------
0 | 1
end of Calculations.
Calculating the module Anick resolution in degree 4...
B(0,0)=1
B(0,2)=1
    0   1   2   3   4
  +------------------
0 | 1   -   -
1 | -   -
2 | 1
end of Calculations.
Calculating the module Anick resolution in degree 5...
B(0,0)=1
B(0,2)=1
B(0,3)=2
    0   1   2   3   4   5
  +----------------------
0 | 1   -   -   -
1 | -   -   -
2 | 1   -
3 | 2
end of Calculations.
Calculating the module Anick resolution in degree 6...
B(0,0)=1
B(0,2)=1
B(0,3)=2
B(0,4)=4
    0   1   2   3   4   5   6
  +--------------------------
0 | 1   -   -   -   -
1 | -   -   -   -
2 | 1   -   -
3 | 2   -
4 | 4
end of Calculations.

NIL Printing the results ...
Printing is done.

NIL Closing the streams.Cleaning the variables

NIL 

NIL NEW TEST 14: Betti numbers for two modules: hochschild
("NEW TEST 14: Betti numbers for two modules: hochschild") 
"../../test_bergman/clisp/hoch.out" 
6 
1 
1 algebraic form input> 
T The Anick resolution initialization (for two modules)...
The Anick resolution initialization done.
Calculating the module Anick resolution in degree 2...
B(0,0)=1
    0   1   2
  +----------
0 | 1
end of Calculations.
Calculating the module Anick resolution in degree 3...
B(0,0)=1
B(0,1)=2
B(1,1)=2
    0   1   2   3
  +--------------
0 | 1   2
1 | 2
end of Calculations.
Calculating the module Anick resolution in degree 4...
B(0,0)=1
B(0,1)=2
B(1,1)=2
B(0,2)=2
B(1,2)=2
    0   1   2   3   4
  +------------------
0 | 1   2   -
1 | 2   2
2 | 2
end of Calculations.
Calculating the module Anick resolution in degree 5...
B(0,0)=1
B(0,1)=2
B(1,1)=2
B(0,2)=2
B(1,2)=2
B(0,3)=2
B(1,3)=2
    0   1   2   3   4   5
  +----------------------
0 | 1   2   -   -
1 | 2   2   -
2 | 2   2
3 | 2
end of Calculations.


NIL 
NIL Printing the results ...
Printing is done.

NIL Closing the streams.Cleaning the variables

NIL 

NIL NEW TEST 15: Hochschild homology
("NEW TEST 15: Hochschild homology") 
"../../test_bergman/clisp/hoch1.out" 
5 algebraic form input> 
T The Anick resolution initialization (for two modules)...
The Anick resolution initialization done.
Calculating the module Anick resolution in degree 2...
B(0,0)=1
    0   1   2
  +----------
0 | 1
end of Calculations.
Calculating the module Anick resolution in degree 3...
B(0,0)=1
B(0,1)=2
B(1,1)=2
    0   1   2   3
  +--------------
0 | 1   2
1 | 2
end of Calculations.
Calculating the module Anick resolution in degree 4...
B(0,0)=1
B(0,1)=2
B(1,1)=2
B(0,2)=2
B(1,2)=2
    0   1   2   3   4
  +------------------
0 | 1   2   -
1 | 2   2
2 | 2
end of Calculations.
Calculating the module Anick resolution in degree 5...
B(0,0)=1
B(0,1)=2
B(1,1)=2
B(0,2)=2
B(1,2)=2
B(0,3)=2
B(1,3)=2
    0   1   2   3   4   5
  +----------------------
0 | 1   2   -   -
1 | 2   2   -
2 | 2   2
3 | 2
end of Calculations.


NIL 
NIL Printing the results ...
Printing is done.

NIL Closing the streams.Cleaning the variables

NIL 

NIL NEW TEST 16: simple noncommutative char2 
("NEW TEST 16: simple noncommutative char2 ") 
ANICK 
NIL 
T 
NIL 
5 algebraic form input> 
T 
#\X  - All is OK (I hope). Now you may (e. g.):
   - kill bergman with (QUIT); or
   - interrupt bergman with ^Z; or
   - clear the memory with (CLEARIDEAL), and run a new (SIMPLE).

NIL Cleaning the variables

NIL 

NIL NEW TEST 17: simple noncommutative char5 
("NEW TEST 17: simple noncommutative char5 ") 
NONE 
NIL 
T 
NIL 
6 algebraic form input> 
T 
#\X  - All is OK (I hope). Now you may (e. g.):
   - kill bergman with (QUIT); or
   - interrupt bergman with ^Z; or
   - clear the memory with (CLEARIDEAL), and run a new (SIMPLE).

NIL Cleaning the variables

NIL 

NIL NEW TEST 18: simple with modlogarithms
("NEW TEST 18: simple with modlogarithms") 
NONE 
NIL 
ORDINARY 
T 
NIL 
6 algebraic form input> 
T 
#\X  - All is OK (I hope). Now you may (e. g.):
   - kill bergman with (QUIT); or
   - interrupt bergman with ^Z; or
   - clear the memory with (CLEARIDEAL), and run a new (SIMPLE).

NIL Cleaning the variables

NIL 
MODLOGARITHMIC 
T 

NIL NEW TEST 19: Leftmodulebettinumbers
("NEW TEST 19: Leftmodulebettinumbers") 
T 
NONE 
"../../test_bergman/clisp/leftmodbtn.out" 
*** We turn on the MODULE mode

15 
1 algebraic form input> 
T The Anick resolution initialization...
B(0,0)=1
The Anick resolution initialization done.
Calculating the module Anick resolution in degree 2...
B(0,0)=1
B(1,1)=1
    0   1   2
  +----------
0 | 1   1
1 | -
end of Calculations.
Calculating the module Anick resolution in degree 3...
B(0,0)=1
B(1,1)=1
B(2,2)=1
    0   1   2   3
  +--------------
0 | 1   1   1
1 | -   -
2 | -
end of Calculations.

Groebner basis is finite.
If you want to continue calculations until the maximal degree
type (CALCULATEANICKRESOLUTIONTOLIMIT (GETMAXDEG))

NIL Calculating the module Anick resolution in degree 4...
B(0,0)=1
B(1,1)=1
B(2,2)=1
B(3,3)=1
    0   1   2   3   4
  +------------------
0 | 1   1   1   1
1 | -   -   -
2 | -   -
3 | -
end of Calculations.
Calculating the module Anick resolution in degree 5...
B(0,0)=1
B(1,1)=1
B(2,2)=1
B(3,3)=1
B(4,4)=1
    0   1   2   3   4   5
  +----------------------
0 | 1   1   1   1   1
1 | -   -   -   -
2 | -   -   -
3 | -   -
4 | -
end of Calculations.

NIL Printing the results ...
Printing is done.

NIL 
ANICK Closing the streams.Cleaning the variables

NIL 

NIL NEW TEST 20: Rabbit with setrabbit
("NEW TEST 20: Rabbit with setrabbit") 
8 algebraic form input> 
T 
#\X  steps: 2,2,8
Cleaning the variables
RABBIT: Added step, Maxdegree=4
 Jump number 1

Cleaning the variables
RABBIT: Jump number 2

Cleaning the variables
RABBIT: Jump number 3

Cleaning the variables
RABBIT: Added step, Maxdegree=6
 Jump number 4

GB is completely calculated
Rabbit has finishied jumping.
NIL Cleaning the variables

NIL 
NIL 

NIL NEW TEST 21: Skipcdeg - test N1
("NEW TEST 21: Skipcdeg - test N1") 
ORDINARY 
T 
NIL 
6 algebraic form input> 
T 
#\X 
% No. of Spolynomials calculated until degree 2: 0
% Time: 2900

% No. of Spolynomials calculated until degree 3: 0
% Time: 2928

% No. of Spolynomials calculated until degree 4: 0
% Time: 2956

% No. of Spolynomials calculated until degree 5: 0
% Time: 2984

% No. of Spolynomials calculated until degree 6: 4
% Time: 3012

% No. of Spolynomials calculated until degree 7: 9
% Time: 3036

% No. of Spolynomials calculated until degree 8: 15
% Time: 3060

% No. of Spolynomials calculated until degree 9: 22
% Time: 3084

% No. of Spolynomials calculated until degree 10: 30
% Time: 3108
 - All is OK (I hope). Now you may (e. g.):
   - kill bergman with (QUIT); or
   - interrupt bergman with ^Z; or
   - clear the memory with (CLEARIDEAL), and run a new (SIMPLE).

NIL Cleaning the variables

NIL 

NIL NEW TEST 22:Ignorecdeg
("NEW TEST 22:Ignorecdeg") 
MINHILBLIMITS 
T 
NIL 
10 algebraic form input> 
T 
#\X 
% No. of Spolynomials calculated until degree 2: 0
% Time: 3160

% No. of Spolynomials calculated until degree 3: 0
% Time: 3184

% No. of Spolynomials calculated until degree 4: 0
% Time: 3208

% No. of Spolynomials calculated until degree 5: 1
% Time: 3232

% No. of Spolynomials calculated until degree 6: 3
% Time: 3256

% No. of Spolynomials calculated until degree 7: 6
% Time: 3280

% No. of Spolynomials calculated until degree 8: 10
% Time: 3308

% No. of Spolynomials calculated until degree 9: 15
% Time: 3336

% No. of Spolynomials calculated until degree 10: 21
% Time: 3364
 - All is OK (I hope). Now you may (e. g.):
   - kill bergman with (QUIT); or
   - interrupt bergman with ^Z; or
   - clear the memory with (CLEARIDEAL), and run a new (SIMPLE).

NIL 
MINHILBLIMITS Cleaning the variables

NIL 

NIL NEW TEST 23: Matrix ordering
("NEW TEST 23: Matrix ordering") 
NIL 
NIL 
NIL 
NIL algebraic form input> 
T 
#\X 
% No. of Spolynomials calculated until degree 3: 0
% Time: 3424

% No. of Spolynomials calculated until degree 5: 0
% Time: 3452

% No. of Spolynomials calculated until degree 6: 0
% Time: 3476

% No. of Spolynomials calculated until degree 7: 1
% Time: 3500

% No. of Spolynomials calculated until degree 8: 3
% Time: 3524

% No. of Spolynomials calculated until degree 9: 6
% Time: 3548

% No. of Spolynomials calculated until degree 10: 7
% Time: 3572
 - All is OK (I hope). Now you may (e. g.):
   - kill bergman with (QUIT); or
   - interrupt bergman with ^Z; or
   - clear the memory with (CLEARIDEAL), and run a new (SIMPLE).

NIL Cleaning the variables

NIL 
NIL 

NIL NEW TEST 24: Test input data
("NEW TEST 24: Test input data") 
NIL 
NIL algebraic form input> 
T 
((4 4) (5 NIL 5 5 5 5) (6)) 
#\X 
T Cleaning the variables

NIL 

NIL NEW TEST 25:Linear relations
("NEW TEST 25:Linear relations") 
NIL 
SAFE algebraic form input> 
T 
#\X 
% No. of Spolynomials calculated until degree 1: 0
% Time: 3688
 - All is OK (I hope). Now you may (e. g.):
   - kill bergman with (QUIT); or
   - interrupt bergman with ^Z; or
   - clear the memory with (CLEARIDEAL), and run a new (SIMPLE).

NIL Cleaning the variables

NIL 

NIL NEW TEST 26:Linear relations - non-commutative
("NEW TEST 26:Linear relations - non-commutative") 
NIL 
SAFE algebraic form input> 
T 
#\X 
% No. of Spolynomials calculated until degree 1: 0
% Time: 3740

% No. of Spolynomials calculated until degree 2: 0
% Time: 3764

% No. of Spolynomials calculated until degree 3: 1
% Time: 3788
 - All is OK (I hope). Now you may (e. g.):
   - kill bergman with (QUIT); or
   - interrupt bergman with ^Z; or
   - clear the memory with (CLEARIDEAL), and run a new (SIMPLE).

NIL Cleaning the variables

NIL 

NIL NEW TEST 27: Minimal resolution
("NEW TEST 27: Minimal resolution") 
NIL 
10 
1 algebraic form input> 
T algebraic form input> 
T 
#\X Cleaning the variables
% 2
x*y,
   z^2+y*x,
   a*x-G3234,
   a*y-G3235,
   a*z-G3236,
   

% No. of Spolynomials calculated until degree 2: 0
% Time: 3884
% 3
G3234*y,
   -G3236*z-G3235*x,
   x^2*z,
   -z*y*x+y*x*z,
   

% No. of Spolynomials calculated until degree 3: 3
% Time: 3908
% 4
G3234*x*z,
   G3236*y*x-G3235*x*z,
   y*x*z*y,
   

% No. of Spolynomials calculated until degree 4: 9
% Time: 3936
% 5
G3235*x*z*y,
   y*x*z*x*z,
   

% No. of Spolynomials calculated until degree 5: 18
% Time: 3960
% 6
G3235*x*z*x*z,
   

% No. of Spolynomials calculated until degree 6: 27
% Time: 3988

% No. of Spolynomials calculated until degree 7: 32
% Time: 4012

% No. of Spolynomials calculated until degree 8: 33
% Time: 4036
Cleaning the variables
% 2
x*y,
   z^2+y*x,
   

% No. of Spolynomials calculated until degree 2: 0
% Time: 4088
% 3
G3234*y,
   -G3236*z-G3235*x,
   x^2*z,
   -z*y*x+y*x*z,
   

% No. of Spolynomials calculated until degree 3: 1
% Time: 4112
% 4
G3234*x*z,
   G3236*y*x-G3235*x*z,
   y*x*z*y,
   

% No. of Spolynomials calculated until degree 4: 5
% Time: 4140
% 5
G3235*x*z*y,
   y*x*z*x*z,
   

% No. of Spolynomials calculated until degree 5: 13
% Time: 4164
% 6
G3235*x*z*x*z,
   

% No. of Spolynomials calculated until degree 6: 21
% Time: 4192

% No. of Spolynomials calculated until degree 7: 26
% Time: 4216

% No. of Spolynomials calculated until degree 8: 27
% Time: 4240

Current homological degree=2
Current Poincare-Betti series is 
1t+3t^2z+2t^3z^2+1t^4z^2
Cleaning the variables
Cleaning the variables
% 2
x*y,
   z^2+y*x,
   

% No. of Spolynomials calculated until degree 2: 0
% Time: 4340
% 3
G3234*y-G3237,
   -G3236*z-G3235*x-G3238,
   x^2*z,
   -z*y*x+y*x*z,
   

% No. of Spolynomials calculated until degree 3: 1
% Time: 4364
% 4
G3234*x*z-G3239,
   G3236*y*x-G3235*x*z-G3238*z,
   y*x*z*y,
   

% No. of Spolynomials calculated until degree 4: 5
% Time: 4388
% 5
G3239*z,
   -G3235*x*z*y-G3238*z*y,
   y*x*z*x*z,
   

% No. of Spolynomials calculated until degree 5: 13
% Time: 4416
% 6
G3239*y*x,
   G3237*x*z*y,
   G3238*y*x*z,
   -G3235*x*z*x*z-G3238*z*x*z,
   

% No. of Spolynomials calculated until degree 6: 22
% Time: 4440
% 7
G3237*x*z*x*z,
   

% No. of Spolynomials calculated until degree 7: 32
% Time: 4468

% No. of Spolynomials calculated until degree 8: 37
% Time: 4492
Cleaning the variables
% 2
x*y,
   z^2+y*x,
   

% No. of Spolynomials calculated until degree 2: 0
% Time: 4544
% 3
x^2*z,
   -z*y*x+y*x*z,
   

% No. of Spolynomials calculated until degree 3: 1
% Time: 4568
% 4
y*x*z*y,
   

% No. of Spolynomials calculated until degree 4: 4
% Time: 4592
% 5
G3239*z,
   y*x*z*x*z,
   

% No. of Spolynomials calculated until degree 5: 9
% Time: 4620
% 6
G3239*y*x,
   G3237*x*z*y,
   G3238*y*x*z,
   

% No. of Spolynomials calculated until degree 6: 13
% Time: 4644
% 7
G3237*x*z*x*z,
   

% No. of Spolynomials calculated until degree 7: 20
% Time: 4668

% No. of Spolynomials calculated until degree 8: 24
% Time: 4696

Current homological degree=3
Current Poincare-Betti series is 
1t+3t^2z+2t^3z^2+1t^4z^2+1t^5z^3+2t^6z^3
+1t^7z^3
Cleaning the variables
Cleaning the variables
% 2
x*y,
   z^2+y*x,
   

% No. of Spolynomials calculated until degree 2: 0
% Time: 4792
% 3
x^2*z,
   -z*y*x+y*x*z,
   

% No. of Spolynomials calculated until degree 3: 1
% Time: 4816
% 4
y*x*z*y,
   

% No. of Spolynomials calculated until degree 4: 4
% Time: 4844
% 5
G3239*z-G3240,
   y*x*z*x*z,
   

% No. of Spolynomials calculated until degree 5: 9
% Time: 4868
% 6
-G3239*y*x-G3240*z,
   G3237*x*z*y-G3241,
   G3238*y*x*z-G3242,
   

% No. of Spolynomials calculated until degree 6: 13
% Time: 4892
% 7
G3241*x,
   G3242*y,
   G3242*z,
   G3240*z*y,
   G3237*x*z*x*z-G3243,
   

% No. of Spolynomials calculated until degree 7: 20
% Time: 4920
% 8
G3243*z,
   G3242*x*z,
   G3240*y*x*z,
   G3240*z*x*z,
   

% No. of Spolynomials calculated until degree 8: 27
% Time: 4944
Cleaning the variables
% 2
x*y,
   z^2+y*x,
   

% No. of Spolynomials calculated until degree 2: 0
% Time: 4996
% 3
x^2*z,
   -z*y*x+y*x*z,
   

% No. of Spolynomials calculated until degree 3: 1
% Time: 5020
% 4
y*x*z*y,
   

% No. of Spolynomials calculated until degree 4: 4
% Time: 5044
% 5
y*x*z*x*z,
   

% No. of Spolynomials calculated until degree 5: 9
% Time: 5072

% No. of Spolynomials calculated until degree 6: 12
% Time: 5096
% 7
G3241*x,
   G3242*y,
   G3242*z,
   G3240*z*y,
   

% No. of Spolynomials calculated until degree 7: 14
% Time: 5120
% 8
G3243*z,
   G3242*x*z,
   G3240*y*x*z,
   G3240*z*x*z,
   

% No. of Spolynomials calculated until degree 8: 17
% Time: 5148

Current homological degree=4
Current Poincare-Betti series is 
1t+3t^2z+2t^3z^2+1t^4z^2+1t^5z^3+2t^6z^3
+1t^7z^3+4t^7z^4+3t^8z^4
Cleaning the variables
Cleaning the variables
% 2
x*y,
   z^2+y*x,
   

% No. of Spolynomials calculated until degree 2: 0
% Time: 5244
% 3
x^2*z,
   -z*y*x+y*x*z,
   

% No. of Spolynomials calculated until degree 3: 1
% Time: 5268
% 4
y*x*z*y,
   

% No. of Spolynomials calculated until degree 4: 4
% Time: 5292
% 5
y*x*z*x*z,
   

% No. of Spolynomials calculated until degree 5: 9
% Time: 5316

% No. of Spolynomials calculated until degree 6: 12
% Time: 5344
% 7
G3241*x-G3244,
   G3242*y-G3245,
   G3242*z-G3246,
   G3240*z*y-G3247,
   

% No. of Spolynomials calculated until degree 7: 14
% Time: 5368
% 8
G3244*y,
   -G3246*z-G3245*x,
   G3243*z-G3248,
   G3242*x*z-G3249,
   G3240*y*x*z-G3247*x,
   G3240*z*x*z-G3250,
   

% No. of Spolynomials calculated until degree 8: 17
% Time: 5392
Cleaning the variables
% 2
x*y,
   z^2+y*x,
   

% No. of Spolynomials calculated until degree 2: 0
% Time: 5444
% 3
x^2*z,
   -z*y*x+y*x*z,
   

% No. of Spolynomials calculated until degree 3: 1
% Time: 5468
% 4
y*x*z*y,
   

% No. of Spolynomials calculated until degree 4: 4
% Time: 5496
% 5
y*x*z*x*z,
   

% No. of Spolynomials calculated until degree 5: 9
% Time: 5520

% No. of Spolynomials calculated until degree 6: 12
% Time: 5544

% No. of Spolynomials calculated until degree 7: 14
% Time: 5568
% 8
G3244*y,
   -G3246*z-G3245*x,
   

% No. of Spolynomials calculated until degree 8: 14
% Time: 5596

Current homological degree=5
Current Poincare-Betti series is 
1t+3t^2z+2t^3z^2+1t^4z^2+1t^5z^3+2t^6z^3
+1t^7z^3+4t^7z^4+3t^8z^4+2t^8z^5
Cleaning the variables
Cleaning the variables
% 2
x*y,
   z^2+y*x,
   

% No. of Spolynomials calculated until degree 2: 0
% Time: 5688
% 3
x^2*z,
   -z*y*x+y*x*z,
   

% No. of Spolynomials calculated until degree 3: 1
% Time: 5716
% 4
y*x*z*y,
   

% No. of Spolynomials calculated until degree 4: 4
% Time: 5740
% 5
y*x*z*x*z,
   

% No. of Spolynomials calculated until degree 5: 9
% Time: 5764

% No. of Spolynomials calculated until degree 6: 12
% Time: 5788

% No. of Spolynomials calculated until degree 7: 14
% Time: 5816
% 8
G3244*y-G3251,
   -G3246*z-G3245*x-G3252,
   

% No. of Spolynomials calculated until degree 8: 14
% Time: 5840

Calculated Poincare-Betti series is 
1t+3t^2z+2t^3z^2+1t^4z^2+1t^5z^3+2t^6z^3
+1t^7z^3+4t^7z^4+3t^8z^4+2t^8z^5

NIL Cleaning the variables

NIL 
NIL 

NIL Last test finished
("Last test finished") 
Bye.
