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