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