Loading image file :/home/guests/sveta/b1/bin/Linux_elf/bergman.img Bergman 1.0, 7-Aug-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: 40 % No. of Spolynomials calculated until degree 3: 2 % No. of ReducePol(0) demanded until degree 3: 0 % Time: 50 % No. of Spolynomials calculated until degree 4: 8 % No. of ReducePol(0) demanded until degree 4: 5 % Time: 50 *** 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 256 0 0 0 nil Anick trivial "Anick trivial" 0 0 "../test_bergman/anick_tm.out" 4 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 0 0 0 nil Modulebettinumbers "Modulebettinumbers" 0 0 "../test_bergman/modbtn.out" *** We turn on the MODULE mode 4 1 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 "../test_bergman/fact.out" 5 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 "../test_bergman/two.out" *** We turn on the TWOMODULES mode 8 1 1 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 "../test_bergman/hoch.out" 6 1 1 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 "../test_bergman/hoch1.out" 5 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 simple noncommutative char2 "simple noncommutative char2" 0 anick nil t nil 5 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 0 0 0 0 nil simple noncommutative char5 "simple noncommutative char5" 0 none nil *** (dm!A!Y!B!E): base 16#8154780, length 10#57 bytes t 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 Cleaning the variables nil 0 0 0 0 nil simple with modlogarithms "simple with modlogarithms" 0 none nil ordinary *** Function `g!E!T!Cm!O!D' has been redefined *** Function `g!E!Th!A!L!F!Cm!O!D' has been redefined *** Function `g!E!Tp!R!E!D!Cm!O!D' has been redefined t 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 Cleaning the variables nil modlogarithmic t 0 0 0 0 nil Leftmodulebettinumbers "Leftmodulebettinumbers" 0 0 nil none "../test_bergman/leftmodbtn.out" *** We turn on the MODULE mode *** Function `p!O!La!L!Gr!E!A!D' has been redefined 15 1 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 anick 0 256 0 0 0 nil Rabbit with setrabbit "Rabbit with setrabbit" 0 8 t 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 0 0 0 0 nil Skipcdeg - test N1 "Skipcdeg - test N1" 0 ordinary t nil 6 t % No. of Spolynomials calculated until degree 2: 0 % Time: 320 % No. of Spolynomials calculated until degree 3: 0 % Time: 320 % No. of Spolynomials calculated until degree 4: 0 % Time: 330 % No. of Spolynomials calculated until degree 5: 0 % Time: 330 % No. of Spolynomials calculated until degree 6: 4 % Time: 330 % No. of Spolynomials calculated until degree 7: 9 % Time: 340 % No. of Spolynomials calculated until degree 8: 15 % Time: 340 % No. of Spolynomials calculated until degree 9: 22 % Time: 340 % No. of Spolynomials calculated until degree 10: 30 % Time: 340 - 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 0 0 0 0 nil Ignorecdeg "Ignorecdeg" 0 minhilblimits t nil 10 t % No. of Spolynomials calculated until degree 2: 0 % Time: 350 % No. of Spolynomials calculated until degree 3: 0 % Time: 350 % No. of Spolynomials calculated until degree 4: 0 % Time: 350 % No. of Spolynomials calculated until degree 5: 1 % Time: 360 % No. of Spolynomials calculated until degree 6: 3 % Time: 360 % No. of Spolynomials calculated until degree 7: 6 % Time: 360 % No. of Spolynomials calculated until degree 8: 10 % Time: 360 % No. of Spolynomials calculated until degree 9: 15 % Time: 360 % No. of Spolynomials calculated until degree 10: 21 % Time: 370 - 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 0 0 0 0 nil Matrix ordering "Matrix ordering" 0 nil nil nil nil t % No. of Spolynomials calculated until degree 3: 0 % Time: 370 % No. of Spolynomials calculated until degree 5: 0 % Time: 370 % No. of Spolynomials calculated until degree 6: 0 % Time: 380 % No. of Spolynomials calculated until degree 7: 1 % Time: 380 % No. of Spolynomials calculated until degree 8: 3 % Time: 380 % No. of Spolynomials calculated until degree 9: 6 % Time: 380 % No. of Spolynomials calculated until degree 10: 7 % Time: 380 - 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 0 0 0 0 nil Test input data "Test input data" nil nil t ((4 4) (5 nil 5 5 5 5) (6)) nil Cleaning the variables nil 0 nil Minimal resolution "Minimal resolution" 0 nil 10 1 t t Cleaning the variables % No. of Spolynomials calculated until degree 2: 0 % Time: 400 % No. of Spolynomials calculated until degree 3: 2 % Time: 400 % No. of Spolynomials calculated until degree 4: 5 % Time: 400 % No. of Spolynomials calculated until degree 5: 7 % Time: 410 % No. of Spolynomials calculated until degree 6: 8 % Time: 410 % No. of Spolynomials calculated until degree 7: 9 % Time: 410 Cleaning the variables % No. of Spolynomials calculated until degree 2: 0 % Time: 420 % No. of Spolynomials calculated until degree 3: 0 % Time: 420 % No. of Spolynomials calculated until degree 4: 2 % Time: 420 % No. of Spolynomials calculated until degree 5: 4 % Time: 420 % No. of Spolynomials calculated until degree 6: 5 % Time: 430 % No. of Spolynomials calculated until degree 7: 6 % Time: 430 Current homological degree=2 Current Poincare-Betti series is 1t+3t^2z+2t^3z^2+1t^4z^2 Cleaning the variables Cleaning the variables % No. of Spolynomials calculated until degree 2: 0 % Time: 440 % No. of Spolynomials calculated until degree 3: 0 % Time: 440 % No. of Spolynomials calculated until degree 4: 2 % Time: 440 % No. of Spolynomials calculated until degree 5: 4 % Time: 440 % No. of Spolynomials calculated until degree 6: 6 % Time: 440 % No. of Spolynomials calculated until degree 7: 8 % Time: 450 % No. of Spolynomials calculated until degree 8: 9 % Time: 450 Cleaning the variables % No. of Spolynomials calculated until degree 2: 0 % Time: 460 % No. of Spolynomials calculated until degree 3: 0 % Time: 460 % No. of Spolynomials calculated until degree 4: 1 % Time: 460 % No. of Spolynomials calculated until degree 5: 1 % Time: 460 % No. of Spolynomials calculated until degree 6: 2 % Time: 460 % No. of Spolynomials calculated until degree 7: 3 % Time: 460 % No. of Spolynomials calculated until degree 8: 4 % Time: 470 Current homological degree=3 Current Poincare-Betti series is 1t+3t^2z+2t^3z^2+1t^4z^2+1t^5z^3 Cleaning the variables Cleaning the variables % No. of Spolynomials calculated until degree 2: 0 % Time: 480 % No. of Spolynomials calculated until degree 3: 0 % Time: 480 % No. of Spolynomials calculated until degree 4: 1 % Time: 480 % No. of Spolynomials calculated until degree 5: 1 % Time: 480 % No. of Spolynomials calculated until degree 6: 2 % Time: 480 % No. of Spolynomials calculated until degree 7: 3 % Time: 490 % No. of Spolynomials calculated until degree 8: 4 % Time: 490 Cleaning the variables % No. of Spolynomials calculated until degree 2: 0 % Time: 490 % No. of Spolynomials calculated until degree 3: 0 % Time: 500 % No. of Spolynomials calculated until degree 4: 1 % Time: 500 % No. of Spolynomials calculated until degree 7: 1 % Time: 500 % No. of Spolynomials calculated until degree 8: 1 % Time: 500 Current homological degree=4 Current Poincare-Betti series is 1t+3t^2z+2t^3z^2+1t^4z^2+1t^5z^3+1t^7z^4 +1t^8z^4 Cleaning the variables Cleaning the variables % No. of Spolynomials calculated until degree 2: 0 % Time: 510 % No. of Spolynomials calculated until degree 3: 0 % Time: 510 % No. of Spolynomials calculated until degree 4: 1 % Time: 520 % No. of Spolynomials calculated until degree 7: 1 % Time: 520 % No. of Spolynomials calculated until degree 8: 1 % Time: 520 Calculated Poincare-Betti series is 1t+3t^2z+2t^3z^2+1t^4z^2+1t^5z^3+1t^7z^4 +1t^8z^4 nil Cleaning the variables nil nil 0 256 0 0 nil Linear relations "Linear relations" 0 nil safe t % No. of Spolynomials calculated until degree 1: 0 % Time: 520 - 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 0 512 0 0 nil Last test finished "Last test finished" 256 nil 3 lisp> Exiting lisp