0.03/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer   : n014.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   : 960
0.12/0.33	% DateTime   : Thu Jul  2 07:44:10 EDT 2020
0.12/0.33	% CPUTime    : 
0.93/1.22	============================== Prover9 ===============================
0.93/1.22	Prover9 (32) version 2009-11A, November 2009.
0.93/1.22	Process 6196 was started by sandbox2 on n014.cluster.edu,
0.93/1.22	Thu Jul  2 07:44:11 2020
0.93/1.22	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_6019_n014.cluster.edu".
0.93/1.22	============================== end of head ===========================
0.93/1.22	
0.93/1.22	============================== INPUT =================================
0.93/1.22	
0.93/1.22	% Reading from file /tmp/Prover9_6019_n014.cluster.edu
0.93/1.22	
0.93/1.22	set(prolog_style_variables).
0.93/1.22	set(auto2).
0.93/1.22	    % set(auto2) -> set(auto).
0.93/1.22	    % set(auto) -> set(auto_inference).
0.93/1.22	    % set(auto) -> set(auto_setup).
0.93/1.22	    % set(auto_setup) -> set(predicate_elim).
0.93/1.22	    % set(auto_setup) -> assign(eq_defs, unfold).
0.93/1.22	    % set(auto) -> set(auto_limits).
0.93/1.22	    % set(auto_limits) -> assign(max_weight, "100.000").
0.93/1.22	    % set(auto_limits) -> assign(sos_limit, 20000).
0.93/1.22	    % set(auto) -> set(auto_denials).
0.93/1.22	    % set(auto) -> set(auto_process).
0.93/1.22	    % set(auto2) -> assign(new_constants, 1).
0.93/1.22	    % set(auto2) -> assign(fold_denial_max, 3).
0.93/1.22	    % set(auto2) -> assign(max_weight, "200.000").
0.93/1.22	    % set(auto2) -> assign(max_hours, 1).
0.93/1.22	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.93/1.22	    % set(auto2) -> assign(max_seconds, 0).
0.93/1.22	    % set(auto2) -> assign(max_minutes, 5).
0.93/1.22	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.93/1.22	    % set(auto2) -> set(sort_initial_sos).
0.93/1.22	    % set(auto2) -> assign(sos_limit, -1).
0.93/1.22	    % set(auto2) -> assign(lrs_ticks, 3000).
0.93/1.22	    % set(auto2) -> assign(max_megs, 400).
0.93/1.22	    % set(auto2) -> assign(stats, some).
0.93/1.22	    % set(auto2) -> clear(echo_input).
0.93/1.22	    % set(auto2) -> set(quiet).
0.93/1.22	    % set(auto2) -> clear(print_initial_clauses).
0.93/1.22	    % set(auto2) -> clear(print_given).
0.93/1.22	assign(lrs_ticks,-1).
0.93/1.22	assign(sos_limit,10000).
0.93/1.22	assign(order,kbo).
0.93/1.22	set(lex_order_vars).
0.93/1.22	clear(print_given).
0.93/1.22	
0.93/1.22	% formulas(sos).  % not echoed (67 formulas)
0.93/1.22	
0.93/1.22	============================== end of input ==========================
0.93/1.22	
0.93/1.22	% From the command line: assign(max_seconds, 960).
0.93/1.22	
0.93/1.22	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.93/1.22	
0.93/1.22	% Formulas that are not ordinary clauses:
0.93/1.22	1 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	2 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	3 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	4 (all X all Y (m_NormQ(X) != m_NormQ(Y) <-> Y != X)) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	5 (all X all Y all Z m_Ldr(Z) != m_Ack(X,Y)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	6 (all Q (q_nil = Q | cons(head(Q),tail(Q)) = Q)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	7 (all X all Q ((all Y (pidElem(X) & pidElem(Y) & elem(Y,Q) & host(pidMsg(X)) = host(pidMsg(Y)) -> leq(pidMsg(Y),pidMsg(X)))) & ordered(Q) <-> ordered(snoc(Q,X)))) # label(axiom_54) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	8 (all X (pidElem(X) <-> (exists Y (X = m_Down(Y) | X = m_Halt(Y))))) # label(axiom_48) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	9 (all X all Y (leq(X,Y) & leq(Y,X) <-> X = Y)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	10 (all Pid all Pid2 (host(Pid2) != host(Pid) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	11 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	12 (all Q all X all Y (host(Y) = host(X) & ordered(cons(m_Halt(X),Q)) & elem(m_Down(Y),Q) -> leq(X,Y))) # label(axiom_57) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	13 (all X all Y m_Down(X) != m_NormQ(Y)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	14 (all X all Y m_NormQ(Y) != m_Ldr(X)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	15 (all X all Y all Z m_NotNorm(Z) != m_Ack(X,Y)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	16 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	17 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	18 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	19 (all X (ordered(snoc(q_nil,X)) & ordered(cons(X,q_nil)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	20 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	21 (all X all Y m_Halt(Y) != m_Ldr(X)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	22 (all X all Y (m_Down(X) != m_Down(Y) <-> X != Y)) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	23 (all X all Y m_Ldr(Y) != m_Down(X)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	24 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	25 (all Pid all Pid2 (elem(m_Ack(Pid,Pid2),queue(host(Pid))) -> setIn(Pid,pids) & setIn(Pid2,pids))) # label(axiom) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	26 (all Y all Q last(snoc(Q,Y)) = Y) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	27 (all X all Y all Q snoc(cons(X,Q),Y) = cons(X,snoc(Q,Y))) # label(axiom_44) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	28 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	29 (all X all Y all Z m_Halt(Z) != m_Ack(X,Y)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	30 (all X all Y (Y != X <-> m_Ldr(Y) != m_Ldr(X))) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	31 (all X1 all X2 all Y1 all Y2 (X1 != X2 -> m_Ack(X2,Y2) != m_Ack(X1,Y1))) # label(axiom_31) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	32 (all X all Y all Q (elem(X,snoc(Q,Y)) <-> X = Y | elem(X,Q))) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	33 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	34 (all Q all X all Y (ordered(Q) -> ordered(snoc(Q,m_Ack(X,Y))))) # label(axiom_55) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	35 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	36 (all P all Q (s(host(P)) = host(Q) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	37 (all X all Y all Q (elem(X,Q) | Y = X <-> elem(X,cons(Y,Q)))) # label(axiom_46) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	38 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	39 (all X all Q cons(X,Q) != q_nil) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	40 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	41 (all X pidMsg(m_Halt(X)) = X) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	42 (all X all Y all Z m_Down(Z) != m_Ack(X,Y)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	43 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	44 (all X1 all X2 all Y1 all Y2 (Y2 != Y1 -> m_Ack(X2,Y2) != m_Ack(X1,Y1))) # label(axiom_32) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	45 (all X all Y all Z (leq(X,Y) & leq(Y,Z) -> leq(X,Z))) # label(axiom_62) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	46 (all X all Y (X = s(Y) | leq(X,Y) <-> leq(X,s(Y)))) # label(axiom_64) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	47 (all X cons(X,q_nil) = snoc(q_nil,X)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	48 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	49 (all Q (Q = q_nil | Q = snoc(init(Q),last(Q)))) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	50 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.93/1.22	51 (all X all Y (m_NotNorm(X) != m_NotNorm(Y) <-> X != Y)) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.93/1.23	52 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.93/1.23	53 (all X all Y (leq(Y,X) | leq(X,Y))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.93/1.23	54 (all X all Y (m_Halt(Y) != m_Halt(X) <-> Y != X)) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.93/1.23	55 (all X all Q (ordered(cons(X,Q)) <-> ordered(Q) & (all Y (pidElem(X) & host(pidMsg(Y)) = host(pidMsg(X)) & pidElem(Y) & elem(Y,Q) -> leq(pidMsg(X),pidMsg(Y)))))) # label(axiom_53) # label(axiom) # label(non_clause).  [assumption].
0.93/1.23	56 (all X all Q head(cons(X,Q)) = X) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.93/1.23	57 (all X all Y all Z m_NormQ(Z) != m_Ack(X,Y)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.93/1.23	58 -(all V all W all X all Y ((all Z (index(status,host(Z)) = elec_2 -> -leq(index(pendack,host(Z)),host(Z)))) & (all Z all Pid20 all Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid20))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (host(Z) = host(Pid0) & Z != Pid0 -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (all Z all Pid0 (setIn(Pid0,alive) & elec_2 = index(status,host(Pid0)) -> -elem(m_Ack(Z,Pid0),queue(host(Z))))) & (all Z (setIn(Z,alive) & (index(status,host(Z)) = elec_2 | elec_1 = index(status,host(Z))) -> Z = index(elid,host(Z)))) & (all Z all Pid20 all Pid0 (index(status,host(Pid0)) = elec_2 & elec_2 = index(status,host(Z)) & host(Pid0) = host(Pid20) & setIn(Pid0,alive) & setIn(Z,alive) -> -elem(m_Ack(Z,Pid20),queue(host(Z))))) & (all Z all Pid0 (-leq(host(Z),host(Pid0)) & setIn(Z,alive) & index(status,host(Z)) = elec_2 & elec_2 = index(status,host(Pid0)) & setIn(Pid0,alive) -> -leq(index(pendack,host(Z)),index(pendack,host(Pid0))))) & queue(host(X)) = cons(m_Down(Y),V) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & elem(m_Down(Pid20),queue(host(Z))) & index(status,host(Pid0)) = elec_2 & host(Pid0) = host(Pid20) & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid0 (setIn(Pid0,alive) & elec_2 = index(status,host(Z)) & elec_2 = index(status,host(Pid0)) & setIn(Z,alive) & -leq(host(Z),host(Pid0)) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid20 all Pid0 (-leq(host(Pid0),host(Z)) & elec_2 = index(status,host(Pid0)) & host(Pid20) = host(Pid0) & setIn(Pid0,alive) & setIn(Z,alive) -> -elem(m_Down(Pid20),queue(host(Z))))) & (all Z all Pid0 (setIn(Z,alive) & setIn(host(Pid0),index(down,host(Z))) & index(status,host(Pid0)) = elec_2 & setIn(Pid0,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid0 (elem(m_Halt(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) -> (setIn(X,alive) -> (-leq(host(X),host(Y)) -> (-(wait = index(status,host(X)) & host(index(elid,host(X))) = host(Y) | host(Y) = index(ldr,host(X)) & norm = index(status,host(X))) -> ((all Z (leq(s(zero),Z) & -leq(host(X),Z) -> setIn(Z,index(down,host(X))) | Z = host(Y))) & index(status,host(X)) = elec_1 -> (-leq(nbr_proc,host(X)) -> (all Z (host(Z) = host(X) -> (all W0 (host(X) != host(W0) -> (setIn(Z,alive) & index(status,host(W0)) = elec_2 & setIn(W0,alive) & -leq(host(Z),host(W0)) -> -leq(s(host(X)),index(pendack,host(W0))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.93/1.23	
0.93/1.23	============================== end of process non-clausal formulas ===
0.93/1.23	
0.93/1.23	============================== PROCESS INITIAL CLAUSES ===============
0.93/1.23	
0.93/1.23	============================== PREDICATE ELIMINATION =================
0.93/1.23	
0.93/1.23	============================== end predicate elimination =============
0.93/1.23	
0.93/1.23	Auto_denials:  (non-Horn, no changes).
0.93/1.23	
0.93/1.23	Term ordering decisions:
0.93/1.23	Function symbol KB weights:  alive=1. status=1. elec_2=1. q_nil=1. pendack=1. zero=1. down=1. elec_1=1. elid=1. nbr_proc=1. pids=1. ldr=1. nil=1. norm=1. setEmpty=1. wait=1. c1=1. c3=1. c4=1. c5=1. c6=1. index=1. cons=1. snoc=1. m_Ack=1. f1=1. f3=1. host=1. pidMsg=1. s=1. m_Down=1. m_Halt=1. m_Ldr=1. queue=1. m_NormQ=1. m_NotNorm=1. head=1. init=1. last=1. tail=1. f2=1.
0.93/1.23	
0.93/1.23	============================== end of process initial clauses ========
14.54/14.83	
14.54/14.83	============================== CLAUSES FOR SEARCH ====================
14.54/14.83	
14.54/14.83	============================== end of clauses for search =============
14.54/14.83	
14.54/14.83	============================== SEARCH ================================
14.54/14.83	
14.54/14.83	% Starting search at 0.02 seconds.
14.54/14.83	
14.54/14.83	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 166 (0.00 of 0.34 sec).
14.54/14.83	
14.54/14.83	Low Water (keep): wt=22.000, iters=5297
14.54/14.83	
14.54/14.83	Low Water (keep): wt=18.000, iters=4582
14.54/14.83	
14.54/14.83	Low Water (keep): wt=16.000, iters=5294
14.54/14.83	
14.54/14.83	Low Water (keep): wt=15.000, iters=4019
14.54/14.83	
14.54/14.83	Low Water (keep): wt=14.000, iters=3333
14.54/14.83	
14.54/14.83	Low Water (displace): id=3540, wt=115.000
14.54/14.83	
14.54/14.83	Low Water (displace): id=5132, wt=82.000
14.54/14.83	
14.54/14.83	Low Water (displace): id=3529, wt=73.000
14.54/14.83	
14.54/14.83	Low Water (displace): id=5509, wt=59.000
14.54/14.83	
14.54/14.83	Low Water (displace): id=15732, wt=57.000
14.54/14.83	
14.54/14.83	Low Water (displace): id=14979, wt=56.000
14.54/14.83	
14.54/14.83	Low Water (displace): id=15771, wt=53.000
14.54/14.83	
14.54/14.83	Low Water (displace): id=3519, wt=52.000
14.54/14.83	
14.54/14.83	Low Water (displace): id=6203, wt=50.000
14.54/14.83	
14.54/14.83	Low Water (displace): id=5512, wt=48.000
14.54/14.83	
14.54/14.83	Low Water (displace): id=5515, wt=47.000
14.54/14.83	
14.54/14.83	Low Water (displace): id=5514, wt=45.000
14.54/14.83	
14.54/14.83	Low Water (displace): id=3514, wt=44.000
14.54/14.83	
14.54/14.83	Low Water (displace): id=5513, wt=43.000
14.54/14.83	
14.54/14.83	============================== PROOF =================================
14.54/14.83	% SZS status Theorem
14.54/14.83	% SZS output start Refutation
14.54/14.83	
14.54/14.83	% Proof 1 at 13.11 (+ 0.51) seconds.
14.54/14.83	% Length of proof is 61.
14.54/14.83	% Level of proof is 11.
14.54/14.83	% Maximum clause weight is 33.000.
14.54/14.83	% Given clauses 5601.
14.54/14.83	
14.54/14.83	6 (all Q (q_nil = Q | cons(head(Q),tail(Q)) = Q)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
14.54/14.83	9 (all X all Y (leq(X,Y) & leq(Y,X) <-> X = Y)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
14.54/14.83	10 (all Pid all Pid2 (host(Pid2) != host(Pid) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
14.54/14.83	17 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
14.54/14.83	24 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
14.54/14.83	33 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
14.54/14.83	36 (all P all Q (s(host(P)) = host(Q) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
14.54/14.83	37 (all X all Y all Q (elem(X,Q) | Y = X <-> elem(X,cons(Y,Q)))) # label(axiom_46) # label(axiom) # label(non_clause).  [assumption].
14.54/14.83	45 (all X all Y all Z (leq(X,Y) & leq(Y,Z) -> leq(X,Z))) # label(axiom_62) # label(axiom) # label(non_clause).  [assumption].
14.54/14.83	46 (all X all Y (X = s(Y) | leq(X,Y) <-> leq(X,s(Y)))) # label(axiom_64) # label(axiom) # label(non_clause).  [assumption].
14.54/14.83	52 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
14.54/14.83	58 -(all V all W all X all Y ((all Z (index(status,host(Z)) = elec_2 -> -leq(index(pendack,host(Z)),host(Z)))) & (all Z all Pid20 all Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid20))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (host(Z) = host(Pid0) & Z != Pid0 -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (all Z all Pid0 (setIn(Pid0,alive) & elec_2 = index(status,host(Pid0)) -> -elem(m_Ack(Z,Pid0),queue(host(Z))))) & (all Z (setIn(Z,alive) & (index(status,host(Z)) = elec_2 | elec_1 = index(status,host(Z))) -> Z = index(elid,host(Z)))) & (all Z all Pid20 all Pid0 (index(status,host(Pid0)) = elec_2 & elec_2 = index(status,host(Z)) & host(Pid0) = host(Pid20) & setIn(Pid0,alive) & setIn(Z,alive) -> -elem(m_Ack(Z,Pid20),queue(host(Z))))) & (all Z all Pid0 (-leq(host(Z),host(Pid0)) & setIn(Z,alive) & index(status,host(Z)) = elec_2 & elec_2 = index(status,host(Pid0)) & setIn(Pid0,alive) -> -leq(index(pendack,host(Z)),index(pendack,host(Pid0))))) & queue(host(X)) = cons(m_Down(Y),V) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & elem(m_Down(Pid20),queue(host(Z))) & index(status,host(Pid0)) = elec_2 & host(Pid0) = host(Pid20) & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid0 (setIn(Pid0,alive) & elec_2 = index(status,host(Z)) & elec_2 = index(status,host(Pid0)) & setIn(Z,alive) & -leq(host(Z),host(Pid0)) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid20 all Pid0 (-leq(host(Pid0),host(Z)) & elec_2 = index(status,host(Pid0)) & host(Pid20) = host(Pid0) & setIn(Pid0,alive) & setIn(Z,alive) -> -elem(m_Down(Pid20),queue(host(Z))))) & (all Z all Pid0 (setIn(Z,alive) & setIn(host(Pid0),index(down,host(Z))) & index(status,host(Pid0)) = elec_2 & setIn(Pid0,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid0 (elem(m_Halt(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) -> (setIn(X,alive) -> (-leq(host(X),host(Y)) -> (-(wait = index(status,host(X)) & host(index(elid,host(X))) = host(Y) | host(Y) = index(ldr,host(X)) & norm = index(status,host(X))) -> ((all Z (leq(s(zero),Z) & -leq(host(X),Z) -> setIn(Z,index(down,host(X))) | Z = host(Y))) & index(status,host(X)) = elec_1 -> (-leq(nbr_proc,host(X)) -> (all Z (host(Z) = host(X) -> (all W0 (host(X) != host(W0) -> (setIn(Z,alive) & index(status,host(W0)) = elec_2 & setIn(W0,alive) & -leq(host(Z),host(W0)) -> -leq(s(host(X)),index(pendack,host(W0))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
14.54/14.83	66 q_nil = A | cons(head(A),tail(A)) = A # label(axiom_39) # label(axiom).  [clausify(6)].
14.54/14.83	77 -leq(A,B) | -leq(B,A) | B = A # label(axiom_61) # label(axiom).  [clausify(9)].
14.54/14.83	80 host(A) = host(B) | A != B # label(axiom_33) # label(axiom).  [clausify(10)].
14.54/14.83	88 leq(A,A) # label(axiom_59) # label(axiom).  [clausify(17)].
14.54/14.83	99 -leq(s(A),A) # label(axiom_58) # label(axiom).  [clausify(24)].
14.54/14.83	115 init(snoc(A,B)) = A # label(axiom_38) # label(axiom).  [clausify(33)].
14.54/14.83	118 s(host(A)) != host(B) | host(A) != host(B) # label(axiom_01) # label(axiom).  [clausify(36)].
14.54/14.83	120 A != B | elem(B,cons(A,C)) # label(axiom_46) # label(axiom).  [clausify(37)].
14.54/14.83	133 -leq(A,B) | -leq(B,C) | leq(A,C) # label(axiom_62) # label(axiom).  [clausify(45)].
14.54/14.83	134 -leq(A,B) | leq(A,s(B)) # label(axiom_64) # label(axiom).  [clausify(46)].
14.54/14.83	143 leq(s(zero),host(A)) # label(axiom_02) # label(axiom).  [clausify(52)].
14.54/14.83	167 queue(host(c3)) = cons(m_Down(c4),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
14.54/14.83	168 cons(m_Down(c4),c1) = queue(host(c3)).  [copy(167),flip(a)].
14.54/14.83	169 -setIn(A,alive) | -elem(m_Down(B),queue(host(C))) | index(status,host(A)) != elec_2 | host(A) != host(B) | -setIn(C,alive) | leq(index(pendack,host(A)),host(C)) # label(conj) # label(negated_conjecture).  [clausify(58)].
14.54/14.83	172 -setIn(A,alive) | -setIn(host(B),index(down,host(A))) | index(status,host(B)) != elec_2 | -setIn(B,alive) | leq(index(pendack,host(B)),host(A)) # label(conj) # label(negated_conjecture).  [clausify(58)].
14.54/14.83	174 setIn(c3,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
14.54/14.83	178 -leq(s(zero),A) | leq(host(c3),A) | setIn(A,index(down,host(c3))) | host(c4) = A # label(conj) # label(negated_conjecture).  [clausify(58)].
14.54/14.83	182 host(c5) = host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
14.54/14.83	185 index(status,host(c6)) = elec_2 # label(conj) # label(negated_conjecture).  [clausify(58)].
14.54/14.83	186 elec_2 = index(status,host(c6)).  [copy(185),flip(a)].
14.54/14.83	187 setIn(c6,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
14.54/14.83	188 -leq(host(c5),host(c6)) # label(conj) # label(negated_conjecture).  [clausify(58)].
14.54/14.83	189 -leq(host(c3),host(c6)).  [copy(188),rewrite([182(2)])].
14.54/14.83	190 leq(s(host(c3)),index(pendack,host(c6))) # label(conj) # label(negated_conjecture).  [clausify(58)].
14.54/14.83	198 -setIn(A,alive) | -setIn(host(B),index(down,host(A))) | index(status,host(c6)) != index(status,host(B)) | -setIn(B,alive) | leq(index(pendack,host(B)),host(A)).  [back_rewrite(172),rewrite([186(11)]),flip(c)].
14.54/14.83	201 -setIn(A,alive) | -elem(m_Down(B),queue(host(C))) | index(status,host(c6)) != index(status,host(A)) | host(A) != host(B) | -setIn(C,alive) | leq(index(pendack,host(A)),host(C)).  [back_rewrite(169),rewrite([186(10)]),flip(c)].
14.54/14.83	216 host(cons(head(A),tail(A))) = host(A) | q_nil = A.  [resolve(80,b,66,b)].
14.54/14.83	235 elem(A,cons(A,B)).  [resolve(120,a,115,a),rewrite([115(2)])].
14.54/14.83	250 leq(A,s(A)).  [resolve(134,a,88,a)].
14.54/14.83	300 leq(host(c3),host(A)) | setIn(host(A),index(down,host(c3))) | host(c4) = host(A).  [resolve(178,a,143,a)].
14.54/14.83	304 s(host(A)) != host(c3) | host(c3) != host(A).  [para(182(a,1),118(a,2)),rewrite([182(8)]),flip(b)].
14.54/14.83	310 -leq(index(pendack,host(c6)),A) | leq(s(host(c3)),A).  [resolve(190,a,133,a)].
14.54/14.83	312 -leq(index(pendack,host(c6)),s(host(c3))) | index(pendack,host(c6)) = s(host(c3)).  [resolve(190,a,77,b),flip(b)].
14.54/14.83	340 -leq(s(A),B) | leq(A,B).  [resolve(250,a,133,a)].
14.54/14.83	353 elem(m_Down(c4),queue(host(c3))).  [para(168(a,1),235(a,2))].
14.54/14.83	437 q_nil = A | s(host(A)) != host(B) | host(cons(head(A),tail(A))) != host(B).  [para(216(a,1),118(a,1,1))].
14.54/14.83	457 -setIn(A,alive) | index(status,host(c6)) != index(status,host(A)) | host(c4) != host(A) | leq(index(pendack,host(A)),host(c3)).  [resolve(353,a,201,b),flip(c),unit_del(d,174)].
14.54/14.83	599 leq(host(c3),index(pendack,host(c6))).  [resolve(340,a,190,a)].
14.54/14.83	745 -leq(index(pendack,host(c6)),host(c3)) | index(pendack,host(c6)) = host(c3).  [resolve(599,a,77,b),flip(b)].
14.54/14.83	1934 leq(host(c3),host(A)) | host(c4) = host(A) | index(status,host(c6)) != index(status,host(A)) | -setIn(A,alive) | leq(index(pendack,host(A)),host(c3)).  [resolve(300,b,198,b),unit_del(c,174)].
14.54/14.83	6251 q_nil = A | s(host(A)) != host(A).  [resolve(437,c,216,a),merge(c)].
14.54/14.83	7240 host(c6) != host(c4) | leq(index(pendack,host(c6)),host(c3)).  [resolve(457,a,187,a),flip(b),xx(a)].
14.54/14.83	16510 host(c6) = host(c4) | leq(index(pendack,host(c6)),host(c3)).  [resolve(1934,d,187,a),flip(b),xx(c),unit_del(a,189)].
14.54/14.83	16928 host(c6) = host(c4).  [resolve(16510,b,310,a),unit_del(b,99)].
14.54/14.83	17090 leq(index(pendack,host(c4)),host(c3)).  [back_rewrite(7240),rewrite([16928(2),16928(8)]),xx(a)].
14.54/14.83	17409 index(pendack,host(c4)) = host(c3).  [back_rewrite(745),rewrite([16928(3),16928(10)]),unit_del(a,17090)].
14.54/14.83	17411 s(host(c3)) = host(c3).  [back_rewrite(312),rewrite([16928(3),17409(4),16928(9),17409(10)]),flip(b),unit_del(a,250)].
14.54/14.83	17643 c3 = q_nil.  [resolve(17411,a,6251,b),flip(a)].
14.54/14.83	17644 $F.  [resolve(17411,a,304,a),rewrite([17643(1),17643(3)]),xx(a)].
14.54/14.83	
14.54/14.83	% SZS output end Refutation
14.54/14.83	============================== end of proof ==========================
14.54/14.83	
14.54/14.83	============================== STATISTICS ============================
14.54/14.83	
14.54/14.83	Given=5601. Generated=1067764. Kept=17576. proofs=1.
14.54/14.83	Usable=3604. Sos=8328. Demods=67. Limbo=1, Disabled=5767. Hints=0.
14.54/14.83	Megabytes=26.30.
14.54/14.83	User_CPU=13.11, System_CPU=0.51, Wall_clock=13.
14.54/14.83	
14.54/14.83	============================== end of statistics =====================
14.54/14.83	
14.54/14.83	============================== end of search =========================
14.54/14.83	
14.54/14.83	THEOREM PROVED
14.54/14.83	% SZS status Theorem
14.54/14.83	
14.54/14.83	Exiting with 1 proof.
14.54/14.83	
14.54/14.83	Process 6196 exit (max_proofs) Thu Jul  2 07:44:24 2020
14.54/14.83	Prover9 interrupted
14.54/14.83	EOF