Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroand

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