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