Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

Feedback

Path 1

path[]
steps0
major rules0
active labels