Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
All applications
Rule | defimpl.inv |
Location | [1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ (s → F))
ready: no
Rule | defimpl.inv |
Location | [1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ (s → F))
ready: no
Rule | falsezeroor.inv |
Location | [] |
F ∨ (¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F))
ready: no
Rule | falsezeroor.inv |
Location | [] |
(¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)) ∨ F
ready: no
Rule | falsezeroor.inv |
Location | [0] |
(F ∨ ¬(q → p)) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [0] |
(¬(q → p) ∨ F) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [0,0] |
¬(F ∨ (q → p)) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [0,0] |
¬((q → p) ∨ F) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [0,0,0] |
¬((F ∨ q) → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [0,0,0] |
¬((q ∨ F) → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [0,0,1] |
¬(q → (F ∨ p)) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [0,0,1] |
¬(q → (p ∨ F)) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1] |
¬(q → p) ↔ (F ∨ (((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,0] |
¬(q → p) ↔ (F ∨ (((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ F ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0] |
¬(q → p) ↔ (((F ∨ ((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r)))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0] |
¬(q → p) ↔ (((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ∨ F) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0,0] |
¬(q → p) ↔ ((((F ∨ T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r) ∨ F) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0,0,0] |
¬(q → p) ↔ ((((F ∨ T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0,0,0] |
¬(q → p) ↔ ((((T ∨ F ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0,0,1] |
¬(q → p) ↔ ((((T ∨ F ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0,0,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r) ∨ F) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0,0,1,0] |
¬(q → p) ↔ ((((T ∨ ((F ∨ T) ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0,0,1,0] |
¬(q → p) ↔ ((((T ∨ ((T ∨ F) ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0,0,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ (F ∨ r))) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0,0,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ (r ∨ F))) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (F ∨ r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r) ∨ F)) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0,1,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (F ∨ r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0,1,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ F ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ F ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r) ∨ F)) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0,1,1,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ ((F ∨ T) ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0,1,1,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ ((T ∨ F) ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0,1,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ (F ∨ r)))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0,1,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ (r ∨ F)))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,0,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ (F ∨ s)) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,0,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ (s ∨ F)) ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ F ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,1,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ F ∨ ¬s ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,1,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,1,0,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬(F ∨ s) ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,1,0,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬(s ∨ F) ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F ∨ F)
ready: no
Rule | idempand.inv |
Location | [] |
(¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)) ∧ (¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F))
ready: no
Rule | idempand.inv |
Location | [0] |
(¬(q → p) ∧ ¬(q → p)) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempand.inv |
Location | [0,0] |
¬((q → p) ∧ (q → p)) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempand.inv |
Location | [0,0,0] |
¬((q ∧ q) → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempand.inv |
Location | [0,0,1] |
¬(q → (p ∧ p)) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempand.inv |
Location | [1] |
¬(q → p) ↔ (((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F) ∧ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F))
ready: no
Rule | idempand.inv |
Location | [1,0] |
¬(q → p) ↔ (((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∧ (((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s)) ∨ ¬s ∨ F)
ready: no
Rule | idempand.inv |
Location | [1,0,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r)) ∧ (T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempand.inv |
Location | [1,0,0,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempand.inv |
Location | [1,0,0,0,0] |
¬(q → p) ↔ (((((T ∧ T) ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempand.inv |
Location | [1,0,0,0,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r ∧ T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempand.inv |
Location | [1,0,0,0,1,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempand.inv |
Location | [1,0,0,0,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempand.inv |
Location | [1,0,0,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempand.inv |
Location | [1,0,0,1,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ ((r ∧ r) ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempand.inv |
Location | [1,0,0,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r ∧ T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempand.inv |
Location | [1,0,0,1,1,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempand.inv |
Location | [1,0,0,1,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempand.inv |
Location | [1,0,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ (s ∧ s)) ∨ ¬s ∨ F)
ready: no
Rule | idempand.inv |
Location | [1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ((¬s ∨ F) ∧ (¬s ∨ F)))
ready: no
Rule | idempand.inv |
Location | [1,1,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ (¬s ∧ ¬s) ∨ F)
ready: no
Rule | idempand.inv |
Location | [1,1,0,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬(s ∧ s) ∨ F)
ready: no
Rule | idempand.inv |
Location | [1,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ (F ∧ F))
ready: no
Rule | idempor.inv |
Location | [] |
(¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)) ∨ (¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F))
ready: no
Rule | idempor.inv |
Location | [0] |
(¬(q → p) ∨ ¬(q → p)) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempor.inv |
Location | [0,0] |
¬((q → p) ∨ (q → p)) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempor.inv |
Location | [0,0,0] |
¬((q ∨ q) → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempor.inv |
Location | [0,0,1] |
¬(q → (p ∨ p)) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempor.inv |
Location | [1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F ∨ (((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempor.inv |
Location | [1,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ (((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempor.inv |
Location | [1,0,0] |
¬(q → p) ↔ (((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ∨ ((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r)))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempor.inv |
Location | [1,0,0,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r) ∨ T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempor.inv |
Location | [1,0,0,0,0] |
¬(q → p) ↔ ((((T ∨ T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempor.inv |
Location | [1,0,0,0,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r) ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempor.inv |
Location | [1,0,0,0,1,0] |
¬(q → p) ↔ ((((T ∨ ((T ∨ T) ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempor.inv |
Location | [1,0,0,0,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ (r ∨ r))) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempor.inv |
Location | [1,0,0,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r) ∨ r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempor.inv |
Location | [1,0,0,1,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempor.inv |
Location | [1,0,0,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r) ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempor.inv |
Location | [1,0,0,1,1,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ ((T ∨ T) ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempor.inv |
Location | [1,0,0,1,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ (r ∨ r)))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | idempor.inv |
Location | [1,0,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ (s ∨ s)) ∨ ¬s ∨ F)
ready: no
Rule | idempor.inv |
Location | [1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F ∨ ¬s ∨ F)
ready: no
Rule | idempor.inv |
Location | [1,1,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ ¬s ∨ F)
ready: no
Rule | idempor.inv |
Location | [1,1,0,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬(s ∨ s) ∨ F)
ready: no
Rule | idempor.inv |
Location | [1,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F ∨ F)
ready: no
Rule | logic.propositional.absorpor |
Location | [1,0,0,0] |
¬(q → p) ↔ (((T ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | logic.propositional.absorpor |
Location | [1,0,0,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ r) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | logic.propositional.andoveror |
Location | [1,0,0] |
¬(q → p) ↔ (((((T ∨ (T ∧ r)) ∧ r) ∨ ((T ∨ (T ∧ r)) ∧ T ∧ r)) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | logic.propositional.andoveror |
Location | [1,0,0] |
¬(q → p) ↔ ((((T ∧ (r ∨ (T ∧ r))) ∨ (T ∧ r ∧ (r ∨ (T ∧ r)))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | logic.propositional.assocor |
Location | [1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | logic.propositional.buggy.assoc |
Location | [1,0,0] |
Rule | logic.propositional.buggy.assoc |
Location | [1,0,0] |
Rule | logic.propositional.buggy.assoc |
Location | [1,0,0,0] |
Rule | logic.propositional.buggy.assoc |
Location | [1,0,0,1] |
Rule | logic.propositional.buggy.commimp |
Location | [0,0] |
Rule | logic.propositional.buggy.defimpl.inv |
Location | [1] |
Rule | logic.propositional.buggy.defimpl.inv |
Location | [1] |
Rule | logic.propositional.buggy.defimpl.inv |
Location | [1,1] |
Rule | logic.propositional.buggy.distr |
Location | [1,0,0] |
Rule | logic.propositional.buggy.distr |
Location | [1,0,0] |
Rule | logic.propositional.buggy.distr |
Location | [1,0,0] |
Rule | logic.propositional.buggy.distr |
Location | [1,0,0] |
Rule | logic.propositional.buggy.distr |
Location | [1,0,0,0] |
Rule | logic.propositional.buggy.distr |
Location | [1,0,0,0] |
Rule | logic.propositional.buggy.distr |
Location | [1,0,0,1] |
Rule | logic.propositional.buggy.distr |
Location | [1,0,0,1] |
Rule | logic.propositional.buggy.distr.inv |
Location | [1,0,0] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1,0] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1,0] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1,0] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1,0] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1,0] |
Rule | logic.propositional.buggy.equivelim2 |
Location | [] |
Rule | logic.propositional.buggy.equivelim2 |
Location | [] |
Rule | logic.propositional.buggy.equivelim2 |
Location | [] |
Rule | logic.propositional.buggy.equivelim2 |
Location | [1,0] |
Rule | logic.propositional.buggy.equivelim2 |
Location | [1,0] |
Rule | logic.propositional.buggy.equivelim2 |
Location | [1,0] |
Rule | logic.propositional.buggy.equivelim3 |
Location | [] |
Rule | logic.propositional.buggy.equivelim3 |
Location | [1,0] |
Rule | logic.propositional.buggy.falseprop |
Location | [1] |
Rule | logic.propositional.buggy.falseprop |
Location | [1] |
Rule | logic.propositional.buggy.falseprop |
Location | [1,1] |
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,0,0] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [0,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,0,0] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,0,0,0,1] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,0,0,0,1,0] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,0,0,0,1,1] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,0,0,1] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,0,0,1,0] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,0,0,1,1] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,0,0,1,1,0] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,0,0,1,1,1] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,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,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,0,0] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [0,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,0,0] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,0,0,0,1] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,0,0,0,1,0] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,0,0,0,1,1] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,0,0,1] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,0,0,1,0] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,0,0,1,1] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,0,0,1,1,0] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,0,0,1,1,1] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,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,1] |
Rule | logic.propositional.buggy.implelim |
Location | [0,0] |
Rule | logic.propositional.buggy.implelim |
Location | [0,0] |
Rule | logic.propositional.buggy.implelim |
Location | [0,0] |
Rule | logic.propositional.buggy.implelim |
Location | [0,0] |
Rule | logic.propositional.buggy.implelim1 |
Location | [0,0] |
Rule | logic.propositional.buggy.implelim2 |
Location | [0,0] |
Rule | logic.propositional.buggy.notoverimpl |
Location | [0] |
Rule | logic.propositional.buggy.trueprop |
Location | [1,0,0,0] |
Rule | logic.propositional.buggy.trueprop |
Location | [1,0,0,0,1] |
Rule | logic.propositional.buggy.trueprop |
Location | [1,0,0,1,1] |
Rule | logic.propositional.command |
Location | [1,0,0] |
¬(q → p) ↔ ((((r ∨ (T ∧ r)) ∧ (T ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | logic.propositional.command |
Location | [1,0,0,0,1] |
¬(q → p) ↔ ((((T ∨ (r ∧ T)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | logic.propositional.command |
Location | [1,0,0,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (r ∧ T))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | logic.propositional.commor |
Location | [1] |
¬(q → p) ↔ (¬s ∨ F ∨ (((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s))
ready: no
Rule | logic.propositional.commor |
Location | [1] |
¬(q → p) ↔ (F ∨ (((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s)
ready: no
Rule | logic.propositional.commor |
Location | [1] |
¬(q → p) ↔ (¬s ∨ (((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ F)
ready: no
Rule | logic.propositional.commor |
Location | [1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ F ∨ ¬s)
ready: no
Rule | logic.propositional.commor |
Location | [1,0,0,0] |
¬(q → p) ↔ (((((T ∧ r) ∨ T) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | logic.propositional.commor |
Location | [1,0,0,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ ((T ∧ r) ∨ r)) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | logic.propositional.commor |
Location | [1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ F ∨ ¬s)
ready: no
Rule | logic.propositional.defequiv |
Location | [] |
(¬(q → p) ∧ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)) ∨ (¬¬(q → p) ∧ ¬((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F))
ready: no
Rule | logic.propositional.defequiv |
Location | [1,0] |
¬(q → p) ↔ (((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r)) ∧ s) ∨ (¬((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ∧ ¬s) ∨ ¬s ∨ F)
ready: no
Rule | logic.propositional.defimpl |
Location | [0,0] |
¬(¬q ∨ p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | logic.propositional.falsezeroor |
Location | [1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s)
ready: no
Rule | logic.propositional.falsezeroor |
Location | [1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s)
ready: no
Rule | logic.propositional.falsezeroor |
Location | [1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s)
ready: no
Rule | logic.propositional.invoroverand |
Location | [1,0,0] |
¬(q → p) ↔ ((((T ∧ r) ∨ (T ∧ r)) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | logic.propositional.oroverand |
Location | [1,0,0,0] |
¬(q → p) ↔ ((((T ∨ T) ∧ (T ∨ r) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | logic.propositional.oroverand |
Location | [1,0,0,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ T) ∧ (r ∨ r)) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | logic.propositional.truezeroand |
Location | [1,0,0,0,1] |
¬(q → p) ↔ ((((T ∨ r) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | logic.propositional.truezeroand |
Location | [1,0,0,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ r)) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | logic.propositional.truezeroor |
Location | [1,0,0,0] |
¬(q → p) ↔ (((T ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | notfalse.inv |
Location | [1,0,0,0,0] |
¬(q → p) ↔ ((((¬F ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | notfalse.inv |
Location | [1,0,0,0,1,0] |
¬(q → p) ↔ ((((T ∨ (¬F ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | notfalse.inv |
Location | [1,0,0,1,1,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (¬F ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
¬¬(¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F))
ready: no
Rule | notnot.inv |
Location | [0] |
¬¬¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | notnot.inv |
Location | [0,0] |
¬¬¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | notnot.inv |
Location | [0,0,0] |
¬(¬¬q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | notnot.inv |
Location | [0,0,1] |
¬(q → ¬¬p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | notnot.inv |
Location | [1] |
¬(q → p) ↔ ¬¬((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | notnot.inv |
Location | [1,0] |
¬(q → p) ↔ (¬¬(((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | notnot.inv |
Location | [1,0,0] |
¬(q → p) ↔ ((¬¬((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | notnot.inv |
Location | [1,0,0,0] |
¬(q → p) ↔ (((¬¬(T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | notnot.inv |
Location | [1,0,0,0,0] |
¬(q → p) ↔ ((((¬¬T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | notnot.inv |
Location | [1,0,0,0,1] |
¬(q → p) ↔ ((((T ∨ ¬¬(T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | notnot.inv |
Location | [1,0,0,0,1,0] |
¬(q → p) ↔ ((((T ∨ (¬¬T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | notnot.inv |
Location | [1,0,0,0,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ ¬¬r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | notnot.inv |
Location | [1,0,0,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ ¬¬(r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | notnot.inv |
Location | [1,0,0,1,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (¬¬r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | notnot.inv |
Location | [1,0,0,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ ¬¬(T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | notnot.inv |
Location | [1,0,0,1,1,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (¬¬T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | notnot.inv |
Location | [1,0,0,1,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ ¬¬r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | notnot.inv |
Location | [1,0,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ ¬¬s) ∨ ¬s ∨ F)
ready: no
Rule | notnot.inv |
Location | [1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬¬(¬s ∨ F))
ready: no
Rule | notnot.inv |
Location | [1,1,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬¬¬s ∨ F)
ready: no
Rule | notnot.inv |
Location | [1,1,0,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬¬¬s ∨ F)
ready: no
Rule | notnot.inv |
Location | [1,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ ¬¬F)
ready: no
Rule | nottrue.inv |
Location | [1,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ ¬T)
ready: no
Rule | oroverand.inv |
Location | [1,0,0] |
¬(q → p) ↔ ((((T ∧ r) ∨ (T ∧ r)) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [] |
T ∧ (¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F))
ready: no
Rule | truezeroand.inv |
Location | [] |
(¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)) ∧ T
ready: no
Rule | truezeroand.inv |
Location | [0] |
(T ∧ ¬(q → p)) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [0] |
(¬(q → p) ∧ T) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [0,0] |
¬(T ∧ (q → p)) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [0,0] |
¬((q → p) ∧ T) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [0,0,0] |
¬((T ∧ q) → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [0,0,0] |
¬((q ∧ T) → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [0,0,1] |
¬(q → (T ∧ p)) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [0,0,1] |
¬(q → (p ∧ T)) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1] |
¬(q → p) ↔ (T ∧ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F))
ready: no
Rule | truezeroand.inv |
Location | [1] |
¬(q → p) ↔ (((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F) ∧ T)
ready: no
Rule | truezeroand.inv |
Location | [1,0] |
¬(q → p) ↔ ((T ∧ (((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s)) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1,0] |
¬(q → p) ↔ (((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∧ T) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1,0,0] |
¬(q → p) ↔ (((T ∧ (T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1,0,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r)) ∧ T) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1,0,0,0] |
¬(q → p) ↔ (((T ∧ (T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1,0,0,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ T ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1,0,0,0,0] |
¬(q → p) ↔ (((((T ∧ T) ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1,0,0,0,0] |
¬(q → p) ↔ (((((T ∧ T) ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1,0,0,0,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1,0,0,0,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r ∧ T)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1,0,0,0,1,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1,0,0,0,1,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1,0,0,0,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1,0,0,0,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r ∧ T)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1,0,0,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ T ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1,0,0,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r)) ∧ T) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1,0,0,1,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ ((T ∧ r) ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1,0,0,1,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ ((r ∧ T) ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1,0,0,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1,0,0,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r ∧ T))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1,0,0,1,1,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1,0,0,1,1,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1,0,0,1,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ T ∧ r))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1,0,0,1,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r ∧ T))) ↔ s) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1,0,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ (T ∧ s)) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1,0,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ (s ∧ T)) ∨ ¬s ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ (T ∧ (¬s ∨ F)))
ready: no
Rule | truezeroand.inv |
Location | [1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ((¬s ∨ F) ∧ T))
ready: no
Rule | truezeroand.inv |
Location | [1,1,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ (T ∧ ¬s) ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1,1,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ (¬s ∧ T) ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1,1,0,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬(T ∧ s) ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1,1,0,0] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬(s ∧ T) ∨ F)
ready: no
Rule | truezeroand.inv |
Location | [1,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ (T ∧ F))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1] |
¬(q → p) ↔ ((((T ∨ (T ∧ r)) ∧ (r ∨ (T ∧ r))) ↔ s) ∨ ¬s ∨ (F ∧ T))
ready: no