Exercise

Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

onefirst
allfirsts (5)
allapplications
derivation
microsteps

Path 1

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

enter dnf, check, navigator.down, check, enter simplify, enter andrules, logic.propositional.idempand, exit andrules, exit simplify, navigator.up, check, navigator.down, check, enter simplify, navigator.down, navigator.down, enter orrules, logic.propositional.falsezeroor

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