Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

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