Exercise

Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

onefirst
allfirsts (3)
allapplications
derivation
microsteps

Path 1

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

enter dnf, check, navigator.down, check, enter specialdemorgannot, check, logic.propositional.gendemorganor, exit specialdemorgannot, navigator.up, check, navigator.down, navigator.right, check, enter specialdemorgannot, check, logic.propositional.gendemorganor

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