Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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