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