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, 0, 1, 1, 0, 0, 2, 0, 0, 3, 3, 0, 0, 0, 3] |
steps | 16 |
major rules | 3 |
active labels | |
enter dnf,
check,
enter simplify,
enter andrules,
logic.propositional.truezeroand,
exit andrules,
exit simplify,
check,
navigator.down,
check,
enter eliminateimplequiv,
logic.propositional.defequiv,
exit eliminateimplequiv,
navigator.up,
enter orrules,
logic.propositional.absorpor