Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.nottrue

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