Exercise

Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

(no onefirst)
allfirsts (0)
allapplications
derivation
microsteps

Path 1

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

enter dnf, check, enter simplify, navigator.down, logic.propositional.notfalse, navigator.up, exit simplify, check, enter simplify, logic.propositional.nottrue

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