Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

path	[0]
steps	1
major rules	0
active labels	dnf