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