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 (3)
allapplications
derivation
microsteps

Path 1

path [0, 2, 0, 0, 2, 2, 0, 1, 0, 0, 0, 2, 0, 0, 0, 5, 5, 4]
steps 18
major rules 2
active labels
dnf
simplify

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

path	[0, 2, 0, 0, 2, 2, 0, 1, 0, 0, 0, 2, 0, 0, 0, 5, 5, 4]
steps	18
major rules	2
active labels	dnf simplify