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