Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

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