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