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