Exercise

Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

onefirst
allfirsts (1)
allapplications
derivation
microsteps

Path 1

path [0, 2, 0, 2, 0, 0, 4, 0, 0, 2, 0, 0, 0, 4]
steps 14
major rules 2
active labels
dnf

enter dnf, check, navigator.down, navigator.right, check, enter simplify, logic.propositional.notnot, exit simplify, navigator.up, check, navigator.down, check, enter simplify, logic.propositional.notnot

path	[0, 2, 0, 2, 0, 0, 4, 0, 0, 2, 0, 0, 0, 4]
steps	14
major rules	2
active labels	dnf