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