Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

path	[0, 1, 2, 0, 1, 0, 1, 0, 4]
steps	9
major rules	2
active labels	dnf simplify