Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.notnot

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