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