Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.notnot

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

⇒ logic.propositional.truezeroand

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