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