Exercise

Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

onefirst
allfirsts (3)
allapplications
derivation
microsteps

Path 1

path [0, 2, 0, 0, 0, 5, 6, 0, 2, 0, 0, 0, 0, 2, 0, 0, 3, 1, 1, 0]
steps 20
major rules 2
active labels
dnf
eliminateimplequiv

enter dnf, check, navigator.down, check, enter simplify, navigator.down, navigator.right, enter orrules, logic.propositional.idempor, exit orrules, navigator.up, exit simplify, navigator.up, check, navigator.down, check, enter eliminateimplequiv, navigator.down, navigator.down, logic.propositional.defimpl

path	[0, 2, 0, 0, 0, 5, 6, 0, 2, 0, 0, 0, 0, 2, 0, 0, 3, 1, 1, 0]
steps	20
major rules	2
active labels	dnf eliminateimplequiv