Exercise logic.propositional.cnf.unicode
Description
Proposition to CNF (unicode support)
Derivation
Final term is not finished
(T ∧ ¬(r ↔ r)) ∨ ¬(T ∧ r ∧ (r ↔ r)) ∨ (¬(¬F ∧ r) ∧ ¬(T ∧ r))
⇒ logic.propositional.notfalse(T ∧ ¬(r ↔ r)) ∨ ¬(T ∧ r ∧ (r ↔ r)) ∨ (¬(T ∧ r) ∧ ¬(T ∧ r))