Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

Feedback

Path 1

path[]
steps0
major rules0
active labels