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