Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

Feedback

Path 1

path[]
steps0
major rules0
active labels