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