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