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