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