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