Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

¬(r ↔ r) ∨ ¬(T ∨ F) ∨ (¬r ∧ T)

⇒ logic.propositional.truezeroand

¬(r ↔ r) ∨ ¬(T ∨ F) ∨ ¬r