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