Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

path	[0, 1, 0, 5, 6, 5, 6, 4]
steps	8
major rules	1
active labels	dnf simplify