Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

path	[0, 2, 0, 0, 0, 1, 1]
steps	7
major rules	1
active labels	dnf simplify andrules