Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.nottrue

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