Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

(¬(q → p) ↔ ((r ∧ s) ∨ ¬s)) ∨ ((¬¬q ∧ ¬p) ↔ ((r ↔ s) ∨ ¬s))
ready: no

Feedback

Path 1

path[0, 2, 0, 0, 3, 2, 2, 0, 1, 0, 0, 0, 0, 2, 0, 0, 0, 5, 6, 0, 3, 0, 0, 0, 0, 2, 0, 2, 0, 3, 1, 1, 0, 0, 0, 0, 0, 2, 0, 2, 0, 2, 2, 0, 1]
steps45
major rules4
active labels
  • dnf
  • specialdemorgannot

enter dnf, check, navigator.down, check, enter eliminateimplequiv, navigator.down, navigator.right, navigator.down, logic.propositional.defequiv, navigator.up, navigator.up, exit eliminateimplequiv, navigator.up, check, navigator.down, check, enter simplify, navigator.down, navigator.right, enter orrules, logic.propositional.absorpor, exit orrules, navigator.up, exit simplify, navigator.up, check, navigator.down, navigator.right, check, enter eliminateimplequiv, navigator.down, navigator.down, logic.propositional.defimpl, navigator.up, navigator.up, exit eliminateimplequiv, navigator.up, check, navigator.down, navigator.right, check, enter specialdemorgannot, navigator.down, check, logic.propositional.demorganor