Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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