Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

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