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, 0, 5, 5, 6, 1, 1, 0, 0, 0, 0, 1, 2, 0, 0]
steps 16
major rules 2
active labels
dnf
specialdemorgannot

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

path	[0, 1, 0, 5, 5, 6, 1, 1, 0, 0, 0, 0, 1, 2, 0, 0]
steps	16
major rules	2
active labels	dnf specialdemorgannot