Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.defequiv

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.absorpand

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