Exercise

Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

onefirst
allfirsts (2)
allapplications
derivation
microsteps

Path 1

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

enter dnf, check, enter eliminateimplequiv, logic.propositional.defequiv, exit eliminateimplequiv, check, navigator.down, check, enter eliminateimplequiv, navigator.down, navigator.down, logic.propositional.defimpl

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