Exercise

Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

onefirst
allfirsts (1)
allapplications
derivation
microsteps

Path 1

path [0, 0, 0, 0, 1, 3, 1, 0, 0, 0, 1, 2, 0, 1]
steps 14
major rules 3
active labels
dnf
specialdemorgannot

enter dnf, enter orrules, logic.propositional.falsezeroor, exit orrules, check, enter eliminateimplequiv, navigator.down, logic.propositional.defimpl, navigator.up, exit eliminateimplequiv, check, enter specialdemorgannot, check, logic.propositional.demorganor

path	[0, 0, 0, 0, 1, 3, 1, 0, 0, 0, 1, 2, 0, 1]
steps	14
major rules	3
active labels	dnf specialdemorgannot