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