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