Exercise

Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

onefirst
allfirsts (1)
allapplications
derivation
microsteps

Path 1

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

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

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