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