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