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, 2, 0, 0, 5, 4, 0, 0, 0, 2, 0, 0, 0, 5, 5, 5, 6, 1, 1] |
| steps | 21 |
| major rules | 2 |
| active labels | |
enter dnf,
check,
navigator.down,
navigator.right,
check,
enter simplify,
navigator.down,
logic.propositional.notnot,
navigator.up,
exit simplify,
navigator.up,
check,
navigator.down,
check,
enter simplify,
navigator.down,
navigator.down,
navigator.down,
navigator.right,
enter andrules,
logic.propositional.truezeroand