Exercise

Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

onefirst
allfirsts (3)
allapplications
derivation
microsteps

Path 1

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

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

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