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