Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.defequiv

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.absorpand

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

⇒ logic.propositional.truezeroand

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