Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroand

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