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