Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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