Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.compland

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