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