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