Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.notnot

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