Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

Feedback

Path 1

path[]
steps0
major rules0
active labels