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