Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.notnot

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