0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.34	% Computer   : n025.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   : 180
0.12/0.34	% DateTime   : Thu Aug 29 09:43:45 EDT 2019
0.12/0.34	% CPUTime    : 
0.81/1.09	============================== Prover9 ===============================
0.81/1.09	Prover9 (32) version 2009-11A, November 2009.
0.81/1.09	Process 19107 was started by sandbox2 on n025.cluster.edu,
0.81/1.09	Thu Aug 29 09:43:46 2019
0.81/1.09	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 180 -f /tmp/Prover9_18954_n025.cluster.edu".
0.81/1.09	============================== end of head ===========================
0.81/1.09	
0.81/1.09	============================== INPUT =================================
0.81/1.09	
0.81/1.09	% Reading from file /tmp/Prover9_18954_n025.cluster.edu
0.81/1.09	
0.81/1.09	set(prolog_style_variables).
0.81/1.09	set(auto2).
0.81/1.09	    % set(auto2) -> set(auto).
0.81/1.09	    % set(auto) -> set(auto_inference).
0.81/1.09	    % set(auto) -> set(auto_setup).
0.81/1.09	    % set(auto_setup) -> set(predicate_elim).
0.81/1.09	    % set(auto_setup) -> assign(eq_defs, unfold).
0.81/1.09	    % set(auto) -> set(auto_limits).
0.81/1.09	    % set(auto_limits) -> assign(max_weight, "100.000").
0.81/1.09	    % set(auto_limits) -> assign(sos_limit, 20000).
0.81/1.09	    % set(auto) -> set(auto_denials).
0.81/1.09	    % set(auto) -> set(auto_process).
0.81/1.09	    % set(auto2) -> assign(new_constants, 1).
0.81/1.09	    % set(auto2) -> assign(fold_denial_max, 3).
0.81/1.09	    % set(auto2) -> assign(max_weight, "200.000").
0.81/1.09	    % set(auto2) -> assign(max_hours, 1).
0.81/1.09	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.81/1.09	    % set(auto2) -> assign(max_seconds, 0).
0.81/1.09	    % set(auto2) -> assign(max_minutes, 5).
0.81/1.09	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.81/1.09	    % set(auto2) -> set(sort_initial_sos).
0.81/1.09	    % set(auto2) -> assign(sos_limit, -1).
0.81/1.09	    % set(auto2) -> assign(lrs_ticks, 3000).
0.81/1.09	    % set(auto2) -> assign(max_megs, 400).
0.81/1.09	    % set(auto2) -> assign(stats, some).
0.81/1.09	    % set(auto2) -> clear(echo_input).
0.81/1.09	    % set(auto2) -> set(quiet).
0.81/1.09	    % set(auto2) -> clear(print_initial_clauses).
0.81/1.09	    % set(auto2) -> clear(print_given).
0.81/1.09	assign(lrs_ticks,-1).
0.81/1.09	assign(sos_limit,10000).
0.81/1.09	assign(order,kbo).
0.81/1.09	set(lex_order_vars).
0.81/1.09	clear(print_given).
0.81/1.09	
0.81/1.09	% formulas(sos).  % not echoed (67 formulas)
0.81/1.09	
0.81/1.09	============================== end of input ==========================
0.81/1.09	
0.81/1.09	% From the command line: assign(max_seconds, 180).
0.81/1.09	
0.81/1.09	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.81/1.09	
0.81/1.09	% Formulas that are not ordinary clauses:
0.81/1.09	1 (all X all Y (Y != X <-> m_NotNorm(Y) != m_NotNorm(X))) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	2 (all X (pidElem(X) <-> (exists Y (m_Halt(Y) = X | m_Down(Y) = X)))) # label(axiom_48) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	3 (all X all Y (Y != X <-> m_Ldr(Y) != m_Ldr(X))) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	4 (all X all Y (m_Down(Y) != m_Down(X) <-> X != Y)) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	5 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid2 != Pid)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	6 (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.81/1.09	7 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	8 (all X all Y (Y != X <-> m_NormQ(X) != m_NormQ(Y))) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	9 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	10 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	11 (all X all Y all Z m_Ack(X,Y) != m_Halt(Z)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	12 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	13 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	14 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	15 (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.81/1.09	16 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	17 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	18 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	19 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	20 (all X all Y (leq(Y,X) | leq(X,Y))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	21 (all X all Q ((all Y (host(pidMsg(Y)) = host(pidMsg(X)) & pidElem(Y) & pidElem(X) & elem(Y,Q) -> leq(pidMsg(Y),pidMsg(X)))) & ordered(Q) <-> ordered(snoc(Q,X)))) # label(axiom_54) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	22 (all X X = pidMsg(m_Down(X))) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	23 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	24 (all Q (Q = cons(head(Q),tail(Q)) | q_nil = Q)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	25 (all X all Y all Z m_NotNorm(Z) != m_Ack(X,Y)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	26 (all X all Y all Q (X = Y | elem(X,Q) <-> elem(X,cons(Y,Q)))) # label(axiom_46) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	27 (all X all Y (X = s(Y) | leq(X,Y) <-> leq(X,s(Y)))) # label(axiom_64) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	28 (all P all Q (s(host(P)) = host(Q) -> host(Q) != host(P))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	29 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	30 (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.81/1.09	31 (all X all Q Q = tail(cons(X,Q))) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	32 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	33 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	34 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	35 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	36 (all X1 all X2 all Y1 all Y2 (Y1 != Y2 -> m_Ack(X1,Y1) != m_Ack(X2,Y2))) # label(axiom_32) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	37 (all Q (q_nil = Q | Q = snoc(init(Q),last(Q)))) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	38 (all Q all X all Y (host(X) = host(Y) & elem(m_Down(Y),Q) & ordered(cons(m_Halt(X),Q)) -> leq(X,Y))) # label(axiom_57) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	39 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	40 (all X all Q head(cons(X,Q)) = X) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	41 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	42 (all X all Y all Q (X = Y | elem(X,Q) <-> elem(X,snoc(Q,Y)))) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	43 (all X all Q (ordered(cons(X,Q)) <-> (all Y (elem(Y,Q) & pidElem(X) & pidElem(Y) & host(pidMsg(Y)) = host(pidMsg(X)) -> leq(pidMsg(X),pidMsg(Y)))) & ordered(Q))) # label(axiom_53) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	44 (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.81/1.09	45 (all Pid all Pid2 (elem(m_Ack(Pid,Pid2),queue(host(Pid))) -> setIn(Pid2,pids) & setIn(Pid,pids))) # label(axiom) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	46 (all X all Y m_Down(X) != m_NormQ(Y)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	47 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	48 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	49 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	50 (all X X = pidMsg(m_Halt(X))) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	51 (all X all Y m_Halt(Y) != m_Down(X)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	52 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	53 (all Y all Q last(snoc(Q,Y)) = Y) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	54 (all X all Y all Z m_Ack(X,Y) != m_Down(Z)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	55 (all X (ordered(snoc(q_nil,X)) & ordered(cons(X,q_nil)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	56 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	57 (all X all Y (m_Halt(Y) != m_Halt(X) <-> X != Y)) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	58 -(all V all W all X all Y ((all Z all Pid0 (elem(m_Ldr(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid20 all Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid20))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid0))) & setIn(Pid0,alive) -> leq(host(Z),index(pendack,host(Pid0))))) & (all Z all Pid0 (setIn(Pid0,alive) & index(status,host(Pid0)) = elec_1 -> -elem(m_Ack(Pid0,Z),queue(host(Pid0))))) & (all Z (setIn(Z,alive) & (index(status,host(Z)) = elec_2 | index(status,host(Z)) = elec_1) -> Z = index(elid,host(Z)))) & (all Z all Pid0 (-leq(host(Z),host(Pid0)) & setIn(Pid0,alive) & index(status,host(Pid0)) = elec_2 & elec_2 = index(status,host(Z)) & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid0 (-leq(host(Z),host(Pid0)) & setIn(Pid0,alive) & elec_2 = index(status,host(Pid0)) & index(status,host(Z)) = elec_2 & setIn(Z,alive) -> -leq(index(pendack,host(Z)),index(pendack,host(Pid0))))) & (all Z all Pid30 all Pid20 all Pid0 ((all V0 (leq(s(zero),V0) & -leq(host(Pid0),V0) -> host(Pid20) = V0 | setIn(V0,index(down,host(Pid0))))) & elem(m_Down(Pid20),queue(host(Pid0))) & nbr_proc = host(Pid0) & elec_1 = index(status,host(Pid0)) & host(Pid30) = host(Pid0) -> -(setIn(Z,alive) & elem(m_Down(Pid30),queue(host(Z)))))) & queue(host(X)) = cons(m_Ack(W,Y),V) & (all Z all Pid30 all Pid20 all Pid0 (elem(m_Ack(Pid0,Pid30),queue(host(Pid0))) & leq(nbr_proc,s(index(pendack,host(Pid0)))) & s(index(pendack,host(Pid0))) = host(Pid20) & index(pendack,host(Pid0)) = host(Pid30) & elec_2 = index(status,host(Pid0)) & elem(m_Down(Pid20),queue(host(Pid0))) & setIn(Pid0,alive) -> -(index(status,host(Z)) = norm & index(ldr,host(Z)) = host(Z) & setIn(Z,alive)))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & elem(m_Halt(Pid0),queue(host(Pid20))) & index(status,host(Pid0)) = elec_2 & -leq(index(pendack,host(Pid0)),host(Z)) -> -(norm = index(status,host(Z)) & host(Z) = index(ldr,host(Z)) & setIn(Z,alive)))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & elec_2 = index(status,host(Pid0)) & elec_2 = index(status,host(Z)) & host(Pid0) = host(Pid20) & setIn(Z,alive) -> -elem(m_Ack(Z,Pid20),queue(host(Z))))) & (all Z all Pid20 all Pid0 (elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid20) = host(Z) & setIn(Pid0,alive) -> -(setIn(Z,alive) & index(ldr,host(Z)) = host(Z) & norm = index(status,host(Z))))) & (all Z all Pid0 (Pid0 != Z & host(Z) = host(Pid0) -> -setIn(Pid0,alive) | -setIn(Z,alive))) & (all Z all Pid0 (elem(m_Halt(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Z) != host(Pid0))) -> (setIn(X,alive) -> (index(elid,host(X)) = W & host(Y) = index(pendack,host(X)) & elec_2 = index(status,host(X)) -> (leq(nbr_proc,index(pendack,host(X))) -> (all Z (host(Y) = host(Z) | setIn(host(Z),index(acks,host(X))) -> (all V0 (host(X) != host(V0) -> (all W0 all X0 all Y0 (host(Z) = host(Y0) -> (host(Y0) != host(X) -> (setIn(Y0,alive) & elem(m_Down(X0),snoc(queue(host(Y0)),m_Ldr(X))) & host(X0) = s(index(pendack,host(Y0))) & host(W0) = index(pendack,host(Y0)) & index(status,host(Y0)) = elec_2 & elem(m_Ack(Y0,W0),snoc(queue(host(Y0)),m_Ldr(X))) & leq(nbr_proc,s(index(pendack,host(Y0)))) -> -(setIn(V0,alive) & index(ldr,host(V0)) = host(V0) & norm = index(status,host(V0)))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.92/1.21	
0.92/1.21	============================== end of process non-clausal formulas ===
0.92/1.21	
0.92/1.21	============================== PROCESS INITIAL CLAUSES ===============
0.92/1.21	
0.92/1.21	============================== PREDICATE ELIMINATION =================
0.92/1.21	
0.92/1.21	============================== end predicate elimination =============
0.92/1.21	
0.92/1.21	Auto_denials:  (non-Horn, no changes).
0.92/1.21	
0.92/1.21	Term ordering decisions:
0.92/1.21	Function symbol KB weights:  alive=1. status=1. pendack=1. elec_2=1. q_nil=1. nbr_proc=1. elid=1. zero=1. elec_1=1. ldr=1. norm=1. pids=1. acks=1. down=1. nil=1. setEmpty=1. wait=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. index=1. snoc=1. cons=1. m_Ack=1. f2=1. f3=1. host=1. pidMsg=1. s=1. m_Down=1. m_Halt=1. queue=1. m_Ldr=1. m_NormQ=1. m_NotNorm=1. head=1. init=1. last=1. tail=1. f1=1. f4=1.
0.92/1.21	
0.92/1.21	============================== end of process initial clauses ========
0.92/1.21	
0.92/1.21	============================== CLAUSES FOR SEARCH ====================
0.92/1.21	
0.92/1.21	============================== end of clauses for search =============
0.92/1.21	
0.92/1.21	============================== SEARCH ================================
0.92/1.21	
0.92/1.21	% Starting search at 0.04 seconds.
0.92/1.21	
0.92/1.21	============================== PROOF =================================
0.92/1.21	% SZS status Theorem
0.92/1.21	% SZS output start Refutation
0.92/1.21	
0.92/1.21	% Proof 1 at 0.13 (+ 0.01) seconds.
0.92/1.21	% Length of proof is 53.
0.92/1.21	% Level of proof is 11.
0.92/1.21	% Maximum clause weight is 66.000.
0.92/1.21	% Given clauses 299.
0.92/1.21	
0.92/1.21	12 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.92/1.21	13 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.92/1.21	33 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.92/1.21	42 (all X all Y all Q (X = Y | elem(X,Q) <-> elem(X,snoc(Q,Y)))) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
0.92/1.21	52 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.92/1.21	58 -(all V all W all X all Y ((all Z all Pid0 (elem(m_Ldr(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid20 all Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid20))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid0))) & setIn(Pid0,alive) -> leq(host(Z),index(pendack,host(Pid0))))) & (all Z all Pid0 (setIn(Pid0,alive) & index(status,host(Pid0)) = elec_1 -> -elem(m_Ack(Pid0,Z),queue(host(Pid0))))) & (all Z (setIn(Z,alive) & (index(status,host(Z)) = elec_2 | index(status,host(Z)) = elec_1) -> Z = index(elid,host(Z)))) & (all Z all Pid0 (-leq(host(Z),host(Pid0)) & setIn(Pid0,alive) & index(status,host(Pid0)) = elec_2 & elec_2 = index(status,host(Z)) & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid0 (-leq(host(Z),host(Pid0)) & setIn(Pid0,alive) & elec_2 = index(status,host(Pid0)) & index(status,host(Z)) = elec_2 & setIn(Z,alive) -> -leq(index(pendack,host(Z)),index(pendack,host(Pid0))))) & (all Z all Pid30 all Pid20 all Pid0 ((all V0 (leq(s(zero),V0) & -leq(host(Pid0),V0) -> host(Pid20) = V0 | setIn(V0,index(down,host(Pid0))))) & elem(m_Down(Pid20),queue(host(Pid0))) & nbr_proc = host(Pid0) & elec_1 = index(status,host(Pid0)) & host(Pid30) = host(Pid0) -> -(setIn(Z,alive) & elem(m_Down(Pid30),queue(host(Z)))))) & queue(host(X)) = cons(m_Ack(W,Y),V) & (all Z all Pid30 all Pid20 all Pid0 (elem(m_Ack(Pid0,Pid30),queue(host(Pid0))) & leq(nbr_proc,s(index(pendack,host(Pid0)))) & s(index(pendack,host(Pid0))) = host(Pid20) & index(pendack,host(Pid0)) = host(Pid30) & elec_2 = index(status,host(Pid0)) & elem(m_Down(Pid20),queue(host(Pid0))) & setIn(Pid0,alive) -> -(index(status,host(Z)) = norm & index(ldr,host(Z)) = host(Z) & setIn(Z,alive)))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & elem(m_Halt(Pid0),queue(host(Pid20))) & index(status,host(Pid0)) = elec_2 & -leq(index(pendack,host(Pid0)),host(Z)) -> -(norm = index(status,host(Z)) & host(Z) = index(ldr,host(Z)) & setIn(Z,alive)))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & elec_2 = index(status,host(Pid0)) & elec_2 = index(status,host(Z)) & host(Pid0) = host(Pid20) & setIn(Z,alive) -> -elem(m_Ack(Z,Pid20),queue(host(Z))))) & (all Z all Pid20 all Pid0 (elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid20) = host(Z) & setIn(Pid0,alive) -> -(setIn(Z,alive) & index(ldr,host(Z)) = host(Z) & norm = index(status,host(Z))))) & (all Z all Pid0 (Pid0 != Z & host(Z) = host(Pid0) -> -setIn(Pid0,alive) | -setIn(Z,alive))) & (all Z all Pid0 (elem(m_Halt(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Z) != host(Pid0))) -> (setIn(X,alive) -> (index(elid,host(X)) = W & host(Y) = index(pendack,host(X)) & elec_2 = index(status,host(X)) -> (leq(nbr_proc,index(pendack,host(X))) -> (all Z (host(Y) = host(Z) | setIn(host(Z),index(acks,host(X))) -> (all V0 (host(X) != host(V0) -> (all W0 all X0 all Y0 (host(Z) = host(Y0) -> (host(Y0) != host(X) -> (setIn(Y0,alive) & elem(m_Down(X0),snoc(queue(host(Y0)),m_Ldr(X))) & host(X0) = s(index(pendack,host(Y0))) & host(W0) = index(pendack,host(Y0)) & index(status,host(Y0)) = elec_2 & elem(m_Ack(Y0,W0),snoc(queue(host(Y0)),m_Ldr(X))) & leq(nbr_proc,s(index(pendack,host(Y0)))) -> -(setIn(V0,alive) & index(ldr,host(V0)) = host(V0) & norm = index(status,host(V0)))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.92/1.21	77 m_Ldr(A) != m_Down(B) # label(axiom_18) # label(axiom).  [clausify(12)].
0.92/1.21	78 -leq(A,B) | -leq(B,A) | A = B # label(axiom_61) # label(axiom).  [clausify(13)].
0.92/1.21	114 m_Ack(A,B) != m_Ldr(C) # label(axiom_14) # label(axiom).  [clausify(33)].
0.92/1.21	127 A = B | elem(B,C) | -elem(B,snoc(C,A)) # label(axiom_47) # label(axiom).  [clausify(42)].
0.92/1.21	150 leq(host(A),nbr_proc) # label(axiom_04) # label(axiom).  [clausify(52)].
0.92/1.21	173 -elem(m_Ack(A,B),queue(host(A))) | -leq(nbr_proc,s(index(pendack,host(A)))) | s(index(pendack,host(A))) != host(C) | index(pendack,host(A)) != host(B) | index(status,host(A)) != elec_2 | -elem(m_Down(C),queue(host(A))) | -setIn(A,alive) | index(status,host(D)) != norm | index(ldr,host(D)) != host(D) | -setIn(D,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.92/1.21	183 index(status,host(c3)) = elec_2 # label(conj) # label(negated_conjecture).  [clausify(58)].
0.92/1.21	184 elec_2 = index(status,host(c3)).  [copy(183),flip(a)].
0.92/1.21	189 host(c9) = host(c5) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.92/1.21	190 host(c9) != host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.92/1.21	191 host(c5) != host(c3).  [copy(190),rewrite([189(2)])].
0.92/1.21	192 setIn(c9,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.92/1.21	193 elem(m_Down(c8),snoc(queue(host(c9)),m_Ldr(c3))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.92/1.21	194 elem(m_Down(c8),snoc(queue(host(c5)),m_Ldr(c3))).  [copy(193),rewrite([189(4)])].
0.92/1.21	195 s(index(pendack,host(c9))) = host(c8) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.92/1.21	196 s(index(pendack,host(c5))) = host(c8).  [copy(195),rewrite([189(3)])].
0.92/1.21	197 index(pendack,host(c9)) = host(c7) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.92/1.21	198 index(pendack,host(c5)) = host(c7).  [copy(197),rewrite([189(3)])].
0.92/1.21	199 index(status,host(c9)) = elec_2 # label(conj) # label(negated_conjecture).  [clausify(58)].
0.92/1.21	200 index(status,host(c5)) = index(status,host(c3)).  [copy(199),rewrite([189(3),184(5)])].
0.92/1.21	201 elem(m_Ack(c9,c7),snoc(queue(host(c9)),m_Ldr(c3))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.92/1.21	202 elem(m_Ack(c9,c7),snoc(queue(host(c5)),m_Ldr(c3))).  [copy(201),rewrite([189(5)])].
0.92/1.21	203 leq(nbr_proc,s(index(pendack,host(c9)))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.92/1.21	204 leq(nbr_proc,s(host(c7))).  [copy(203),rewrite([189(4),198(5)])].
0.92/1.21	205 setIn(c6,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.92/1.21	206 index(ldr,host(c6)) = host(c6) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.92/1.21	207 index(status,host(c6)) = norm # label(conj) # label(negated_conjecture).  [clausify(58)].
0.92/1.21	208 norm = index(status,host(c6)).  [copy(207),flip(a)].
0.92/1.21	214 -elem(m_Ack(A,B),queue(host(A))) | -leq(nbr_proc,s(index(pendack,host(A)))) | s(index(pendack,host(A))) != host(C) | index(pendack,host(A)) != host(B) | index(status,host(c3)) != index(status,host(A)) | -elem(m_Down(C),queue(host(A))) | -setIn(A,alive) | index(status,host(c6)) != index(status,host(D)) | index(ldr,host(D)) != host(D) | -setIn(D,alive).  [back_rewrite(173),rewrite([184(25),208(39)]),flip(e),flip(h)].
0.92/1.21	221 host(c5) = c_0.  [new_symbol(191)].
0.92/1.21	222 s(index(pendack,c_0)) = host(c8).  [back_rewrite(196),rewrite([221(3)])].
0.92/1.21	226 elem(m_Ack(c9,c7),snoc(queue(c_0),m_Ldr(c3))).  [back_rewrite(202),rewrite([221(5)])].
0.92/1.21	227 index(status,host(c3)) = index(status,c_0).  [back_rewrite(200),rewrite([221(3)]),flip(a)].
0.92/1.21	228 index(pendack,c_0) = host(c7).  [back_rewrite(198),rewrite([221(3)])].
0.92/1.21	229 elem(m_Down(c8),snoc(queue(c_0),m_Ldr(c3))).  [back_rewrite(194),rewrite([221(4)])].
0.92/1.21	231 host(c9) = c_0.  [back_rewrite(189),rewrite([221(4)])].
0.92/1.21	239 -elem(m_Ack(A,B),queue(host(A))) | -leq(nbr_proc,s(index(pendack,host(A)))) | s(index(pendack,host(A))) != host(C) | index(pendack,host(A)) != host(B) | index(status,host(A)) != index(status,c_0) | -elem(m_Down(C),queue(host(A))) | -setIn(A,alive) | index(status,host(c6)) != index(status,host(D)) | index(ldr,host(D)) != host(D) | -setIn(D,alive).  [back_rewrite(214),rewrite([227(25)]),flip(e)].
0.92/1.21	246 s(host(c7)) = host(c8).  [back_rewrite(222),rewrite([228(3)])].
0.92/1.21	247 leq(nbr_proc,host(c8)).  [back_rewrite(204),rewrite([246(4)])].
0.92/1.21	371 elem(m_Ack(c9,c7),queue(c_0)).  [resolve(226,a,127,c),flip(a),unit_del(a,114)].
0.92/1.21	376 elem(m_Down(c8),queue(c_0)).  [resolve(229,a,127,c),unit_del(a,77)].
0.92/1.21	418 -elem(m_Ack(c9,A),queue(c_0)) | host(c8) != host(B) | host(c7) != host(A) | -elem(m_Down(B),queue(c_0)) | index(status,host(c6)) != index(status,host(C)) | index(ldr,host(C)) != host(C) | -setIn(C,alive).  [resolve(239,g,192,a),rewrite([231(4),231(9),228(9),246(9),231(12),228(12),246(12),231(16),228(16),231(20),231(27)]),xx(e),unit_del(b,247)].
0.92/1.21	435 host(c8) = nbr_proc.  [resolve(247,a,78,b),unit_del(a,150)].
0.92/1.21	442 -elem(m_Ack(c9,A),queue(c_0)) | host(B) != nbr_proc | host(c7) != host(A) | -elem(m_Down(B),queue(c_0)) | index(status,host(c6)) != index(status,host(C)) | index(ldr,host(C)) != host(C) | -setIn(C,alive).  [back_rewrite(418),rewrite([435(7)]),flip(b)].
0.92/1.21	935 -elem(m_Ack(c9,A),queue(c_0)) | host(B) != nbr_proc | host(c7) != host(A) | -elem(m_Down(B),queue(c_0)).  [resolve(442,g,205,a),rewrite([206(29)]),xx(e),xx(f)].
0.92/1.21	936 host(A) != nbr_proc | -elem(m_Down(A),queue(c_0)).  [resolve(935,a,371,a),xx(b)].
0.92/1.21	962 $F.  [resolve(936,b,376,a),rewrite([435(2)]),xx(a)].
0.92/1.21	
0.92/1.21	% SZS output end Refutation
0.92/1.21	============================== end of proof ==========================
0.92/1.21	
0.92/1.21	============================== STATISTICS ============================
0.92/1.21	
0.92/1.21	Given=299. Generated=2336. Kept=886. proofs=1.
0.92/1.21	Usable=276. Sos=499. Demods=31. Limbo=0, Disabled=246. Hints=0.
0.92/1.21	Megabytes=1.92.
0.92/1.21	User_CPU=0.13, System_CPU=0.01, Wall_clock=0.
0.92/1.21	
0.92/1.21	============================== end of statistics =====================
0.92/1.21	
0.92/1.21	============================== end of search =========================
0.92/1.21	
0.92/1.21	THEOREM PROVED
0.92/1.21	% SZS status Theorem
0.92/1.21	
0.92/1.21	Exiting with 1 proof.
0.92/1.21	
0.92/1.21	Process 19107 exit (max_proofs) Thu Aug 29 09:43:46 2019
0.92/1.21	Prover9 interrupted
0.92/1.21	EOF