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