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