Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

path	[0, 1, 0, 5, 5, 6, 5, 4]
steps	8
major rules	1
active labels	dnf simplify