Loading image file :/home/guests/sveta/b1002s/bin/Linux_elf/bergman.img Bergman 1.001, 22-Aug-20 1 lisp> nil 2 lisp> 0 ((objecttype ring (autoaddrelationstate nil nil) (lowtermshandling quick)) ( resolutiontype none) (variablesetup (ringtype commutative) (commutativeorder tdegrevlex) (ordermatrix nil) (noncommutativeorder tdegleftlex) (variablenumber nil) (invariables nil) (outvariables nil) (variableweights nil) ( homogenisationvariable nil)) (strategy default (process degreewise) (stability t ) (mindeg nil) (maxdeg nil) (interruption ordinary) (customised nil)) ( coefficientdomain nil (oddprimesmoduli ordinary)) (inputformat casesensalgin) ( outputformat alg (printtimes (degreeprintoutput nil) (itemprintoutput nil)) exptsprint (immediateassocringpbdisplay nil) (overwrite nil) (customised nil)) ( debugstate (directalertclosing nil) (checkfailuredisplay t) (activetracebreaks nil)) (variousflags (dynamiclogtables off) (immediatecrit off) ( immediatefullreduction on) (immediaterecdefine off) (nobignum off) ( obsoletenamesinform off) (oldprintmodes1 off) (oldseriesmodes1 off) ( standardanickmodes on) (pbseries off) (reductivity on) (savedegree off) ( saverecvalues on))) 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 t nil Commutative Hilbert series "Commutative Hilbert series" 0 0 nil nil 7 t nil 0 0 0 0 0 nil t 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 t 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 t nil Weights handling: non-commutative "Weights handling: non-commutative" 0 nil 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 t nil Eliminating ordering: Groebner basis "Eliminating ordering: Groebner basis" 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 nil 0 0 0 0 nil t nil modulehseries "modulehseries" 0 0 *** Function `modulehseries' has been redefined *** I turn on noncommutativity nil 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 t nil Anick trivial "Anick trivial" 0 0 "../test_bergman/anick_tm.out" *** We turn on noncommutativity *** We turn on PBSERIES nil 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 t nil Modulebettinumbers "Modulebettinumbers" 0 0 "../test_bergman/modbtn.out" *** We turn on the MODULE mode *** We turn on noncommutativity *** We turn on PBSERIES nil 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 t nil Factor-algebra "Factor-algebra" 0 0 "../test_bergman/fact.out" *** We turn on the MODULE mode *** We turn on PBSERIES *** We turn on noncommutativity nil 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 t nil Betti numbers for two modules "Betti numbers for two modules" 0 0 "../test_bergman/two.out" *** We turn on the TWOMODULES mode *** We turn on noncommutativity *** We turn on PBSERIES nil 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 t nil Betti numbers for two modules: hochschild "Betti numbers for two modules: hochschild" 0 0 "../test_bergman/hoch.out" *** We turn on the TWOMODULES mode *** We turn on noncommutativity *** We turn on PBSERIES nil 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 t nil Hochschild homology "Hochschild homology" 0 0 "../test_bergman/hoch1.out" *** We turn on the TWOMODULES mode *** We turn on PBSERIES *** We turn on noncommutativity nil 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 t nil simple noncommutative char2 "simple noncommutative char2" 0 none nil t 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 Cleaning the variables nil 0 0 0 0 t nil simple noncommutative char5 "simple noncommutative char5" 0 none nil *** (dm!A!Y!B!E): base 16#8154D60, length 10#57 bytes t 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 Cleaning the variables nil 0 0 0 0 t 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 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 Cleaning the variables nil modlogarithmic t 0 0 0 0 t nil Leftmodulebettinumbers "Leftmodulebettinumbers" 0 0 nil none "../test_bergman/leftmodbtn.out" *** We turn on the MODULE mode *** We turn on noncommutativity *** We turn on PBSERIES *** Function `p!O!La!L!Gr!E!A!D' has been redefined nil 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 t 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 nil 0 0 0 0 t nil Skipcdeg - test N1 "Skipcdeg - test N1" 0 ordinary t 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 Cleaning the variables nil 0 0 0 0 t nil Ignorecdeg "Ignorecdeg" 0 ordinary t 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 Cleaning the variables nil minhilblimits 0 0 0 0 t nil Matrix ordering "Matrix ordering" 0 nil nil 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 Cleaning the variables nil nil 0 0 0 0 t 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 Linear relations "Linear relations" 0 nil quick 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 t nil Linear relations - non-commutative "Linear relations - non-commutative" 0 nil quick 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 safe 0 0 0 0 t nil Minimal resolution "Minimal resolution" 0 nil nil 1 t t *** We turn on the MODULE mode Cleaning the variables Cleaning the variables Current homological degree=2 Current Poincare-Betti series is 1t+3t^2z+2t^3z^2+1t^4z^2 Cleaning the variables Cleaning the variables Cleaning the variables 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 Cleaning the variables 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 Cleaning the variables 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 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 0 0 0 0 t nil Combination: weights and maxdeg "Combination: weights and maxdeg" 0 nil 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 (2 1 1) Cleaning the variables nil 0 0 0 0 t nil Nonhomogeneity "Nonhomogeneity" 0 nil t t quick none t x*y-z, y^2-x^2, y*z-x, z*x-y, -z^2+x^2, x^3-z*y, -x^2*z+y*x, y*x^2-x*z, y*x*z-x*z*y, -z*y*x+x*z*y, - 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 nil safe t nil Anick in characteristic 5 "Anick in characteristic 5" 0 0 "../test_bergman/anick_5.out" *** We turn on noncommutativity *** We turn on PBSERIES nil *** 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 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)=1 0 1 2 +---------- 0 | 1 2 1 1 | - - Printing the results ... Printing is done. end of Calculations. Calculating the Anick resolution in degree 3... B(1,1)=2 B(2,2)=1 0 1 2 +---------- 0 | 1 2 1 1 | - - Printing the results ... Printing is done. end of Calculations. Calculating the Anick resolution in degree 4... B(1,1)=2 B(2,2)=1 0 1 2 +---------- 0 | 1 2 1 1 | - - 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 t nil Last test finished "Last test finished" 256 nil 3 lisp> Exiting lisp