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