Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

Feedback

Path 1

path[]
steps0
major rules0
active labels