Exercise

Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

onefirst
allfirsts (2)
allapplications
derivation
microsteps

Path 1

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

enter dnf, check, navigator.down, navigator.right, check, navigator.down, navigator.right, check, navigator.down, check, enter simplify, navigator.down, enter andrules, logic.propositional.truezeroand

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