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