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