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