Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

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