Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.compland

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