Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

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