Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

• onefirst
• allfirsts (11)
• allapplications
• derivation
• microsteps

Path 1

path	[]
steps	0
major rules	0
active labels