Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
((¬¬q ∧ ¬p) ↔ ((r ↔ s) ∨ ¬s)) ∨ (¬(¬q ∨ p) ↔ ((T ∧ (r ↔ s)) ∨ ¬s))
ready: no
Feedback
Path 1
| path | [0, 2, 0, 0, 0, 5, 6, 5, 1, 1, 0, 0, 0, 0, 0, 2, 0, 0, 2, 2, 0, 1] |
| steps | 22 |
| major rules | 2 |
| active labels | |
enter dnf,
check,
navigator.down,
check,
enter simplify,
navigator.down,
navigator.right,
navigator.down,
enter andrules,
logic.propositional.truezeroand,
exit andrules,
navigator.up,
navigator.up,
exit simplify,
navigator.up,
check,
navigator.down,
check,
enter specialdemorgannot,
navigator.down,
check,
logic.propositional.demorganor