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