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