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