Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.compland

((r ↔ r) ∧ ¬F ∧ r) → F