Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

• (no onefirst)
• allfirsts (0)
• allapplications
• derivation
• microsteps

Path 1

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