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