Z3 now has a satisfiability engine for nonlinear real arithmetic based on cylindrical algebraic decomposition.
Is there any way to obtain the result of quantifier elimination, as opposed to mere satisfiability testing?
The following does not work:
from z3 import *
b,c,x = Reals('b c x')
f = Exists(x, b*x+c==0);
print Tactic('qe')(f).as_expr();
I would like to get something like Or(b!=0, And(b==0, c==0)).
Thanks.