Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.notnot

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

⇒ logic.propositional.falsezeroor

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