Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

path	[0, 1, 0, 5, 5, 6, 5, 6, 5, 5, 1, 2]
steps	12
major rules	1
active labels	dnf simplify andrules