Exercise logic.propositional.cnf.unicode
Description
Proposition to CNF (unicode support)
Derivation
Final term is not finished¬((r ↔ (r ∧ T)) ∧ T ∧ r) ∧ ¬(r ∧ (r ↔ (r ∧ T)) ∧ T)
⇒ logic.propositional.truezeroand¬((r ↔ (r ∧ T)) ∧ T ∧ r) ∧ ¬(r ∧ (r ↔ (r ∧ T)))
⇒ logic.propositional.truezeroand¬((r ↔ (r ∧ T)) ∧ T ∧ r) ∧ ¬(r ∧ (r ↔ r))
⇒ logic.propositional.defequiv¬((r ↔ (r ∧ T)) ∧ T ∧ r) ∧ ¬(r ∧ ((r ∧ r) ∨ (¬r ∧ ¬r)))
⇒ logic.propositional.idempand¬((r ↔ (r ∧ T)) ∧ T ∧ r) ∧ ¬(r ∧ (r ∨ (¬r ∧ ¬r)))
⇒ logic.propositional.absorpand¬((r ↔ (r ∧ T)) ∧ T ∧ r) ∧ ¬r