Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

¬((((r ↔ r) ∨ F) ∧ T ∧ r) ∨ (((r ↔ r) ∨ (r ↔ (r ∧ T))) ∧ T ∧ r)) ∨ F

⇒ logic.propositional.truezeroand

¬((((r ↔ r) ∨ F) ∧ T ∧ r) ∨ (((r ↔ r) ∨ (r ↔ r)) ∧ T ∧ r)) ∨ F