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