Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

path	[0, 1, 3, 3, 0, 2, 0, 2, 0, 0, 5, 4]
steps	12
major rules	2
active labels	dnf simplify