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