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