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