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