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