Exercise

Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

(no onefirst)
allfirsts (0)
allapplications
derivation
microsteps

Path 1

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

enter dnf, check, enter simplify, enter andrules, logic.propositional.truezeroand, exit andrules, exit simplify, check, enter eliminateimplequiv, logic.propositional.defimpl

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