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, 1, 3, 3, 0, 2, 0, 0, 3, 1, 1, 0, 0, 0, 0, 0, 2, 0, 0, 2, 2, 0, 1] |
| steps | 23 |
| major rules | 3 |
| active labels | |
enter dnf,
check,
enter eliminateimplequiv,
logic.propositional.defequiv,
exit eliminateimplequiv,
check,
navigator.down,
check,
enter eliminateimplequiv,
navigator.down,
navigator.down,
logic.propositional.defimpl,
navigator.up,
navigator.up,
exit eliminateimplequiv,
navigator.up,
check,
navigator.down,
check,
enter specialdemorgannot,
navigator.down,
check,
logic.propositional.demorganor