Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroand

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