Exercise

Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

onefirst
allfirsts (1)
allapplications
derivation
microsteps

Path 1

path [0, 1, 3, 0, 0, 2, 0, 2, 1, 0, 0, 3, 3]
steps 13
major rules 2
active labels
dnf

enter dnf, check, enter eliminateimplequiv, logic.propositional.defimpl, exit eliminateimplequiv, check, navigator.down, navigator.right, check, navigator.down, check, enter eliminateimplequiv, logic.propositional.defequiv

path	[0, 1, 3, 0, 0, 2, 0, 2, 1, 0, 0, 3, 3]
steps	13
major rules	2
active labels	dnf