| 1 |
i i i i i i i ooooo o ooooooo ooooo ooooo |
| 2 |
I I I I I I I 8 8 8 8 8 o 8 8 |
| 3 |
I \ `+' / I 8 8 8 8 8 8 |
| 4 |
\ `-+-' / 8 8 8 ooooo 8oooo |
| 5 |
`-__|__-' 8 8 8 8 8 |
| 6 |
| 8 o 8 8 o 8 8 |
| 7 |
------+------ ooooo 8oooooo ooo8ooo ooooo 8 |
| 8 |
|
| 9 |
Copyright (c) Bruno Haible, Michael Stoll 1992, 1993 |
| 10 |
Copyright (c) Bruno Haible, Marcus Daniels 1994-1997 |
| 11 |
Copyright (c) Bruno Haible, Pierpaolo Bernardi, Sam Steingold 1998 |
| 12 |
Copyright (c) Bruno Haible, Sam Steingold 1999-2000 |
| 13 |
Copyright (c) Sam Steingold, Bruno Haible 2001-2004 |
| 14 |
|
| 15 |
Welcome to the BERGMAN system. (v. 0.988) |
| 16 |
NIL |
| 17 |
|
| 18 |
NIL NEW TEST:simple commutative |
| 19 |
("NEW TEST 1:simple commutative ") |
| 20 |
|
| 21 |
NIL simple commutative |
| 22 |
("simple commutative ") |
| 23 |
NIL algebraic form input> |
| 24 |
T |
| 25 |
#\X - All is OK (I hope). Now you may (e. g.): |
| 26 |
- kill bergman with (QUIT); or |
| 27 |
- interrupt bergman with ^Z; or |
| 28 |
- clear the memory with (CLEARIDEAL), and run a new (SIMPLE). |
| 29 |
|
| 30 |
NIL Cleaning the variables |
| 31 |
|
| 32 |
NIL |
| 33 |
|
| 34 |
NIL NEW TEST:simple noncommutative |
| 35 |
("NEW TEST 2:simple noncommutative") |
| 36 |
NIL |
| 37 |
NIL algebraic form input> |
| 38 |
T - All is OK (I hope). Now you may (e. g.): |
| 39 |
- kill bergman with (QUIT); or |
| 40 |
- interrupt bergman with ^Z; or |
| 41 |
- clear the memory with (CLEARIDEAL), and run a new (SIMPLE). |
| 42 |
|
| 43 |
NIL Cleaning the variables |
| 44 |
|
| 45 |
NIL |
| 46 |
|
| 47 |
NIL NEW TEST:ncpbhgroebner |
| 48 |
("NEW TEST 3:ncpbhgroebner") |
| 49 |
6 algebraic form input> |
| 50 |
T |
| 51 |
% No. of Spolynomials calculated until degree 2: 0 |
| 52 |
% No. of ReducePol(0) demanded until degree 2: 0 |
| 53 |
% Time: 110 |
| 54 |
|
| 55 |
% No. of Spolynomials calculated until degree 3: 2 |
| 56 |
% No. of ReducePol(0) demanded until degree 3: 0 |
| 57 |
% Time: 130 |
| 58 |
|
| 59 |
% No. of Spolynomials calculated until degree 4: 8 |
| 60 |
% No. of ReducePol(0) demanded until degree 4: 5 |
| 61 |
% Time: 140 |
| 62 |
|
| 63 |
NIL Cleaning the variables |
| 64 |
|
| 65 |
NIL |
| 66 |
|
| 67 |
NIL NEW TEST:Commutative Hilbert series |
| 68 |
("NEW TEST 4:Commutative Hilbert series") |
| 69 |
T |
| 70 |
NIL |
| 71 |
7 algebraic form input> |
| 72 |
T |
| 73 |
#\X |
| 74 |
NIL Cleaning the variables |
| 75 |
|
| 76 |
NIL |
| 77 |
|
| 78 |
NIL NEW TEST: Hilbert series interrupt strategy: commutative |
| 79 |
("NEW TEST 5: Hilbert series interrupt strategy: commutative") |
| 80 |
ORDINARY |
| 81 |
T |
| 82 |
NIL algebraic form input> |
| 83 |
T |
| 84 |
#\X - All is OK (I hope). Now you may (e. g.): |
| 85 |
- kill bergman with (QUIT); or |
| 86 |
- interrupt bergman with ^Z; or |
| 87 |
- clear the memory with (CLEARIDEAL), and run a new (SIMPLE). |
| 88 |
|
| 89 |
NIL Cleaning the variables |
| 90 |
|
| 91 |
NIL |
| 92 |
MINHILBLIMITS |
| 93 |
|
| 94 |
NIL NEW TEST: Weights handling: commutative |
| 95 |
("NEW TEST 6: Weights handling: commutative") |
| 96 |
NIL |
| 97 |
NIL algebraic form input> |
| 98 |
T - All is OK (I hope). Now you may (e. g.): |
| 99 |
- kill bergman with (QUIT); or |
| 100 |
- interrupt bergman with ^Z; or |
| 101 |
- clear the memory with (CLEARIDEAL), and run a new (SIMPLE). |
| 102 |
|
| 103 |
NIL |
| 104 |
(1 1 2) Cleaning the variables |
| 105 |
|
| 106 |
NIL |
| 107 |
|
| 108 |
NIL NEW TEST: Weights handling: non-commutative |
| 109 |
("NEW TEST 7: Weights handling: non-commutative") |
| 110 |
NIL |
| 111 |
6 |
| 112 |
NIL algebraic form input> |
| 113 |
T - All is OK (I hope). Now you may (e. g.): |
| 114 |
- kill bergman with (QUIT); or |
| 115 |
- interrupt bergman with ^Z; or |
| 116 |
- clear the memory with (CLEARIDEAL), and run a new (SIMPLE). |
| 117 |
|
| 118 |
NIL |
| 119 |
(1 1 2) Cleaning the variables |
| 120 |
|
| 121 |
NIL |
| 122 |
|
| 123 |
NIL NEW TEST: Eliminating ordering: Groebner basis |
| 124 |
("NEW TEST 8: Eliminating ordering: Groebner basis") |
| 125 |
NIL |
| 126 |
6 algebraic form input> |
| 127 |
T - All is OK (I hope). Now you may (e. g.): |
| 128 |
- kill bergman with (QUIT); or |
| 129 |
- interrupt bergman with ^Z; or |
| 130 |
- clear the memory with (CLEARIDEAL), and run a new (SIMPLE). |
| 131 |
|
| 132 |
NIL |
| 133 |
NIL Cleaning the variables |
| 134 |
|
| 135 |
NIL |
| 136 |
|
| 137 |
NIL NEW TEST: modulehseries |
| 138 |
("NEW TEST 9: modulehseries") '(OutModFile ScInput InModFile *HSisLoaded *PBSERIES) |
| 139 |
|
| 140 |
WARNING: |
| 141 |
DEFUN/DEFMACRO: redefining macro MODULEHSERIES in top-level, was defined in /home/guests/sveta/b9881/auxil/topproc.sl |
| 142 |
10 |
| 143 |
2 algebraic form input> |
| 144 |
T +23*z^2 |
| 145 |
+106*z^3 |
| 146 |
+489*z^4 |
| 147 |
+2256*z^5 |
| 148 |
+10408*z^6 |
| 149 |
algebraic form input> |
| 150 |
T +23*z^2 |
| 151 |
+105*z^3 |
| 152 |
+478*z^4 |
| 153 |
+2175*z^5 |
| 154 |
+9896*z^6 |
| 155 |
|
| 156 |
Here is (1-H)^(-1) for Hilbert series H of the module |
| 157 |
|
| 158 |
+1 |
| 159 |
+2*t^1 |
| 160 |
+10*t^2 |
| 161 |
+45*t^3 |
| 162 |
+204*t^4 |
| 163 |
+928*t^5 |
| 164 |
+4222*t^6 |
| 165 |
Here is the Hilbert series H of the module |
| 166 |
+2*t^1 |
| 167 |
+6*t^2 |
| 168 |
+13*t^3 |
| 169 |
+28*t^4 |
| 170 |
+64*t^5 |
| 171 |
+149*t^6 |
| 172 |
|
| 173 |
NIL Cleaning the variables |
| 174 |
|
| 175 |
NIL |
| 176 |
|
| 177 |
NIL NEW TEST: Anick trivial |
| 178 |
("NEW TEST 10: Anick trivial") |
| 179 |
"../../test_bergman/clisp/anick_tm.out" |
| 180 |
4 algebraic form input> |
| 181 |
T |
| 182 |
#\X The Anick resolution initialization... |
| 183 |
B(1,1)=2 |
| 184 |
The Anick resolution initialization done. |
| 185 |
Calculating the Anick resolution in degree 2... |
| 186 |
B(1,1)=2 |
| 187 |
B(2,2)=2 |
| 188 |
0 1 2 |
| 189 |
+---------- |
| 190 |
0 | 1 2 2 |
| 191 |
1 | - - |
| 192 |
Printing the results ... |
| 193 |
Printing is done. |
| 194 |
end of Calculations. |
| 195 |
Calculating the Anick resolution in degree 3... |
| 196 |
B(1,1)=2 |
| 197 |
B(2,2)=2 |
| 198 |
B(3,3)=1 |
| 199 |
0 1 2 3 |
| 200 |
+-------------- |
| 201 |
0 | 1 2 2 1 |
| 202 |
1 | - - - |
| 203 |
2 | - - |
| 204 |
Printing the results ... |
| 205 |
Printing is done. |
| 206 |
end of Calculations. |
| 207 |
Calculating the Anick resolution in degree 4... |
| 208 |
B(1,1)=2 |
| 209 |
B(2,2)=2 |
| 210 |
B(3,3)=1 |
| 211 |
B(3,4)=1 |
| 212 |
B(4,4)=1 |
| 213 |
0 1 2 3 4 |
| 214 |
+------------------ |
| 215 |
0 | 1 2 2 1 1 |
| 216 |
1 | - - - 1 |
| 217 |
2 | - - - |
| 218 |
3 | - - |
| 219 |
Printing the results ... |
| 220 |
Printing is done. |
| 221 |
end of Calculations. |
| 222 |
|
| 223 |
|
| 224 |
NIL |
| 225 |
NIL Printing the results ... |
| 226 |
Printing is done. |
| 227 |
|
| 228 |
NIL Closing the streams.Cleaning the variables |
| 229 |
|
| 230 |
NIL |
| 231 |
|
| 232 |
NIL NEW TEST: Modulebettinumbers |
| 233 |
("NEW TEST 11: Modulebettinumbers") |
| 234 |
"../../test_bergman/clisp/modbtn.out" |
| 235 |
*** We turn on the MODULE mode |
| 236 |
|
| 237 |
4 |
| 238 |
1 algebraic form input> |
| 239 |
T The Anick resolution initialization... |
| 240 |
B(0,0)=1 |
| 241 |
The Anick resolution initialization done. |
| 242 |
Calculating the module Anick resolution in degree 2... |
| 243 |
B(0,0)=1 |
| 244 |
B(1,1)=1 |
| 245 |
0 1 2 |
| 246 |
+---------- |
| 247 |
0 | 1 1 |
| 248 |
1 | - |
| 249 |
end of Calculations. |
| 250 |
Calculating the module Anick resolution in degree 3... |
| 251 |
B(0,0)=1 |
| 252 |
B(1,1)=1 |
| 253 |
B(2,2)=1 |
| 254 |
0 1 2 3 |
| 255 |
+-------------- |
| 256 |
0 | 1 1 1 |
| 257 |
1 | - - |
| 258 |
2 | - |
| 259 |
end of Calculations. |
| 260 |
|
| 261 |
Groebner basis is finite. |
| 262 |
If you want to continue calculations until the maximal degree |
| 263 |
type (CALCULATEANICKRESOLUTIONTOLIMIT (GETMAXDEG)) |
| 264 |
|
| 265 |
NIL Calculating the module Anick resolution in degree 4... |
| 266 |
B(0,0)=1 |
| 267 |
B(1,1)=1 |
| 268 |
B(2,2)=1 |
| 269 |
B(3,3)=1 |
| 270 |
0 1 2 3 4 |
| 271 |
+------------------ |
| 272 |
0 | 1 1 1 1 |
| 273 |
1 | - - - |
| 274 |
2 | - - |
| 275 |
3 | - |
| 276 |
end of Calculations. |
| 277 |
Calculating the module Anick resolution in degree 5... |
| 278 |
B(0,0)=1 |
| 279 |
B(1,1)=1 |
| 280 |
B(2,2)=1 |
| 281 |
B(3,3)=1 |
| 282 |
B(4,4)=1 |
| 283 |
0 1 2 3 4 5 |
| 284 |
+---------------------- |
| 285 |
0 | 1 1 1 1 1 |
| 286 |
1 | - - - - |
| 287 |
2 | - - - |
| 288 |
3 | - - |
| 289 |
4 | - |
| 290 |
end of Calculations. |
| 291 |
|
| 292 |
NIL Printing the results ... |
| 293 |
Printing is done. |
| 294 |
|
| 295 |
NIL Closing the streams.Cleaning the variables |
| 296 |
|
| 297 |
NIL |
| 298 |
|
| 299 |
NIL NEW TEST: Factor-algebra |
| 300 |
("NEW TEST 12: Factor-algebra ") |
| 301 |
"../../test_bergman/clisp/fact.out" |
| 302 |
5 algebraic form input> |
| 303 |
T The Anick resolution initialization... |
| 304 |
B(0,0)=1 |
| 305 |
The Anick resolution initialization done. |
| 306 |
Calculating the module Anick resolution in degree 2... |
| 307 |
B(0,0)=1 |
| 308 |
B(1,1)=2 |
| 309 |
0 1 2 |
| 310 |
+---------- |
| 311 |
0 | 1 2 |
| 312 |
1 | - |
| 313 |
end of Calculations. |
| 314 |
Calculating the module Anick resolution in degree 3... |
| 315 |
B(0,0)=1 |
| 316 |
B(1,1)=2 |
| 317 |
B(1,2)=1 |
| 318 |
B(2,2)=1 |
| 319 |
0 1 2 3 |
| 320 |
+-------------- |
| 321 |
0 | 1 2 1 |
| 322 |
1 | - 1 |
| 323 |
2 | - |
| 324 |
end of Calculations. |
| 325 |
Calculating the module Anick resolution in degree 4... |
| 326 |
B(0,0)=1 |
| 327 |
B(1,1)=2 |
| 328 |
B(1,2)=1 |
| 329 |
B(2,2)=1 |
| 330 |
B(2,3)=2 |
| 331 |
0 1 2 3 4 |
| 332 |
+------------------ |
| 333 |
0 | 1 2 1 - |
| 334 |
1 | - 1 2 |
| 335 |
2 | - - |
| 336 |
3 | - |
| 337 |
end of Calculations. |
| 338 |
Calculating the module Anick resolution in degree 5... |
| 339 |
B(0,0)=1 |
| 340 |
B(1,1)=2 |
| 341 |
B(1,2)=1 |
| 342 |
B(2,2)=1 |
| 343 |
B(2,3)=2 |
| 344 |
B(3,4)=1 |
| 345 |
0 1 2 3 4 5 |
| 346 |
+---------------------- |
| 347 |
0 | 1 2 1 - - |
| 348 |
1 | - 1 2 1 |
| 349 |
2 | - - - |
| 350 |
3 | - - |
| 351 |
4 | - |
| 352 |
end of Calculations. |
| 353 |
Calculating the module Anick resolution in degree 6... |
| 354 |
B(0,0)=1 |
| 355 |
B(1,1)=2 |
| 356 |
B(1,2)=1 |
| 357 |
B(2,2)=1 |
| 358 |
B(2,3)=2 |
| 359 |
B(3,4)=1 |
| 360 |
0 1 2 3 4 5 |
| 361 |
+---------------------- |
| 362 |
0 | 1 2 1 - - |
| 363 |
1 | - 1 2 1 |
| 364 |
2 | - - - |
| 365 |
3 | - - |
| 366 |
4 | - |
| 367 |
end of Calculations. |
| 368 |
Calculating the module Anick resolution in degree 7... |
| 369 |
B(0,0)=1 |
| 370 |
B(1,1)=2 |
| 371 |
B(1,2)=1 |
| 372 |
B(2,2)=1 |
| 373 |
B(2,3)=2 |
| 374 |
B(3,4)=1 |
| 375 |
0 1 2 3 4 5 |
| 376 |
+---------------------- |
| 377 |
0 | 1 2 1 - - |
| 378 |
1 | - 1 2 1 |
| 379 |
2 | - - - |
| 380 |
3 | - - |
| 381 |
4 | - |
| 382 |
end of Calculations. |
| 383 |
Calculating the module Anick resolution in degree 8... |
| 384 |
B(0,0)=1 |
| 385 |
B(1,1)=2 |
| 386 |
B(1,2)=1 |
| 387 |
B(2,2)=1 |
| 388 |
B(2,3)=2 |
| 389 |
B(3,4)=1 |
| 390 |
0 1 2 3 4 5 |
| 391 |
+---------------------- |
| 392 |
0 | 1 2 1 - - |
| 393 |
1 | - 1 2 1 |
| 394 |
2 | - - - |
| 395 |
3 | - - |
| 396 |
4 | - |
| 397 |
end of Calculations. |
| 398 |
|
| 399 |
|
| 400 |
NIL |
| 401 |
NIL Printing the results ... |
| 402 |
Printing is done. |
| 403 |
|
| 404 |
NIL Closing the streams.Cleaning the variables |
| 405 |
|
| 406 |
NIL |
| 407 |
|
| 408 |
NIL NEW TEST: Betti numbers for two modules |
| 409 |
("NEW TEST 13: Betti numbers for two modules") |
| 410 |
"../../test_bergman/clisp/two.out" |
| 411 |
*** We turn on the TWOMODULES mode |
| 412 |
|
| 413 |
8 |
| 414 |
1 |
| 415 |
1 algebraic form input> |
| 416 |
T The Anick resolution initialization (for two modules)... |
| 417 |
The Anick resolution initialization done. |
| 418 |
Calculating the module Anick resolution in degree 2... |
| 419 |
B(0,0)=1 |
| 420 |
0 1 2 |
| 421 |
+---------- |
| 422 |
0 | 1 |
| 423 |
end of Calculations. |
| 424 |
|
| 425 |
Groebner basis is finite. |
| 426 |
If you want to continue calculations until the maximal degree |
| 427 |
type (CALCULATEANICKRESOLUTIONTOLIMIT (GETMAXDEG)) |
| 428 |
|
| 429 |
NIL Calculating the module Anick resolution in degree 3... |
| 430 |
B(0,0)=1 |
| 431 |
0 1 2 |
| 432 |
+---------- |
| 433 |
0 | 1 |
| 434 |
end of Calculations. |
| 435 |
Calculating the module Anick resolution in degree 4... |
| 436 |
B(0,0)=1 |
| 437 |
B(0,2)=1 |
| 438 |
0 1 2 3 4 |
| 439 |
+------------------ |
| 440 |
0 | 1 - - |
| 441 |
1 | - - |
| 442 |
2 | 1 |
| 443 |
end of Calculations. |
| 444 |
Calculating the module Anick resolution in degree 5... |
| 445 |
B(0,0)=1 |
| 446 |
B(0,2)=1 |
| 447 |
B(0,3)=2 |
| 448 |
0 1 2 3 4 5 |
| 449 |
+---------------------- |
| 450 |
0 | 1 - - - |
| 451 |
1 | - - - |
| 452 |
2 | 1 - |
| 453 |
3 | 2 |
| 454 |
end of Calculations. |
| 455 |
Calculating the module Anick resolution in degree 6... |
| 456 |
B(0,0)=1 |
| 457 |
B(0,2)=1 |
| 458 |
B(0,3)=2 |
| 459 |
B(0,4)=4 |
| 460 |
0 1 2 3 4 5 6 |
| 461 |
+-------------------------- |
| 462 |
0 | 1 - - - - |
| 463 |
1 | - - - - |
| 464 |
2 | 1 - - |
| 465 |
3 | 2 - |
| 466 |
4 | 4 |
| 467 |
end of Calculations. |
| 468 |
|
| 469 |
NIL Printing the results ... |
| 470 |
Printing is done. |
| 471 |
|
| 472 |
NIL Closing the streams.Cleaning the variables |
| 473 |
|
| 474 |
NIL |
| 475 |
|
| 476 |
NIL NEW TEST: Betti numbers for two modules: hochschild |
| 477 |
("NEW TEST 14: Betti numbers for two modules: hochschild") |
| 478 |
"../../test_bergman/clisp/hoch.out" |
| 479 |
6 |
| 480 |
1 |
| 481 |
1 algebraic form input> |
| 482 |
T The Anick resolution initialization (for two modules)... |
| 483 |
The Anick resolution initialization done. |
| 484 |
Calculating the module Anick resolution in degree 2... |
| 485 |
B(0,0)=1 |
| 486 |
0 1 2 |
| 487 |
+---------- |
| 488 |
0 | 1 |
| 489 |
end of Calculations. |
| 490 |
Calculating the module Anick resolution in degree 3... |
| 491 |
B(0,0)=1 |
| 492 |
B(0,1)=2 |
| 493 |
B(1,1)=2 |
| 494 |
0 1 2 3 |
| 495 |
+-------------- |
| 496 |
0 | 1 2 |
| 497 |
1 | 2 |
| 498 |
end of Calculations. |
| 499 |
Calculating the module Anick resolution in degree 4... |
| 500 |
B(0,0)=1 |
| 501 |
B(0,1)=2 |
| 502 |
B(1,1)=2 |
| 503 |
B(0,2)=2 |
| 504 |
B(1,2)=2 |
| 505 |
0 1 2 3 4 |
| 506 |
+------------------ |
| 507 |
0 | 1 2 - |
| 508 |
1 | 2 2 |
| 509 |
2 | 2 |
| 510 |
end of Calculations. |
| 511 |
Calculating the module Anick resolution in degree 5... |
| 512 |
B(0,0)=1 |
| 513 |
B(0,1)=2 |
| 514 |
B(1,1)=2 |
| 515 |
B(0,2)=2 |
| 516 |
B(1,2)=2 |
| 517 |
B(0,3)=2 |
| 518 |
B(1,3)=2 |
| 519 |
0 1 2 3 4 5 |
| 520 |
+---------------------- |
| 521 |
0 | 1 2 - - |
| 522 |
1 | 2 2 - |
| 523 |
2 | 2 2 |
| 524 |
3 | 2 |
| 525 |
end of Calculations. |
| 526 |
|
| 527 |
|
| 528 |
NIL |
| 529 |
NIL Printing the results ... |
| 530 |
Printing is done. |
| 531 |
|
| 532 |
NIL Closing the streams.Cleaning the variables |
| 533 |
|
| 534 |
NIL |
| 535 |
|
| 536 |
NIL NEW TEST: Hochschild homology |
| 537 |
("NEW TEST 15: Hochschild homology") |
| 538 |
"../../test_bergman/clisp/hoch1.out" |
| 539 |
5 algebraic form input> |
| 540 |
T The Anick resolution initialization (for two modules)... |
| 541 |
The Anick resolution initialization done. |
| 542 |
Calculating the module Anick resolution in degree 2... |
| 543 |
B(0,0)=1 |
| 544 |
0 1 2 |
| 545 |
+---------- |
| 546 |
0 | 1 |
| 547 |
end of Calculations. |
| 548 |
Calculating the module Anick resolution in degree 3... |
| 549 |
B(0,0)=1 |
| 550 |
B(0,1)=2 |
| 551 |
B(1,1)=2 |
| 552 |
0 1 2 3 |
| 553 |
+-------------- |
| 554 |
0 | 1 2 |
| 555 |
1 | 2 |
| 556 |
end of Calculations. |
| 557 |
Calculating the module Anick resolution in degree 4... |
| 558 |
B(0,0)=1 |
| 559 |
B(0,1)=2 |
| 560 |
B(1,1)=2 |
| 561 |
B(0,2)=2 |
| 562 |
B(1,2)=2 |
| 563 |
0 1 2 3 4 |
| 564 |
+------------------ |
| 565 |
0 | 1 2 - |
| 566 |
1 | 2 2 |
| 567 |
2 | 2 |
| 568 |
end of Calculations. |
| 569 |
Calculating the module Anick resolution in degree 5... |
| 570 |
B(0,0)=1 |
| 571 |
B(0,1)=2 |
| 572 |
B(1,1)=2 |
| 573 |
B(0,2)=2 |
| 574 |
B(1,2)=2 |
| 575 |
B(0,3)=2 |
| 576 |
B(1,3)=2 |
| 577 |
0 1 2 3 4 5 |
| 578 |
+---------------------- |
| 579 |
0 | 1 2 - - |
| 580 |
1 | 2 2 - |
| 581 |
2 | 2 2 |
| 582 |
3 | 2 |
| 583 |
end of Calculations. |
| 584 |
|
| 585 |
|
| 586 |
NIL |
| 587 |
NIL Printing the results ... |
| 588 |
Printing is done. |
| 589 |
|
| 590 |
NIL Closing the streams.Cleaning the variables |
| 591 |
|
| 592 |
NIL |
| 593 |
|
| 594 |
NIL NEW TEST: simple noncommutative char2 |
| 595 |
("NEW TEST 16: simple noncommutative char2 ") |
| 596 |
ANICK |
| 597 |
NIL |
| 598 |
T |
| 599 |
NIL |
| 600 |
5 algebraic form input> |
| 601 |
T |
| 602 |
#\X - All is OK (I hope). Now you may (e. g.): |
| 603 |
- kill bergman with (QUIT); or |
| 604 |
- interrupt bergman with ^Z; or |
| 605 |
- clear the memory with (CLEARIDEAL), and run a new (SIMPLE). |
| 606 |
|
| 607 |
NIL Cleaning the variables |
| 608 |
|
| 609 |
NIL |
| 610 |
|
| 611 |
NIL NEW TEST: simple noncommutative char5 |
| 612 |
("NEW TEST 17: simple noncommutative char5 ") |
| 613 |
NONE |
| 614 |
NIL '(GBasis NOOFSPOLCALCS *IMMEDIATEFULLREDUCTION NOOFNILREDUCTIONS) |
| 615 |
'(*REDEFMSG *USERMODE *PWRDS *MSG) |
| 616 |
|
| 617 |
T |
| 618 |
NIL |
| 619 |
6 algebraic form input> |
| 620 |
T |
| 621 |
#\X - All is OK (I hope). Now you may (e. g.): |
| 622 |
- kill bergman with (QUIT); or |
| 623 |
- interrupt bergman with ^Z; or |
| 624 |
- clear the memory with (CLEARIDEAL), and run a new (SIMPLE). |
| 625 |
|
| 626 |
NIL Cleaning the variables |
| 627 |
|
| 628 |
NIL |
| 629 |
|
| 630 |
NIL NEW TEST: simple with modlogarithms |
| 631 |
("NEW TEST 18: simple with modlogarithms") |
| 632 |
NONE |
| 633 |
NIL |
| 634 |
ORDINARY |
| 635 |
'(GBasis cGBasis NOOFSPOLCALCS *IMMEDIATEFULLREDUCTION LOGVECT EXPVECT |
| 636 |
*IMMEDIATECRIT NOOFNILREDUCTIONS *SAVEDEGREE &*StgFinalOutputChan |
| 637 |
*DEGREEPRINTOUTPUT DegGBasis *PBSERIES cPolSubsPri) |
| 638 |
'(Pek AO+ AO* AO^ AObop+ *REDEFMSG *USERMODE *PWRDS *MSG) |
| 639 |
|
| 640 |
T |
| 641 |
NIL |
| 642 |
6 algebraic form input> |
| 643 |
T |
| 644 |
#\X - All is OK (I hope). Now you may (e. g.): |
| 645 |
- kill bergman with (QUIT); or |
| 646 |
- interrupt bergman with ^Z; or |
| 647 |
- clear the memory with (CLEARIDEAL), and run a new (SIMPLE). |
| 648 |
|
| 649 |
NIL Cleaning the variables |
| 650 |
|
| 651 |
NIL |
| 652 |
MODLOGARITHMIC |
| 653 |
T |
| 654 |
|
| 655 |
NIL NEW TEST: Leftmodulebettinumbers |
| 656 |
("NEW TEST 19: Leftmodulebettinumbers") |
| 657 |
T |
| 658 |
NONE |
| 659 |
"../../test_bergman/clisp/leftmodbtn.out" |
| 660 |
*** We turn on the MODULE mode |
| 661 |
|
| 662 |
15 |
| 663 |
1 algebraic form input> |
| 664 |
T The Anick resolution initialization... |
| 665 |
B(0,0)=1 |
| 666 |
The Anick resolution initialization done. |
| 667 |
Calculating the module Anick resolution in degree 2... |
| 668 |
B(0,0)=1 |
| 669 |
B(1,1)=1 |
| 670 |
0 1 2 |
| 671 |
+---------- |
| 672 |
0 | 1 1 |
| 673 |
1 | - |
| 674 |
end of Calculations. |
| 675 |
Calculating the module Anick resolution in degree 3... |
| 676 |
B(0,0)=1 |
| 677 |
B(1,1)=1 |
| 678 |
B(2,2)=1 |
| 679 |
0 1 2 3 |
| 680 |
+-------------- |
| 681 |
0 | 1 1 1 |
| 682 |
1 | - - |
| 683 |
2 | - |
| 684 |
end of Calculations. |
| 685 |
|
| 686 |
Groebner basis is finite. |
| 687 |
If you want to continue calculations until the maximal degree |
| 688 |
type (CALCULATEANICKRESOLUTIONTOLIMIT (GETMAXDEG)) |
| 689 |
|
| 690 |
NIL Calculating the module Anick resolution in degree 4... |
| 691 |
B(0,0)=1 |
| 692 |
B(1,1)=1 |
| 693 |
B(2,2)=1 |
| 694 |
B(3,3)=1 |
| 695 |
0 1 2 3 4 |
| 696 |
+------------------ |
| 697 |
0 | 1 1 1 1 |
| 698 |
1 | - - - |
| 699 |
2 | - - |
| 700 |
3 | - |
| 701 |
end of Calculations. |
| 702 |
Calculating the module Anick resolution in degree 5... |
| 703 |
B(0,0)=1 |
| 704 |
B(1,1)=1 |
| 705 |
B(2,2)=1 |
| 706 |
B(3,3)=1 |
| 707 |
B(4,4)=1 |
| 708 |
0 1 2 3 4 5 |
| 709 |
+---------------------- |
| 710 |
0 | 1 1 1 1 1 |
| 711 |
1 | - - - - |
| 712 |
2 | - - - |
| 713 |
3 | - - |
| 714 |
4 | - |
| 715 |
end of Calculations. |
| 716 |
|
| 717 |
NIL Printing the results ... |
| 718 |
Printing is done. |
| 719 |
|
| 720 |
NIL |
| 721 |
ANICK Closing the streams.Cleaning the variables |
| 722 |
|
| 723 |
NIL |
| 724 |
|
| 725 |
|
| 726 |
NIL NEW TEST: Rabbit with setrabbit |
| 727 |
("NEW TEST 21: Rabbit with setrabbit") |
| 728 |
8 algebraic form input> |
| 729 |
T |
| 730 |
#\X steps: 2,2,8 |
| 731 |
Cleaning the variables |
| 732 |
RABBIT: Added step, Maxdegree=4 |
| 733 |
Jump number 1 |
| 734 |
|
| 735 |
Cleaning the variables |
| 736 |
RABBIT: Jump number 2 |
| 737 |
|
| 738 |
Cleaning the variables |
| 739 |
RABBIT: Jump number 3 |
| 740 |
|
| 741 |
Cleaning the variables |
| 742 |
RABBIT: Added step, Maxdegree=6 |
| 743 |
Jump number 4 |
| 744 |
|
| 745 |
GB is completely calculated |
| 746 |
Rabbit has finishied jumping. |
| 747 |
NIL Cleaning the variables |
| 748 |
|
| 749 |
NIL |
| 750 |
NIL |
| 751 |
|
| 752 |
|
| 753 |
NIL NEW TEST 21: Skipcdeg - test N1 |
| 754 |
("NEW TEST 21: Skipcdeg - test N1") |
| 755 |
ORDINARY |
| 756 |
T |
| 757 |
NIL |
| 758 |
6 algebraic form input> |
| 759 |
T |
| 760 |
#\X |
| 761 |
% No. of Spolynomials calculated until degree 2: 0 |
| 762 |
% Time: 1830 |
| 763 |
|
| 764 |
% No. of Spolynomials calculated until degree 3: 0 |
| 765 |
% Time: 1850 |
| 766 |
|
| 767 |
% No. of Spolynomials calculated until degree 4: 0 |
| 768 |
% Time: 1870 |
| 769 |
|
| 770 |
% No. of Spolynomials calculated until degree 5: 0 |
| 771 |
% Time: 1880 |
| 772 |
|
| 773 |
% No. of Spolynomials calculated until degree 6: 4 |
| 774 |
% Time: 1900 |
| 775 |
|
| 776 |
% No. of Spolynomials calculated until degree 7: 9 |
| 777 |
% Time: 1910 |
| 778 |
|
| 779 |
% No. of Spolynomials calculated until degree 8: 15 |
| 780 |
% Time: 1930 |
| 781 |
|
| 782 |
% No. of Spolynomials calculated until degree 9: 22 |
| 783 |
% Time: 1940 |
| 784 |
|
| 785 |
% No. of Spolynomials calculated until degree 10: 30 |
| 786 |
% Time: 1950 |
| 787 |
- All is OK (I hope). Now you may (e. g.): |
| 788 |
- kill bergman with (QUIT); or |
| 789 |
- interrupt bergman with ^Z; or |
| 790 |
- clear the memory with (CLEARIDEAL), and run a new (SIMPLE). |
| 791 |
|
| 792 |
NIL Cleaning the variables |
| 793 |
|
| 794 |
NIL |
| 795 |
|
| 796 |
NIL NEW TEST 22:Ignorecdeg |
| 797 |
("NEW TEST 22:Ignorecdeg") |
| 798 |
MINHILBLIMITS |
| 799 |
T |
| 800 |
NIL |
| 801 |
10 algebraic form input> |
| 802 |
T |
| 803 |
#\X |
| 804 |
% No. of Spolynomials calculated until degree 2: 0 |
| 805 |
% Time: 1990 |
| 806 |
|
| 807 |
% No. of Spolynomials calculated until degree 3: 0 |
| 808 |
% Time: 2000 |
| 809 |
|
| 810 |
% No. of Spolynomials calculated until degree 4: 0 |
| 811 |
% Time: 2020 |
| 812 |
|
| 813 |
% No. of Spolynomials calculated until degree 5: 1 |
| 814 |
% Time: 2030 |
| 815 |
|
| 816 |
% No. of Spolynomials calculated until degree 6: 3 |
| 817 |
% Time: 2050 |
| 818 |
|
| 819 |
% No. of Spolynomials calculated until degree 7: 6 |
| 820 |
% Time: 2060 |
| 821 |
|
| 822 |
% No. of Spolynomials calculated until degree 8: 10 |
| 823 |
% Time: 2080 |
| 824 |
|
| 825 |
% No. of Spolynomials calculated until degree 9: 15 |
| 826 |
% Time: 2090 |
| 827 |
|
| 828 |
% No. of Spolynomials calculated until degree 10: 21 |
| 829 |
% Time: 2110 |
| 830 |
- All is OK (I hope). Now you may (e. g.): |
| 831 |
- kill bergman with (QUIT); or |
| 832 |
- interrupt bergman with ^Z; or |
| 833 |
- clear the memory with (CLEARIDEAL), and run a new (SIMPLE). |
| 834 |
|
| 835 |
NIL |
| 836 |
MINHILBLIMITS Cleaning the variables |
| 837 |
|
| 838 |
NIL |
| 839 |
|
| 840 |
NIL NEW TEST 22: Matrix ordering |
| 841 |
("NEW TEST 22: Matrix ordering") |
| 842 |
NIL |
| 843 |
NIL |
| 844 |
NIL |
| 845 |
NIL algebraic form input> |
| 846 |
T |
| 847 |
#\X |
| 848 |
% No. of Spolynomials calculated until degree 3: 0 |
| 849 |
% Time: 2060 |
| 850 |
|
| 851 |
% No. of Spolynomials calculated until degree 5: 0 |
| 852 |
% Time: 2080 |
| 853 |
|
| 854 |
% No. of Spolynomials calculated until degree 6: 0 |
| 855 |
% Time: 2090 |
| 856 |
|
| 857 |
% No. of Spolynomials calculated until degree 7: 1 |
| 858 |
% Time: 2100 |
| 859 |
|
| 860 |
% No. of Spolynomials calculated until degree 8: 3 |
| 861 |
% Time: 2110 |
| 862 |
|
| 863 |
% No. of Spolynomials calculated until degree 9: 6 |
| 864 |
% Time: 2120 |
| 865 |
|
| 866 |
% No. of Spolynomials calculated until degree 10: 7 |
| 867 |
% Time: 2140 |
| 868 |
- All is OK (I hope). Now you may (e. g.): |
| 869 |
- kill bergman with (QUIT); or |
| 870 |
- interrupt bergman with ^Z; or |
| 871 |
- clear the memory with (CLEARIDEAL), and run a new (SIMPLE). |
| 872 |
|
| 873 |
NIL Cleaning the variables |
| 874 |
|
| 875 |
NIL |
| 876 |
NIL |
| 877 |
|
| 878 |
NIL NEW TEST 24: Test input data |
| 879 |
("NEW TEST 24: Test input data") |
| 880 |
NIL |
| 881 |
NIL algebraic form input> |
| 882 |
T |
| 883 |
((4 4) (5 NIL 5 5 5 5) (6)) |
| 884 |
#\X |
| 885 |
T Cleaning the variables |
| 886 |
|
| 887 |
NIL |
| 888 |
NIL Last test finished |
| 889 |
("Last test finished") |
| 890 |
Bye. |