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