Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.notnot

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

⇒ logic.propositional.notnot

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