Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.absorpand

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