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