%------------------------------------------------------------------------------ % File : Otter---3.3 % Problem : SWV467+1 : TPTP v8.1.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : otter-tptp-script %s % Computer : n010.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 300s % DateTime : Wed Jul 27 13:20:51 EDT 2022 % Result : Unknown 29.08s 29.25s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : SWV467+1 : TPTP v8.1.0. Released v4.0.0. % 0.06/0.12 % Command : otter-tptp-script %s % 0.12/0.33 % Computer : n010.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Wed Jul 27 05:50:54 EDT 2022 % 0.12/0.33 % CPUTime : % 2.09/2.29 ----- Otter 3.3f, August 2004 ----- % 2.09/2.29 The process was started by sandbox on n010.cluster.edu, % 2.09/2.29 Wed Jul 27 05:50:55 2022 % 2.09/2.29 The command was "./otter". The process ID is 29250. % 2.09/2.29 % 2.09/2.29 set(prolog_style_variables). % 2.09/2.29 set(auto). % 2.09/2.29 dependent: set(auto1). % 2.09/2.29 dependent: set(process_input). % 2.09/2.29 dependent: clear(print_kept). % 2.09/2.29 dependent: clear(print_new_demod). % 2.09/2.29 dependent: clear(print_back_demod). % 2.09/2.29 dependent: clear(print_back_sub). % 2.09/2.29 dependent: set(control_memory). % 2.09/2.29 dependent: assign(max_mem, 12000). % 2.09/2.29 dependent: assign(pick_given_ratio, 4). % 2.09/2.29 dependent: assign(stats_level, 1). % 2.09/2.29 dependent: assign(max_seconds, 10800). % 2.09/2.29 clear(print_given). % 2.09/2.29 % 2.09/2.29 formula_list(usable). % 2.09/2.29 all A (A=A). % 2.09/2.29 all Pid Pid2 (elem(m_Ack(Pid,Pid2),queue(host(Pid)))->setIn(Pid,pids)&setIn(Pid2,pids)). % 2.09/2.29 all P Q (s(host(P))=host(Q)->host(P)!=host(Q)). % 2.09/2.29 all P le_q(s(zero),host(P)). % 2.09/2.29 le_q(s(zero),nbr_proc). % 2.09/2.29 all P le_q(host(P),nbr_proc). % 2.09/2.29 elec_1!=elec_2. % 2.09/2.29 elec_1!=wait. % 2.09/2.29 elec_1!=norm. % 2.09/2.29 elec_2!=wait. % 2.09/2.29 elec_2!=norm. % 2.09/2.29 norm!=wait. % 2.09/2.29 all X Y Z (m_Ack(X,Y)!=m_Halt(Z)). % 2.09/2.29 all X Y Z (m_Ack(X,Y)!=m_Down(Z)). % 2.09/2.29 all X Y Z (m_Ack(X,Y)!=m_NotNorm(Z)). % 2.09/2.29 all X Y Z (m_Ack(X,Y)!=m_Ldr(Z)). % 2.09/2.29 all X Y Z (m_Ack(X,Y)!=m_NormQ(Z)). % 2.09/2.29 all X Y (m_NotNorm(X)!=m_Halt(Y)). % 2.09/2.29 all X Y (m_Down(X)!=m_Halt(Y)). % 2.09/2.29 all X Y (m_Down(X)!=m_Ldr(Y)). % 2.09/2.29 all X Y (m_Down(X)!=m_NotNorm(Y)). % 2.09/2.29 all X Y (m_Down(X)!=m_NormQ(Y)). % 2.09/2.29 all X Y (m_NormQ(X)!=m_Halt(Y)). % 2.09/2.29 all X Y (m_Ldr(X)!=m_Halt(Y)). % 2.09/2.29 all X Y (m_Ldr(X)!=m_NormQ(Y)). % 2.09/2.29 all X Y (m_Ldr(X)!=m_NotNorm(Y)). % 2.09/2.29 all X Y (m_NormQ(X)!=m_NotNorm(Y)). % 2.09/2.29 all X Y (X!=Y<->m_Halt(X)!=m_Halt(Y)). % 2.09/2.29 all X Y (X!=Y<->m_NormQ(X)!=m_NormQ(Y)). % 2.09/2.29 all X Y (X!=Y<->m_NotNorm(X)!=m_NotNorm(Y)). % 2.09/2.29 all X Y (X!=Y<->m_Ldr(X)!=m_Ldr(Y)). % 2.09/2.29 all X Y (X!=Y<->m_Down(X)!=m_Down(Y)). % 2.09/2.29 all X1 X2 Y1 Y2 (X1!=X2->m_Ack(X1,Y1)!=m_Ack(X2,Y2)). % 2.09/2.29 all X1 X2 Y1 Y2 (Y1!=Y2->m_Ack(X1,Y1)!=m_Ack(X2,Y2)). % 2.09/2.29 all Pid Pid2 (host(Pid)!=host(Pid2)->Pid!=Pid2). % 2.09/2.29 -setIn(nil,alive). % 2.09/2.29 all X Q (head(cons(X,Q))=X). % 2.09/2.29 all X Q (tail(cons(X,Q))=Q). % 2.09/2.29 all Y Q (last(snoc(Q,Y))=Y). % 2.09/2.29 all Y Q (init(snoc(Q,Y))=Q). % 2.09/2.29 all Q (Q=q_nil|Q=cons(head(Q),tail(Q))). % 2.09/2.29 all Q (Q=q_nil|Q=snoc(init(Q),last(Q))). % 2.09/2.29 all X Q (q_nil!=cons(X,Q)). % 2.09/2.29 all Y Q (q_nil!=snoc(Q,Y)). % 2.09/2.29 all X (cons(X,q_nil)=snoc(q_nil,X)). % 2.09/2.29 all X Y Q (snoc(cons(X,Q),Y)=cons(X,snoc(Q,Y))). % 2.09/2.29 all X (-elem(X,q_nil)). % 2.09/2.29 all X Y Q (elem(X,cons(Y,Q))<->X=Y|elem(X,Q)). % 2.09/2.29 all X Y Q (elem(X,snoc(Q,Y))<->X=Y|elem(X,Q)). % 2.09/2.29 all X (pidElem(X)<-> (exists Y (X=m_Halt(Y)|X=m_Down(Y)))). % 2.09/2.29 all X (pidMsg(m_Halt(X))=X). % 2.09/2.29 all X (pidMsg(m_Down(X))=X). % 2.09/2.29 ordered(q_nil). % 2.09/2.29 all X (ordered(cons(X,q_nil))&ordered(snoc(q_nil,X))). % 2.09/2.29 all X Q (ordered(cons(X,Q))<->ordered(Q)& (all Y (elem(Y,Q)&pidElem(X)&pidElem(Y)&host(pidMsg(Y))=host(pidMsg(X))->le_q(pidMsg(X),pidMsg(Y))))). % 2.09/2.29 all X Q (ordered(snoc(Q,X))<->ordered(Q)& (all Y (elem(Y,Q)&pidElem(X)&pidElem(Y)&host(pidMsg(Y))=host(pidMsg(X))->le_q(pidMsg(Y),pidMsg(X))))). % 2.09/2.29 all Q X Y (ordered(Q)->ordered(snoc(Q,m_Ack(X,Y)))). % 2.09/2.29 all Q X (ordered(Q)->ordered(snoc(Q,m_Ldr(X)))). % 2.09/2.29 all Q X Y (ordered(cons(m_Halt(X),Q))&host(X)=host(Y)&elem(m_Down(Y),Q)->le_q(X,Y)). % 2.09/2.29 all X (-le_q(s(X),X)). % 2.09/2.29 all X le_q(X,X). % 2.09/2.29 all X Y (le_q(X,Y)|le_q(Y,X)). % 2.09/2.29 all X Y (le_q(X,Y)&le_q(Y,X)<->X=Y). % 2.09/2.29 all X Y Z (le_q(X,Y)&le_q(Y,Z)->le_q(X,Z)). % 2.09/2.29 all X Y (le_q(X,Y)<->le_q(s(X),s(Y))). % 2.09/2.29 all X Y (le_q(X,s(Y))<->X=s(Y)|le_q(X,Y)). % 2.09/2.29 all X (-setIn(X,setEmpty)). % 2.09/2.29 -(all V W X Y ((all Z Pid0 (elem(m_Ldr(Pid0),queue(host(Z)))-> -le_q(host(Z),host(Pid0))))& (all Z Pid0 (elem(m_Down(Pid0),queue(host(Z)))->host(Pid0)!=host(Z)))& (all Z Pid0 (elem(m_Halt(Pid0),queue(host(Z)))-> -le_q(host(Z),host(Pid0))))& (all Z Pid20 Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid20)))-> -le_q(host(Z),host(Pid0))))& (all Z Pid0 (Pid0!=Z&host(Pid0)=host(Z)-> -setIn(Z,alive)| -setIn(Pid0,alive)))& (all Z Pid0 (setIn(Pid0,alive)&elem(m_Ack(Pid0,Z),queue(host(Pid0)))->le_q(host(Z),index(pendack,host(Pid0)))))& (all Z Pid0 (setIn(Pid0,alive)&index(status,host(Pid0))=elec_1-> -elem(m_Ack(Pid0,Z),queue(host(Pid0)))))& (all Z ((index(status,host(Z))=elec_1|index(status,host(Z))=elec_2)&setIn(Z,alive)->index(elid,host(Z))=Z))& (all Z Pid20 Pid0 (setIn(Pid0,alive)&elem(m_Down(Pid20),queue(host(Pid0)))&host(Pid20)=host(Z)-> -(setIn(Z,alive)&index(ldr,host(Z))=host(Z)&index(status,host(Z))=norm)))& (all Z Pid0 (-le_q(host(Z),host(Pid0))&setIn(Z,alive)&setIn(Pid0,alive)&index(status,host(Z))=elec_2&index(status,host(Pid0))=elec_2->le_q(index(pendack,host(Pid0)),host(Z))))& (all Z Pid20 Pid0 (setIn(Z,alive)&setIn(Pid0,alive)&host(Pid0)=host(Pid20)&index(status,host(Z))=elec_2&index(status,host(Pid0))=elec_2-> -elem(m_Ack(Z,Pid20),queue(host(Z)))))& (all Z Pid0 (-le_q(host(Z),host(Pid0))&setIn(Z,alive)&setIn(Pid0,alive)&index(status,host(Z))=elec_2&index(status,host(Pid0))=elec_2-> -le_q(index(pendack,host(Z)),index(pendack,host(Pid0)))))& (all Z Pid20 Pid0 (-le_q(index(pendack,host(Pid0)),host(Z))&setIn(Pid0,alive)&elem(m_Halt(Pid0),queue(host(Pid20)))&index(status,host(Pid0))=elec_2-> -(setIn(Z,alive)&index(ldr,host(Z))=host(Z)&index(status,host(Z))=norm)))& (all Z Pid30 Pid20 Pid0 ((all V0 (-le_q(host(Pid0),V0)&le_q(s(zero),V0)->setIn(V0,index(down,host(Pid0)))|V0=host(Pid20)))&elem(m_Down(Pid20),queue(host(Pid0)))&host(Pid0)=nbr_proc&host(Pid0)=host(Pid30)&index(status,host(Pid0))=elec_1-> -(setIn(Z,alive)&elem(m_Down(Pid30),queue(host(Z))))))& (all Z Pid30 Pid20 Pid0 (setIn(Pid0,alive)&elem(m_Down(Pid20),queue(host(Pid0)))&elem(m_Ack(Pid0,Pid30),queue(host(Pid0)))&le_q(nbr_proc,s(index(pendack,host(Pid0))))&index(status,host(Pid0))=elec_2&host(Pid30)=index(pendack,host(Pid0))&host(Pid20)=s(index(pendack,host(Pid0)))-> -(setIn(Z,alive)&index(ldr,host(Z))=host(Z)&index(status,host(Z))=norm)))&queue(host(X))=cons(m_Down(Y),V)-> (setIn(X,alive)-> (-le_q(host(X),host(Y))-> (-(index(ldr,host(X))=host(Y)&index(status,host(X))=norm|index(status,host(X))=wait&host(Y)=host(index(elid,host(X))))-> ((all Z (-le_q(host(X),Z)&le_q(s(zero),Z)->setIn(Z,index(down,host(X)))|Z=host(Y)))&index(status,host(X))=elec_1-> (le_q(nbr_proc,host(X))-> (all Z (-setIn(host(Z),setEmpty)-> (all V0 (host(X)=host(V0)-> (all W0 X0 Y0 (host(X)!=host(Y0)-> (setIn(Y0,alive)&elem(m_Down(X0),queue(host(Y0)))&elem(m_Ack(Y0,W0),queue(host(Y0)))&le_q(nbr_proc,s(index(pendack,host(Y0))))&index(status,host(Y0))=elec_2&host(W0)=index(pendack,host(Y0))&host(X0)=s(index(pendack,host(Y0)))-> -(setIn(V0,alive)&host(X)=host(V0)))))))))))))))). % 2.09/2.29 end_of_list. % 2.09/2.29 % 2.09/2.29 -------> usable clausifies to: % 2.09/2.29 % 2.09/2.29 list(usable). % 2.09/2.29 0 [] A=A. % 2.09/2.29 0 [] -elem(m_Ack(Pid,Pid2),queue(host(Pid)))|setIn(Pid,pids). % 2.09/2.29 0 [] -elem(m_Ack(Pid,Pid2),queue(host(Pid)))|setIn(Pid2,pids). % 2.09/2.29 0 [] s(host(P))!=host(Q)|host(P)!=host(Q). % 2.09/2.29 0 [] le_q(s(zero),host(P)). % 2.09/2.29 0 [] le_q(s(zero),nbr_proc). % 2.09/2.29 0 [] le_q(host(P),nbr_proc). % 2.09/2.29 0 [] elec_1!=elec_2. % 2.09/2.29 0 [] elec_1!=wait. % 2.09/2.29 0 [] elec_1!=norm. % 2.09/2.29 0 [] elec_2!=wait. % 2.09/2.29 0 [] elec_2!=norm. % 2.09/2.29 0 [] norm!=wait. % 2.09/2.29 0 [] m_Ack(X,Y)!=m_Halt(Z). % 2.09/2.29 0 [] m_Ack(X,Y)!=m_Down(Z). % 2.09/2.29 0 [] m_Ack(X,Y)!=m_NotNorm(Z). % 2.09/2.29 0 [] m_Ack(X,Y)!=m_Ldr(Z). % 2.09/2.29 0 [] m_Ack(X,Y)!=m_NormQ(Z). % 2.09/2.29 0 [] m_NotNorm(X)!=m_Halt(Y). % 2.09/2.29 0 [] m_Down(X)!=m_Halt(Y). % 2.09/2.29 0 [] m_Down(X)!=m_Ldr(Y). % 2.09/2.29 0 [] m_Down(X)!=m_NotNorm(Y). % 2.09/2.29 0 [] m_Down(X)!=m_NormQ(Y). % 2.09/2.29 0 [] m_NormQ(X)!=m_Halt(Y). % 2.09/2.29 0 [] m_Ldr(X)!=m_Halt(Y). % 2.09/2.29 0 [] m_Ldr(X)!=m_NormQ(Y). % 2.09/2.29 0 [] m_Ldr(X)!=m_NotNorm(Y). % 2.09/2.29 0 [] m_NormQ(X)!=m_NotNorm(Y). % 2.09/2.29 0 [] X=Y|m_Halt(X)!=m_Halt(Y). % 2.09/2.29 0 [] X!=Y|m_Halt(X)=m_Halt(Y). % 2.09/2.29 0 [] X=Y|m_NormQ(X)!=m_NormQ(Y). % 2.09/2.29 0 [] X!=Y|m_NormQ(X)=m_NormQ(Y). % 2.09/2.29 0 [] X=Y|m_NotNorm(X)!=m_NotNorm(Y). % 2.09/2.29 0 [] X!=Y|m_NotNorm(X)=m_NotNorm(Y). % 2.09/2.29 0 [] X=Y|m_Ldr(X)!=m_Ldr(Y). % 2.09/2.29 0 [] X!=Y|m_Ldr(X)=m_Ldr(Y). % 2.09/2.29 0 [] X=Y|m_Down(X)!=m_Down(Y). % 2.09/2.29 0 [] X!=Y|m_Down(X)=m_Down(Y). % 2.09/2.29 0 [] X1=X2|m_Ack(X1,Y1)!=m_Ack(X2,Y2). % 2.09/2.29 0 [] Y1=Y2|m_Ack(X1,Y1)!=m_Ack(X2,Y2). % 2.09/2.29 0 [] host(Pid)=host(Pid2)|Pid!=Pid2. % 2.09/2.29 0 [] -setIn(nil,alive). % 2.09/2.29 0 [] head(cons(X,Q))=X. % 2.09/2.29 0 [] tail(cons(X,Q))=Q. % 2.09/2.29 0 [] last(snoc(Q,Y))=Y. % 2.09/2.29 0 [] init(snoc(Q,Y))=Q. % 2.09/2.29 0 [] Q=q_nil|Q=cons(head(Q),tail(Q)). % 2.09/2.29 0 [] Q=q_nil|Q=snoc(init(Q),last(Q)). % 2.09/2.29 0 [] q_nil!=cons(X,Q). % 2.09/2.29 0 [] q_nil!=snoc(Q,Y). % 2.09/2.29 0 [] cons(X,q_nil)=snoc(q_nil,X). % 2.09/2.29 0 [] snoc(cons(X,Q),Y)=cons(X,snoc(Q,Y)). % 2.09/2.29 0 [] -elem(X,q_nil). % 2.09/2.29 0 [] -elem(X,cons(Y,Q))|X=Y|elem(X,Q). % 2.09/2.29 0 [] elem(X,cons(Y,Q))|X!=Y. % 2.09/2.29 0 [] elem(X,cons(Y,Q))| -elem(X,Q). % 2.09/2.29 0 [] -elem(X,snoc(Q,Y))|X=Y|elem(X,Q). % 2.09/2.29 0 [] elem(X,snoc(Q,Y))|X!=Y. % 2.09/2.29 0 [] elem(X,snoc(Q,Y))| -elem(X,Q). % 2.09/2.29 0 [] -pidElem(X)|X=m_Halt($f1(X))|X=m_Down($f1(X)). % 2.09/2.29 0 [] pidElem(X)|X!=m_Halt(Y). % 2.09/2.29 0 [] pidElem(X)|X!=m_Down(Y). % 2.09/2.29 0 [] pidMsg(m_Halt(X))=X. % 2.09/2.29 0 [] pidMsg(m_Down(X))=X. % 2.09/2.29 0 [] ordered(q_nil). % 2.09/2.29 0 [] ordered(cons(X,q_nil)). % 2.09/2.29 0 [] ordered(snoc(q_nil,X)). % 2.09/2.29 0 [] -ordered(cons(X,Q))|ordered(Q). % 2.09/2.29 0 [] -ordered(cons(X,Q))| -elem(Y,Q)| -pidElem(X)| -pidElem(Y)|host(pidMsg(Y))!=host(pidMsg(X))|le_q(pidMsg(X),pidMsg(Y)). % 2.09/2.29 0 [] ordered(cons(X,Q))| -ordered(Q)|elem($f2(X,Q),Q). % 2.09/2.29 0 [] ordered(cons(X,Q))| -ordered(Q)|pidElem(X). % 2.09/2.29 0 [] ordered(cons(X,Q))| -ordered(Q)|pidElem($f2(X,Q)). % 2.09/2.29 0 [] ordered(cons(X,Q))| -ordered(Q)|host(pidMsg($f2(X,Q)))=host(pidMsg(X)). % 2.09/2.29 0 [] ordered(cons(X,Q))| -ordered(Q)| -le_q(pidMsg(X),pidMsg($f2(X,Q))). % 2.09/2.29 0 [] -ordered(snoc(Q,X))|ordered(Q). % 2.09/2.29 0 [] -ordered(snoc(Q,X))| -elem(Y,Q)| -pidElem(X)| -pidElem(Y)|host(pidMsg(Y))!=host(pidMsg(X))|le_q(pidMsg(Y),pidMsg(X)). % 2.09/2.29 0 [] ordered(snoc(Q,X))| -ordered(Q)|elem($f3(X,Q),Q). % 2.09/2.29 0 [] ordered(snoc(Q,X))| -ordered(Q)|pidElem(X). % 2.09/2.29 0 [] ordered(snoc(Q,X))| -ordered(Q)|pidElem($f3(X,Q)). % 2.09/2.29 0 [] ordered(snoc(Q,X))| -ordered(Q)|host(pidMsg($f3(X,Q)))=host(pidMsg(X)). % 2.09/2.29 0 [] ordered(snoc(Q,X))| -ordered(Q)| -le_q(pidMsg($f3(X,Q)),pidMsg(X)). % 2.09/2.29 0 [] -ordered(Q)|ordered(snoc(Q,m_Ack(X,Y))). % 2.09/2.29 0 [] -ordered(Q)|ordered(snoc(Q,m_Ldr(X))). % 2.09/2.29 0 [] -ordered(cons(m_Halt(X),Q))|host(X)!=host(Y)| -elem(m_Down(Y),Q)|le_q(X,Y). % 2.09/2.29 0 [] -le_q(s(X),X). % 2.09/2.29 0 [] le_q(X,X). % 2.09/2.29 0 [] le_q(X,Y)|le_q(Y,X). % 2.09/2.29 0 [] -le_q(X,Y)| -le_q(Y,X)|X=Y. % 2.09/2.29 0 [] le_q(X,Y)|X!=Y. % 2.09/2.29 0 [] le_q(Y,X)|X!=Y. % 2.09/2.29 0 [] -le_q(X,Y)| -le_q(Y,Z)|le_q(X,Z). % 2.09/2.29 0 [] -le_q(X,Y)|le_q(s(X),s(Y)). % 2.09/2.29 0 [] le_q(X,Y)| -le_q(s(X),s(Y)). % 2.09/2.29 0 [] -le_q(X,s(Y))|X=s(Y)|le_q(X,Y). % 2.09/2.29 0 [] le_q(X,s(Y))|X!=s(Y). % 2.09/2.29 0 [] le_q(X,s(Y))| -le_q(X,Y). % 2.09/2.29 0 [] -setIn(X,setEmpty). % 2.09/2.29 0 [] -elem(m_Ldr(Pid0),queue(host(Z)))| -le_q(host(Z),host(Pid0)). % 2.09/2.29 0 [] -elem(m_Down(X4),queue(host(X3)))|host(X4)!=host(X3). % 2.09/2.29 0 [] -elem(m_Halt(X6),queue(host(X5)))| -le_q(host(X5),host(X6)). % 2.09/2.29 0 [] -elem(m_Ack(X8,X7),queue(host(Pid20)))| -le_q(host(X7),host(X8)). % 2.09/2.29 0 [] X10=X9|host(X10)!=host(X9)| -setIn(X9,alive)| -setIn(X10,alive). % 2.09/2.29 0 [] -setIn(X12,alive)| -elem(m_Ack(X12,X11),queue(host(X12)))|le_q(host(X11),index(pendack,host(X12))). % 2.09/2.29 0 [] -setIn(X14,alive)|index(status,host(X14))!=elec_1| -elem(m_Ack(X14,X13),queue(host(X14))). % 2.09/2.29 0 [] index(status,host(X15))!=elec_1| -setIn(X15,alive)|index(elid,host(X15))=X15. % 2.09/2.29 0 [] index(status,host(X15))!=elec_2| -setIn(X15,alive)|index(elid,host(X15))=X15. % 2.09/2.29 0 [] -setIn(X18,alive)| -elem(m_Down(X17),queue(host(X18)))|host(X17)!=host(X16)| -setIn(X16,alive)|index(ldr,host(X16))!=host(X16)|index(status,host(X16))!=norm. % 2.09/2.29 0 [] le_q(host(X19),host(X20))| -setIn(X19,alive)| -setIn(X20,alive)|index(status,host(X19))!=elec_2|index(status,host(X20))!=elec_2|le_q(index(pendack,host(X20)),host(X19)). % 2.09/2.29 0 [] -setIn(X21,alive)| -setIn(X23,alive)|host(X23)!=host(X22)|index(status,host(X21))!=elec_2|index(status,host(X23))!=elec_2| -elem(m_Ack(X21,X22),queue(host(X21))). % 2.09/2.29 0 [] le_q(host(X24),host(X25))| -setIn(X24,alive)| -setIn(X25,alive)|index(status,host(X24))!=elec_2|index(status,host(X25))!=elec_2| -le_q(index(pendack,host(X24)),index(pendack,host(X25))). % 2.09/2.29 0 [] le_q(index(pendack,host(X28)),host(X26))| -setIn(X28,alive)| -elem(m_Halt(X28),queue(host(X27)))|index(status,host(X28))!=elec_2| -setIn(X26,alive)|index(ldr,host(X26))!=host(X26)|index(status,host(X26))!=norm. % 2.09/2.29 0 [] -le_q(host(X31),$f4(X29,Pid30,X30,X31))| -elem(m_Down(X30),queue(host(X31)))|host(X31)!=nbr_proc|host(X31)!=host(Pid30)|index(status,host(X31))!=elec_1| -setIn(X29,alive)| -elem(m_Down(Pid30),queue(host(X29))). % 2.09/2.29 0 [] le_q(s(zero),$f4(X29,Pid30,X30,X31))| -elem(m_Down(X30),queue(host(X31)))|host(X31)!=nbr_proc|host(X31)!=host(Pid30)|index(status,host(X31))!=elec_1| -setIn(X29,alive)| -elem(m_Down(Pid30),queue(host(X29))). % 2.09/2.29 0 [] -setIn($f4(X29,Pid30,X30,X31),index(down,host(X31)))| -elem(m_Down(X30),queue(host(X31)))|host(X31)!=nbr_proc|host(X31)!=host(Pid30)|index(status,host(X31))!=elec_1| -setIn(X29,alive)| -elem(m_Down(Pid30),queue(host(X29))). % 2.09/2.29 0 [] $f4(X29,Pid30,X30,X31)!=host(X30)| -elem(m_Down(X30),queue(host(X31)))|host(X31)!=nbr_proc|host(X31)!=host(Pid30)|index(status,host(X31))!=elec_1| -setIn(X29,alive)| -elem(m_Down(Pid30),queue(host(X29))). % 2.14/2.30 0 [] -setIn(X35,alive)| -elem(m_Down(X34),queue(host(X35)))| -elem(m_Ack(X35,X33),queue(host(X35)))| -le_q(nbr_proc,s(index(pendack,host(X35))))|index(status,host(X35))!=elec_2|host(X33)!=index(pendack,host(X35))|host(X34)!=s(index(pendack,host(X35)))| -setIn(X32,alive)|index(ldr,host(X32))!=host(X32)|index(status,host(X32))!=norm. % 2.14/2.30 0 [] queue(host($c7))=cons(m_Down($c6),$c9). % 2.14/2.30 0 [] setIn($c7,alive). % 2.14/2.30 0 [] -le_q(host($c7),host($c6)). % 2.14/2.30 0 [] index(ldr,host($c7))!=host($c6)|index(status,host($c7))!=norm. % 2.14/2.30 0 [] index(status,host($c7))!=wait|host($c6)!=host(index(elid,host($c7))). % 2.14/2.30 0 [] le_q(host($c7),X36)| -le_q(s(zero),X36)|setIn(X36,index(down,host($c7)))|X36=host($c6). % 2.14/2.30 0 [] index(status,host($c7))=elec_1. % 2.14/2.30 0 [] le_q(nbr_proc,host($c7)). % 2.14/2.30 0 [] -setIn(host($c5),setEmpty). % 2.14/2.30 0 [] host($c7)=host($c4). % 2.14/2.30 0 [] host($c7)!=host($c1). % 2.14/2.30 0 [] setIn($c1,alive). % 2.14/2.30 0 [] elem(m_Down($c2),queue(host($c1))). % 2.14/2.30 0 [] elem(m_Ack($c1,$c3),queue(host($c1))). % 2.14/2.30 0 [] le_q(nbr_proc,s(index(pendack,host($c1)))). % 2.14/2.30 0 [] index(status,host($c1))=elec_2. % 2.14/2.30 0 [] host($c3)=index(pendack,host($c1)). % 2.14/2.30 0 [] host($c2)=s(index(pendack,host($c1))). % 2.14/2.30 0 [] setIn($c4,alive). % 2.14/2.30 end_of_list. % 2.14/2.30 % 2.14/2.30 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=10. % 2.14/2.30 % 2.14/2.30 This ia a non-Horn set with equality. The strategy will be % 2.14/2.30 Knuth-Bendix, ordered hyper_res, factoring, and unit % 2.14/2.30 deletion, with positive clauses in sos and nonpositive % 2.14/2.30 clauses in usable. % 2.14/2.30 % 2.14/2.30 dependent: set(knuth_bendix). % 2.14/2.30 dependent: set(anl_eq). % 2.14/2.30 dependent: set(para_from). % 2.14/2.30 dependent: set(para_into). % 2.14/2.30 dependent: clear(para_from_right). % 2.14/2.30 dependent: clear(para_into_right). % 2.14/2.30 dependent: set(para_from_vars). % 2.14/2.30 dependent: set(eq_units_both_ways). % 2.14/2.30 dependent: set(dynamic_demod_all). % 2.14/2.30 dependent: set(dynamic_demod). % 2.14/2.30 dependent: set(order_eq). % 2.14/2.30 dependent: set(back_demod). % 2.14/2.30 dependent: set(lrpo). % 2.14/2.30 dependent: set(hyper_res). % 2.14/2.30 dependent: set(unit_deletion). % 2.14/2.30 dependent: set(factor). % 2.14/2.30 % 2.14/2.30 ------------> process usable: % 2.14/2.30 ** KEPT (pick-wt=10): 1 [] -elem(m_Ack(A,B),queue(host(A)))|setIn(A,pids). % 2.14/2.30 ** KEPT (pick-wt=10): 2 [] -elem(m_Ack(A,B),queue(host(A)))|setIn(B,pids). % 2.14/2.30 ** KEPT (pick-wt=11): 3 [] s(host(A))!=host(B)|host(A)!=host(B). % 2.14/2.30 ** KEPT (pick-wt=3): 5 [copy,4,flip.1] elec_2!=elec_1. % 2.14/2.30 ** KEPT (pick-wt=3): 7 [copy,6,flip.1] wait!=elec_1. % 2.14/2.30 ** KEPT (pick-wt=3): 9 [copy,8,flip.1] norm!=elec_1. % 2.14/2.30 ** KEPT (pick-wt=3): 11 [copy,10,flip.1] wait!=elec_2. % 2.14/2.30 ** KEPT (pick-wt=3): 13 [copy,12,flip.1] norm!=elec_2. % 2.14/2.30 ** KEPT (pick-wt=3): 15 [copy,14,flip.1] wait!=norm. % 2.14/2.30 ** KEPT (pick-wt=6): 16 [] m_Ack(A,B)!=m_Halt(C). % 2.14/2.30 ** KEPT (pick-wt=6): 17 [] m_Ack(A,B)!=m_Down(C). % 2.14/2.30 ** KEPT (pick-wt=6): 18 [] m_Ack(A,B)!=m_NotNorm(C). % 2.14/2.30 ** KEPT (pick-wt=6): 19 [] m_Ack(A,B)!=m_Ldr(C). % 2.14/2.30 ** KEPT (pick-wt=6): 20 [] m_Ack(A,B)!=m_NormQ(C). % 2.14/2.30 ** KEPT (pick-wt=5): 21 [] m_NotNorm(A)!=m_Halt(B). % 2.14/2.30 ** KEPT (pick-wt=5): 22 [] m_Down(A)!=m_Halt(B). % 2.14/2.30 ** KEPT (pick-wt=5): 23 [] m_Down(A)!=m_Ldr(B). % 2.14/2.30 ** KEPT (pick-wt=5): 24 [] m_Down(A)!=m_NotNorm(B). % 2.14/2.30 ** KEPT (pick-wt=5): 25 [] m_Down(A)!=m_NormQ(B). % 2.14/2.30 ** KEPT (pick-wt=5): 26 [] m_NormQ(A)!=m_Halt(B). % 2.14/2.30 ** KEPT (pick-wt=5): 27 [] m_Ldr(A)!=m_Halt(B). % 2.14/2.30 ** KEPT (pick-wt=5): 28 [] m_Ldr(A)!=m_NormQ(B). % 2.14/2.30 ** KEPT (pick-wt=5): 29 [] m_Ldr(A)!=m_NotNorm(B). % 2.14/2.30 ** KEPT (pick-wt=5): 30 [] m_NormQ(A)!=m_NotNorm(B). % 2.14/2.30 ** KEPT (pick-wt=8): 31 [] A=B|m_Halt(A)!=m_Halt(B). % 2.14/2.30 ** KEPT (pick-wt=8): 32 [] A!=B|m_Halt(A)=m_Halt(B). % 2.14/2.30 ** KEPT (pick-wt=8): 33 [] A=B|m_NormQ(A)!=m_NormQ(B). % 2.14/2.30 ** KEPT (pick-wt=8): 34 [] A!=B|m_NormQ(A)=m_NormQ(B). % 2.14/2.30 ** KEPT (pick-wt=8): 35 [] A=B|m_NotNorm(A)!=m_NotNorm(B). % 2.14/2.30 ** KEPT (pick-wt=8): 36 [] A!=B|m_NotNorm(A)=m_NotNorm(B). % 2.14/2.30 ** KEPT (pick-wt=8): 37 [] A=B|m_Ldr(A)!=m_Ldr(B). % 2.14/2.30 ** KEPT (pick-wt=8): 38 [] A!=B|m_Ldr(A)=m_Ldr(B). % 2.14/2.30 ** KEPT (pick-wt=8): 39 [] A=B|m_Down(A)!=m_Down(B). % 2.14/2.30 ** KEPT (pick-wt=8): 40 [] A!=B|m_Down(A)=m_Down(B). % 2.14/2.30 ** KEPT (pick-wt=10): 41 [] A=B|m_Ack(A,C)!=m_Ack(B,D). % 2.14/2.30 ** KEPT (pick-wt=10): 42 [] A=B|m_Ack(C,A)!=m_Ack(D,B). % 2.14/2.30 ** KEPT (pick-wt=8): 43 [] host(A)=host(B)|A!=B. % 2.14/2.30 ** KEPT (pick-wt=3): 44 [] -setIn(nil,alive). % 2.14/2.30 ** KEPT (pick-wt=5): 46 [copy,45,flip.1] cons(A,B)!=q_nil. % 2.14/2.30 ** KEPT (pick-wt=5): 48 [copy,47,flip.1] snoc(A,B)!=q_nil. % 2.14/2.30 ** KEPT (pick-wt=3): 49 [] -elem(A,q_nil). % 2.14/2.30 ** KEPT (pick-wt=11): 50 [] -elem(A,cons(B,C))|A=B|elem(A,C). % 2.14/2.30 ** KEPT (pick-wt=8): 51 [] elem(A,cons(B,C))|A!=B. % 2.14/2.30 ** KEPT (pick-wt=8): 52 [] elem(A,cons(B,C))| -elem(A,C). % 2.14/2.30 ** KEPT (pick-wt=11): 53 [] -elem(A,snoc(B,C))|A=C|elem(A,B). % 2.14/2.30 ** KEPT (pick-wt=8): 54 [] elem(A,snoc(B,C))|A!=C. % 2.14/2.30 ** KEPT (pick-wt=8): 55 [] elem(A,snoc(B,C))| -elem(A,B). % 2.14/2.30 ** KEPT (pick-wt=12): 57 [copy,56,flip.2,flip.3] -pidElem(A)|m_Halt($f1(A))=A|m_Down($f1(A))=A. % 2.14/2.30 ** KEPT (pick-wt=6): 58 [] pidElem(A)|A!=m_Halt(B). % 2.14/2.30 ** KEPT (pick-wt=6): 59 [] pidElem(A)|A!=m_Down(B). % 2.14/2.30 ** KEPT (pick-wt=6): 60 [] -ordered(cons(A,B))|ordered(B). % 2.14/2.30 ** KEPT (pick-wt=23): 61 [] -ordered(cons(A,B))| -elem(C,B)| -pidElem(A)| -pidElem(C)|host(pidMsg(C))!=host(pidMsg(A))|le_q(pidMsg(A),pidMsg(C)). % 2.14/2.30 ** KEPT (pick-wt=11): 62 [] ordered(cons(A,B))| -ordered(B)|elem($f2(A,B),B). % 2.14/2.30 ** KEPT (pick-wt=8): 63 [] ordered(cons(A,B))| -ordered(B)|pidElem(A). % 2.14/2.30 ** KEPT (pick-wt=10): 64 [] ordered(cons(A,B))| -ordered(B)|pidElem($f2(A,B)). % 2.14/2.30 ** KEPT (pick-wt=15): 65 [] ordered(cons(A,B))| -ordered(B)|host(pidMsg($f2(A,B)))=host(pidMsg(A)). % 2.14/2.30 ** KEPT (pick-wt=13): 66 [] ordered(cons(A,B))| -ordered(B)| -le_q(pidMsg(A),pidMsg($f2(A,B))). % 2.14/2.30 ** KEPT (pick-wt=6): 67 [] -ordered(snoc(A,B))|ordered(A). % 2.14/2.30 ** KEPT (pick-wt=23): 68 [] -ordered(snoc(A,B))| -elem(C,A)| -pidElem(B)| -pidElem(C)|host(pidMsg(C))!=host(pidMsg(B))|le_q(pidMsg(C),pidMsg(B)). % 2.14/2.30 ** KEPT (pick-wt=11): 69 [] ordered(snoc(A,B))| -ordered(A)|elem($f3(B,A),A). % 2.14/2.30 ** KEPT (pick-wt=8): 70 [] ordered(snoc(A,B))| -ordered(A)|pidElem(B). % 2.14/2.30 ** KEPT (pick-wt=10): 71 [] ordered(snoc(A,B))| -ordered(A)|pidElem($f3(B,A)). % 2.14/2.30 ** KEPT (pick-wt=15): 72 [] ordered(snoc(A,B))| -ordered(A)|host(pidMsg($f3(B,A)))=host(pidMsg(B)). % 2.14/2.30 ** KEPT (pick-wt=13): 73 [] ordered(snoc(A,B))| -ordered(A)| -le_q(pidMsg($f3(B,A)),pidMsg(B)). % 2.14/2.30 ** KEPT (pick-wt=8): 74 [] -ordered(A)|ordered(snoc(A,m_Ack(B,C))). % 2.14/2.30 ** KEPT (pick-wt=7): 75 [] -ordered(A)|ordered(snoc(A,m_Ldr(B))). % 2.14/2.30 ** KEPT (pick-wt=17): 76 [] -ordered(cons(m_Halt(A),B))|host(A)!=host(C)| -elem(m_Down(C),B)|le_q(A,C). % 2.14/2.30 ** KEPT (pick-wt=4): 77 [] -le_q(s(A),A). % 2.14/2.30 ** KEPT (pick-wt=9): 78 [] -le_q(A,B)| -le_q(B,A)|A=B. % 2.14/2.30 ** KEPT (pick-wt=6): 79 [] le_q(A,B)|A!=B. % 2.14/2.30 ** KEPT (pick-wt=6): 80 [] le_q(A,B)|B!=A. % 2.14/2.30 ** KEPT (pick-wt=9): 81 [] -le_q(A,B)| -le_q(B,C)|le_q(A,C). % 2.14/2.30 ** KEPT (pick-wt=8): 82 [] -le_q(A,B)|le_q(s(A),s(B)). % 2.14/2.30 ** KEPT (pick-wt=8): 83 [] le_q(A,B)| -le_q(s(A),s(B)). % 2.14/2.30 ** KEPT (pick-wt=11): 84 [] -le_q(A,s(B))|A=s(B)|le_q(A,B). % 2.14/2.30 Following clause subsumed by 79 during input processing: 0 [] le_q(A,s(B))|A!=s(B). % 2.14/2.30 ** KEPT (pick-wt=7): 85 [] le_q(A,s(B))| -le_q(A,B). % 2.14/2.30 ** KEPT (pick-wt=3): 86 [] -setIn(A,setEmpty). % 2.14/2.30 ** KEPT (pick-wt=11): 87 [] -elem(m_Ldr(A),queue(host(B)))| -le_q(host(B),host(A)). % 2.14/2.30 ** KEPT (pick-wt=11): 88 [] -elem(m_Down(A),queue(host(B)))|host(A)!=host(B). % 2.14/2.30 ** KEPT (pick-wt=11): 89 [] -elem(m_Halt(A),queue(host(B)))| -le_q(host(B),host(A)). % 2.14/2.30 ** KEPT (pick-wt=12): 90 [] -elem(m_Ack(A,B),queue(host(C)))| -le_q(host(B),host(A)). % 2.14/2.30 ** KEPT (pick-wt=14): 91 [] A=B|host(A)!=host(B)| -setIn(B,alive)| -setIn(A,alive). % 2.14/2.30 ** KEPT (pick-wt=17): 92 [] -setIn(A,alive)| -elem(m_Ack(A,B),queue(host(A)))|le_q(host(B),index(pendack,host(A))). % 2.14/2.30 ** KEPT (pick-wt=16): 93 [] -setIn(A,alive)|index(status,host(A))!=elec_1| -elem(m_Ack(A,B),queue(host(A))). % 2.14/2.30 ** KEPT (pick-wt=15): 94 [] index(status,host(A))!=elec_1| -setIn(A,alive)|index(elid,host(A))=A. % 2.14/2.30 ** KEPT (pick-wt=15): 95 [] index(status,host(A))!=elec_2| -setIn(A,alive)|index(elid,host(A))=A. % 2.14/2.30 ** KEPT (pick-wt=30): 96 [] -setIn(A,alive)| -elem(m_Down(B),queue(host(A)))|host(B)!=host(C)| -setIn(C,alive)|index(ldr,host(C))!=host(C)|index(status,host(C))!=norm. % 2.14/2.30 ** KEPT (pick-wt=30): 97 [] le_q(host(A),host(B))| -setIn(A,alive)| -setIn(B,alive)|index(status,host(A))!=elec_2|index(status,host(B))!=elec_2|le_q(index(pendack,host(B)),host(A)). % 2.14/2.30 ** KEPT (pick-wt=30): 98 [] -setIn(A,alive)| -setIn(B,alive)|host(B)!=host(C)|index(status,host(A))!=elec_2|index(status,host(B))!=elec_2| -elem(m_Ack(A,C),queue(host(A))). % 2.14/2.30 ** KEPT (pick-wt=32): 99 [] le_q(host(A),host(B))| -setIn(A,alive)| -setIn(B,alive)|index(status,host(A))!=elec_2|index(status,host(B))!=elec_2| -le_q(index(pendack,host(A)),index(pendack,host(B))). % 2.14/2.30 ** KEPT (pick-wt=38): 100 [] le_q(index(pendack,host(A)),host(B))| -setIn(A,alive)| -elem(m_Halt(A),queue(host(C)))|index(status,host(A))!=elec_2| -setIn(B,alive)|index(ldr,host(B))!=host(B)|index(status,host(B))!=norm. % 2.14/2.30 ** KEPT (pick-wt=38): 101 [] -le_q(host(A),$f4(B,C,D,A))| -elem(m_Down(D),queue(host(A)))|host(A)!=nbr_proc|host(A)!=host(C)|index(status,host(A))!=elec_1| -setIn(B,alive)| -elem(m_Down(C),queue(host(B))). % 2.14/2.30 ** KEPT (pick-wt=38): 102 [] le_q(s(zero),$f4(A,B,C,D))| -elem(m_Down(C),queue(host(D)))|host(D)!=nbr_proc|host(D)!=host(B)|index(status,host(D))!=elec_1| -setIn(A,alive)| -elem(m_Down(B),queue(host(A))). % 2.14/2.30 ** KEPT (pick-wt=40): 103 [] -setIn($f4(A,B,C,D),index(down,host(D)))| -elem(m_Down(C),queue(host(D)))|host(D)!=nbr_proc|host(D)!=host(B)|index(status,host(D))!=elec_1| -setIn(A,alive)| -elem(m_Down(B),queue(host(A))). % 2.14/2.30 ** KEPT (pick-wt=38): 104 [] $f4(A,B,C,D)!=host(C)| -elem(m_Down(C),queue(host(D)))|host(D)!=nbr_proc|host(D)!=host(B)|index(status,host(D))!=elec_1| -setIn(A,alive)| -elem(m_Down(B),queue(host(A))). % 2.14/2.30 ** KEPT (pick-wt=60): 105 [] -setIn(A,alive)| -elem(m_Down(B),queue(host(A)))| -elem(m_Ack(A,C),queue(host(A)))| -le_q(nbr_proc,s(index(pendack,host(A))))|index(status,host(A))!=elec_2|host(C)!=index(pendack,host(A))|host(B)!=s(index(pendack,host(A)))| -setIn(D,alive)|index(ldr,host(D))!=host(D)|index(status,host(D))!=norm. % 2.14/2.30 ** KEPT (pick-wt=5): 106 [] -le_q(host($c7),host($c6)). % 2.14/2.30 ** KEPT (pick-wt=13): 107 [] index(ldr,host($c7))!=host($c6)|index(status,host($c7))!=norm. % 2.14/2.30 ** KEPT (pick-wt=14): 109 [copy,108,flip.2] index(status,host($c7))!=wait|host(index(elid,host($c7)))!=host($c6). % 2.14/2.30 ** KEPT (pick-wt=18): 110 [] le_q(host($c7),A)| -le_q(s(zero),A)|setIn(A,index(down,host($c7)))|A=host($c6). % 2.14/2.30 Following clause subsumed by 86 during input processing: 0 [] -setIn(host($c5),setEmpty). % 2.14/2.30 ** KEPT (pick-wt=5): 111 [] host($c7)!=host($c1). % 2.14/2.30 ** KEPT (pick-wt=6): 112 [copy,16,flip.1] m_Halt(A)!=m_Ack(B,C). % 2.14/2.30 ** KEPT (pick-wt=6): 113 [copy,17,flip.1] m_Down(A)!=m_Ack(B,C). % 2.14/2.30 ** KEPT (pick-wt=6): 114 [copy,18,flip.1] m_NotNorm(A)!=m_Ack(B,C). % 2.14/2.30 ** KEPT (pick-wt=6): 115 [copy,19,flip.1] m_Ldr(A)!=m_Ack(B,C). % 2.14/2.30 ** KEPT (pick-wt=6): 116 [copy,20,flip.1] m_NormQ(A)!=m_Ack(B,C). % 2.14/2.30 ** KEPT (pick-wt=5): 117 [copy,21,flip.1] m_Halt(A)!=m_NotNorm(B). % 2.14/2.30 ** KEPT (pick-wt=5): 118 [copy,22,flip.1] m_Halt(A)!=m_Down(B). % 2.14/2.30 ** KEPT (pick-wt=5): 119 [copy,23,flip.1] m_Ldr(A)!=m_Down(B). % 2.14/2.30 ** KEPT (pick-wt=5): 120 [copy,24,flip.1] m_NotNorm(A)!=m_Down(B). % 2.14/2.30 ** KEPT (pick-wt=5): 121 [copy,25,flip.1] m_NormQ(A)!=m_Down(B). % 2.14/2.30 ** KEPT (pick-wt=5): 122 [copy,26,flip.1] m_Halt(A)!=m_NormQ(B). % 2.14/2.30 ** KEPT (pick-wt=5): 123 [copy,27,flip.1] m_Halt(A)!=m_Ldr(B). % 2.14/2.30 ** KEPT (pick-wt=5): 124 [copy,28,flip.1] m_NormQ(A)!=m_Ldr(B). % 2.14/2.30 ** KEPT (pick-wt=5): 125 [copy,29,flip.1] m_NotNorm(A)!=m_Ldr(B). % 2.14/2.30 ** KEPT (pick-wt=5): 126 [copy,30,flip.1] m_NotNorm(A)!=m_NormQ(B). % 2.14/2.30 Following clause subsumed by 16 during input processing: 0 [copy,112,flip.1] m_Ack(A,B)!=m_Halt(C). % 2.14/2.30 Following clause subsumed by 17 during input processing: 0 [copy,113,flip.1] m_Ack(A,B)!=m_Down(C). % 2.14/2.30 Following clause subsumed by 18 during input processing: 0 [copy,114,flip.1] m_Ack(A,B)!=m_NotNorm(C). % 2.14/2.30 Following clause subsumed by 19 during input processing: 0 [copy,115,flip.1] m_Ack(A,B)!=m_Ldr(C). % 2.14/2.30 Following clause subsumed by 20 during input processing: 0 [copy,116,flip.1] m_Ack(A,B)!=m_NormQ(C). % 2.14/2.30 Following clause subsumed by 21 during input processing: 0 [copy,117,flip.1] m_NotNorm(A)!=m_Halt(B). % 2.14/2.30 Following clause subsumed by 22 during input processing: 0 [copy,118,flip.1] m_Down(A)!=m_Halt(B). % 2.14/2.30 Following clause subsumed by 23 during input processing: 0 [copy,119,flip.1] m_Down(A)!=m_Ldr(B). % 2.14/2.30 Following clause subsumed by 24 during input processing: 0 [copy,120,flip.1] m_Down(A)!=m_NotNorm(B). % 2.14/2.30 Following clause subsumed by 25 during input processing: 0 [copy,121,flip.1] m_Down(A)!=m_NormQ(B). % 2.14/2.30 Following clause subsumed by 26 during input processing: 0 [copy,122,flip.1] m_NormQ(A)!=m_Halt(B). % 2.14/2.30 Following clause subsumed by 27 during input processing: 0 [copy,123,flip.1] m_Ldr(A)!=m_Halt(B). % 2.14/2.30 Following clause subsumed by 28 during input processing: 0 [copy,124,flip.1] m_Ldr(A)!=m_NormQ(B). % 2.14/2.30 Following clause subsumed by 29 during input processing: 0 [copy,125,flip.1] m_Ldr(A)!=m_NotNorm(B). % 2.14/2.30 Following clause subsumed by 30 during input processing: 0 [copy,126,flip.1] m_NormQ(A)!=m_NotNorm(B). % 2.14/2.30 % 2.14/2.30 ------------> process sos: % 2.14/2.30 ** KEPT (pick-wt=3): 140 [] A=A. % 2.14/2.30 ** KEPT (pick-wt=5): 141 [] le_q(s(zero),host(A)). % 2.14/2.30 ** KEPT (pick-wt=4): 142 [] le_q(s(zero),nbr_proc). % 2.14/2.30 ** KEPT (pick-wt=4): 143 [] le_q(host(A),nbr_proc). % 2.14/2.30 ** KEPT (pick-wt=6): 144 [] head(cons(A,B))=A. % 2.14/2.30 ---> New Demodulator: 145 [new_demod,144] head(cons(A,B))=A. % 2.14/2.30 ** KEPT (pick-wt=6): 146 [] tail(cons(A,B))=B. % 2.14/2.30 ---> New Demodulator: 147 [new_demod,146] tail(cons(A,B))=B. % 2.14/2.30 ** KEPT (pick-wt=6): 148 [] last(snoc(A,B))=B. % 2.14/2.30 ---> New Demodulator: 149 [new_demod,148] last(snoc(A,B))=B. % 2.14/2.30 ** KEPT (pick-wt=6): 150 [] init(snoc(A,B))=A. % 2.14/2.30 ---> New Demodulator: 151 [new_demod,150] init(snoc(A,B))=A. % 2.14/2.30 ** KEPT (pick-wt=10): 153 [copy,152,flip.2] A=q_nil|cons(head(A),tail(A))=A. % 2.14/2.30 ** KEPT (pick-wt=10): 155 [copy,154,flip.2] A=q_nil|snoc(init(A),last(A))=A. % 2.14/2.30 ** KEPT (pick-wt=7): 157 [copy,156,flip.1] snoc(q_nil,A)=cons(A,q_nil). % 2.14/2.30 ---> New Demodulator: 158 [new_demod,157] snoc(q_nil,A)=cons(A,q_nil). % 2.14/2.30 ** KEPT (pick-wt=11): 159 [] snoc(cons(A,B),C)=cons(A,snoc(B,C)). % 2.14/2.30 ---> New Demodulator: 160 [new_demod,159] snoc(cons(A,B),C)=cons(A,snoc(B,C)). % 2.14/2.30 ** KEPT (pick-wt=5): 161 [] pidMsg(m_Halt(A))=A. % 2.14/2.30 ---> New Demodulator: 162 [new_demod,161] pidMsg(m_Halt(A))=A. % 2.14/2.30 ** KEPT (pick-wt=5): 163 [] pidMsg(m_Down(A))=A. % 2.14/2.30 ---> New Demodulator: 164 [new_demod,163] pidMsg(m_Down(A))=A. % 2.14/2.30 ** KEPT (pick-wt=2): 165 [] ordered(q_nil). % 2.14/2.30 ** KEPT (pick-wt=4): 166 [] ordered(cons(A,q_nil)). % 2.14/2.30 Following clause subsumed by 166 during input processing: 0 [demod,158] ordered(cons(A,q_nil)). % 2.14/2.30 ** KEPT (pick-wt=3): 167 [] le_q(A,A). % 2.14/2.30 ** KEPT (pick-wt=6): 168 [] le_q(A,B)|le_q(B,A). % 2.14/2.30 ** KEPT (pick-wt=8): 169 [] queue(host($c7))=cons(m_Down($c6),$c9). % 2.14/2.30 ---> New Demodulator: 170 [new_demod,169] queue(host($c7))=cons(m_Down($c6),$c9). % 2.14/2.30 ** KEPT (pick-wt=3): 171 [] setIn($c7,alive). % 2.14/2.30 ** KEPT (pick-wt=6): 172 [] index(status,host($c7))=elec_1. % 2.14/2.30 ---> New Demodulator: 173 [new_demod,172] index(status,host($c7))=elec_1. % 2.14/2.30 ** KEPT (pick-wt=4): 174 [] le_q(nbr_proc,host($c7)). % 2.14/2.30 ** KEPT (pick-wt=5): 175 [] host($c7)=host($c4). % 2.14/2.30 ---> New Demodulator: 176 [new_demod,175] host($c7)=host($c4). % 2.14/2.30 ** KEPT (pick-wt=3): 177 [] setIn($c1,alive). % 2.14/2.30 ** KEPT (pick-wt=6): 178 [] elem(m_Down($c2),queue(host($c1))). % 2.14/2.30 ** KEPT (pick-wt=7): 179 [] elem(m_Ack($c1,$c3),queue(host($c1))). % 2.14/2.30 ** KEPT (pick-wt=7): 180 [] le_q(nbr_proc,s(index(pendack,host($c1)))). % 2.14/2.30 ** KEPT (pick-wt=6): 181 [] index(status,host($c1))=elec_2. % 2.14/2.30 ---> New Demodulator: 182 [new_demod,181] index(status,host($c1))=elec_2. % 2.14/2.30 ** KEPT (pick-wt=7): 183 [] host($c3)=index(pendack,host($c1)). % 2.14/2.30 ---> New Demodulator: 184 [new_demod,183] host($c3)=index(pendack,host($c1)). % 2.14/2.30 ** KEPT (pick-wt=8): 186 [copy,185,flip.1] s(index(pendack,host($c1)))=host($c2). % 2.14/2.30 ---> New Demodulator: 187 [new_demod,186] s(index(pendack,host($c1)))=host($c2). % 2.14/2.30 ** KEPT (pick-wt=3): 188 [] setIn($c4,alive). % 2.14/2.30 Following clause subsumed by 140 during input processing: 0 [copy,140,flip.1] A=A. % 2.14/2.30 140 back subsumes 130. % 2.14/2.30 140 back subsumes 129. % 2.14/2.30 >>>> Starting back demodulation with 145. % 2.14/2.30 >>>> Starting back demodulation with 147. % 2.14/2.30 >>>> Starting back demodulation with 149. % 2.14/2.30 >>>> Starting back demodulation with 151. % 2.14/2.30 >>>> Starting back demodulation with 158. % 2.14/2.30 >>>> Starting back demodulation with 160. % 2.14/2.30 >>>> Starting back demodulation with 162. % 2.14/2.30 >>>> Starting back demodulation with 164. % 2.14/2.30 167 back subsumes 133. % 2.14/2.30 167 back subsumes 131. % 2.14/2.30 167 back subsumes 128. % 2.14/2.30 167 back subsumes 127. % 2.14/2.30 >>>> Starting back demodulation with 170. % 2.14/2.30 >>>> Starting back demodulation with 173. % 2.14/2.30 >> back demodulating 109 with 173. % 2.14/2.30 >> back demodulating 107 with 173. % 2.14/2.30 >>>> Starting back demodulation with 176. % 29.08/29.25 >> back demodulating 174 with 176. % 29.08/29.25 >> back demodulating 172 with 176. % 29.08/29.25 >> back demodulating 169 with 176. % 29.08/29.25 >> back demodulating 111 with 176. % 29.08/29.25 >> back demodulating 110 with 176. % 29.08/29.25 >> back demodulating 106 with 176. % 29.08/29.25 >>>> Starting back demodulation with 182. % 29.08/29.25 >>>> Starting back demodulation with 184. % 29.08/29.25 >>>> Starting back demodulation with 187. % 29.08/29.25 >> back demodulating 180 with 187. % 29.08/29.25 >>>> Starting back demodulation with 193. % 29.08/29.25 >> back demodulating 190 with 193. % 29.08/29.25 >> back demodulating 189 with 193. % 29.08/29.25 >>>> Starting back demodulation with 195. % 29.08/29.25 % 29.08/29.25 ======= end of input processing ======= % 29.08/29.25 % 29.08/29.25 =========== start of search =========== % 29.08/29.25 % 29.08/29.25 % 29.08/29.25 Resetting weight limit to 8. % 29.08/29.25 % 29.08/29.25 % 29.08/29.25 Resetting weight limit to 8. % 29.08/29.25 % 29.08/29.25 sos_size=1196 % 29.08/29.25 % 29.08/29.25 % 29.08/29.25 Resetting weight limit to 7. % 29.08/29.25 % 29.08/29.25 % 29.08/29.25 Resetting weight limit to 7. % 29.08/29.25 % 29.08/29.25 sos_size=1288 % 29.08/29.25 % 29.08/29.25 Search stopped because sos empty. % 29.08/29.25 % 29.08/29.25 % 29.08/29.25 Search stopped because sos empty. % 29.08/29.25 % 29.08/29.25 ============ end of search ============ % 29.08/29.25 % 29.08/29.25 -------------- statistics ------------- % 29.08/29.25 clauses given 1557 % 29.08/29.25 clauses generated 1573315 % 29.08/29.25 clauses kept 1788 % 29.08/29.25 clauses forward subsumed 7660 % 29.08/29.25 clauses back subsumed 47 % 29.08/29.25 Kbytes malloced 10742 % 29.08/29.25 % 29.08/29.25 ----------- times (seconds) ----------- % 29.08/29.25 user CPU time 26.96 (0 hr, 0 min, 26 sec) % 29.08/29.25 system CPU time 0.01 (0 hr, 0 min, 0 sec) % 29.08/29.25 wall-clock time 28 (0 hr, 0 min, 28 sec) % 29.08/29.25 % 29.08/29.25 Process 29250 finished Wed Jul 27 05:51:23 2022 % 29.08/29.25 Otter interrupted % 29.08/29.25 PROOF NOT FOUND %------------------------------------------------------------------------------