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