Exercise

Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

onefirst
allfirsts (2)
allapplications
derivation
microsteps

Path 1

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

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

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