Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

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