Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

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