Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
All applications
Rule | defimpl.inv |
Location | [1,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (s → (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [] |
F ∨ (T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s))))
ready: no
Rule | falsezeroor.inv |
Location | [] |
(T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))) ∨ F
ready: no
Rule | falsezeroor.inv |
Location | [0] |
(F ∨ T) ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [0] |
(T ∨ F) ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1] |
T ∧ (F ∨ ((¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))))
ready: no
Rule | falsezeroor.inv |
Location | [1] |
T ∧ (((¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))) ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,0] |
T ∧ (F ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s))) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,0] |
T ∧ ((¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∨ F) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0] |
T ∧ ((F ∨ ¬(q → p)) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0] |
T ∧ ((¬(q → p) ∨ F) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0,0] |
T ∧ (¬(F ∨ (q → p)) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0,0] |
T ∧ (¬((q → p) ∨ F) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0,0,0] |
T ∧ (¬((F ∨ q) → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0,0,0] |
T ∧ (¬((q ∨ F) → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0,0,1] |
T ∧ (¬(q → (F ∨ p)) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,0,0,0,1] |
T ∧ (¬(q → (p ∨ F)) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,0,1] |
T ∧ (¬(q → p) ↔ (F ∨ (r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,0,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s ∨ F)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,0,1,0] |
T ∧ (¬(q → p) ↔ (F ∨ (r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,0,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ F ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,0,1,0,0] |
T ∧ (¬(q → p) ↔ (((F ∨ r) ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,0,1,0,0] |
T ∧ (¬(q → p) ↔ (((r ∨ F) ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,0,1,0,1] |
T ∧ (¬(q → p) ↔ ((r ↔ (F ∨ s)) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,0,1,0,1] |
T ∧ (¬(q → p) ↔ ((r ↔ (s ∨ F)) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,0,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ F ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,0,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s ∨ F)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,0,1,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(F ∨ s))) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,0,1,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∨ F))) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (F ∨ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s))))
ready: no
Rule | falsezeroor.inv |
Location | [1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ ((¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s))) ∨ F)
ready: no
Rule | falsezeroor.inv |
Location | [1,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ ((F ∨ ¬((q → p) ∨ (q → p))) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ ((¬((q → p) ∨ (q → p)) ∨ F) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬(F ∨ (q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p) ∨ F) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,0,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬(F ∨ (q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,0,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ F ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,0,0,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬(((F ∨ q) → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,0,0,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬(((q ∨ F) → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,0,0,0,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → (F ∨ p)) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,0,0,0,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → (p ∨ F)) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,0,0,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ F ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,0,0,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p) ∨ F) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,0,0,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ ((F ∨ q) → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,0,0,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ ((q ∨ F) → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,0,0,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → (F ∨ p))) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,0,0,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → (p ∨ F))) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (F ∨ ¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s) ∨ F))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (F ∨ ¬s ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ F ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬(F ∨ s) ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬(s ∨ F) ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ F ∨ (r ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s) ∨ F))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ ((F ∨ r) ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ ((r ∨ F) ↔ s)))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ (F ∨ s))))
ready: no
Rule | falsezeroor.inv |
Location | [1,1,1,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ (s ∨ F))))
ready: no
Rule | idempand.inv |
Location | [] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s))) ∧ T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempand.inv |
Location | [0] |
T ∧ T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempand.inv |
Location | [1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s))) ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempand.inv |
Location | [1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempand.inv |
Location | [1,0,0] |
T ∧ ((¬(q → p) ∧ ¬(q → p)) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempand.inv |
Location | [1,0,0,0] |
T ∧ (¬((q → p) ∧ (q → p)) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempand.inv |
Location | [1,0,0,0,0] |
T ∧ (¬((q ∧ q) → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempand.inv |
Location | [1,0,0,0,1] |
T ∧ (¬(q → (p ∧ p)) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempand.inv |
Location | [1,0,1] |
T ∧ (¬(q → p) ↔ (((r ↔ s) ∨ ¬s) ∧ ((r ↔ s) ∨ ¬s))) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempand.inv |
Location | [1,0,1,0] |
T ∧ (¬(q → p) ↔ (((r ↔ s) ∧ (r ↔ s)) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempand.inv |
Location | [1,0,1,0,0] |
T ∧ (¬(q → p) ↔ (((r ∧ r) ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempand.inv |
Location | [1,0,1,0,1] |
T ∧ (¬(q → p) ↔ ((r ↔ (s ∧ s)) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempand.inv |
Location | [1,0,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ (¬s ∧ ¬s))) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempand.inv |
Location | [1,0,1,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ s))) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempand.inv |
Location | [1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s))) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempand.inv |
Location | [1,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ ((¬((q → p) ∨ (q → p)) ∧ ¬((q → p) ∨ (q → p))) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempand.inv |
Location | [1,1,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬(((q → p) ∨ (q → p)) ∧ ((q → p) ∨ (q → p))) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempand.inv |
Location | [1,1,0,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬(((q → p) ∧ (q → p)) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempand.inv |
Location | [1,1,0,0,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬(((q ∧ q) → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempand.inv |
Location | [1,1,0,0,0,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → (p ∧ p)) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempand.inv |
Location | [1,1,0,0,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ ((q → p) ∧ (q → p))) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempand.inv |
Location | [1,1,0,0,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ ((q ∧ q) → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempand.inv |
Location | [1,1,0,0,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → (p ∧ p))) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempand.inv |
Location | [1,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ ((¬s ∨ (r ↔ s)) ∧ (¬s ∨ (r ↔ s))))
ready: no
Rule | idempand.inv |
Location | [1,1,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ ((¬s ∧ ¬s) ∨ (r ↔ s)))
ready: no
Rule | idempand.inv |
Location | [1,1,1,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬(s ∧ s) ∨ (r ↔ s)))
ready: no
Rule | idempand.inv |
Location | [1,1,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ ((r ↔ s) ∧ (r ↔ s))))
ready: no
Rule | idempand.inv |
Location | [1,1,1,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ ((r ∧ r) ↔ s)))
ready: no
Rule | idempand.inv |
Location | [1,1,1,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ (s ∧ s))))
ready: no
Rule | idempor.inv |
Location | [] |
(T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))) ∨ (T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s))))
ready: no
Rule | idempor.inv |
Location | [0] |
(T ∨ T) ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempor.inv |
Location | [1] |
T ∧ (((¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))) ∨ ((¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))))
ready: no
Rule | idempor.inv |
Location | [1,0] |
T ∧ ((¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s))) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempor.inv |
Location | [1,0,0] |
T ∧ ((¬(q → p) ∨ ¬(q → p)) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempor.inv |
Location | [1,0,0,0] |
T ∧ (¬((q → p) ∨ (q → p)) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempor.inv |
Location | [1,0,0,0,0] |
T ∧ (¬((q ∨ q) → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempor.inv |
Location | [1,0,0,0,1] |
T ∧ (¬(q → (p ∨ p)) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempor.inv |
Location | [1,0,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s ∨ (r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempor.inv |
Location | [1,0,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ (r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempor.inv |
Location | [1,0,1,0,0] |
T ∧ (¬(q → p) ↔ (((r ∨ r) ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempor.inv |
Location | [1,0,1,0,1] |
T ∧ (¬(q → p) ↔ ((r ↔ (s ∨ s)) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempor.inv |
Location | [1,0,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempor.inv |
Location | [1,0,1,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∨ s))) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempor.inv |
Location | [1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ ((¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s))) ∨ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s))))
ready: no
Rule | idempor.inv |
Location | [1,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ ((¬((q → p) ∨ (q → p)) ∨ ¬((q → p) ∨ (q → p))) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempor.inv |
Location | [1,1,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p) ∨ (q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempor.inv |
Location | [1,1,0,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempor.inv |
Location | [1,1,0,0,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬(((q ∨ q) → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempor.inv |
Location | [1,1,0,0,0,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → (p ∨ p)) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempor.inv |
Location | [1,1,0,0,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempor.inv |
Location | [1,1,0,0,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ ((q ∨ q) → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempor.inv |
Location | [1,1,0,0,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → (p ∨ p))) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | idempor.inv |
Location | [1,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s) ∨ ¬s ∨ (r ↔ s)))
ready: no
Rule | idempor.inv |
Location | [1,1,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ ¬s ∨ (r ↔ s)))
ready: no
Rule | idempor.inv |
Location | [1,1,1,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬(s ∨ s) ∨ (r ↔ s)))
ready: no
Rule | idempor.inv |
Location | [1,1,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s) ∨ (r ↔ s)))
ready: no
Rule | idempor.inv |
Location | [1,1,1,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ ((r ∨ r) ↔ s)))
ready: no
Rule | idempor.inv |
Location | [1,1,1,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ (s ∨ s))))
ready: no
Rule | logic.propositional.assocand |
Location | [] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | logic.propositional.buggy.commimp |
Location | [1,0,0,0] |
Rule | logic.propositional.buggy.commimp |
Location | [1,1,0,0,0] |
Rule | logic.propositional.buggy.commimp |
Location | [1,1,0,0,1] |
Rule | logic.propositional.buggy.defimpl.inv |
Location | [1,0,1] |
Rule | logic.propositional.buggy.defimpl.inv |
Location | [1,1,0] |
Rule | logic.propositional.buggy.defimpl.inv |
Location | [1,1,1] |
Rule | logic.propositional.buggy.demorgan1 |
Location | [1,1,0] |
Rule | logic.propositional.buggy.demorgan1 |
Location | [1,1,0] |
Rule | logic.propositional.buggy.demorgan1 |
Location | [1,1,0] |
Rule | logic.propositional.buggy.demorgan2 |
Location | [1,1,0] |
Rule | logic.propositional.buggy.demorgan4 |
Location | [1,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.equivelim1 |
Location | [1,0] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1,0,1,0] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1,0,1,0] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1,0,1,0] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1,0,1,0] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1,0,1,0] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1,1] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1,1] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1,1] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1,1] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1,1] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1,1,1,1] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1,1,1,1] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1,1,1,1] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1,1,1,1] |
Rule | logic.propositional.buggy.equivelim1 |
Location | [1,1,1,1] |
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.equivelim2 |
Location | [1,0,1,0] |
Rule | logic.propositional.buggy.equivelim2 |
Location | [1,0,1,0] |
Rule | logic.propositional.buggy.equivelim2 |
Location | [1,0,1,0] |
Rule | logic.propositional.buggy.equivelim2 |
Location | [1,1] |
Rule | logic.propositional.buggy.equivelim2 |
Location | [1,1] |
Rule | logic.propositional.buggy.equivelim2 |
Location | [1,1] |
Rule | logic.propositional.buggy.equivelim2 |
Location | [1,1,1,1] |
Rule | logic.propositional.buggy.equivelim2 |
Location | [1,1,1,1] |
Rule | logic.propositional.buggy.equivelim2 |
Location | [1,1,1,1] |
Rule | logic.propositional.buggy.equivelim3 |
Location | [1,0] |
Rule | logic.propositional.buggy.equivelim3 |
Location | [1,0,1,0] |
Rule | logic.propositional.buggy.equivelim3 |
Location | [1,1] |
Rule | logic.propositional.buggy.equivelim3 |
Location | [1,1,1,1] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [0] |
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,1] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,0,1,0] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,0,1,0,0] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,0,1,0,1] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,0,1,1] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,0,1,1,0] |
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,0,0] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,1,0,0,0,0] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,1,0,0,0,1] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,1,0,0,1] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,1,0,0,1,0] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,1,0,0,1,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,1] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,1,1,1,0] |
Rule | logic.propositional.buggy.idemequiv.inv |
Location | [1,1,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 | [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,1] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,0,1,0] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,0,1,0,0] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,0,1,0,1] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,0,1,1] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,0,1,1,0] |
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,0,0] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,1,0,0,0,0] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,1,0,0,0,1] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,1,0,0,1] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,1,0,0,1,0] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,1,0,0,1,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,1] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,1,1,1,0] |
Rule | logic.propositional.buggy.idemimp.inv |
Location | [1,1,1,1,1] |
Rule | logic.propositional.buggy.implelim |
Location | [1,0,0,0] |
Rule | logic.propositional.buggy.implelim |
Location | [1,0,0,0] |
Rule | logic.propositional.buggy.implelim |
Location | [1,0,0,0] |
Rule | logic.propositional.buggy.implelim |
Location | [1,0,0,0] |
Rule | logic.propositional.buggy.implelim |
Location | [1,1,0,0,0] |
Rule | logic.propositional.buggy.implelim |
Location | [1,1,0,0,0] |
Rule | logic.propositional.buggy.implelim |
Location | [1,1,0,0,0] |
Rule | logic.propositional.buggy.implelim |
Location | [1,1,0,0,0] |
Rule | logic.propositional.buggy.implelim |
Location | [1,1,0,0,1] |
Rule | logic.propositional.buggy.implelim |
Location | [1,1,0,0,1] |
Rule | logic.propositional.buggy.implelim |
Location | [1,1,0,0,1] |
Rule | logic.propositional.buggy.implelim |
Location | [1,1,0,0,1] |
Rule | logic.propositional.buggy.implelim1 |
Location | [1,0,0,0] |
Rule | logic.propositional.buggy.implelim1 |
Location | [1,1,0,0,0] |
Rule | logic.propositional.buggy.implelim1 |
Location | [1,1,0,0,1] |
Rule | logic.propositional.buggy.implelim2 |
Location | [1,0,0,0] |
Rule | logic.propositional.buggy.implelim2 |
Location | [1,1,0,0,0] |
Rule | logic.propositional.buggy.implelim2 |
Location | [1,1,0,0,1] |
Rule | logic.propositional.buggy.notoverimpl |
Location | [1,0,0] |
Rule | logic.propositional.buggy.orsame |
Location | [1,1,0,0] |
Rule | logic.propositional.buggy.parenth1 |
Location | [1,1,0] |
Rule | logic.propositional.buggy.trueprop |
Location | [] |
Rule | logic.propositional.buggy.trueprop |
Location | [] |
Rule | logic.propositional.command |
Location | [] |
(¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s))) ∧ T
ready: no
Rule | logic.propositional.command |
Location | [] |
(¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s))) ∧ T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s))
ready: no
Rule | logic.propositional.command |
Location | [] |
(¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ T ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | logic.propositional.command |
Location | [] |
T ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s))) ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s))
ready: no
Rule | logic.propositional.command |
Location | [1] |
T ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s))) ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s))
ready: no
Rule | logic.propositional.commor |
Location | [1,0,1] |
T ∧ (¬(q → p) ↔ (¬s ∨ (r ↔ s))) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | logic.propositional.commor |
Location | [1,1,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | logic.propositional.commor |
Location | [1,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ ((r ↔ s) ∨ ¬s))
ready: no
Rule | logic.propositional.defequiv |
Location | [1,0] |
T ∧ ((¬(q → p) ∧ ((r ↔ s) ∨ ¬s)) ∨ (¬¬(q → p) ∧ ¬((r ↔ s) ∨ ¬s))) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | logic.propositional.defequiv |
Location | [1,0,1,0] |
T ∧ (¬(q → p) ↔ ((r ∧ s) ∨ (¬r ∧ ¬s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | logic.propositional.defequiv |
Location | [1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ ((¬((q → p) ∨ (q → p)) ∧ (¬s ∨ (r ↔ s))) ∨ (¬¬((q → p) ∨ (q → p)) ∧ ¬(¬s ∨ (r ↔ s))))
ready: no
Rule | logic.propositional.defequiv |
Location | [1,1,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ∧ s) ∨ (¬r ∧ ¬s)))
ready: no
Rule | logic.propositional.defimpl |
Location | [1,0,0,0] |
T ∧ (¬(¬q ∨ p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | logic.propositional.defimpl |
Location | [1,1,0,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬(¬q ∨ p ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | logic.propositional.defimpl |
Location | [1,1,0,0,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ ¬q ∨ p) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | logic.propositional.demorganor |
Location | [1,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ ((¬(q → p) ∧ ¬(q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | logic.propositional.idempor |
Location | [1,1,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬(q → p) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | logic.propositional.truezeroand |
Location | [] |
(¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | logic.propositional.truezeroand |
Location | [] |
(¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | notfalse.inv |
Location | [0] |
¬F ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
¬¬(T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s))))
ready: no
Rule | notnot.inv |
Location | [0] |
¬¬T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | notnot.inv |
Location | [1] |
T ∧ ¬¬((¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s))))
ready: no
Rule | notnot.inv |
Location | [1,0] |
T ∧ ¬¬(¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | notnot.inv |
Location | [1,0,0] |
T ∧ (¬¬¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | notnot.inv |
Location | [1,0,0,0] |
T ∧ (¬¬¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | notnot.inv |
Location | [1,0,0,0,0] |
T ∧ (¬(¬¬q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | notnot.inv |
Location | [1,0,0,0,1] |
T ∧ (¬(q → ¬¬p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | notnot.inv |
Location | [1,0,1] |
T ∧ (¬(q → p) ↔ ¬¬((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | notnot.inv |
Location | [1,0,1,0] |
T ∧ (¬(q → p) ↔ (¬¬(r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | notnot.inv |
Location | [1,0,1,0,0] |
T ∧ (¬(q → p) ↔ ((¬¬r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | notnot.inv |
Location | [1,0,1,0,1] |
T ∧ (¬(q → p) ↔ ((r ↔ ¬¬s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | notnot.inv |
Location | [1,0,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬¬¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | notnot.inv |
Location | [1,0,1,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬¬¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | notnot.inv |
Location | [1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ ¬¬(¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | notnot.inv |
Location | [1,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬¬¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | notnot.inv |
Location | [1,1,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬¬¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | notnot.inv |
Location | [1,1,0,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬(¬¬(q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | notnot.inv |
Location | [1,1,0,0,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((¬¬q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | notnot.inv |
Location | [1,1,0,0,0,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → ¬¬p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | notnot.inv |
Location | [1,1,0,0,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ ¬¬(q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | notnot.inv |
Location | [1,1,0,0,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (¬¬q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | notnot.inv |
Location | [1,1,0,0,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → ¬¬p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | notnot.inv |
Location | [1,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ ¬¬(¬s ∨ (r ↔ s)))
ready: no
Rule | notnot.inv |
Location | [1,1,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬¬¬s ∨ (r ↔ s)))
ready: no
Rule | notnot.inv |
Location | [1,1,1,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬¬¬s ∨ (r ↔ s)))
ready: no
Rule | notnot.inv |
Location | [1,1,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ ¬¬(r ↔ s)))
ready: no
Rule | notnot.inv |
Location | [1,1,1,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (¬¬r ↔ s)))
ready: no
Rule | notnot.inv |
Location | [1,1,1,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ ¬¬s)))
ready: no
Rule | truezeroand.inv |
Location | [] |
T ∧ T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s))) ∧ T
ready: no
Rule | truezeroand.inv |
Location | [0] |
T ∧ T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [0] |
T ∧ T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1] |
T ∧ T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s))) ∧ T
ready: no
Rule | truezeroand.inv |
Location | [1,0] |
T ∧ T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ T ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,0,0] |
T ∧ ((T ∧ ¬(q → p)) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,0,0] |
T ∧ ((¬(q → p) ∧ T) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,0,0,0] |
T ∧ (¬(T ∧ (q → p)) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,0,0,0] |
T ∧ (¬((q → p) ∧ T) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,0,0,0,0] |
T ∧ (¬((T ∧ q) → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,0,0,0,0] |
T ∧ (¬((q ∧ T) → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,0,0,0,1] |
T ∧ (¬(q → (T ∧ p)) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,0,0,0,1] |
T ∧ (¬(q → (p ∧ T)) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,0,1] |
T ∧ (¬(q → p) ↔ (T ∧ ((r ↔ s) ∨ ¬s))) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,0,1] |
T ∧ (¬(q → p) ↔ (((r ↔ s) ∨ ¬s) ∧ T)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,0,1,0] |
T ∧ (¬(q → p) ↔ ((T ∧ (r ↔ s)) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,0,1,0] |
T ∧ (¬(q → p) ↔ (((r ↔ s) ∧ T) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,0,1,0,0] |
T ∧ (¬(q → p) ↔ (((T ∧ r) ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,0,1,0,0] |
T ∧ (¬(q → p) ↔ (((r ∧ T) ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,0,1,0,1] |
T ∧ (¬(q → p) ↔ ((r ↔ (T ∧ s)) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,0,1,0,1] |
T ∧ (¬(q → p) ↔ ((r ↔ (s ∧ T)) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,0,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ (T ∧ ¬s))) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,0,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ (¬s ∧ T))) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,0,1,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(T ∧ s))) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,0,1,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬(s ∧ T))) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ T ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s))) ∧ T
ready: no
Rule | truezeroand.inv |
Location | [1,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ ((T ∧ ¬((q → p) ∨ (q → p))) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ ((¬((q → p) ∨ (q → p)) ∧ T) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬(T ∧ ((q → p) ∨ (q → p))) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬(((q → p) ∨ (q → p)) ∧ T) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,0,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((T ∧ (q → p)) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,0,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬(((q → p) ∧ T) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,0,0,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬(((T ∧ q) → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,0,0,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬(((q ∧ T) → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,0,0,0,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → (T ∧ p)) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,0,0,0,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → (p ∧ T)) ∨ (q → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,0,0,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (T ∧ (q → p))) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,0,0,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ ((q → p) ∧ T)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,0,0,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ ((T ∧ q) → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,0,0,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ ((q ∧ T) → p)) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,0,0,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → (T ∧ p))) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,0,0,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → (p ∧ T))) ↔ (¬s ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (T ∧ (¬s ∨ (r ↔ s))))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ ((¬s ∨ (r ↔ s)) ∧ T))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ ((T ∧ ¬s) ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ ((¬s ∧ T) ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬(T ∧ s) ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,0,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬(s ∧ T) ∨ (r ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (T ∧ (r ↔ s))))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ ((r ↔ s) ∧ T)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ ((T ∧ r) ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,1,0] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ ((r ∧ T) ↔ s)))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ (T ∧ s))))
ready: no
Rule | truezeroand.inv |
Location | [1,1,1,1,1] |
T ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ (¬((q → p) ∨ (q → p)) ↔ (¬s ∨ (r ↔ (s ∧ T))))
ready: no