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