Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.defequiv

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.absorpand

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