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