Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

path	[0, 2, 0, 0, 0, 1, 2]
steps	7
major rules	1
active labels	dnf simplify andrules