Exercise

Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

onefirst
allfirsts (3)
allapplications
derivation
microsteps

Path 1

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

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

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