Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
All applications
Rule | complor.sort |
Location | [1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ (r ↔ s) ∨ ¬(s ∧ s) ∨ ¬(s ∧ s)))
ready: no
Rule | complor.sort |
Location | [1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ ¬(s ∧ s) ∨ (r ↔ s)))
ready: no
Rule | defimpl.inv |
Location | [1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ((s ∧ s) → ((r ↔ s) ∨ ¬(s ∧ s)))))
ready: no
Rule | defimpl.inv |
Location | [1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ((s ∧ s) → (r ↔ s)) ∨ ¬(s ∧ s)))
ready: no
Rule | defimpl.inv |
Location | [1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ((s ∧ s) → ((r ↔ s) ∨ ¬(s ∧ s)))))
ready: no
Rule | defimpl.inv |
Location | [1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ((s ∧ s) → (r ↔ s)) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [] |
F ∨ (F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s))) ∨ F
ready: no
Rule | falsezeroor.inv |
Location | [0] |
F ∨ (F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [0] |
(F ∧ F) ∨ F ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [0,0] |
((F ∨ F) ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [0,0] |
((F ∨ F) ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [0,1] |
(F ∧ (F ∨ F)) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [0,1] |
(F ∧ (F ∨ F)) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1] |
(F ∧ F) ∨ F ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s))) ∨ F
ready: no
Rule | falsezeroor.inv |
Location | [1,0] |
(F ∧ F) ∨ ((F ∨ ¬(q → p)) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,0] |
(F ∧ F) ∨ ((¬(q → p) ∨ F) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0] |
(F ∧ F) ∨ (¬(F ∨ (q → p)) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0] |
(F ∧ F) ∨ (¬((q → p) ∨ F) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0,0] |
(F ∧ F) ∨ (¬((F ∨ q) → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0,0] |
(F ∧ F) ∨ (¬((q ∨ F) → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0,1] |
(F ∧ F) ∨ (¬(q → (F ∨ p)) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0,1] |
(F ∧ F) ∨ (¬(q → (p ∨ F)) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ (F ∨ (r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s) ∨ F))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ (F ∨ (r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ F ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ (((F ∨ r) ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ (((r ∨ F) ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,0,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ (F ∨ s)) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,0,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ (s ∨ F)) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ F ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s) ∨ F))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ F ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ F ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(F ∨ (s ∧ s)) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬((s ∧ s) ∨ F) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,0,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬((F ∨ s) ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,0,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬((s ∨ F) ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,0,0,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ (F ∨ s)) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,0,0,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ (s ∨ F)) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ F ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s) ∨ F))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ F ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ F ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,1,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ ((F ∨ r) ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,1,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ ((r ∨ F) ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,1,0,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ (F ∨ s)) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,1,0,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ (s ∨ F)) ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ F ∨ ¬(s ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s) ∨ F))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(F ∨ (s ∧ s))))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬((s ∧ s) ∨ F)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,1,1,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬((F ∨ s) ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,1,1,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬((s ∨ F) ∧ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,1,1,0,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ (F ∨ s))))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,1,1,0,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ (s ∨ F))))
ready: no
Rule | idempand.inv |
Location | [] |
((F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))) ∧ ((F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s))))
ready: no
Rule | idempand.inv |
Location | [0] |
(F ∧ F ∧ F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempand.inv |
Location | [0,0] |
(F ∧ F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempand.inv |
Location | [0,1] |
(F ∧ F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempand.inv |
Location | [1] |
(F ∧ F) ∨ ((¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s))) ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s))))
ready: no
Rule | idempand.inv |
Location | [1,0] |
(F ∧ F) ∨ ((¬(q → p) ∧ ¬(q → p)) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempand.inv |
Location | [1,0,0] |
(F ∧ F) ∨ (¬((q → p) ∧ (q → p)) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempand.inv |
Location | [1,0,0,0] |
(F ∧ F) ∨ (¬((q ∧ q) → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempand.inv |
Location | [1,0,0,1] |
(F ∧ F) ∨ (¬(q → (p ∧ p)) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempand.inv |
Location | [1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ (((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)) ∧ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s))))
ready: no
Rule | idempand.inv |
Location | [1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ (((r ↔ s) ∧ (r ↔ s)) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempand.inv |
Location | [1,1,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ (((r ∧ r) ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempand.inv |
Location | [1,1,0,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ (s ∧ s)) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempand.inv |
Location | [1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ((¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)) ∧ (¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))))
ready: no
Rule | idempand.inv |
Location | [1,1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ (¬(s ∧ s) ∧ ¬(s ∧ s)) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempand.inv |
Location | [1,1,1,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s ∧ s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempand.inv |
Location | [1,1,1,0,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempand.inv |
Location | [1,1,1,0,0,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempand.inv |
Location | [1,1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (((r ↔ s) ∨ ¬(s ∧ s)) ∧ ((r ↔ s) ∨ ¬(s ∧ s)))))
ready: no
Rule | idempand.inv |
Location | [1,1,1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ ((r ↔ s) ∧ (r ↔ s)) ∨ ¬(s ∧ s)))
ready: no
Rule | idempand.inv |
Location | [1,1,1,1,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ ((r ∧ r) ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempand.inv |
Location | [1,1,1,1,0,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ (s ∧ s)) ∨ ¬(s ∧ s)))
ready: no
Rule | idempand.inv |
Location | [1,1,1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ (¬(s ∧ s) ∧ ¬(s ∧ s))))
ready: no
Rule | idempand.inv |
Location | [1,1,1,1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s ∧ s ∧ s)))
ready: no
Rule | idempand.inv |
Location | [1,1,1,1,1,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s ∧ s)))
ready: no
Rule | idempand.inv |
Location | [1,1,1,1,1,0,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s ∧ s)))
ready: no
Rule | idempor.inv |
Location | [] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s))) ∨ (F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempor.inv |
Location | [0] |
(F ∧ F) ∨ (F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempor.inv |
Location | [0,0] |
((F ∨ F) ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempor.inv |
Location | [0,1] |
(F ∧ (F ∨ F)) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempor.inv |
Location | [1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s))) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempor.inv |
Location | [1,0] |
(F ∧ F) ∨ ((¬(q → p) ∨ ¬(q → p)) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempor.inv |
Location | [1,0,0] |
(F ∧ F) ∨ (¬((q → p) ∨ (q → p)) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempor.inv |
Location | [1,0,0,0] |
(F ∧ F) ∨ (¬((q ∨ q) → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempor.inv |
Location | [1,0,0,1] |
(F ∧ F) ∨ (¬(q → (p ∨ p)) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempor.inv |
Location | [1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempor.inv |
Location | [1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ (r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempor.inv |
Location | [1,1,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ (((r ∨ r) ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempor.inv |
Location | [1,1,0,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ (s ∨ s)) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempor.inv |
Location | [1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempor.inv |
Location | [1,1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempor.inv |
Location | [1,1,1,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬((s ∧ s) ∨ (s ∧ s)) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempor.inv |
Location | [1,1,1,0,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬((s ∨ s) ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempor.inv |
Location | [1,1,1,0,0,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ (s ∨ s)) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempor.inv |
Location | [1,1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempor.inv |
Location | [1,1,1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempor.inv |
Location | [1,1,1,1,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ ((r ∨ r) ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempor.inv |
Location | [1,1,1,1,0,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ (s ∨ s)) ∨ ¬(s ∧ s)))
ready: no
Rule | idempor.inv |
Location | [1,1,1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s) ∨ ¬(s ∧ s)))
ready: no
Rule | idempor.inv |
Location | [1,1,1,1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬((s ∧ s) ∨ (s ∧ s))))
ready: no
Rule | idempor.inv |
Location | [1,1,1,1,1,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬((s ∨ s) ∧ s)))
ready: no
Rule | idempor.inv |
Location | [1,1,1,1,1,0,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ (s ∨ s))))
ready: no
Rule | logic.propositional.assocor |
Location | [1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | logic.propositional.assocor |
Location | [1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | logic.propositional.assocor |
Location | [1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | logic.propositional.assocor |
Location | [1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | logic.propositional.assocor |
Location | [1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | logic.propositional.assocor |
Location | [1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | logic.propositional.buggy.andsame |
Location | [0] |
Rule | logic.propositional.buggy.andsame |
Location | [1,1,1,0,0] |
Rule | logic.propositional.buggy.andsame |
Location | [1,1,1,1,1,0] |
Rule | logic.propositional.buggy.assoc |
Location | [] |
Rule | logic.propositional.buggy.commimp |
Location | [1,0,0] |
Rule | logic.propositional.buggy.defimpl.inv |
Location | [1,1] |
Rule | logic.propositional.buggy.defimpl.inv |
Location | [1,1] |
Rule | logic.propositional.buggy.defimpl.inv |
Location | [1,1] |
Rule | logic.propositional.buggy.defimpl.inv |
Location | [1,1] |
Rule | logic.propositional.buggy.defimpl.inv |
Location | [1,1] |
Rule | logic.propositional.buggy.defimpl.inv |
Location | [1,1] |
Rule | logic.propositional.buggy.defimpl.inv |
Location | [1,1,1] |
Rule | logic.propositional.buggy.defimpl.inv |
Location | [1,1,1] |
Rule | logic.propositional.buggy.defimpl.inv |
Location | [1,1,1] |
Rule | logic.propositional.buggy.defimpl.inv |
Location | [1,1,1] |
Rule | logic.propositional.buggy.defimpl.inv |
Location | [1,1,1,1] |
Rule | logic.propositional.buggy.demorgan1 |
Location | [1,1,1,0] |
Rule | logic.propositional.buggy.demorgan1 |
Location | [1,1,1,0] |
Rule | logic.propositional.buggy.demorgan1 |
Location | [1,1,1,0] |
Rule | logic.propositional.buggy.demorgan1 |
Location | [1,1,1,1,1] |
Rule | logic.propositional.buggy.demorgan1 |
Location | [1,1,1,1,1] |
Rule | logic.propositional.buggy.demorgan1 |
Location | [1,1,1,1,1] |
Rule | logic.propositional.buggy.demorgan2 |
Location | [1,1,1,0] |
Rule | logic.propositional.buggy.demorgan2 |
Location | [1,1,1,1,1] |
Rule | logic.propositional.buggy.demorgan3 |
Location | [1,1,1,0] |
Rule | logic.propositional.buggy.demorgan3 |
Location | [1,1,1,1,1] |
Rule | logic.propositional.buggy.distr |
Location | [] |
Rule | logic.propositional.buggy.distr |
Location | [] |
Rule | logic.propositional.buggy.distr.inv |
Location | [1,1] |
Rule | logic.propositional.buggy.distr.inv |
Location | [1,1] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1,1,0] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1,1,0] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1,1,0] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1,1,0] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1,1,0] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1,1,1,1,0] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1,1,1,1,0] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1,1,1,1,0] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1,1,1,1,0] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1,1,1,1,0] |
Rule | logic.propositional.buggy.equivelim2 |
Location | [1] |
Rule | logic.propositional.buggy.equivelim2 |
Location | [1] |
Rule | logic.propositional.buggy.equivelim2 |
Location | [1] |
Rule | logic.propositional.buggy.equivelim2 |
Location | [1,1,0] |
Rule | logic.propositional.buggy.equivelim2 |
Location | [1,1,0] |
Rule | logic.propositional.buggy.equivelim2 |
Location | [1,1,0] |
Rule | logic.propositional.buggy.equivelim2 |
Location | [1,1,1,1,0] |
Rule | logic.propositional.buggy.equivelim2 |
Location | [1,1,1,1,0] |
Rule | logic.propositional.buggy.equivelim2 |
Location | [1,1,1,1,0] |
Rule | logic.propositional.buggy.equivelim3 |
Location | [1] |
Rule | logic.propositional.buggy.equivelim3 |
Location | [1,1,0] |
Rule | logic.propositional.buggy.equivelim3 |
Location | [1,1,1,1,0] |
Rule | logic.propositional.buggy.falseprop |
Location | [0] |
Rule | logic.propositional.buggy.falseprop |
Location | [0] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [0] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [0,0] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [0,1] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,0] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,0,0] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,0,0,0] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,0,0,1] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,1] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,1,0] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,1,0,0] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,1,0,1] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,1,1] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,1,1,0] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,1,1,0,0] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,1,1,0,0,0] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,1,1,0,0,1] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,1,1,1] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,1,1,1,0] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,1,1,1,0,0] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,1,1,1,0,1] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,1,1,1,1] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,1,1,1,1,0] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,1,1,1,1,0,0] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,1,1,1,1,0,1] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [0] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [0,0] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [0,1] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,0] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,0,0] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,0,0,0] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,0,0,1] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,1] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,1,0] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,1,0,0] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,1,0,1] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,1,1] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,1,1,0] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,1,1,0,0] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,1,1,0,0,0] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,1,1,0,0,1] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,1,1,1] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,1,1,1,0] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,1,1,1,0,0] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,1,1,1,0,1] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,1,1,1,1] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,1,1,1,1,0] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,1,1,1,1,0,0] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,1,1,1,1,0,1] |
Rule | logic.propositional.buggy.implelim |
Location | [1,0,0] |
Rule | logic.propositional.buggy.implelim |
Location | [1,0,0] |
Rule | logic.propositional.buggy.implelim |
Location | [1,0,0] |
Rule | logic.propositional.buggy.implelim |
Location | [1,0,0] |
Rule | logic.propositional.buggy.implelim1 |
Location | [1,0,0] |
Rule | logic.propositional.buggy.implelim2 |
Location | [1,0,0] |
Rule | logic.propositional.buggy.notoverimpl |
Location | [1,0] |
Rule | logic.propositional.buggy.orsame |
Location | [1,1] |
Rule | logic.propositional.buggy.parenth1 |
Location | [1,1,1,0] |
Rule | logic.propositional.buggy.parenth1 |
Location | [1,1,1,1,1] |
Rule | logic.propositional.command |
Location | [0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | logic.propositional.command |
Location | [1,1,1,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | logic.propositional.command |
Location | [1,1,1,1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | logic.propositional.commor |
Location | [] |
(¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s))) ∨ (F ∧ F)
ready: no
Rule | logic.propositional.commor |
Location | [1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ (¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s)))
ready: no
Rule | logic.propositional.commor |
Location | [1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | logic.propositional.commor |
Location | [1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ (¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s)))
ready: no
Rule | logic.propositional.commor |
Location | [1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ (¬(s ∧ s) ∨ (r ↔ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | logic.propositional.commor |
Location | [1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ (¬(s ∧ s) ∨ (r ↔ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | logic.propositional.commor |
Location | [1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ (r ↔ s) ∨ ¬(s ∧ s) ∨ ¬(s ∧ s)))
ready: no
Rule | logic.propositional.commor |
Location | [1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ (r ↔ s) ∨ ¬(s ∧ s) ∨ ¬(s ∧ s)))
ready: no
Rule | logic.propositional.commor |
Location | [1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ ¬(s ∧ s) ∨ (r ↔ s)))
ready: no
Rule | logic.propositional.commor |
Location | [1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ ¬(s ∧ s) ∨ (r ↔ s)))
ready: no
Rule | logic.propositional.commor |
Location | [1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ (r ↔ s) ∨ ¬(s ∧ s) ∨ ¬(s ∧ s)))
ready: no
Rule | logic.propositional.commor |
Location | [1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ (r ↔ s) ∨ ¬(s ∧ s) ∨ ¬(s ∧ s)))
ready: no
Rule | logic.propositional.commor |
Location | [1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ ¬(s ∧ s) ∨ (r ↔ s)))
ready: no
Rule | logic.propositional.commor |
Location | [1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ (r ↔ s) ∨ ¬(s ∧ s) ∨ ¬(s ∧ s)))
ready: no
Rule | logic.propositional.commor |
Location | [1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ ¬(s ∧ s) ∨ (r ↔ s)))
ready: no
Rule | logic.propositional.commor |
Location | [1,1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ ¬(s ∧ s) ∨ (r ↔ s)))
ready: no
Rule | logic.propositional.defequiv |
Location | [1] |
(F ∧ F) ∨ (¬(q → p) ∧ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s))) ∨ (¬¬(q → p) ∧ ¬((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | logic.propositional.defequiv |
Location | [1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ∧ s) ∨ (¬r ∧ ¬s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | logic.propositional.defequiv |
Location | [1,1,1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ∧ s) ∨ (¬r ∧ ¬s) ∨ ¬(s ∧ s)))
ready: no
Rule | logic.propositional.defimpl |
Location | [1,0,0] |
(F ∧ F) ∨ (¬(¬q ∨ p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | logic.propositional.demorganand |
Location | [1,1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s ∨ ¬s ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | logic.propositional.demorganand |
Location | [1,1,1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬s ∨ ¬s))
ready: no
Rule | logic.propositional.falsezeroand |
Location | [0] |
F ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | logic.propositional.idempand |
Location | [0] |
F ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | logic.propositional.idempand |
Location | [1,1,1,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | logic.propositional.idempand |
Location | [1,1,1,1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬s))
ready: no
Rule | logic.propositional.idempor |
Location | [1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | logic.propositional.oroverand |
Location | [] |
(F ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))) ∧ (F ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s))))
ready: no
¬¬((F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s))))
ready: no
Rule | notnot.inv |
Location | [0] |
¬¬(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | notnot.inv |
Location | [0,0] |
(¬¬F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | notnot.inv |
Location | [0,1] |
(F ∧ ¬¬F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | notnot.inv |
Location | [1] |
(F ∧ F) ∨ ¬¬(¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | notnot.inv |
Location | [1,0] |
(F ∧ F) ∨ (¬¬¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | notnot.inv |
Location | [1,0,0] |
(F ∧ F) ∨ (¬¬¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | notnot.inv |
Location | [1,0,0,0] |
(F ∧ F) ∨ (¬(¬¬q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | notnot.inv |
Location | [1,0,0,1] |
(F ∧ F) ∨ (¬(q → ¬¬p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | notnot.inv |
Location | [1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ¬¬((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | notnot.inv |
Location | [1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ (¬¬(r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | notnot.inv |
Location | [1,1,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((¬¬r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | notnot.inv |
Location | [1,1,0,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ ¬¬s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | notnot.inv |
Location | [1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬¬(¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s))))
ready: no
Rule | notnot.inv |
Location | [1,1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬¬¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | notnot.inv |
Location | [1,1,1,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬¬¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | notnot.inv |
Location | [1,1,1,0,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(¬¬s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | notnot.inv |
Location | [1,1,1,0,0,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ ¬¬s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | notnot.inv |
Location | [1,1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ ¬¬((r ↔ s) ∨ ¬(s ∧ s))))
ready: no
Rule | notnot.inv |
Location | [1,1,1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ ¬¬(r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | notnot.inv |
Location | [1,1,1,1,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (¬¬r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | notnot.inv |
Location | [1,1,1,1,0,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ ¬¬s) ∨ ¬(s ∧ s)))
ready: no
Rule | notnot.inv |
Location | [1,1,1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬¬¬(s ∧ s)))
ready: no
Rule | notnot.inv |
Location | [1,1,1,1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬¬¬(s ∧ s)))
ready: no
Rule | notnot.inv |
Location | [1,1,1,1,1,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(¬¬s ∧ s)))
ready: no
Rule | notnot.inv |
Location | [1,1,1,1,1,0,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ ¬¬s)))
ready: no
Rule | nottrue.inv |
Location | [0,0] |
(¬T ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | nottrue.inv |
Location | [0,1] |
(F ∧ ¬T) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [] |
T ∧ ((F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s))))
ready: no
Rule | truezeroand.inv |
Location | [] |
((F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))) ∧ T
ready: no
Rule | truezeroand.inv |
Location | [0] |
(T ∧ F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [0] |
(F ∧ F ∧ T) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [0,0] |
(T ∧ F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [0,0] |
(F ∧ T ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [0,1] |
(F ∧ T ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [0,1] |
(F ∧ F ∧ T) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1] |
(F ∧ F) ∨ (T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s))))
ready: no
Rule | truezeroand.inv |
Location | [1] |
(F ∧ F) ∨ ((¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s))) ∧ T)
ready: no
Rule | truezeroand.inv |
Location | [1,0] |
(F ∧ F) ∨ ((T ∧ ¬(q → p)) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,0] |
(F ∧ F) ∨ ((¬(q → p) ∧ T) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,0,0] |
(F ∧ F) ∨ (¬(T ∧ (q → p)) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,0,0] |
(F ∧ F) ∨ (¬((q → p) ∧ T) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,0,0,0] |
(F ∧ F) ∨ (¬((T ∧ q) → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,0,0,0] |
(F ∧ F) ∨ (¬((q ∧ T) → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,0,0,1] |
(F ∧ F) ∨ (¬(q → (T ∧ p)) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,0,0,1] |
(F ∧ F) ∨ (¬(q → (p ∧ T)) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ (T ∧ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s))))
ready: no
Rule | truezeroand.inv |
Location | [1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ (((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)) ∧ T))
ready: no
Rule | truezeroand.inv |
Location | [1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((T ∧ (r ↔ s)) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ (((r ↔ s) ∧ T) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ (((T ∧ r) ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ (((r ∧ T) ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,0,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ (T ∧ s)) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,0,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ (s ∧ T)) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ (T ∧ (¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ((¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)) ∧ T)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ (T ∧ ¬(s ∧ s)) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ (¬(s ∧ s) ∧ T) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(T ∧ s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s ∧ T) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,0,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(T ∧ s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,0,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ T ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,0,0,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ T ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,0,0,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s ∧ T) ∨ (r ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (T ∧ ((r ↔ s) ∨ ¬(s ∧ s)))))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (((r ↔ s) ∨ ¬(s ∧ s)) ∧ T)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (T ∧ (r ↔ s)) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ ((r ↔ s) ∧ T) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,1,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ ((T ∧ r) ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,1,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ ((r ∧ T) ↔ s) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,1,0,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ (T ∧ s)) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,1,0,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ (s ∧ T)) ∨ ¬(s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ (T ∧ ¬(s ∧ s))))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,1,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ (¬(s ∧ s) ∧ T)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(T ∧ s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,1,1,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s ∧ T)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,1,1,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(T ∧ s ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,1,1,0,0] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ T ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,1,1,0,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ T ∧ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,1,1,0,1] |
(F ∧ F) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s) ∨ (r ↔ s) ∨ ¬(s ∧ s ∧ T)))
ready: no