Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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