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