TSTP Solution File: SWV448+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWV448+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n022.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:49 EDT 2022
% Result : Unknown 40.29s 40.44s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV448+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n022.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 06:22:05 EDT 2022
% 0.12/0.34 % CPUTime :
% 2.02/2.20 ----- Otter 3.3f, August 2004 -----
% 2.02/2.20 The process was started by sandbox on n022.cluster.edu,
% 2.02/2.20 Wed Jul 27 06:22:05 2022
% 2.02/2.20 The command was "./otter". The process ID is 25974.
% 2.02/2.20
% 2.02/2.20 set(prolog_style_variables).
% 2.02/2.20 set(auto).
% 2.02/2.20 dependent: set(auto1).
% 2.02/2.20 dependent: set(process_input).
% 2.02/2.20 dependent: clear(print_kept).
% 2.02/2.20 dependent: clear(print_new_demod).
% 2.02/2.20 dependent: clear(print_back_demod).
% 2.02/2.20 dependent: clear(print_back_sub).
% 2.02/2.20 dependent: set(control_memory).
% 2.02/2.20 dependent: assign(max_mem, 12000).
% 2.02/2.20 dependent: assign(pick_given_ratio, 4).
% 2.02/2.20 dependent: assign(stats_level, 1).
% 2.02/2.20 dependent: assign(max_seconds, 10800).
% 2.02/2.20 clear(print_given).
% 2.02/2.20
% 2.02/2.20 formula_list(usable).
% 2.02/2.20 all A (A=A).
% 2.02/2.20 all Pid Pid2 (elem(m_Ack(Pid,Pid2),queue(host(Pid)))->setIn(Pid,pids)&setIn(Pid2,pids)).
% 2.02/2.20 all P Q (s(host(P))=host(Q)->host(P)!=host(Q)).
% 2.02/2.20 all P le_q(s(zero),host(P)).
% 2.02/2.20 le_q(s(zero),nbr_proc).
% 2.02/2.20 all P le_q(host(P),nbr_proc).
% 2.02/2.20 elec_1!=elec_2.
% 2.02/2.20 elec_1!=wait.
% 2.02/2.20 elec_1!=norm.
% 2.02/2.20 elec_2!=wait.
% 2.02/2.20 elec_2!=norm.
% 2.02/2.20 norm!=wait.
% 2.02/2.20 all X Y Z (m_Ack(X,Y)!=m_Halt(Z)).
% 2.02/2.20 all X Y Z (m_Ack(X,Y)!=m_Down(Z)).
% 2.02/2.20 all X Y Z (m_Ack(X,Y)!=m_NotNorm(Z)).
% 2.02/2.20 all X Y Z (m_Ack(X,Y)!=m_Ldr(Z)).
% 2.02/2.20 all X Y Z (m_Ack(X,Y)!=m_NormQ(Z)).
% 2.02/2.20 all X Y (m_NotNorm(X)!=m_Halt(Y)).
% 2.02/2.20 all X Y (m_Down(X)!=m_Halt(Y)).
% 2.02/2.20 all X Y (m_Down(X)!=m_Ldr(Y)).
% 2.02/2.20 all X Y (m_Down(X)!=m_NotNorm(Y)).
% 2.02/2.20 all X Y (m_Down(X)!=m_NormQ(Y)).
% 2.02/2.20 all X Y (m_NormQ(X)!=m_Halt(Y)).
% 2.02/2.20 all X Y (m_Ldr(X)!=m_Halt(Y)).
% 2.02/2.20 all X Y (m_Ldr(X)!=m_NormQ(Y)).
% 2.02/2.20 all X Y (m_Ldr(X)!=m_NotNorm(Y)).
% 2.02/2.20 all X Y (m_NormQ(X)!=m_NotNorm(Y)).
% 2.02/2.20 all X Y (X!=Y<->m_Halt(X)!=m_Halt(Y)).
% 2.02/2.20 all X Y (X!=Y<->m_NormQ(X)!=m_NormQ(Y)).
% 2.02/2.20 all X Y (X!=Y<->m_NotNorm(X)!=m_NotNorm(Y)).
% 2.02/2.20 all X Y (X!=Y<->m_Ldr(X)!=m_Ldr(Y)).
% 2.02/2.20 all X Y (X!=Y<->m_Down(X)!=m_Down(Y)).
% 2.02/2.20 all X1 X2 Y1 Y2 (X1!=X2->m_Ack(X1,Y1)!=m_Ack(X2,Y2)).
% 2.02/2.20 all X1 X2 Y1 Y2 (Y1!=Y2->m_Ack(X1,Y1)!=m_Ack(X2,Y2)).
% 2.02/2.20 all Pid Pid2 (host(Pid)!=host(Pid2)->Pid!=Pid2).
% 2.02/2.20 -setIn(nil,alive).
% 2.02/2.20 all X Q (head(cons(X,Q))=X).
% 2.02/2.20 all X Q (tail(cons(X,Q))=Q).
% 2.02/2.20 all Y Q (last(snoc(Q,Y))=Y).
% 2.02/2.20 all Y Q (init(snoc(Q,Y))=Q).
% 2.02/2.20 all Q (Q=q_nil|Q=cons(head(Q),tail(Q))).
% 2.02/2.20 all Q (Q=q_nil|Q=snoc(init(Q),last(Q))).
% 2.02/2.20 all X Q (q_nil!=cons(X,Q)).
% 2.02/2.20 all Y Q (q_nil!=snoc(Q,Y)).
% 2.02/2.20 all X (cons(X,q_nil)=snoc(q_nil,X)).
% 2.02/2.20 all X Y Q (snoc(cons(X,Q),Y)=cons(X,snoc(Q,Y))).
% 2.02/2.20 all X (-elem(X,q_nil)).
% 2.02/2.20 all X Y Q (elem(X,cons(Y,Q))<->X=Y|elem(X,Q)).
% 2.02/2.20 all X Y Q (elem(X,snoc(Q,Y))<->X=Y|elem(X,Q)).
% 2.02/2.20 all X (pidElem(X)<-> (exists Y (X=m_Halt(Y)|X=m_Down(Y)))).
% 2.02/2.20 all X (pidMsg(m_Halt(X))=X).
% 2.02/2.20 all X (pidMsg(m_Down(X))=X).
% 2.02/2.20 ordered(q_nil).
% 2.02/2.20 all X (ordered(cons(X,q_nil))&ordered(snoc(q_nil,X))).
% 2.02/2.20 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.02/2.20 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.02/2.20 all Q X Y (ordered(Q)->ordered(snoc(Q,m_Ack(X,Y)))).
% 2.02/2.20 all Q X (ordered(Q)->ordered(snoc(Q,m_Ldr(X)))).
% 2.02/2.20 all Q X Y (ordered(cons(m_Halt(X),Q))&host(X)=host(Y)&elem(m_Down(Y),Q)->le_q(X,Y)).
% 2.02/2.20 all X (-le_q(s(X),X)).
% 2.02/2.20 all X le_q(X,X).
% 2.02/2.20 all X Y (le_q(X,Y)|le_q(Y,X)).
% 2.02/2.20 all X Y (le_q(X,Y)&le_q(Y,X)<->X=Y).
% 2.02/2.20 all X Y Z (le_q(X,Y)&le_q(Y,Z)->le_q(X,Z)).
% 2.02/2.20 all X Y (le_q(X,Y)<->le_q(s(X),s(Y))).
% 2.02/2.20 all X Y (le_q(X,s(Y))<->X=s(Y)|le_q(X,Y)).
% 2.02/2.20 all X (-setIn(X,setEmpty)).
% 2.02/2.20 -(all V W X Y ((all Z Pid0 (elem(m_Ldr(Pid0),queue(host(Z)))-> -le_q(host(Z),host(Pid0))))& (all Z Pid0 (Pid0!=Z&host(Pid0)=host(Z)-> -setIn(Z,alive)| -setIn(Pid0,alive)))& (all Z ((index(status,host(Z))=elec_1|index(status,host(Z))=elec_2)&setIn(Z,alive)->index(elid,host(Z))=Z))& (all Z Pid0 (setIn(Z,alive)&setIn(Pid0,alive)&index(ldr,host(Z))=host(Z)&index(status,host(Z))=norm&index(status,host(Pid0))=norm&index(ldr,host(Pid0))=host(Pid0)->Pid0=Z))& (all Z Pid20 Pid0 (setIn(Pid0,alive)&elem(m_Down(Pid20),queue(host(Pid0)))&le_q(nbr_proc,index(pendack,host(Pid0)))&index(status,host(Pid0))=elec_2&host(Pid20)=index(pendack,host(Pid0))-> -(setIn(Z,alive)&index(ldr,host(Z))=host(Z)&index(status,host(Z))=norm)))& (all Z Pid20 Pid0 (setIn(Pid0,alive)&elem(m_Ack(Pid0,Pid20),queue(host(Pid0)))&le_q(nbr_proc,index(pendack,host(Pid0)))&index(status,host(Pid0))=elec_2&host(Pid20)=index(pendack,host(Pid0))-> -(setIn(Z,alive)&index(ldr,host(Z))=host(Z)&index(status,host(Z))=norm)))& (all Z Pid20 Pid0 ((all V0 (-le_q(host(Pid0),V0)&le_q(s(zero),V0)->setIn(V0,index(down,host(Pid0)))|V0=host(Pid20)))& -le_q(host(Pid0),host(Z))&elem(m_Down(Pid20),queue(host(Pid0)))&index(status,host(Pid0))=elec_1-> -(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 (host(X)!=host(W0)-> (setIn(V0,alive)&setIn(W0,alive)&host(X)=host(V0)&index(ldr,host(W0))=host(W0)&index(status,host(W0))=norm->W0=V0)))))))))))))).
% 2.02/2.20 end_of_list.
% 2.02/2.20
% 2.02/2.20 -------> usable clausifies to:
% 2.02/2.20
% 2.02/2.20 list(usable).
% 2.02/2.20 0 [] A=A.
% 2.02/2.20 0 [] -elem(m_Ack(Pid,Pid2),queue(host(Pid)))|setIn(Pid,pids).
% 2.02/2.20 0 [] -elem(m_Ack(Pid,Pid2),queue(host(Pid)))|setIn(Pid2,pids).
% 2.02/2.20 0 [] s(host(P))!=host(Q)|host(P)!=host(Q).
% 2.02/2.20 0 [] le_q(s(zero),host(P)).
% 2.02/2.20 0 [] le_q(s(zero),nbr_proc).
% 2.02/2.20 0 [] le_q(host(P),nbr_proc).
% 2.02/2.20 0 [] elec_1!=elec_2.
% 2.02/2.20 0 [] elec_1!=wait.
% 2.02/2.20 0 [] elec_1!=norm.
% 2.02/2.20 0 [] elec_2!=wait.
% 2.02/2.20 0 [] elec_2!=norm.
% 2.02/2.20 0 [] norm!=wait.
% 2.02/2.20 0 [] m_Ack(X,Y)!=m_Halt(Z).
% 2.02/2.20 0 [] m_Ack(X,Y)!=m_Down(Z).
% 2.02/2.20 0 [] m_Ack(X,Y)!=m_NotNorm(Z).
% 2.02/2.20 0 [] m_Ack(X,Y)!=m_Ldr(Z).
% 2.02/2.20 0 [] m_Ack(X,Y)!=m_NormQ(Z).
% 2.02/2.20 0 [] m_NotNorm(X)!=m_Halt(Y).
% 2.02/2.20 0 [] m_Down(X)!=m_Halt(Y).
% 2.02/2.20 0 [] m_Down(X)!=m_Ldr(Y).
% 2.02/2.20 0 [] m_Down(X)!=m_NotNorm(Y).
% 2.02/2.20 0 [] m_Down(X)!=m_NormQ(Y).
% 2.02/2.20 0 [] m_NormQ(X)!=m_Halt(Y).
% 2.02/2.20 0 [] m_Ldr(X)!=m_Halt(Y).
% 2.02/2.20 0 [] m_Ldr(X)!=m_NormQ(Y).
% 2.02/2.20 0 [] m_Ldr(X)!=m_NotNorm(Y).
% 2.02/2.20 0 [] m_NormQ(X)!=m_NotNorm(Y).
% 2.02/2.20 0 [] X=Y|m_Halt(X)!=m_Halt(Y).
% 2.02/2.20 0 [] X!=Y|m_Halt(X)=m_Halt(Y).
% 2.02/2.20 0 [] X=Y|m_NormQ(X)!=m_NormQ(Y).
% 2.02/2.20 0 [] X!=Y|m_NormQ(X)=m_NormQ(Y).
% 2.02/2.20 0 [] X=Y|m_NotNorm(X)!=m_NotNorm(Y).
% 2.02/2.20 0 [] X!=Y|m_NotNorm(X)=m_NotNorm(Y).
% 2.02/2.20 0 [] X=Y|m_Ldr(X)!=m_Ldr(Y).
% 2.02/2.20 0 [] X!=Y|m_Ldr(X)=m_Ldr(Y).
% 2.02/2.20 0 [] X=Y|m_Down(X)!=m_Down(Y).
% 2.02/2.20 0 [] X!=Y|m_Down(X)=m_Down(Y).
% 2.02/2.20 0 [] X1=X2|m_Ack(X1,Y1)!=m_Ack(X2,Y2).
% 2.02/2.20 0 [] Y1=Y2|m_Ack(X1,Y1)!=m_Ack(X2,Y2).
% 2.02/2.20 0 [] host(Pid)=host(Pid2)|Pid!=Pid2.
% 2.02/2.20 0 [] -setIn(nil,alive).
% 2.02/2.20 0 [] head(cons(X,Q))=X.
% 2.02/2.20 0 [] tail(cons(X,Q))=Q.
% 2.02/2.20 0 [] last(snoc(Q,Y))=Y.
% 2.02/2.20 0 [] init(snoc(Q,Y))=Q.
% 2.02/2.20 0 [] Q=q_nil|Q=cons(head(Q),tail(Q)).
% 2.02/2.20 0 [] Q=q_nil|Q=snoc(init(Q),last(Q)).
% 2.02/2.20 0 [] q_nil!=cons(X,Q).
% 2.02/2.20 0 [] q_nil!=snoc(Q,Y).
% 2.02/2.20 0 [] cons(X,q_nil)=snoc(q_nil,X).
% 2.02/2.20 0 [] snoc(cons(X,Q),Y)=cons(X,snoc(Q,Y)).
% 2.02/2.20 0 [] -elem(X,q_nil).
% 2.02/2.20 0 [] -elem(X,cons(Y,Q))|X=Y|elem(X,Q).
% 2.02/2.20 0 [] elem(X,cons(Y,Q))|X!=Y.
% 2.02/2.20 0 [] elem(X,cons(Y,Q))| -elem(X,Q).
% 2.02/2.20 0 [] -elem(X,snoc(Q,Y))|X=Y|elem(X,Q).
% 2.02/2.20 0 [] elem(X,snoc(Q,Y))|X!=Y.
% 2.02/2.20 0 [] elem(X,snoc(Q,Y))| -elem(X,Q).
% 2.02/2.20 0 [] -pidElem(X)|X=m_Halt($f1(X))|X=m_Down($f1(X)).
% 2.02/2.20 0 [] pidElem(X)|X!=m_Halt(Y).
% 2.02/2.20 0 [] pidElem(X)|X!=m_Down(Y).
% 2.02/2.20 0 [] pidMsg(m_Halt(X))=X.
% 2.02/2.20 0 [] pidMsg(m_Down(X))=X.
% 2.02/2.20 0 [] ordered(q_nil).
% 2.02/2.20 0 [] ordered(cons(X,q_nil)).
% 2.02/2.20 0 [] ordered(snoc(q_nil,X)).
% 2.02/2.20 0 [] -ordered(cons(X,Q))|ordered(Q).
% 2.02/2.20 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.02/2.20 0 [] ordered(cons(X,Q))| -ordered(Q)|elem($f2(X,Q),Q).
% 2.02/2.20 0 [] ordered(cons(X,Q))| -ordered(Q)|pidElem(X).
% 2.02/2.20 0 [] ordered(cons(X,Q))| -ordered(Q)|pidElem($f2(X,Q)).
% 2.02/2.20 0 [] ordered(cons(X,Q))| -ordered(Q)|host(pidMsg($f2(X,Q)))=host(pidMsg(X)).
% 2.02/2.20 0 [] ordered(cons(X,Q))| -ordered(Q)| -le_q(pidMsg(X),pidMsg($f2(X,Q))).
% 2.02/2.20 0 [] -ordered(snoc(Q,X))|ordered(Q).
% 2.02/2.20 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.02/2.20 0 [] ordered(snoc(Q,X))| -ordered(Q)|elem($f3(X,Q),Q).
% 2.02/2.20 0 [] ordered(snoc(Q,X))| -ordered(Q)|pidElem(X).
% 2.02/2.20 0 [] ordered(snoc(Q,X))| -ordered(Q)|pidElem($f3(X,Q)).
% 2.02/2.20 0 [] ordered(snoc(Q,X))| -ordered(Q)|host(pidMsg($f3(X,Q)))=host(pidMsg(X)).
% 2.02/2.20 0 [] ordered(snoc(Q,X))| -ordered(Q)| -le_q(pidMsg($f3(X,Q)),pidMsg(X)).
% 2.02/2.20 0 [] -ordered(Q)|ordered(snoc(Q,m_Ack(X,Y))).
% 2.02/2.20 0 [] -ordered(Q)|ordered(snoc(Q,m_Ldr(X))).
% 2.02/2.20 0 [] -ordered(cons(m_Halt(X),Q))|host(X)!=host(Y)| -elem(m_Down(Y),Q)|le_q(X,Y).
% 2.02/2.20 0 [] -le_q(s(X),X).
% 2.02/2.20 0 [] le_q(X,X).
% 2.02/2.20 0 [] le_q(X,Y)|le_q(Y,X).
% 2.02/2.20 0 [] -le_q(X,Y)| -le_q(Y,X)|X=Y.
% 2.02/2.20 0 [] le_q(X,Y)|X!=Y.
% 2.02/2.20 0 [] le_q(Y,X)|X!=Y.
% 2.02/2.20 0 [] -le_q(X,Y)| -le_q(Y,Z)|le_q(X,Z).
% 2.02/2.20 0 [] -le_q(X,Y)|le_q(s(X),s(Y)).
% 2.02/2.20 0 [] le_q(X,Y)| -le_q(s(X),s(Y)).
% 2.02/2.20 0 [] -le_q(X,s(Y))|X=s(Y)|le_q(X,Y).
% 2.02/2.20 0 [] le_q(X,s(Y))|X!=s(Y).
% 2.02/2.20 0 [] le_q(X,s(Y))| -le_q(X,Y).
% 2.02/2.20 0 [] -setIn(X,setEmpty).
% 2.02/2.20 0 [] -elem(m_Ldr(Pid0),queue(host(Z)))| -le_q(host(Z),host(Pid0)).
% 2.02/2.20 0 [] X4=X3|host(X4)!=host(X3)| -setIn(X3,alive)| -setIn(X4,alive).
% 2.02/2.20 0 [] index(status,host(X5))!=elec_1| -setIn(X5,alive)|index(elid,host(X5))=X5.
% 2.02/2.20 0 [] index(status,host(X5))!=elec_2| -setIn(X5,alive)|index(elid,host(X5))=X5.
% 2.02/2.20 0 [] -setIn(X6,alive)| -setIn(X7,alive)|index(ldr,host(X6))!=host(X6)|index(status,host(X6))!=norm|index(status,host(X7))!=norm|index(ldr,host(X7))!=host(X7)|X7=X6.
% 2.02/2.20 0 [] -setIn(X9,alive)| -elem(m_Down(Pid20),queue(host(X9)))| -le_q(nbr_proc,index(pendack,host(X9)))|index(status,host(X9))!=elec_2|host(Pid20)!=index(pendack,host(X9))| -setIn(X8,alive)|index(ldr,host(X8))!=host(X8)|index(status,host(X8))!=norm.
% 2.02/2.20 0 [] -setIn(X12,alive)| -elem(m_Ack(X12,X11),queue(host(X12)))| -le_q(nbr_proc,index(pendack,host(X12)))|index(status,host(X12))!=elec_2|host(X11)!=index(pendack,host(X12))| -setIn(X10,alive)|index(ldr,host(X10))!=host(X10)|index(status,host(X10))!=norm.
% 2.02/2.20 0 [] -le_q(host(X15),$f4(X13,X14,X15))|le_q(host(X15),host(X13))| -elem(m_Down(X14),queue(host(X15)))|index(status,host(X15))!=elec_1| -setIn(X13,alive)|index(ldr,host(X13))!=host(X13)|index(status,host(X13))!=norm.
% 2.02/2.20 0 [] le_q(s(zero),$f4(X13,X14,X15))|le_q(host(X15),host(X13))| -elem(m_Down(X14),queue(host(X15)))|index(status,host(X15))!=elec_1| -setIn(X13,alive)|index(ldr,host(X13))!=host(X13)|index(status,host(X13))!=norm.
% 2.02/2.20 0 [] -setIn($f4(X13,X14,X15),index(down,host(X15)))|le_q(host(X15),host(X13))| -elem(m_Down(X14),queue(host(X15)))|index(status,host(X15))!=elec_1| -setIn(X13,alive)|index(ldr,host(X13))!=host(X13)|index(status,host(X13))!=norm.
% 2.02/2.20 0 [] $f4(X13,X14,X15)!=host(X14)|le_q(host(X15),host(X13))| -elem(m_Down(X14),queue(host(X15)))|index(status,host(X15))!=elec_1| -setIn(X13,alive)|index(ldr,host(X13))!=host(X13)|index(status,host(X13))!=norm.
% 2.02/2.20 0 [] queue(host($c5))=cons(m_Down($c4),$c7).
% 2.02/2.20 0 [] setIn($c5,alive).
% 2.02/2.20 0 [] -le_q(host($c5),host($c4)).
% 2.02/2.20 0 [] index(ldr,host($c5))!=host($c4)|index(status,host($c5))!=norm.
% 2.02/2.20 0 [] index(status,host($c5))!=wait|host($c4)!=host(index(elid,host($c5))).
% 2.02/2.20 0 [] le_q(host($c5),X16)| -le_q(s(zero),X16)|setIn(X16,index(down,host($c5)))|X16=host($c4).
% 2.02/2.20 0 [] index(status,host($c5))=elec_1.
% 2.02/2.20 0 [] le_q(nbr_proc,host($c5)).
% 2.02/2.20 0 [] -setIn(host($c3),setEmpty).
% 2.02/2.20 0 [] host($c5)=host($c2).
% 2.02/2.20 0 [] host($c5)!=host($c1).
% 2.02/2.20 0 [] setIn($c2,alive).
% 2.02/2.20 0 [] setIn($c1,alive).
% 2.02/2.20 0 [] index(ldr,host($c1))=host($c1).
% 2.02/2.20 0 [] index(status,host($c1))=norm.
% 2.02/2.20 0 [] $c1!=$c2.
% 2.02/2.20 end_of_list.
% 2.02/2.20
% 2.02/2.20 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 2.02/2.20
% 2.02/2.20 This ia a non-Horn set with equality. The strategy will be
% 2.02/2.20 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.02/2.20 deletion, with positive clauses in sos and nonpositive
% 2.02/2.20 clauses in usable.
% 2.02/2.20
% 2.02/2.20 dependent: set(knuth_bendix).
% 2.02/2.20 dependent: set(anl_eq).
% 2.02/2.20 dependent: set(para_from).
% 2.02/2.20 dependent: set(para_into).
% 2.02/2.20 dependent: clear(para_from_right).
% 2.02/2.20 dependent: clear(para_into_right).
% 2.02/2.20 dependent: set(para_from_vars).
% 2.02/2.20 dependent: set(eq_units_both_ways).
% 2.02/2.20 dependent: set(dynamic_demod_all).
% 2.02/2.20 dependent: set(dynamic_demod).
% 2.02/2.20 dependent: set(order_eq).
% 2.02/2.20 dependent: set(back_demod).
% 2.02/2.20 dependent: set(lrpo).
% 2.02/2.20 dependent: set(hyper_res).
% 2.02/2.20 dependent: set(unit_deletion).
% 2.02/2.20 dependent: set(factor).
% 2.02/2.20
% 2.02/2.20 ------------> process usable:
% 2.02/2.20 ** KEPT (pick-wt=10): 1 [] -elem(m_Ack(A,B),queue(host(A)))|setIn(A,pids).
% 2.02/2.20 ** KEPT (pick-wt=10): 2 [] -elem(m_Ack(A,B),queue(host(A)))|setIn(B,pids).
% 2.02/2.20 ** KEPT (pick-wt=11): 3 [] s(host(A))!=host(B)|host(A)!=host(B).
% 2.02/2.20 ** KEPT (pick-wt=3): 5 [copy,4,flip.1] elec_2!=elec_1.
% 2.02/2.20 ** KEPT (pick-wt=3): 7 [copy,6,flip.1] wait!=elec_1.
% 2.02/2.20 ** KEPT (pick-wt=3): 9 [copy,8,flip.1] norm!=elec_1.
% 2.02/2.21 ** KEPT (pick-wt=3): 11 [copy,10,flip.1] wait!=elec_2.
% 2.02/2.21 ** KEPT (pick-wt=3): 13 [copy,12,flip.1] norm!=elec_2.
% 2.02/2.21 ** KEPT (pick-wt=3): 15 [copy,14,flip.1] wait!=norm.
% 2.02/2.21 ** KEPT (pick-wt=6): 16 [] m_Ack(A,B)!=m_Halt(C).
% 2.02/2.21 ** KEPT (pick-wt=6): 17 [] m_Ack(A,B)!=m_Down(C).
% 2.02/2.21 ** KEPT (pick-wt=6): 18 [] m_Ack(A,B)!=m_NotNorm(C).
% 2.02/2.21 ** KEPT (pick-wt=6): 19 [] m_Ack(A,B)!=m_Ldr(C).
% 2.02/2.21 ** KEPT (pick-wt=6): 20 [] m_Ack(A,B)!=m_NormQ(C).
% 2.02/2.21 ** KEPT (pick-wt=5): 21 [] m_NotNorm(A)!=m_Halt(B).
% 2.02/2.21 ** KEPT (pick-wt=5): 22 [] m_Down(A)!=m_Halt(B).
% 2.02/2.21 ** KEPT (pick-wt=5): 23 [] m_Down(A)!=m_Ldr(B).
% 2.02/2.21 ** KEPT (pick-wt=5): 24 [] m_Down(A)!=m_NotNorm(B).
% 2.02/2.21 ** KEPT (pick-wt=5): 25 [] m_Down(A)!=m_NormQ(B).
% 2.02/2.21 ** KEPT (pick-wt=5): 26 [] m_NormQ(A)!=m_Halt(B).
% 2.02/2.21 ** KEPT (pick-wt=5): 27 [] m_Ldr(A)!=m_Halt(B).
% 2.02/2.21 ** KEPT (pick-wt=5): 28 [] m_Ldr(A)!=m_NormQ(B).
% 2.02/2.21 ** KEPT (pick-wt=5): 29 [] m_Ldr(A)!=m_NotNorm(B).
% 2.02/2.21 ** KEPT (pick-wt=5): 30 [] m_NormQ(A)!=m_NotNorm(B).
% 2.02/2.21 ** KEPT (pick-wt=8): 31 [] A=B|m_Halt(A)!=m_Halt(B).
% 2.02/2.21 ** KEPT (pick-wt=8): 32 [] A!=B|m_Halt(A)=m_Halt(B).
% 2.02/2.21 ** KEPT (pick-wt=8): 33 [] A=B|m_NormQ(A)!=m_NormQ(B).
% 2.02/2.21 ** KEPT (pick-wt=8): 34 [] A!=B|m_NormQ(A)=m_NormQ(B).
% 2.02/2.21 ** KEPT (pick-wt=8): 35 [] A=B|m_NotNorm(A)!=m_NotNorm(B).
% 2.02/2.21 ** KEPT (pick-wt=8): 36 [] A!=B|m_NotNorm(A)=m_NotNorm(B).
% 2.02/2.21 ** KEPT (pick-wt=8): 37 [] A=B|m_Ldr(A)!=m_Ldr(B).
% 2.02/2.21 ** KEPT (pick-wt=8): 38 [] A!=B|m_Ldr(A)=m_Ldr(B).
% 2.02/2.21 ** KEPT (pick-wt=8): 39 [] A=B|m_Down(A)!=m_Down(B).
% 2.02/2.21 ** KEPT (pick-wt=8): 40 [] A!=B|m_Down(A)=m_Down(B).
% 2.02/2.21 ** KEPT (pick-wt=10): 41 [] A=B|m_Ack(A,C)!=m_Ack(B,D).
% 2.02/2.21 ** KEPT (pick-wt=10): 42 [] A=B|m_Ack(C,A)!=m_Ack(D,B).
% 2.02/2.21 ** KEPT (pick-wt=8): 43 [] host(A)=host(B)|A!=B.
% 2.02/2.21 ** KEPT (pick-wt=3): 44 [] -setIn(nil,alive).
% 2.02/2.21 ** KEPT (pick-wt=5): 46 [copy,45,flip.1] cons(A,B)!=q_nil.
% 2.02/2.21 ** KEPT (pick-wt=5): 48 [copy,47,flip.1] snoc(A,B)!=q_nil.
% 2.02/2.21 ** KEPT (pick-wt=3): 49 [] -elem(A,q_nil).
% 2.02/2.21 ** KEPT (pick-wt=11): 50 [] -elem(A,cons(B,C))|A=B|elem(A,C).
% 2.02/2.21 ** KEPT (pick-wt=8): 51 [] elem(A,cons(B,C))|A!=B.
% 2.02/2.21 ** KEPT (pick-wt=8): 52 [] elem(A,cons(B,C))| -elem(A,C).
% 2.02/2.21 ** KEPT (pick-wt=11): 53 [] -elem(A,snoc(B,C))|A=C|elem(A,B).
% 2.02/2.21 ** KEPT (pick-wt=8): 54 [] elem(A,snoc(B,C))|A!=C.
% 2.02/2.21 ** KEPT (pick-wt=8): 55 [] elem(A,snoc(B,C))| -elem(A,B).
% 2.02/2.21 ** KEPT (pick-wt=12): 57 [copy,56,flip.2,flip.3] -pidElem(A)|m_Halt($f1(A))=A|m_Down($f1(A))=A.
% 2.02/2.21 ** KEPT (pick-wt=6): 58 [] pidElem(A)|A!=m_Halt(B).
% 2.02/2.21 ** KEPT (pick-wt=6): 59 [] pidElem(A)|A!=m_Down(B).
% 2.02/2.21 ** KEPT (pick-wt=6): 60 [] -ordered(cons(A,B))|ordered(B).
% 2.02/2.21 ** 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.02/2.21 ** KEPT (pick-wt=11): 62 [] ordered(cons(A,B))| -ordered(B)|elem($f2(A,B),B).
% 2.02/2.21 ** KEPT (pick-wt=8): 63 [] ordered(cons(A,B))| -ordered(B)|pidElem(A).
% 2.02/2.21 ** KEPT (pick-wt=10): 64 [] ordered(cons(A,B))| -ordered(B)|pidElem($f2(A,B)).
% 2.02/2.21 ** KEPT (pick-wt=15): 65 [] ordered(cons(A,B))| -ordered(B)|host(pidMsg($f2(A,B)))=host(pidMsg(A)).
% 2.02/2.21 ** KEPT (pick-wt=13): 66 [] ordered(cons(A,B))| -ordered(B)| -le_q(pidMsg(A),pidMsg($f2(A,B))).
% 2.02/2.21 ** KEPT (pick-wt=6): 67 [] -ordered(snoc(A,B))|ordered(A).
% 2.02/2.21 ** 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.02/2.21 ** KEPT (pick-wt=11): 69 [] ordered(snoc(A,B))| -ordered(A)|elem($f3(B,A),A).
% 2.02/2.21 ** KEPT (pick-wt=8): 70 [] ordered(snoc(A,B))| -ordered(A)|pidElem(B).
% 2.02/2.21 ** KEPT (pick-wt=10): 71 [] ordered(snoc(A,B))| -ordered(A)|pidElem($f3(B,A)).
% 2.02/2.21 ** KEPT (pick-wt=15): 72 [] ordered(snoc(A,B))| -ordered(A)|host(pidMsg($f3(B,A)))=host(pidMsg(B)).
% 2.02/2.21 ** KEPT (pick-wt=13): 73 [] ordered(snoc(A,B))| -ordered(A)| -le_q(pidMsg($f3(B,A)),pidMsg(B)).
% 2.02/2.21 ** KEPT (pick-wt=8): 74 [] -ordered(A)|ordered(snoc(A,m_Ack(B,C))).
% 2.02/2.21 ** KEPT (pick-wt=7): 75 [] -ordered(A)|ordered(snoc(A,m_Ldr(B))).
% 2.02/2.21 ** 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.02/2.21 ** KEPT (pick-wt=4): 77 [] -le_q(s(A),A).
% 2.02/2.21 ** KEPT (pick-wt=9): 78 [] -le_q(A,B)| -le_q(B,A)|A=B.
% 2.02/2.21 ** KEPT (pick-wt=6): 79 [] le_q(A,B)|A!=B.
% 2.02/2.21 ** KEPT (pick-wt=6): 80 [] le_q(A,B)|B!=A.
% 2.02/2.21 ** KEPT (pick-wt=9): 81 [] -le_q(A,B)| -le_q(B,C)|le_q(A,C).
% 2.02/2.21 ** KEPT (pick-wt=8): 82 [] -le_q(A,B)|le_q(s(A),s(B)).
% 2.02/2.21 ** KEPT (pick-wt=8): 83 [] le_q(A,B)| -le_q(s(A),s(B)).
% 2.02/2.21 ** KEPT (pick-wt=11): 84 [] -le_q(A,s(B))|A=s(B)|le_q(A,B).
% 2.02/2.21 Following clause subsumed by 79 during input processing: 0 [] le_q(A,s(B))|A!=s(B).
% 2.02/2.21 ** KEPT (pick-wt=7): 85 [] le_q(A,s(B))| -le_q(A,B).
% 2.02/2.21 ** KEPT (pick-wt=3): 86 [] -setIn(A,setEmpty).
% 2.02/2.21 ** KEPT (pick-wt=11): 87 [] -elem(m_Ldr(A),queue(host(B)))| -le_q(host(B),host(A)).
% 2.02/2.21 ** KEPT (pick-wt=14): 88 [] A=B|host(A)!=host(B)| -setIn(B,alive)| -setIn(A,alive).
% 2.02/2.21 ** KEPT (pick-wt=15): 89 [] index(status,host(A))!=elec_1| -setIn(A,alive)|index(elid,host(A))=A.
% 2.02/2.21 ** KEPT (pick-wt=15): 90 [] index(status,host(A))!=elec_2| -setIn(A,alive)|index(elid,host(A))=A.
% 2.02/2.21 ** KEPT (pick-wt=35): 91 [] -setIn(A,alive)| -setIn(B,alive)|index(ldr,host(A))!=host(A)|index(status,host(A))!=norm|index(status,host(B))!=norm|index(ldr,host(B))!=host(B)|B=A.
% 2.02/2.21 ** KEPT (pick-wt=44): 92 [] -setIn(A,alive)| -elem(m_Down(B),queue(host(A)))| -le_q(nbr_proc,index(pendack,host(A)))|index(status,host(A))!=elec_2|host(B)!=index(pendack,host(A))| -setIn(C,alive)|index(ldr,host(C))!=host(C)|index(status,host(C))!=norm.
% 2.02/2.21 ** KEPT (pick-wt=45): 93 [] -setIn(A,alive)| -elem(m_Ack(A,B),queue(host(A)))| -le_q(nbr_proc,index(pendack,host(A)))|index(status,host(A))!=elec_2|host(B)!=index(pendack,host(A))| -setIn(C,alive)|index(ldr,host(C))!=host(C)|index(status,host(C))!=norm.
% 2.02/2.21 ** KEPT (pick-wt=40): 94 [] -le_q(host(A),$f4(B,C,A))|le_q(host(A),host(B))| -elem(m_Down(C),queue(host(A)))|index(status,host(A))!=elec_1| -setIn(B,alive)|index(ldr,host(B))!=host(B)|index(status,host(B))!=norm.
% 2.02/2.21 ** KEPT (pick-wt=40): 95 [] le_q(s(zero),$f4(A,B,C))|le_q(host(C),host(A))| -elem(m_Down(B),queue(host(C)))|index(status,host(C))!=elec_1| -setIn(A,alive)|index(ldr,host(A))!=host(A)|index(status,host(A))!=norm.
% 2.02/2.21 ** KEPT (pick-wt=42): 96 [] -setIn($f4(A,B,C),index(down,host(C)))|le_q(host(C),host(A))| -elem(m_Down(B),queue(host(C)))|index(status,host(C))!=elec_1| -setIn(A,alive)|index(ldr,host(A))!=host(A)|index(status,host(A))!=norm.
% 2.02/2.21 ** KEPT (pick-wt=40): 97 [] $f4(A,B,C)!=host(B)|le_q(host(C),host(A))| -elem(m_Down(B),queue(host(C)))|index(status,host(C))!=elec_1| -setIn(A,alive)|index(ldr,host(A))!=host(A)|index(status,host(A))!=norm.
% 2.02/2.21 ** KEPT (pick-wt=5): 98 [] -le_q(host($c5),host($c4)).
% 2.02/2.21 ** KEPT (pick-wt=13): 99 [] index(ldr,host($c5))!=host($c4)|index(status,host($c5))!=norm.
% 2.02/2.21 ** KEPT (pick-wt=14): 101 [copy,100,flip.2] index(status,host($c5))!=wait|host(index(elid,host($c5)))!=host($c4).
% 2.02/2.21 ** KEPT (pick-wt=18): 102 [] le_q(host($c5),A)| -le_q(s(zero),A)|setIn(A,index(down,host($c5)))|A=host($c4).
% 2.02/2.21 Following clause subsumed by 86 during input processing: 0 [] -setIn(host($c3),setEmpty).
% 2.02/2.21 ** KEPT (pick-wt=5): 103 [] host($c5)!=host($c1).
% 2.02/2.21 ** KEPT (pick-wt=3): 105 [copy,104,flip.1] $c2!=$c1.
% 2.02/2.21 ** KEPT (pick-wt=6): 106 [copy,16,flip.1] m_Halt(A)!=m_Ack(B,C).
% 2.02/2.21 ** KEPT (pick-wt=6): 107 [copy,17,flip.1] m_Down(A)!=m_Ack(B,C).
% 2.02/2.21 ** KEPT (pick-wt=6): 108 [copy,18,flip.1] m_NotNorm(A)!=m_Ack(B,C).
% 2.02/2.21 ** KEPT (pick-wt=6): 109 [copy,19,flip.1] m_Ldr(A)!=m_Ack(B,C).
% 2.02/2.21 ** KEPT (pick-wt=6): 110 [copy,20,flip.1] m_NormQ(A)!=m_Ack(B,C).
% 2.02/2.21 ** KEPT (pick-wt=5): 111 [copy,21,flip.1] m_Halt(A)!=m_NotNorm(B).
% 2.02/2.21 ** KEPT (pick-wt=5): 112 [copy,22,flip.1] m_Halt(A)!=m_Down(B).
% 2.02/2.21 ** KEPT (pick-wt=5): 113 [copy,23,flip.1] m_Ldr(A)!=m_Down(B).
% 2.02/2.21 ** KEPT (pick-wt=5): 114 [copy,24,flip.1] m_NotNorm(A)!=m_Down(B).
% 2.02/2.21 ** KEPT (pick-wt=5): 115 [copy,25,flip.1] m_NormQ(A)!=m_Down(B).
% 2.02/2.21 ** KEPT (pick-wt=5): 116 [copy,26,flip.1] m_Halt(A)!=m_NormQ(B).
% 2.02/2.21 ** KEPT (pick-wt=5): 117 [copy,27,flip.1] m_Halt(A)!=m_Ldr(B).
% 2.02/2.21 ** KEPT (pick-wt=5): 118 [copy,28,flip.1] m_NormQ(A)!=m_Ldr(B).
% 2.02/2.21 ** KEPT (pick-wt=5): 119 [copy,29,flip.1] m_NotNorm(A)!=m_Ldr(B).
% 2.02/2.21 ** KEPT (pick-wt=5): 120 [copy,30,flip.1] m_NotNorm(A)!=m_NormQ(B).
% 2.02/2.21 Following clause subsumed by 16 during input processing: 0 [copy,106,flip.1] m_Ack(A,B)!=m_Halt(C).
% 2.02/2.21 Following clause subsumed by 17 during input processing: 0 [copy,107,flip.1] m_Ack(A,B)!=m_Down(C).
% 2.02/2.21 Following clause subsumed by 18 during input processing: 0 [copy,108,flip.1] m_Ack(A,B)!=m_NotNorm(C).
% 2.02/2.21 Following clause subsumed by 19 during input processing: 0 [copy,109,flip.1] m_Ack(A,B)!=m_Ldr(C).
% 2.02/2.21 Following clause subsumed by 20 during input processing: 0 [copy,110,flip.1] m_Ack(A,B)!=m_NormQ(C).
% 2.02/2.21 Following clause subsumed by 21 during input processing: 0 [copy,111,flip.1] m_NotNorm(A)!=m_Halt(B).
% 2.02/2.21 Following clause subsumed by 22 during input processing: 0 [copy,112,flip.1] m_Down(A)!=m_Halt(B).
% 2.02/2.21 Following clause subsumed by 23 during input processing: 0 [copy,113,flip.1] m_Down(A)!=m_Ldr(B).
% 2.02/2.21 Following clause subsumed by 24 during input processing: 0 [copy,114,flip.1] m_Down(A)!=m_NotNorm(B).
% 2.02/2.21 Following clause subsumed by 25 during input processing: 0 [copy,115,flip.1] m_Down(A)!=m_NormQ(B).
% 2.02/2.21 Following clause subsumed by 26 during input processing: 0 [copy,116,flip.1] m_NormQ(A)!=m_Halt(B).
% 2.02/2.21 Following clause subsumed by 27 during input processing: 0 [copy,117,flip.1] m_Ldr(A)!=m_Halt(B).
% 2.02/2.21 Following clause subsumed by 28 during input processing: 0 [copy,118,flip.1] m_Ldr(A)!=m_NormQ(B).
% 2.02/2.21 Following clause subsumed by 29 during input processing: 0 [copy,119,flip.1] m_Ldr(A)!=m_NotNorm(B).
% 2.02/2.21 Following clause subsumed by 30 during input processing: 0 [copy,120,flip.1] m_NormQ(A)!=m_NotNorm(B).
% 2.02/2.21
% 2.02/2.21 ------------> process sos:
% 2.02/2.21 ** KEPT (pick-wt=3): 128 [] A=A.
% 2.02/2.21 ** KEPT (pick-wt=5): 129 [] le_q(s(zero),host(A)).
% 2.02/2.21 ** KEPT (pick-wt=4): 130 [] le_q(s(zero),nbr_proc).
% 2.02/2.21 ** KEPT (pick-wt=4): 131 [] le_q(host(A),nbr_proc).
% 2.02/2.21 ** KEPT (pick-wt=6): 132 [] head(cons(A,B))=A.
% 2.02/2.21 ---> New Demodulator: 133 [new_demod,132] head(cons(A,B))=A.
% 2.02/2.21 ** KEPT (pick-wt=6): 134 [] tail(cons(A,B))=B.
% 2.02/2.21 ---> New Demodulator: 135 [new_demod,134] tail(cons(A,B))=B.
% 2.02/2.21 ** KEPT (pick-wt=6): 136 [] last(snoc(A,B))=B.
% 2.02/2.21 ---> New Demodulator: 137 [new_demod,136] last(snoc(A,B))=B.
% 2.02/2.21 ** KEPT (pick-wt=6): 138 [] init(snoc(A,B))=A.
% 2.02/2.21 ---> New Demodulator: 139 [new_demod,138] init(snoc(A,B))=A.
% 2.02/2.21 ** KEPT (pick-wt=10): 141 [copy,140,flip.2] A=q_nil|cons(head(A),tail(A))=A.
% 2.02/2.21 ** KEPT (pick-wt=10): 143 [copy,142,flip.2] A=q_nil|snoc(init(A),last(A))=A.
% 2.02/2.21 ** KEPT (pick-wt=7): 145 [copy,144,flip.1] snoc(q_nil,A)=cons(A,q_nil).
% 2.02/2.21 ---> New Demodulator: 146 [new_demod,145] snoc(q_nil,A)=cons(A,q_nil).
% 2.02/2.21 ** KEPT (pick-wt=11): 147 [] snoc(cons(A,B),C)=cons(A,snoc(B,C)).
% 2.02/2.21 ---> New Demodulator: 148 [new_demod,147] snoc(cons(A,B),C)=cons(A,snoc(B,C)).
% 2.02/2.21 ** KEPT (pick-wt=5): 149 [] pidMsg(m_Halt(A))=A.
% 2.02/2.21 ---> New Demodulator: 150 [new_demod,149] pidMsg(m_Halt(A))=A.
% 2.02/2.21 ** KEPT (pick-wt=5): 151 [] pidMsg(m_Down(A))=A.
% 2.02/2.21 ---> New Demodulator: 152 [new_demod,151] pidMsg(m_Down(A))=A.
% 2.02/2.21 ** KEPT (pick-wt=2): 153 [] ordered(q_nil).
% 2.02/2.21 ** KEPT (pick-wt=4): 154 [] ordered(cons(A,q_nil)).
% 2.02/2.21 Following clause subsumed by 154 during input processing: 0 [demod,146] ordered(cons(A,q_nil)).
% 2.02/2.21 ** KEPT (pick-wt=3): 155 [] le_q(A,A).
% 2.02/2.21 ** KEPT (pick-wt=6): 156 [] le_q(A,B)|le_q(B,A).
% 2.02/2.21 ** KEPT (pick-wt=8): 157 [] queue(host($c5))=cons(m_Down($c4),$c7).
% 2.02/2.21 ---> New Demodulator: 158 [new_demod,157] queue(host($c5))=cons(m_Down($c4),$c7).
% 2.02/2.21 ** KEPT (pick-wt=3): 159 [] setIn($c5,alive).
% 2.02/2.21 ** KEPT (pick-wt=6): 160 [] index(status,host($c5))=elec_1.
% 2.02/2.21 ---> New Demodulator: 161 [new_demod,160] index(status,host($c5))=elec_1.
% 2.02/2.21 ** KEPT (pick-wt=4): 162 [] le_q(nbr_proc,host($c5)).
% 2.02/2.21 ** KEPT (pick-wt=5): 163 [] host($c5)=host($c2).
% 2.02/2.21 ---> New Demodulator: 164 [new_demod,163] host($c5)=host($c2).
% 2.02/2.21 ** KEPT (pick-wt=3): 165 [] setIn($c2,alive).
% 2.02/2.21 ** KEPT (pick-wt=3): 166 [] setIn($c1,alive).
% 2.02/2.21 ** KEPT (pick-wt=7): 167 [] index(ldr,host($c1))=host($c1).
% 2.02/2.21 ---> New Demodulator: 168 [new_demod,167] index(ldr,host($c1))=host($c1).
% 2.02/2.21 ** KEPT (pick-wt=6): 169 [] index(status,host($c1))=norm.
% 2.02/2.21 ---> New Demodulator: 170 [new_demod,169] index(status,host($c1))=norm.
% 2.02/2.21 Following clause subsumed by 128 during input processing: 0 [copy,128,flip.1] A=A.
% 2.02/2.21 128 back subsumes 125.
% 2.02/2.21 128 back subsumes 124.
% 2.02/2.21 128 back subsumes 123.
% 2.02/2.21 >>>> Starting back demodulation with 133.
% 2.02/2.21 >>>> Starting back demodulation with 135.
% 2.02/2.21 >>>> Starting back demodulation with 137.
% 2.02/2.21 >>>> Starting back demodulation with 139.
% 2.02/2.21 >>>> Starting back demodulation with 146.
% 2.02/2.21 >>>> Starting back demodulation with 148.
% 40.29/40.44 >>>> Starting back demodulation with 150.
% 40.29/40.44 >>>> Starting back demodulation with 152.
% 40.29/40.44 155 back subsumes 122.
% 40.29/40.44 155 back subsumes 121.
% 40.29/40.44 >>>> Starting back demodulation with 158.
% 40.29/40.44 >>>> Starting back demodulation with 161.
% 40.29/40.44 >> back demodulating 101 with 161.
% 40.29/40.44 >> back demodulating 99 with 161.
% 40.29/40.44 >>>> Starting back demodulation with 164.
% 40.29/40.44 >> back demodulating 162 with 164.
% 40.29/40.44 >> back demodulating 160 with 164.
% 40.29/40.44 >> back demodulating 157 with 164.
% 40.29/40.44 >> back demodulating 103 with 164.
% 40.29/40.44 >> back demodulating 102 with 164.
% 40.29/40.44 >> back demodulating 98 with 164.
% 40.29/40.44 >>>> Starting back demodulation with 168.
% 40.29/40.44 >>>> Starting back demodulation with 170.
% 40.29/40.44 >>>> Starting back demodulation with 175.
% 40.29/40.44 >> back demodulating 172 with 175.
% 40.29/40.44 >> back demodulating 171 with 175.
% 40.29/40.44 >>>> Starting back demodulation with 177.
% 40.29/40.44
% 40.29/40.44 ======= end of input processing =======
% 40.29/40.44
% 40.29/40.44 =========== start of search ===========
% 40.29/40.44
% 40.29/40.44
% 40.29/40.44 Resetting weight limit to 8.
% 40.29/40.44
% 40.29/40.44
% 40.29/40.44 Resetting weight limit to 8.
% 40.29/40.44
% 40.29/40.44 sos_size=1155
% 40.29/40.44
% 40.29/40.44
% 40.29/40.44 Resetting weight limit to 7.
% 40.29/40.44
% 40.29/40.44
% 40.29/40.44 Resetting weight limit to 7.
% 40.29/40.44
% 40.29/40.44 sos_size=1224
% 40.29/40.44
% 40.29/40.44 Search stopped because sos empty.
% 40.29/40.44
% 40.29/40.44
% 40.29/40.44 Search stopped because sos empty.
% 40.29/40.44
% 40.29/40.44 ============ end of search ============
% 40.29/40.44
% 40.29/40.44 -------------- statistics -------------
% 40.29/40.44 clauses given 1405
% 40.29/40.44 clauses generated 1576723
% 40.29/40.44 clauses kept 1609
% 40.29/40.44 clauses forward subsumed 6947
% 40.29/40.44 clauses back subsumed 39
% 40.29/40.44 Kbytes malloced 10742
% 40.29/40.44
% 40.29/40.44 ----------- times (seconds) -----------
% 40.29/40.44 user CPU time 38.23 (0 hr, 0 min, 38 sec)
% 40.29/40.44 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 40.29/40.44 wall-clock time 40 (0 hr, 0 min, 40 sec)
% 40.29/40.44
% 40.29/40.44 Process 25974 finished Wed Jul 27 06:22:45 2022
% 40.29/40.44 Otter interrupted
% 40.29/40.44 PROOF NOT FOUND
%------------------------------------------------------------------------------