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