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 (1)
• allapplications
• derivation
• microsteps

Path 1

path	[0, 1, 0, 4, 0, 1, 2, 2, 0, 1]
steps	10
major rules	2
active labels	dnf specialdemorgannot