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