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