Hi all,
Im trying to convert a formula do CNF to get the diferent clauses of the formula.
Imagine this formula:
{ a in S : (all s in S all t in S exists u ) a * s = a * u <-> a * t = u * a }
How doi insert the quantifyers "for all" and "exists" sympy.
I tryed something like prover9 format but with no luck.
Thanks in advance.