Exercise

Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

(no onefirst)
allfirsts (0)
allapplications
derivation
microsteps

Path 1

path [0, 1, 0, 4, 0, 1, 3, 1, 0, 0, 0, 1, 2, 0, 1, 0, 1, 0, 5, 4]
steps 20
major rules 4
active labels
dnf

enter dnf, check, enter simplify, logic.propositional.notnot, exit simplify, check, enter eliminateimplequiv, navigator.down, logic.propositional.defimpl, navigator.up, exit eliminateimplequiv, check, enter specialdemorgannot, check, logic.propositional.demorganor, exit specialdemorgannot, check, enter simplify, navigator.down, logic.propositional.notnot

path	[0, 1, 0, 4, 0, 1, 3, 1, 0, 0, 0, 1, 2, 0, 1, 0, 1, 0, 5, 4]
steps	20
major rules	4
active labels	dnf