Exercise

Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

onefirst
allfirsts (1)
allapplications
derivation
microsteps

Path 1

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

enter dnf, check, enter eliminateimplequiv, navigator.down, navigator.right, navigator.down, logic.propositional.defequiv, navigator.up, navigator.up, exit eliminateimplequiv, check, enter simplify, navigator.down, navigator.right, enter orrules, logic.propositional.absorpor

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