TSTP Solution File: SWV463+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWV463+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n026.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:50 EDT 2022
% Result : Theorem 4.02s 4.18s
% Output : Refutation 4.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 23
% Syntax : Number of clauses : 39 ( 30 unt; 4 nHn; 35 RR)
% Number of literals : 68 ( 35 equ; 34 neg)
% Maximal clause size : 10 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 13 con; 0-2 aty)
% Number of variables : 34 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
( s(host(A)) != host(B)
| host(A) != host(B) ),
file('SWV463+1.p',unknown),
[] ).
cnf(19,axiom,
m_Ack(A,B) != m_Ldr(C),
file('SWV463+1.p',unknown),
[] ).
cnf(23,axiom,
m_Down(A) != m_Ldr(B),
file('SWV463+1.p',unknown),
[] ).
cnf(53,axiom,
( ~ elem(A,snoc(B,C))
| A = C
| elem(A,B) ),
file('SWV463+1.p',unknown),
[] ).
cnf(77,axiom,
~ le_q(s(A),A),
file('SWV463+1.p',unknown),
[] ).
cnf(78,axiom,
( ~ le_q(A,B)
| ~ le_q(B,A)
| A = B ),
file('SWV463+1.p',unknown),
[] ).
cnf(84,axiom,
( ~ le_q(A,s(B))
| A = s(B)
| le_q(A,B) ),
file('SWV463+1.p',unknown),
[] ).
cnf(105,axiom,
( ~ 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 ),
file('SWV463+1.p',unknown),
[] ).
cnf(111,plain,
m_Ldr(A) != m_Ack(B,C),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[19])]),
[iquote('copy,19,flip.1')] ).
cnf(115,plain,
m_Ldr(A) != m_Down(B),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[23])]),
[iquote('copy,23,flip.1')] ).
cnf(136,axiom,
A = A,
file('SWV463+1.p',unknown),
[] ).
cnf(139,axiom,
le_q(host(A),nbr_proc),
file('SWV463+1.p',unknown),
[] ).
cnf(164,axiom,
( le_q(A,B)
| le_q(B,A) ),
file('SWV463+1.p',unknown),
[] ).
cnf(172,axiom,
host(dollar_c6) = index(pendack,host(dollar_c7)),
file('SWV463+1.p',unknown),
[] ).
cnf(174,plain,
index(pendack,host(dollar_c7)) = host(dollar_c6),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[172])]),
[iquote('copy,172,flip.1')] ).
cnf(175,axiom,
le_q(nbr_proc,index(pendack,host(dollar_c7))),
file('SWV463+1.p',unknown),
[] ).
cnf(176,plain,
le_q(nbr_proc,host(dollar_c6)),
inference(demod,[status(thm),theory(equality)],[inference(copy,[status(thm)],[175]),174]),
[iquote('copy,175,demod,174')] ).
cnf(181,axiom,
setIn(dollar_c1,alive),
file('SWV463+1.p',unknown),
[] ).
cnf(182,axiom,
le_q(nbr_proc,s(index(pendack,host(dollar_c1)))),
file('SWV463+1.p',unknown),
[] ).
cnf(183,axiom,
elem(m_Down(dollar_c2),snoc(queue(host(dollar_c1)),m_Ldr(dollar_c7))),
file('SWV463+1.p',unknown),
[] ).
cnf(184,axiom,
elem(m_Ack(dollar_c1,dollar_c3),snoc(queue(host(dollar_c1)),m_Ldr(dollar_c7))),
file('SWV463+1.p',unknown),
[] ).
cnf(185,axiom,
index(status,host(dollar_c1)) = elec_2,
file('SWV463+1.p',unknown),
[] ).
cnf(187,axiom,
host(dollar_c3) = index(pendack,host(dollar_c1)),
file('SWV463+1.p',unknown),
[] ).
cnf(189,axiom,
host(dollar_c2) = s(index(pendack,host(dollar_c1))),
file('SWV463+1.p',unknown),
[] ).
cnf(191,plain,
s(index(pendack,host(dollar_c1))) = host(dollar_c2),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[189])]),
[iquote('copy,189,flip.1')] ).
cnf(192,axiom,
setIn(dollar_c4,alive),
file('SWV463+1.p',unknown),
[] ).
cnf(193,axiom,
index(ldr,host(dollar_c4)) = host(dollar_c4),
file('SWV463+1.p',unknown),
[] ).
cnf(195,axiom,
index(status,host(dollar_c4)) = norm,
file('SWV463+1.p',unknown),
[] ).
cnf(198,plain,
le_q(nbr_proc,host(dollar_c2)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[182]),191]),
[iquote('back_demod,182,demod,191')] ).
cnf(453,plain,
host(dollar_c6) = nbr_proc,
inference(hyper,[status(thm)],[176,78,139]),
[iquote('hyper,176,78,139')] ).
cnf(461,plain,
host(dollar_c2) = nbr_proc,
inference(hyper,[status(thm)],[198,78,139]),
[iquote('hyper,198,78,139')] ).
cnf(463,plain,
s(index(pendack,host(dollar_c1))) = nbr_proc,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[191]),461]),
[iquote('back_demod,190,demod,461')] ).
cnf(579,plain,
( s(nbr_proc) != host(A)
| host(A) != nbr_proc ),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[453,3]),453])]),
[iquote('para_from,452.1.1,3.2.1,demod,453,flip.2')] ).
cnf(606,plain,
( ~ setIn(A,alive)
| ~ elem(m_Down(dollar_c2),queue(host(A)))
| ~ elem(m_Ack(A,B),queue(host(A)))
| ~ le_q(nbr_proc,s(index(pendack,host(A))))
| index(status,host(A)) != elec_2
| host(B) != index(pendack,host(A))
| s(index(pendack,host(A))) != nbr_proc
| ~ setIn(C,alive)
| index(ldr,host(C)) != host(C)
| index(status,host(C)) != norm ),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[461,105])]),
[iquote('para_from,460.1.1,105.7.1,flip.7')] ).
cnf(1052,plain,
( le_q(s(A),B)
| B = s(A)
| le_q(B,A) ),
inference(hyper,[status(thm)],[164,84]),
[iquote('hyper,164,84')] ).
cnf(1085,plain,
elem(m_Down(dollar_c2),queue(host(dollar_c1))),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[183,53]),115]),
[iquote('hyper,183,53,unit_del,115')] ).
cnf(1121,plain,
elem(m_Ack(dollar_c1,dollar_c3),queue(host(dollar_c1))),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[184,53]),111]),
[iquote('hyper,184,53,unit_del,111')] ).
cnf(1256,plain,
s(nbr_proc) != nbr_proc,
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[579,461]),461]),136]),
[iquote('para_into,579.2.1,460.1.1,demod,461,unit_del,136')] ).
cnf(1354,plain,
$false,
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[606,181,1085,1121,1052,185,187,463,192,193,195]),463,463]),77,1256]),
[iquote('hyper,606,181,1085,1121,1052,185,187,462,192,193,195,demod,463,463,unit_del,77,1256')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV463+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 06:33:54 EDT 2022
% 0.12/0.35 % CPUTime :
% 2.46/2.63 ----- Otter 3.3f, August 2004 -----
% 2.46/2.63 The process was started by sandbox on n026.cluster.edu,
% 2.46/2.63 Wed Jul 27 06:33:54 2022
% 2.46/2.63 The command was "./otter". The process ID is 19506.
% 2.46/2.63
% 2.46/2.63 set(prolog_style_variables).
% 2.46/2.63 set(auto).
% 2.46/2.63 dependent: set(auto1).
% 2.46/2.63 dependent: set(process_input).
% 2.46/2.63 dependent: clear(print_kept).
% 2.46/2.63 dependent: clear(print_new_demod).
% 2.46/2.63 dependent: clear(print_back_demod).
% 2.46/2.63 dependent: clear(print_back_sub).
% 2.46/2.63 dependent: set(control_memory).
% 2.46/2.63 dependent: assign(max_mem, 12000).
% 2.46/2.63 dependent: assign(pick_given_ratio, 4).
% 2.46/2.63 dependent: assign(stats_level, 1).
% 2.46/2.63 dependent: assign(max_seconds, 10800).
% 2.46/2.63 clear(print_given).
% 2.46/2.63
% 2.46/2.63 formula_list(usable).
% 2.46/2.63 all A (A=A).
% 2.46/2.63 all Pid Pid2 (elem(m_Ack(Pid,Pid2),queue(host(Pid)))->setIn(Pid,pids)&setIn(Pid2,pids)).
% 2.46/2.63 all P Q (s(host(P))=host(Q)->host(P)!=host(Q)).
% 2.46/2.63 all P le_q(s(zero),host(P)).
% 2.46/2.63 le_q(s(zero),nbr_proc).
% 2.46/2.63 all P le_q(host(P),nbr_proc).
% 2.46/2.63 elec_1!=elec_2.
% 2.46/2.63 elec_1!=wait.
% 2.46/2.63 elec_1!=norm.
% 2.46/2.63 elec_2!=wait.
% 2.46/2.63 elec_2!=norm.
% 2.46/2.63 norm!=wait.
% 2.46/2.63 all X Y Z (m_Ack(X,Y)!=m_Halt(Z)).
% 2.46/2.63 all X Y Z (m_Ack(X,Y)!=m_Down(Z)).
% 2.46/2.63 all X Y Z (m_Ack(X,Y)!=m_NotNorm(Z)).
% 2.46/2.63 all X Y Z (m_Ack(X,Y)!=m_Ldr(Z)).
% 2.46/2.63 all X Y Z (m_Ack(X,Y)!=m_NormQ(Z)).
% 2.46/2.63 all X Y (m_NotNorm(X)!=m_Halt(Y)).
% 2.46/2.63 all X Y (m_Down(X)!=m_Halt(Y)).
% 2.46/2.63 all X Y (m_Down(X)!=m_Ldr(Y)).
% 2.46/2.63 all X Y (m_Down(X)!=m_NotNorm(Y)).
% 2.46/2.63 all X Y (m_Down(X)!=m_NormQ(Y)).
% 2.46/2.63 all X Y (m_NormQ(X)!=m_Halt(Y)).
% 2.46/2.63 all X Y (m_Ldr(X)!=m_Halt(Y)).
% 2.46/2.63 all X Y (m_Ldr(X)!=m_NormQ(Y)).
% 2.46/2.63 all X Y (m_Ldr(X)!=m_NotNorm(Y)).
% 2.46/2.63 all X Y (m_NormQ(X)!=m_NotNorm(Y)).
% 2.46/2.63 all X Y (X!=Y<->m_Halt(X)!=m_Halt(Y)).
% 2.46/2.63 all X Y (X!=Y<->m_NormQ(X)!=m_NormQ(Y)).
% 2.46/2.63 all X Y (X!=Y<->m_NotNorm(X)!=m_NotNorm(Y)).
% 2.46/2.63 all X Y (X!=Y<->m_Ldr(X)!=m_Ldr(Y)).
% 2.46/2.63 all X Y (X!=Y<->m_Down(X)!=m_Down(Y)).
% 2.46/2.63 all X1 X2 Y1 Y2 (X1!=X2->m_Ack(X1,Y1)!=m_Ack(X2,Y2)).
% 2.46/2.63 all X1 X2 Y1 Y2 (Y1!=Y2->m_Ack(X1,Y1)!=m_Ack(X2,Y2)).
% 2.46/2.63 all Pid Pid2 (host(Pid)!=host(Pid2)->Pid!=Pid2).
% 2.46/2.63 -setIn(nil,alive).
% 2.46/2.63 all X Q (head(cons(X,Q))=X).
% 2.46/2.63 all X Q (tail(cons(X,Q))=Q).
% 2.46/2.63 all Y Q (last(snoc(Q,Y))=Y).
% 2.46/2.63 all Y Q (init(snoc(Q,Y))=Q).
% 2.46/2.63 all Q (Q=q_nil|Q=cons(head(Q),tail(Q))).
% 2.46/2.63 all Q (Q=q_nil|Q=snoc(init(Q),last(Q))).
% 2.46/2.63 all X Q (q_nil!=cons(X,Q)).
% 2.46/2.63 all Y Q (q_nil!=snoc(Q,Y)).
% 2.46/2.63 all X (cons(X,q_nil)=snoc(q_nil,X)).
% 2.46/2.63 all X Y Q (snoc(cons(X,Q),Y)=cons(X,snoc(Q,Y))).
% 2.46/2.63 all X (-elem(X,q_nil)).
% 2.46/2.63 all X Y Q (elem(X,cons(Y,Q))<->X=Y|elem(X,Q)).
% 2.46/2.63 all X Y Q (elem(X,snoc(Q,Y))<->X=Y|elem(X,Q)).
% 2.46/2.63 all X (pidElem(X)<-> (exists Y (X=m_Halt(Y)|X=m_Down(Y)))).
% 2.46/2.63 all X (pidMsg(m_Halt(X))=X).
% 2.46/2.63 all X (pidMsg(m_Down(X))=X).
% 2.46/2.63 ordered(q_nil).
% 2.46/2.63 all X (ordered(cons(X,q_nil))&ordered(snoc(q_nil,X))).
% 2.46/2.63 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.46/2.63 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.46/2.63 all Q X Y (ordered(Q)->ordered(snoc(Q,m_Ack(X,Y)))).
% 2.46/2.63 all Q X (ordered(Q)->ordered(snoc(Q,m_Ldr(X)))).
% 2.46/2.63 all Q X Y (ordered(cons(m_Halt(X),Q))&host(X)=host(Y)&elem(m_Down(Y),Q)->le_q(X,Y)).
% 2.46/2.63 all X (-le_q(s(X),X)).
% 2.46/2.63 all X le_q(X,X).
% 2.46/2.63 all X Y (le_q(X,Y)|le_q(Y,X)).
% 2.46/2.63 all X Y (le_q(X,Y)&le_q(Y,X)<->X=Y).
% 2.46/2.63 all X Y Z (le_q(X,Y)&le_q(Y,Z)->le_q(X,Z)).
% 2.46/2.63 all X Y (le_q(X,Y)<->le_q(s(X),s(Y))).
% 2.46/2.63 all X Y (le_q(X,s(Y))<->X=s(Y)|le_q(X,Y)).
% 2.46/2.63 all X (-setIn(X,setEmpty)).
% 2.46/2.63 -(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_Ack(W,Y),V)-> (setIn(X,alive)-> (index(elid,host(X))=W&index(status,host(X))=elec_2&host(Y)=index(pendack,host(X))-> (le_q(nbr_proc,index(pendack,host(X)))-> (all Z (setIn(host(Z),index(acks,host(X)))|host(Z)=host(Y)-> (all V0 (host(X)!=host(V0)-> (all W0 X0 Y0 (host(Z)=host(Y0)-> (host(X)!=host(Y0)-> (setIn(Y0,alive)&le_q(nbr_proc,s(index(pendack,host(Y0))))&elem(m_Down(X0),snoc(queue(host(Y0)),m_Ldr(X)))&elem(m_Ack(Y0,W0),snoc(queue(host(Y0)),m_Ldr(X)))&index(status,host(Y0))=elec_2&host(W0)=index(pendack,host(Y0))&host(X0)=s(index(pendack,host(Y0)))-> -(setIn(V0,alive)&index(ldr,host(V0))=host(V0)&index(status,host(V0))=norm)))))))))))))).
% 2.46/2.63 end_of_list.
% 2.46/2.63
% 2.46/2.63 -------> usable clausifies to:
% 2.46/2.63
% 2.46/2.63 list(usable).
% 2.46/2.63 0 [] A=A.
% 2.46/2.63 0 [] -elem(m_Ack(Pid,Pid2),queue(host(Pid)))|setIn(Pid,pids).
% 2.46/2.63 0 [] -elem(m_Ack(Pid,Pid2),queue(host(Pid)))|setIn(Pid2,pids).
% 2.46/2.63 0 [] s(host(P))!=host(Q)|host(P)!=host(Q).
% 2.46/2.63 0 [] le_q(s(zero),host(P)).
% 2.46/2.63 0 [] le_q(s(zero),nbr_proc).
% 2.46/2.63 0 [] le_q(host(P),nbr_proc).
% 2.46/2.63 0 [] elec_1!=elec_2.
% 2.46/2.63 0 [] elec_1!=wait.
% 2.46/2.63 0 [] elec_1!=norm.
% 2.46/2.63 0 [] elec_2!=wait.
% 2.46/2.63 0 [] elec_2!=norm.
% 2.46/2.63 0 [] norm!=wait.
% 2.46/2.63 0 [] m_Ack(X,Y)!=m_Halt(Z).
% 2.46/2.63 0 [] m_Ack(X,Y)!=m_Down(Z).
% 2.46/2.63 0 [] m_Ack(X,Y)!=m_NotNorm(Z).
% 2.46/2.63 0 [] m_Ack(X,Y)!=m_Ldr(Z).
% 2.46/2.63 0 [] m_Ack(X,Y)!=m_NormQ(Z).
% 2.46/2.63 0 [] m_NotNorm(X)!=m_Halt(Y).
% 2.46/2.63 0 [] m_Down(X)!=m_Halt(Y).
% 2.46/2.63 0 [] m_Down(X)!=m_Ldr(Y).
% 2.46/2.63 0 [] m_Down(X)!=m_NotNorm(Y).
% 2.46/2.63 0 [] m_Down(X)!=m_NormQ(Y).
% 2.46/2.63 0 [] m_NormQ(X)!=m_Halt(Y).
% 2.46/2.63 0 [] m_Ldr(X)!=m_Halt(Y).
% 2.46/2.63 0 [] m_Ldr(X)!=m_NormQ(Y).
% 2.46/2.63 0 [] m_Ldr(X)!=m_NotNorm(Y).
% 2.46/2.63 0 [] m_NormQ(X)!=m_NotNorm(Y).
% 2.46/2.63 0 [] X=Y|m_Halt(X)!=m_Halt(Y).
% 2.46/2.63 0 [] X!=Y|m_Halt(X)=m_Halt(Y).
% 2.46/2.63 0 [] X=Y|m_NormQ(X)!=m_NormQ(Y).
% 2.46/2.63 0 [] X!=Y|m_NormQ(X)=m_NormQ(Y).
% 2.46/2.63 0 [] X=Y|m_NotNorm(X)!=m_NotNorm(Y).
% 2.46/2.63 0 [] X!=Y|m_NotNorm(X)=m_NotNorm(Y).
% 2.46/2.63 0 [] X=Y|m_Ldr(X)!=m_Ldr(Y).
% 2.46/2.63 0 [] X!=Y|m_Ldr(X)=m_Ldr(Y).
% 2.46/2.63 0 [] X=Y|m_Down(X)!=m_Down(Y).
% 2.46/2.63 0 [] X!=Y|m_Down(X)=m_Down(Y).
% 2.46/2.63 0 [] X1=X2|m_Ack(X1,Y1)!=m_Ack(X2,Y2).
% 2.46/2.63 0 [] Y1=Y2|m_Ack(X1,Y1)!=m_Ack(X2,Y2).
% 2.46/2.63 0 [] host(Pid)=host(Pid2)|Pid!=Pid2.
% 2.46/2.63 0 [] -setIn(nil,alive).
% 2.46/2.63 0 [] head(cons(X,Q))=X.
% 2.46/2.63 0 [] tail(cons(X,Q))=Q.
% 2.46/2.63 0 [] last(snoc(Q,Y))=Y.
% 2.46/2.63 0 [] init(snoc(Q,Y))=Q.
% 2.46/2.63 0 [] Q=q_nil|Q=cons(head(Q),tail(Q)).
% 2.46/2.63 0 [] Q=q_nil|Q=snoc(init(Q),last(Q)).
% 2.46/2.63 0 [] q_nil!=cons(X,Q).
% 2.46/2.63 0 [] q_nil!=snoc(Q,Y).
% 2.46/2.63 0 [] cons(X,q_nil)=snoc(q_nil,X).
% 2.46/2.63 0 [] snoc(cons(X,Q),Y)=cons(X,snoc(Q,Y)).
% 2.46/2.63 0 [] -elem(X,q_nil).
% 2.46/2.63 0 [] -elem(X,cons(Y,Q))|X=Y|elem(X,Q).
% 2.46/2.63 0 [] elem(X,cons(Y,Q))|X!=Y.
% 2.46/2.63 0 [] elem(X,cons(Y,Q))| -elem(X,Q).
% 2.46/2.63 0 [] -elem(X,snoc(Q,Y))|X=Y|elem(X,Q).
% 2.46/2.63 0 [] elem(X,snoc(Q,Y))|X!=Y.
% 2.46/2.63 0 [] elem(X,snoc(Q,Y))| -elem(X,Q).
% 2.46/2.63 0 [] -pidElem(X)|X=m_Halt($f1(X))|X=m_Down($f1(X)).
% 2.46/2.63 0 [] pidElem(X)|X!=m_Halt(Y).
% 2.46/2.63 0 [] pidElem(X)|X!=m_Down(Y).
% 2.46/2.63 0 [] pidMsg(m_Halt(X))=X.
% 2.46/2.63 0 [] pidMsg(m_Down(X))=X.
% 2.46/2.63 0 [] ordered(q_nil).
% 2.46/2.63 0 [] ordered(cons(X,q_nil)).
% 2.46/2.63 0 [] ordered(snoc(q_nil,X)).
% 2.46/2.63 0 [] -ordered(cons(X,Q))|ordered(Q).
% 2.46/2.63 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.46/2.63 0 [] ordered(cons(X,Q))| -ordered(Q)|elem($f2(X,Q),Q).
% 2.46/2.63 0 [] ordered(cons(X,Q))| -ordered(Q)|pidElem(X).
% 2.46/2.63 0 [] ordered(cons(X,Q))| -ordered(Q)|pidElem($f2(X,Q)).
% 2.46/2.63 0 [] ordered(cons(X,Q))| -ordered(Q)|host(pidMsg($f2(X,Q)))=host(pidMsg(X)).
% 2.46/2.63 0 [] ordered(cons(X,Q))| -ordered(Q)| -le_q(pidMsg(X),pidMsg($f2(X,Q))).
% 2.46/2.63 0 [] -ordered(snoc(Q,X))|ordered(Q).
% 2.46/2.63 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.46/2.63 0 [] ordered(snoc(Q,X))| -ordered(Q)|elem($f3(X,Q),Q).
% 2.46/2.63 0 [] ordered(snoc(Q,X))| -ordered(Q)|pidElem(X).
% 2.46/2.63 0 [] ordered(snoc(Q,X))| -ordered(Q)|pidElem($f3(X,Q)).
% 2.46/2.63 0 [] ordered(snoc(Q,X))| -ordered(Q)|host(pidMsg($f3(X,Q)))=host(pidMsg(X)).
% 2.46/2.63 0 [] ordered(snoc(Q,X))| -ordered(Q)| -le_q(pidMsg($f3(X,Q)),pidMsg(X)).
% 2.46/2.63 0 [] -ordered(Q)|ordered(snoc(Q,m_Ack(X,Y))).
% 2.46/2.63 0 [] -ordered(Q)|ordered(snoc(Q,m_Ldr(X))).
% 2.46/2.63 0 [] -ordered(cons(m_Halt(X),Q))|host(X)!=host(Y)| -elem(m_Down(Y),Q)|le_q(X,Y).
% 2.46/2.63 0 [] -le_q(s(X),X).
% 2.46/2.63 0 [] le_q(X,X).
% 2.46/2.63 0 [] le_q(X,Y)|le_q(Y,X).
% 2.46/2.63 0 [] -le_q(X,Y)| -le_q(Y,X)|X=Y.
% 2.46/2.63 0 [] le_q(X,Y)|X!=Y.
% 2.46/2.63 0 [] le_q(Y,X)|X!=Y.
% 2.46/2.63 0 [] -le_q(X,Y)| -le_q(Y,Z)|le_q(X,Z).
% 2.46/2.63 0 [] -le_q(X,Y)|le_q(s(X),s(Y)).
% 2.46/2.63 0 [] le_q(X,Y)| -le_q(s(X),s(Y)).
% 2.46/2.63 0 [] -le_q(X,s(Y))|X=s(Y)|le_q(X,Y).
% 2.46/2.63 0 [] le_q(X,s(Y))|X!=s(Y).
% 2.46/2.63 0 [] le_q(X,s(Y))| -le_q(X,Y).
% 2.46/2.63 0 [] -setIn(X,setEmpty).
% 2.46/2.63 0 [] -elem(m_Ldr(Pid0),queue(host(Z)))| -le_q(host(Z),host(Pid0)).
% 2.46/2.63 0 [] -elem(m_Down(X4),queue(host(X3)))|host(X4)!=host(X3).
% 2.46/2.63 0 [] -elem(m_Halt(X6),queue(host(X5)))| -le_q(host(X5),host(X6)).
% 2.46/2.63 0 [] -elem(m_Ack(X8,X7),queue(host(Pid20)))| -le_q(host(X7),host(X8)).
% 2.46/2.63 0 [] X10=X9|host(X10)!=host(X9)| -setIn(X9,alive)| -setIn(X10,alive).
% 2.46/2.63 0 [] -setIn(X12,alive)| -elem(m_Ack(X12,X11),queue(host(X12)))|le_q(host(X11),index(pendack,host(X12))).
% 2.46/2.63 0 [] -setIn(X14,alive)|index(status,host(X14))!=elec_1| -elem(m_Ack(X14,X13),queue(host(X14))).
% 2.46/2.63 0 [] index(status,host(X15))!=elec_1| -setIn(X15,alive)|index(elid,host(X15))=X15.
% 2.46/2.63 0 [] index(status,host(X15))!=elec_2| -setIn(X15,alive)|index(elid,host(X15))=X15.
% 2.46/2.63 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.46/2.63 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.46/2.63 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.46/2.63 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.46/2.63 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.46/2.63 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.46/2.63 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.46/2.63 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.46/2.63 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.46/2.63 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.46/2.63 0 [] queue(host($c7))=cons(m_Ack($c8,$c6),$c9).
% 2.46/2.63 0 [] setIn($c7,alive).
% 2.46/2.63 0 [] index(elid,host($c7))=$c8.
% 2.46/2.63 0 [] index(status,host($c7))=elec_2.
% 2.46/2.63 0 [] host($c6)=index(pendack,host($c7)).
% 2.46/2.63 0 [] le_q(nbr_proc,index(pendack,host($c7))).
% 2.46/2.63 0 [] setIn(host($c5),index(acks,host($c7)))|host($c5)=host($c6).
% 2.46/2.63 0 [] host($c7)!=host($c4).
% 2.46/2.63 0 [] host($c5)=host($c1).
% 2.46/2.63 0 [] host($c7)!=host($c1).
% 2.46/2.63 0 [] setIn($c1,alive).
% 2.46/2.63 0 [] le_q(nbr_proc,s(index(pendack,host($c1)))).
% 2.46/2.63 0 [] elem(m_Down($c2),snoc(queue(host($c1)),m_Ldr($c7))).
% 2.46/2.63 0 [] elem(m_Ack($c1,$c3),snoc(queue(host($c1)),m_Ldr($c7))).
% 2.46/2.63 0 [] index(status,host($c1))=elec_2.
% 2.46/2.63 0 [] host($c3)=index(pendack,host($c1)).
% 2.46/2.63 0 [] host($c2)=s(index(pendack,host($c1))).
% 2.46/2.63 0 [] setIn($c4,alive).
% 2.46/2.63 0 [] index(ldr,host($c4))=host($c4).
% 2.46/2.63 0 [] index(status,host($c4))=norm.
% 2.46/2.63 end_of_list.
% 2.46/2.63
% 2.46/2.63 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=10.
% 2.46/2.63
% 2.46/2.63 This ia a non-Horn set with equality. The strategy will be
% 2.46/2.63 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.46/2.63 deletion, with positive clauses in sos and nonpositive
% 2.46/2.63 clauses in usable.
% 2.46/2.63
% 2.46/2.63 dependent: set(knuth_bendix).
% 2.46/2.63 dependent: set(anl_eq).
% 2.46/2.63 dependent: set(para_from).
% 2.46/2.63 dependent: set(para_into).
% 2.46/2.63 dependent: clear(para_from_right).
% 2.46/2.63 dependent: clear(para_into_right).
% 2.46/2.63 dependent: set(para_from_vars).
% 2.46/2.63 dependent: set(eq_units_both_ways).
% 2.46/2.63 dependent: set(dynamic_demod_all).
% 2.46/2.63 dependent: set(dynamic_demod).
% 2.46/2.63 dependent: set(order_eq).
% 2.46/2.63 dependent: set(back_demod).
% 2.46/2.63 dependent: set(lrpo).
% 2.46/2.63 dependent: set(hyper_res).
% 2.46/2.63 dependent: set(unit_deletion).
% 2.46/2.63 dependent: set(factor).
% 2.46/2.63
% 2.46/2.63 ------------> process usable:
% 2.46/2.63 ** KEPT (pick-wt=10): 1 [] -elem(m_Ack(A,B),queue(host(A)))|setIn(A,pids).
% 2.46/2.63 ** KEPT (pick-wt=10): 2 [] -elem(m_Ack(A,B),queue(host(A)))|setIn(B,pids).
% 2.46/2.63 ** KEPT (pick-wt=11): 3 [] s(host(A))!=host(B)|host(A)!=host(B).
% 2.46/2.63 ** KEPT (pick-wt=3): 5 [copy,4,flip.1] elec_2!=elec_1.
% 2.46/2.63 ** KEPT (pick-wt=3): 7 [copy,6,flip.1] wait!=elec_1.
% 2.46/2.63 ** KEPT (pick-wt=3): 9 [copy,8,flip.1] norm!=elec_1.
% 2.46/2.63 ** KEPT (pick-wt=3): 11 [copy,10,flip.1] wait!=elec_2.
% 2.46/2.63 ** KEPT (pick-wt=3): 13 [copy,12,flip.1] norm!=elec_2.
% 2.46/2.63 ** KEPT (pick-wt=3): 15 [copy,14,flip.1] wait!=norm.
% 2.46/2.63 ** KEPT (pick-wt=6): 16 [] m_Ack(A,B)!=m_Halt(C).
% 2.46/2.63 ** KEPT (pick-wt=6): 17 [] m_Ack(A,B)!=m_Down(C).
% 2.46/2.63 ** KEPT (pick-wt=6): 18 [] m_Ack(A,B)!=m_NotNorm(C).
% 2.46/2.63 ** KEPT (pick-wt=6): 19 [] m_Ack(A,B)!=m_Ldr(C).
% 2.46/2.63 ** KEPT (pick-wt=6): 20 [] m_Ack(A,B)!=m_NormQ(C).
% 2.46/2.63 ** KEPT (pick-wt=5): 21 [] m_NotNorm(A)!=m_Halt(B).
% 2.46/2.63 ** KEPT (pick-wt=5): 22 [] m_Down(A)!=m_Halt(B).
% 2.46/2.63 ** KEPT (pick-wt=5): 23 [] m_Down(A)!=m_Ldr(B).
% 2.46/2.63 ** KEPT (pick-wt=5): 24 [] m_Down(A)!=m_NotNorm(B).
% 2.46/2.63 ** KEPT (pick-wt=5): 25 [] m_Down(A)!=m_NormQ(B).
% 2.46/2.63 ** KEPT (pick-wt=5): 26 [] m_NormQ(A)!=m_Halt(B).
% 2.46/2.63 ** KEPT (pick-wt=5): 27 [] m_Ldr(A)!=m_Halt(B).
% 2.46/2.63 ** KEPT (pick-wt=5): 28 [] m_Ldr(A)!=m_NormQ(B).
% 2.46/2.63 ** KEPT (pick-wt=5): 29 [] m_Ldr(A)!=m_NotNorm(B).
% 2.46/2.63 ** KEPT (pick-wt=5): 30 [] m_NormQ(A)!=m_NotNorm(B).
% 2.46/2.63 ** KEPT (pick-wt=8): 31 [] A=B|m_Halt(A)!=m_Halt(B).
% 2.46/2.63 ** KEPT (pick-wt=8): 32 [] A!=B|m_Halt(A)=m_Halt(B).
% 2.46/2.63 ** KEPT (pick-wt=8): 33 [] A=B|m_NormQ(A)!=m_NormQ(B).
% 2.46/2.63 ** KEPT (pick-wt=8): 34 [] A!=B|m_NormQ(A)=m_NormQ(B).
% 2.46/2.63 ** KEPT (pick-wt=8): 35 [] A=B|m_NotNorm(A)!=m_NotNorm(B).
% 2.46/2.63 ** KEPT (pick-wt=8): 36 [] A!=B|m_NotNorm(A)=m_NotNorm(B).
% 2.46/2.63 ** KEPT (pick-wt=8): 37 [] A=B|m_Ldr(A)!=m_Ldr(B).
% 2.46/2.63 ** KEPT (pick-wt=8): 38 [] A!=B|m_Ldr(A)=m_Ldr(B).
% 2.46/2.63 ** KEPT (pick-wt=8): 39 [] A=B|m_Down(A)!=m_Down(B).
% 2.46/2.63 ** KEPT (pick-wt=8): 40 [] A!=B|m_Down(A)=m_Down(B).
% 2.46/2.63 ** KEPT (pick-wt=10): 41 [] A=B|m_Ack(A,C)!=m_Ack(B,D).
% 2.46/2.63 ** KEPT (pick-wt=10): 42 [] A=B|m_Ack(C,A)!=m_Ack(D,B).
% 2.46/2.63 ** KEPT (pick-wt=8): 43 [] host(A)=host(B)|A!=B.
% 2.46/2.63 ** KEPT (pick-wt=3): 44 [] -setIn(nil,alive).
% 2.46/2.63 ** KEPT (pick-wt=5): 46 [copy,45,flip.1] cons(A,B)!=q_nil.
% 2.46/2.63 ** KEPT (pick-wt=5): 48 [copy,47,flip.1] snoc(A,B)!=q_nil.
% 2.46/2.63 ** KEPT (pick-wt=3): 49 [] -elem(A,q_nil).
% 2.46/2.63 ** KEPT (pick-wt=11): 50 [] -elem(A,cons(B,C))|A=B|elem(A,C).
% 2.46/2.63 ** KEPT (pick-wt=8): 51 [] elem(A,cons(B,C))|A!=B.
% 2.46/2.63 ** KEPT (pick-wt=8): 52 [] elem(A,cons(B,C))| -elem(A,C).
% 2.46/2.63 ** KEPT (pick-wt=11): 53 [] -elem(A,snoc(B,C))|A=C|elem(A,B).
% 2.46/2.63 ** KEPT (pick-wt=8): 54 [] elem(A,snoc(B,C))|A!=C.
% 2.46/2.63 ** KEPT (pick-wt=8): 55 [] elem(A,snoc(B,C))| -elem(A,B).
% 2.46/2.63 ** KEPT (pick-wt=12): 57 [copy,56,flip.2,flip.3] -pidElem(A)|m_Halt($f1(A))=A|m_Down($f1(A))=A.
% 2.46/2.63 ** KEPT (pick-wt=6): 58 [] pidElem(A)|A!=m_Halt(B).
% 2.46/2.63 ** KEPT (pick-wt=6): 59 [] pidElem(A)|A!=m_Down(B).
% 2.46/2.63 ** KEPT (pick-wt=6): 60 [] -ordered(cons(A,B))|ordered(B).
% 2.46/2.63 ** 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.46/2.63 ** KEPT (pick-wt=11): 62 [] ordered(cons(A,B))| -ordered(B)|elem($f2(A,B),B).
% 2.46/2.63 ** KEPT (pick-wt=8): 63 [] ordered(cons(A,B))| -ordered(B)|pidElem(A).
% 2.46/2.63 ** KEPT (pick-wt=10): 64 [] ordered(cons(A,B))| -ordered(B)|pidElem($f2(A,B)).
% 2.46/2.64 ** KEPT (pick-wt=15): 65 [] ordered(cons(A,B))| -ordered(B)|host(pidMsg($f2(A,B)))=host(pidMsg(A)).
% 2.46/2.64 ** KEPT (pick-wt=13): 66 [] ordered(cons(A,B))| -ordered(B)| -le_q(pidMsg(A),pidMsg($f2(A,B))).
% 2.46/2.64 ** KEPT (pick-wt=6): 67 [] -ordered(snoc(A,B))|ordered(A).
% 2.46/2.64 ** 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.46/2.64 ** KEPT (pick-wt=11): 69 [] ordered(snoc(A,B))| -ordered(A)|elem($f3(B,A),A).
% 2.46/2.64 ** KEPT (pick-wt=8): 70 [] ordered(snoc(A,B))| -ordered(A)|pidElem(B).
% 2.46/2.64 ** KEPT (pick-wt=10): 71 [] ordered(snoc(A,B))| -ordered(A)|pidElem($f3(B,A)).
% 2.46/2.64 ** KEPT (pick-wt=15): 72 [] ordered(snoc(A,B))| -ordered(A)|host(pidMsg($f3(B,A)))=host(pidMsg(B)).
% 2.46/2.64 ** KEPT (pick-wt=13): 73 [] ordered(snoc(A,B))| -ordered(A)| -le_q(pidMsg($f3(B,A)),pidMsg(B)).
% 2.46/2.64 ** KEPT (pick-wt=8): 74 [] -ordered(A)|ordered(snoc(A,m_Ack(B,C))).
% 2.46/2.64 ** KEPT (pick-wt=7): 75 [] -ordered(A)|ordered(snoc(A,m_Ldr(B))).
% 2.46/2.64 ** 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.46/2.64 ** KEPT (pick-wt=4): 77 [] -le_q(s(A),A).
% 2.46/2.64 ** KEPT (pick-wt=9): 78 [] -le_q(A,B)| -le_q(B,A)|A=B.
% 2.46/2.64 ** KEPT (pick-wt=6): 79 [] le_q(A,B)|A!=B.
% 2.46/2.64 ** KEPT (pick-wt=6): 80 [] le_q(A,B)|B!=A.
% 2.46/2.64 ** KEPT (pick-wt=9): 81 [] -le_q(A,B)| -le_q(B,C)|le_q(A,C).
% 2.46/2.64 ** KEPT (pick-wt=8): 82 [] -le_q(A,B)|le_q(s(A),s(B)).
% 2.46/2.64 ** KEPT (pick-wt=8): 83 [] le_q(A,B)| -le_q(s(A),s(B)).
% 2.46/2.64 ** KEPT (pick-wt=11): 84 [] -le_q(A,s(B))|A=s(B)|le_q(A,B).
% 2.46/2.64 Following clause subsumed by 79 during input processing: 0 [] le_q(A,s(B))|A!=s(B).
% 2.46/2.64 ** KEPT (pick-wt=7): 85 [] le_q(A,s(B))| -le_q(A,B).
% 2.46/2.64 ** KEPT (pick-wt=3): 86 [] -setIn(A,setEmpty).
% 2.46/2.64 ** KEPT (pick-wt=11): 87 [] -elem(m_Ldr(A),queue(host(B)))| -le_q(host(B),host(A)).
% 2.46/2.64 ** KEPT (pick-wt=11): 88 [] -elem(m_Down(A),queue(host(B)))|host(A)!=host(B).
% 2.46/2.64 ** KEPT (pick-wt=11): 89 [] -elem(m_Halt(A),queue(host(B)))| -le_q(host(B),host(A)).
% 2.46/2.64 ** KEPT (pick-wt=12): 90 [] -elem(m_Ack(A,B),queue(host(C)))| -le_q(host(B),host(A)).
% 2.46/2.64 ** KEPT (pick-wt=14): 91 [] A=B|host(A)!=host(B)| -setIn(B,alive)| -setIn(A,alive).
% 2.46/2.64 ** 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.46/2.64 ** KEPT (pick-wt=16): 93 [] -setIn(A,alive)|index(status,host(A))!=elec_1| -elem(m_Ack(A,B),queue(host(A))).
% 2.46/2.64 ** KEPT (pick-wt=15): 94 [] index(status,host(A))!=elec_1| -setIn(A,alive)|index(elid,host(A))=A.
% 2.46/2.64 ** KEPT (pick-wt=15): 95 [] index(status,host(A))!=elec_2| -setIn(A,alive)|index(elid,host(A))=A.
% 2.46/2.64 ** 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.46/2.64 ** 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.46/2.64 ** 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.46/2.64 ** 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.46/2.64 ** 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.46/2.64 ** 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.46/2.64 ** 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.46/2.64 ** 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.46/2.64 ** 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.46/2.64 ** 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.46/2.64 ** KEPT (pick-wt=5): 106 [] host($c7)!=host($c4).
% 2.46/2.64 ** KEPT (pick-wt=5): 107 [] host($c7)!=host($c1).
% 2.46/2.64 ** KEPT (pick-wt=6): 108 [copy,16,flip.1] m_Halt(A)!=m_Ack(B,C).
% 2.46/2.64 ** KEPT (pick-wt=6): 109 [copy,17,flip.1] m_Down(A)!=m_Ack(B,C).
% 2.46/2.64 ** KEPT (pick-wt=6): 110 [copy,18,flip.1] m_NotNorm(A)!=m_Ack(B,C).
% 2.46/2.64 ** KEPT (pick-wt=6): 111 [copy,19,flip.1] m_Ldr(A)!=m_Ack(B,C).
% 2.46/2.64 ** KEPT (pick-wt=6): 112 [copy,20,flip.1] m_NormQ(A)!=m_Ack(B,C).
% 2.46/2.64 ** KEPT (pick-wt=5): 113 [copy,21,flip.1] m_Halt(A)!=m_NotNorm(B).
% 2.46/2.64 ** KEPT (pick-wt=5): 114 [copy,22,flip.1] m_Halt(A)!=m_Down(B).
% 2.46/2.64 ** KEPT (pick-wt=5): 115 [copy,23,flip.1] m_Ldr(A)!=m_Down(B).
% 2.46/2.64 ** KEPT (pick-wt=5): 116 [copy,24,flip.1] m_NotNorm(A)!=m_Down(B).
% 2.46/2.64 ** KEPT (pick-wt=5): 117 [copy,25,flip.1] m_NormQ(A)!=m_Down(B).
% 2.46/2.64 ** KEPT (pick-wt=5): 118 [copy,26,flip.1] m_Halt(A)!=m_NormQ(B).
% 2.46/2.64 ** KEPT (pick-wt=5): 119 [copy,27,flip.1] m_Halt(A)!=m_Ldr(B).
% 2.46/2.64 ** KEPT (pick-wt=5): 120 [copy,28,flip.1] m_NormQ(A)!=m_Ldr(B).
% 2.46/2.64 ** KEPT (pick-wt=5): 121 [copy,29,flip.1] m_NotNorm(A)!=m_Ldr(B).
% 2.46/2.64 ** KEPT (pick-wt=5): 122 [copy,30,flip.1] m_NotNorm(A)!=m_NormQ(B).
% 2.46/2.64 Following clause subsumed by 16 during input processing: 0 [copy,108,flip.1] m_Ack(A,B)!=m_Halt(C).
% 2.46/2.64 Following clause subsumed by 17 during input processing: 0 [copy,109,flip.1] m_Ack(A,B)!=m_Down(C).
% 2.46/2.64 Following clause subsumed by 18 during input processing: 0 [copy,110,flip.1] m_Ack(A,B)!=m_NotNorm(C).
% 2.46/2.64 Following clause subsumed by 19 during input processing: 0 [copy,111,flip.1] m_Ack(A,B)!=m_Ldr(C).
% 2.46/2.64 Following clause subsumed by 20 during input processing: 0 [copy,112,flip.1] m_Ack(A,B)!=m_NormQ(C).
% 2.46/2.64 Following clause subsumed by 21 during input processing: 0 [copy,113,flip.1] m_NotNorm(A)!=m_Halt(B).
% 2.46/2.64 Following clause subsumed by 22 during input processing: 0 [copy,114,flip.1] m_Down(A)!=m_Halt(B).
% 2.46/2.64 Following clause subsumed by 23 during input processing: 0 [copy,115,flip.1] m_Down(A)!=m_Ldr(B).
% 2.46/2.64 Following clause subsumed by 24 during input processing: 0 [copy,116,flip.1] m_Down(A)!=m_NotNorm(B).
% 2.46/2.64 Following clause subsumed by 25 during input processing: 0 [copy,117,flip.1] m_Down(A)!=m_NormQ(B).
% 2.46/2.64 Following clause subsumed by 26 during input processing: 0 [copy,118,flip.1] m_NormQ(A)!=m_Halt(B).
% 2.46/2.64 Following clause subsumed by 27 during input processing: 0 [copy,119,flip.1] m_Ldr(A)!=m_Halt(B).
% 2.46/2.64 Following clause subsumed by 28 during input processing: 0 [copy,120,flip.1] m_Ldr(A)!=m_NormQ(B).
% 2.46/2.64 Following clause subsumed by 29 during input processing: 0 [copy,121,flip.1] m_Ldr(A)!=m_NotNorm(B).
% 2.46/2.64 Following clause subsumed by 30 during input processing: 0 [copy,122,flip.1] m_NormQ(A)!=m_NotNorm(B).
% 2.46/2.64
% 2.46/2.64 ------------> process sos:
% 2.46/2.64 ** KEPT (pick-wt=3): 136 [] A=A.
% 2.46/2.64 ** KEPT (pick-wt=5): 137 [] le_q(s(zero),host(A)).
% 2.46/2.64 ** KEPT (pick-wt=4): 138 [] le_q(s(zero),nbr_proc).
% 2.46/2.64 ** KEPT (pick-wt=4): 139 [] le_q(host(A),nbr_proc).
% 2.46/2.64 ** KEPT (pick-wt=6): 140 [] head(cons(A,B))=A.
% 2.46/2.64 ---> New Demodulator: 141 [new_demod,140] head(cons(A,B))=A.
% 2.46/2.64 ** KEPT (pick-wt=6): 142 [] tail(cons(A,B))=B.
% 2.46/2.64 ---> New Demodulator: 143 [new_demod,142] tail(cons(A,B))=B.
% 2.46/2.64 ** KEPT (pick-wt=6): 144 [] last(snoc(A,B))=B.
% 2.46/2.64 ---> New Demodulator: 145 [new_demod,144] last(snoc(A,B))=B.
% 2.46/2.64 ** KEPT (pick-wt=6): 146 [] init(snoc(A,B))=A.
% 2.46/2.64 ---> New Demodulator: 147 [new_demod,146] init(snoc(A,B))=A.
% 2.46/2.64 ** KEPT (pick-wt=10): 149 [copy,148,flip.2] A=q_nil|cons(head(A),tail(A))=A.
% 2.46/2.64 ** KEPT (pick-wt=10): 151 [copy,150,flip.2] A=q_nil|snoc(init(A),last(A))=A.
% 2.46/2.64 ** KEPT (pick-wt=7): 153 [copy,152,flip.1] snoc(q_nil,A)=cons(A,q_nil).
% 2.46/2.64 ---> New Demodulator: 154 [new_demod,153] snoc(q_nil,A)=cons(A,q_nil).
% 2.46/2.64 ** KEPT (pick-wt=11): 155 [] snoc(cons(A,B),C)=cons(A,snoc(B,C)).
% 2.46/2.64 ---> New Demodulator: 156 [new_demod,155] snoc(cons(A,B),C)=cons(A,snoc(B,C)).
% 2.46/2.64 ** KEPT (pick-wt=5): 157 [] pidMsg(m_Halt(A))=A.
% 2.46/2.64 ---> New Demodulator: 158 [new_demod,157] pidMsg(m_Halt(A))=A.
% 2.46/2.64 ** KEPT (pick-wt=5): 159 [] pidMsg(m_Down(A))=A.
% 2.46/2.64 ---> New Demodulator: 160 [new_demod,159] pidMsg(m_Down(A))=A.
% 2.46/2.64 ** KEPT (pick-wt=2): 161 [] ordered(q_nil).
% 2.46/2.64 ** KEPT (pick-wt=4): 162 [] ordered(cons(A,q_nil)).
% 2.46/2.64 Following clause subsumed by 162 during input processing: 0 [demod,154] ordered(cons(A,q_nil)).
% 2.46/2.64 ** KEPT (pick-wt=3): 163 [] le_q(A,A).
% 2.46/2.64 ** KEPT (pick-wt=6): 164 [] le_q(A,B)|le_q(B,A).
% 2.46/2.64 ** KEPT (pick-wt=9): 165 [] queue(host($c7))=cons(m_Ack($c8,$c6),$c9).
% 2.46/2.64 ---> New Demodulator: 166 [new_demod,165] queue(host($c7))=cons(m_Ack($c8,$c6),$c9).
% 2.46/2.64 ** KEPT (pick-wt=3): 167 [] setIn($c7,alive).
% 2.46/2.64 ** KEPT (pick-wt=6): 168 [] index(elid,host($c7))=$c8.
% 2.46/2.64 ---> New Demodulator: 169 [new_demod,168] index(elid,host($c7))=$c8.
% 2.46/2.64 ** KEPT (pick-wt=6): 170 [] index(status,host($c7))=elec_2.
% 2.46/2.64 ---> New Demodulator: 171 [new_demod,170] index(status,host($c7))=elec_2.
% 2.46/2.64 ** KEPT (pick-wt=7): 173 [copy,172,flip.1] index(pendack,host($c7))=host($c6).
% 2.46/2.64 ---> New Demodulator: 174 [new_demod,173] index(pendack,host($c7))=host($c6).
% 2.46/2.64 ** KEPT (pick-wt=4): 176 [copy,175,demod,174] le_q(nbr_proc,host($c6)).
% 2.46/2.64 ** KEPT (pick-wt=12): 178 [copy,177,flip.2] setIn(host($c5),index(acks,host($c7)))|host($c6)=host($c5).
% 2.46/2.64 ** KEPT (pick-wt=5): 179 [] host($c5)=host($c1).
% 2.46/2.64 ---> New Demodulator: 180 [new_demod,179] host($c5)=host($c1).
% 2.46/2.64 ** KEPT (pick-wt=3): 181 [] setIn($c1,alive).
% 2.46/2.64 ** KEPT (pick-wt=7): 182 [] le_q(nbr_proc,s(index(pendack,host($c1)))).
% 2.46/2.64 ** KEPT (pick-wt=9): 183 [] elem(m_Down($c2),snoc(queue(host($c1)),m_Ldr($c7))).
% 2.46/2.64 ** KEPT (pick-wt=10): 184 [] elem(m_Ack($c1,$c3),snoc(queue(host($c1)),m_Ldr($c7))).
% 2.46/2.64 ** KEPT (pick-wt=6): 185 [] index(status,host($c1))=elec_2.
% 2.46/2.64 ---> New Demodulator: 186 [new_demod,185] index(status,host($c1))=elec_2.
% 2.46/2.64 ** KEPT (pick-wt=7): 187 [] host($c3)=index(pendack,host($c1)).
% 2.46/2.64 ---> New Demodulator: 188 [new_demod,187] host($c3)=index(pendack,host($c1)).
% 2.46/2.64 ** KEPT (pick-wt=8): 190 [copy,189,flip.1] s(index(pendack,host($c1)))=host($c2).
% 2.46/2.64 ---> New Demodulator: 191 [new_demod,190] s(index(pendack,host($c1)))=host($c2).
% 2.46/2.64 ** KEPT (pick-wt=3): 192 [] setIn($c4,alive).
% 2.46/2.64 ** KEPT (pick-wt=7): 193 [] index(ldr,host($c4))=host($c4).
% 2.46/2.64 ---> New Demodulator: 194 [new_demod,193] index(ldr,host($c4))=host($c4).
% 2.46/2.64 ** KEPT (pick-wt=6): 195 [] index(status,host($c4))=norm.
% 2.46/2.64 ---> New Demodulator: 196 [new_demod,195] index(status,host($c4))=norm.
% 2.46/2.64 Following clause subsumed by 136 during input processing: 0 [copy,136,flip.1] A=A.
% 2.46/2.64 136 back subsumes 126.
% 2.46/2.64 136 back subsumes 125.
% 2.46/2.64 >>>> Starting back demodulation with 141.
% 2.46/2.64 >>>> Starting back demodulation with 143.
% 2.46/2.64 >>>> Starting back demodulation with 145.
% 2.46/2.64 >>>> Starting back demodulation with 147.
% 2.46/2.64 >>>> Starting back demodulation with 154.
% 2.46/2.64 >>>> Starting back demodulation with 156.
% 2.46/2.64 >>>> Starting back demodulation with 158.
% 2.46/2.64 >>>> Starting back demodulation with 160.
% 2.46/2.64 163 back subsumes 129.
% 2.46/2.64 163 back subsumes 127.
% 4.02/4.18 163 back subsumes 124.
% 4.02/4.18 163 back subsumes 123.
% 4.02/4.18 >>>> Starting back demodulation with 166.
% 4.02/4.18 >>>> Starting back demodulation with 169.
% 4.02/4.18 >>>> Starting back demodulation with 171.
% 4.02/4.18 >>>> Starting back demodulation with 174.
% 4.02/4.18 >>>> Starting back demodulation with 180.
% 4.02/4.18 >> back demodulating 178 with 180.
% 4.02/4.18 >>>> Starting back demodulation with 186.
% 4.02/4.18 >>>> Starting back demodulation with 188.
% 4.02/4.18 >>>> Starting back demodulation with 191.
% 4.02/4.18 >> back demodulating 182 with 191.
% 4.02/4.18 >>>> Starting back demodulation with 194.
% 4.02/4.18 >>>> Starting back demodulation with 196.
% 4.02/4.18
% 4.02/4.18 ======= end of input processing =======
% 4.02/4.18
% 4.02/4.18 =========== start of search ===========
% 4.02/4.18
% 4.02/4.18
% 4.02/4.18 Resetting weight limit to 7.
% 4.02/4.18
% 4.02/4.18
% 4.02/4.18 Resetting weight limit to 7.
% 4.02/4.18
% 4.02/4.18 sos_size=850
% 4.02/4.18
% 4.02/4.18 -------- PROOF --------
% 4.02/4.18
% 4.02/4.18 -----> EMPTY CLAUSE at 1.55 sec ----> 1354 [hyper,606,181,1085,1121,1052,185,187,462,192,193,195,demod,463,463,unit_del,77,1256] $F.
% 4.02/4.18
% 4.02/4.18 Length of proof is 15. Level of proof is 5.
% 4.02/4.18
% 4.02/4.18 ---------------- PROOF ----------------
% 4.02/4.18 % SZS status Theorem
% 4.02/4.18 % SZS output start Refutation
% See solution above
% 4.02/4.18 ------------ end of proof -------------
% 4.02/4.18
% 4.02/4.18
% 4.02/4.18 Search stopped by max_proofs option.
% 4.02/4.18
% 4.02/4.18
% 4.02/4.18 Search stopped by max_proofs option.
% 4.02/4.18
% 4.02/4.18 ============ end of search ============
% 4.02/4.18
% 4.02/4.18 -------------- statistics -------------
% 4.02/4.18 clauses given 1011
% 4.02/4.18 clauses generated 184939
% 4.02/4.18 clauses kept 1306
% 4.02/4.18 clauses forward subsumed 4564
% 4.02/4.18 clauses back subsumed 52
% 4.02/4.18 Kbytes malloced 6835
% 4.02/4.18
% 4.02/4.18 ----------- times (seconds) -----------
% 4.02/4.18 user CPU time 1.55 (0 hr, 0 min, 1 sec)
% 4.02/4.18 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 4.02/4.18 wall-clock time 4 (0 hr, 0 min, 4 sec)
% 4.02/4.18
% 4.02/4.18 That finishes the proof of the theorem.
% 4.02/4.18
% 4.02/4.18 Process 19506 finished Wed Jul 27 06:33:58 2022
% 4.02/4.18 Otter interrupted
% 4.02/4.18 PROOF FOUND
%------------------------------------------------------------------------------