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