Exercise

Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

(no onefirst)
allfirsts (0)
allapplications
derivation
microsteps

Path 1

path [0, 1, 0, 4, 0, 2, 0, 2, 0, 3, 3]
steps 11
major rules 2
active labels
dnf
eliminateimplequiv

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

path	[0, 1, 0, 4, 0, 2, 0, 2, 0, 3, 3]
steps	11
major rules	2
active labels	dnf eliminateimplequiv