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