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