Exercise

Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

onefirst
allfirsts (2)
allapplications
derivation
microsteps

Path 1

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

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

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