Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.notnot

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

⇒ logic.propositional.truezeroand

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