Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

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