Loading image file :/home/guests/sveta/b9881/bin/Linux_elf/bergman.img 
Bergman 0.988, 24-Jun-20
1 lisp> nil
2 lisp> 0

nil
simple commutative
"simple commutative"
0
nil
t
SetupGlobals
 ... done
 - 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
0
0
0
0
nil

nil
simple noncommutative
"simple noncommutative"
0
nil
nil
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
0
0
0
0
nil

nil
ncpbhgroebner
"ncpbhgroebner"
0
0
0
6
t
*** Function `!O!L!D!D!E!D' has been redefined
*** Function `degreeenddisplay' has been redefined

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

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

% No. of Spolynomials calculated until degree 4: 8
% No. of ReducePol(0) demanded until degree 4: 5
% Time: 30
*** Function `degreeenddisplay' has been redefined
nil
0
0
256
0
0
0
nil

nil
Commutative Hilbert series
"Commutative Hilbert series"
0
0
nil
nil
7
t
nil
0
0
0
0
0
nil

nil
Hilbert series interrupt strategy: commutative
"Hilbert series interrupt strategy: commutative"
0
ordinary
t
nil
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
minhilblimits
0
0
0
0

nil
Weights handling: commutative
"Weights handling: commutative"
0
nil
nil
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)
nil
0
0
0
0

nil
Weights handling: non-commutative
"Weights handling: non-commutative"
0
nil
6
nil
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)
nil
0
0
0
0

nil
Eliminating ordering: Groebner basis
"Eliminating ordering: Groebner basis"
0
nil
6
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
0
0
0
0
nil

nil
modulehseries
"modulehseries"
0
0
*** Function `modulehseries' has been redefined
10
2
t
+23*z^2
+106*z^3
+489*z^4
+2256*z^5
+10408*z^6
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
nil
0
0
0
0
0

nil
Anick trivial
"Anick trivial"
0
0
4
"test_bergman/anick_tm.out"
t
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
0
0
256
0
0

nil
Modulebettinumbers
"Modulebettinumbers"
0
0

*** We turn on the MODULE mode
4
1
"test_bergman/modbtn.out"
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
0
0
0
0
0

nil
Factor-algebra
"Factor-algebra"
0
0
5
"test_bergman/fact.out"
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
0
0
0
0
0

nil
Betti numbers for two modules
"Betti numbers for two modules"
0
0

*** We turn on the TWOMODULES mode
8
1
1
"test_bergman/two.out"
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
0
0
0
0
0

nil
Betti numbers for two modules: hochschild
"Betti numbers for two modules: hochschild"
0
0
6
1
1
"test_bergman/hoch.out"
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
0
0
0
0
0

nil
Hochschild homology
"Hochschild homology"
0
0
5
"test_bergman/hoch1.out"
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
0
0
0
0
0
0
nil
3 lisp> Exiting lisp
