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