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