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