Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

Feedback

Path 1

path[]
steps0
major rules0
active labels