Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.absorpand

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