Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

• onefirst
• allfirsts (1)
• allapplications
• derivation
• microsteps

Path 1

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