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