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