Exercise

Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

¬(q → p) ↔ (F ∨ (r ∧ s) ∨ ¬s)

ready: no

Feedback

(no onefirst)
allfirsts (0)
allapplications
derivation
microsteps

Path 1

path [0, 2, 0, 2, 1, 0, 2, 0, 0, 5, 1, 1, 0, 0, 0, 0, 0, 0, 3]
steps 19
major rules 2
active labels
dnf
orrules

enter dnf, check, navigator.down, navigator.right, check, navigator.down, navigator.right, check, enter simplify, navigator.down, enter andrules, logic.propositional.truezeroand, exit andrules, navigator.up, exit simplify, navigator.up, navigator.up, enter orrules, logic.propositional.absorpor

path	[0, 2, 0, 2, 1, 0, 2, 0, 0, 5, 1, 1, 0, 0, 0, 0, 0, 0, 3]
steps	19
major rules	2
active labels	dnf orrules