Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroor

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