Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

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