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