Mhh, the thing triggering the AssertionError is assert(self._solver.okay())
so what seems to be happening is that by the time you add x4 + x5 the solver has figured out that the problem has no solution. AssertError is certainly a user unfriendly error to raise. It should be a ZeroDivision error perhaps. Can you open a ticket so we don't forget to fix that? On Friday 05 Apr 2013, Santanu Sarkar wrote: > R.<x0, x1, x2, x3, x4, x5>=BooleanPolynomialRing(6) > > C=[x0, x0 + x1, x1 + x2, x3, x2 + 1, x4 +x5] > tt=cputime() > > I = Ideal(C) > > import sage.sat.boolean_polynomials > B= sage.sat.boolean_polynomials.solve(I.gens()) Cheers, Martin -- name: Martin Albrecht _pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99 _otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF _www: http://martinralbrecht.wordpress.com/ _jab: [email protected] -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sage-support?hl=en. For more options, visit https://groups.google.com/groups/opt_out.
