Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

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