Dear Developers,

I'm new to Reduce. I tried to run the following code on Ubuntu 11.04, 64 bit, own compiled Reduce (rev 1511, -with-csl -with-wx). Here is the code I entered:

load groebner; torder({a1,a2,b1,b2,c1,c2,d1,d2,e1,e2,f1,f2,g1,g2,h1,h2,i1,i2,j1,j2},'lex); groebner({a1*(b2 - c2) + a2*( - b1 + c1) + b1*c2 - b2*c1,d1*(e2 - f2) + d2*( - e1 + f1) + e1*f2 - e2*f1,a1*( - e2 + h2) + a2*(e1 - h1) - e1*h2 + e2*h1,b1*(d2 - h2) + b2*( - d1 + h1) + d1*h2 - d2*h1,c1*(d2 - i2) + c2*( - d1 + i1) + d1*i2 - d2*i1,a1*( - f2 + i2) + a2*(f1 - i1) - f1*i2 + f2*i1,c1*(e2 - j2) + c2*( - e1 + j1) + e1*j2 - e2*j1,b1*( - f2 + j2) + b2*(f1 - j1) - f1*j2 + f2*j1,a1*(b2*z2 - d2*z2) + a2*( - b1*z2 + d1*z2) + b1*d2*z2 - b2*d1*z2 - 1,a1*(b2*z3 - e2*z3) + a2*( - b1*z3 + e1*z3) + b1*e2*z3 - b2*e1*z3 - 1,h1*(i2*z1 - j2*z1) + h2*( - i1*z1 + j1*z1) + i1*j2*z1 - i2*j1*z1 - 1});

The result can be seen here:

However the calculation stopped after 6 seconds, I got two "Memory access violation detected" errors, but I was unable to continue my work, even by requesting Break. Reduce was still eating my CPU and only exiting helped.

I also learned that Reduce doesn't like too long lines. About over 512 characters it seems to truncate the input.

Thank you for your help in advance,

Zoltan