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