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