Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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