Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

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