Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.notnot

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