Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

((¬(¬q ∨ p) ↔ ((r ↔ s) ∨ (¬s ∧ T))) ∨ (¬(¬q ∨ p) ↔ ((r ↔ s) ∨ (¬s ∧ T)))) ∧ ((¬(¬q ∨ p) ↔ ((r ↔ s) ∨ (¬s ∧ T))) ∨ (¬(¬q ∨ p) ↔ ((r ↔ s) ∨ (¬s ∧ T))))
ready: no

Feedback

Path 1

path[]
steps0
major rules0
active labels