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