0.03/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.10	% Command    : tptp2X_and_run_prover9 %d %s
0.10/0.28	% Computer   : n032.cluster.edu
0.10/0.28	% Model      : x86_64 x86_64
0.10/0.28	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.28	% Memory     : 8042.1875MB
0.10/0.28	% OS         : Linux 3.10.0-693.el7.x86_64
0.10/0.28	% CPULimit   : 960
0.10/0.28	% DateTime   : Thu Jul  2 07:16:19 EDT 2020
0.10/0.29	% CPUTime    : 
0.59/0.86	============================== Prover9 ===============================
0.59/0.86	Prover9 (32) version 2009-11A, November 2009.
0.59/0.86	Process 5134 was started by sandbox2 on n032.cluster.edu,
0.59/0.86	Thu Jul  2 07:16:19 2020
0.59/0.86	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_4981_n032.cluster.edu".
0.59/0.86	============================== end of head ===========================
0.59/0.86	
0.59/0.86	============================== INPUT =================================
0.59/0.86	
0.59/0.86	% Reading from file /tmp/Prover9_4981_n032.cluster.edu
0.59/0.86	
0.59/0.86	set(prolog_style_variables).
0.59/0.86	set(auto2).
0.59/0.86	    % set(auto2) -> set(auto).
0.59/0.86	    % set(auto) -> set(auto_inference).
0.59/0.86	    % set(auto) -> set(auto_setup).
0.59/0.86	    % set(auto_setup) -> set(predicate_elim).
0.59/0.86	    % set(auto_setup) -> assign(eq_defs, unfold).
0.59/0.86	    % set(auto) -> set(auto_limits).
0.59/0.86	    % set(auto_limits) -> assign(max_weight, "100.000").
0.59/0.86	    % set(auto_limits) -> assign(sos_limit, 20000).
0.59/0.86	    % set(auto) -> set(auto_denials).
0.59/0.86	    % set(auto) -> set(auto_process).
0.59/0.86	    % set(auto2) -> assign(new_constants, 1).
0.59/0.86	    % set(auto2) -> assign(fold_denial_max, 3).
0.59/0.86	    % set(auto2) -> assign(max_weight, "200.000").
0.59/0.86	    % set(auto2) -> assign(max_hours, 1).
0.59/0.86	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.59/0.86	    % set(auto2) -> assign(max_seconds, 0).
0.59/0.86	    % set(auto2) -> assign(max_minutes, 5).
0.59/0.86	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.59/0.86	    % set(auto2) -> set(sort_initial_sos).
0.59/0.86	    % set(auto2) -> assign(sos_limit, -1).
0.59/0.86	    % set(auto2) -> assign(lrs_ticks, 3000).
0.59/0.86	    % set(auto2) -> assign(max_megs, 400).
0.59/0.86	    % set(auto2) -> assign(stats, some).
0.59/0.86	    % set(auto2) -> clear(echo_input).
0.59/0.86	    % set(auto2) -> set(quiet).
0.59/0.86	    % set(auto2) -> clear(print_initial_clauses).
0.59/0.86	    % set(auto2) -> clear(print_given).
0.59/0.86	assign(lrs_ticks,-1).
0.59/0.86	assign(sos_limit,10000).
0.59/0.86	assign(order,kbo).
0.59/0.86	set(lex_order_vars).
0.59/0.86	clear(print_given).
0.59/0.86	
0.59/0.86	% formulas(sos).  % not echoed (67 formulas)
0.59/0.86	
0.59/0.86	============================== end of input ==========================
0.59/0.86	
0.59/0.86	% From the command line: assign(max_seconds, 960).
0.59/0.86	
0.59/0.86	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.59/0.86	
0.59/0.86	% Formulas that are not ordinary clauses:
0.59/0.86	1 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	2 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	3 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	4 (all X all Y (m_NormQ(X) != m_NormQ(Y) <-> Y != X)) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	5 (all X all Y all Z m_Ldr(Z) != m_Ack(X,Y)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	6 (all Q (q_nil = Q | cons(head(Q),tail(Q)) = Q)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	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.59/0.86	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.59/0.86	9 (all X all Y (leq(X,Y) & leq(Y,X) <-> X = Y)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	10 (all Pid all Pid2 (host(Pid2) != host(Pid) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	11 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	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.59/0.86	13 (all X all Y m_Down(X) != m_NormQ(Y)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	14 (all X all Y m_NormQ(Y) != m_Ldr(X)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	15 (all X all Y all Z m_NotNorm(Z) != m_Ack(X,Y)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	16 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	17 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	18 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	19 (all X (ordered(snoc(q_nil,X)) & ordered(cons(X,q_nil)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	20 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	21 (all X all Y m_Halt(Y) != m_Ldr(X)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	22 (all X all Y (m_Down(X) != m_Down(Y) <-> X != Y)) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	23 (all X all Y m_Ldr(Y) != m_Down(X)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	24 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	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.59/0.86	26 (all Y all Q last(snoc(Q,Y)) = Y) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	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.59/0.86	28 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	29 (all X all Y all Z m_Halt(Z) != m_Ack(X,Y)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	30 (all X all Y (Y != X <-> m_Ldr(Y) != m_Ldr(X))) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	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.59/0.86	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.59/0.86	33 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	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.59/0.86	35 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	36 (all P all Q (s(host(P)) = host(Q) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	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.59/0.86	38 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	39 (all X all Q cons(X,Q) != q_nil) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	40 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	41 (all X pidMsg(m_Halt(X)) = X) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	42 (all X all Y all Z m_Down(Z) != m_Ack(X,Y)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	43 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	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.59/0.86	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.59/0.86	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.59/0.86	47 (all X cons(X,q_nil) = snoc(q_nil,X)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	48 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	49 (all Q (Q = q_nil | Q = snoc(init(Q),last(Q)))) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	50 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	51 (all X all Y (m_NotNorm(X) != m_NotNorm(Y) <-> X != Y)) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	52 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	53 (all X all Y (leq(Y,X) | leq(X,Y))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	54 (all X all Y (m_Halt(Y) != m_Halt(X) <-> Y != X)) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	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.59/0.86	56 (all X all Q head(cons(X,Q)) = X) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	57 (all X all Y all Z m_NormQ(Z) != m_Ack(X,Y)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.59/0.86	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 (elec_1 = index(status,host(Pid0)) & setIn(Pid0,alive) -> -elem(m_Ack(Pid0,Z),queue(host(Pid0))))) & (all Z (setIn(Z,alive) & (index(status,host(Z)) = elec_1 | index(status,host(Z)) = elec_2) -> index(elid,host(Z)) = Z)) & (all Z all Pid20 all Pid0 (host(Z) = host(Pid20) & elem(m_Down(Pid20),queue(host(Pid0))) & setIn(Pid0,alive) -> -(index(ldr,host(Z)) = host(Z) & index(status,host(Z)) = norm & setIn(Z,alive)))) & (all Z all Pid0 (setIn(Z,alive) & elec_2 = index(status,host(Z)) & index(status,host(Pid0)) = elec_2 & setIn(Pid0,alive) & -leq(host(Z),host(Pid0)) -> -leq(index(pendack,host(Z)),index(pendack,host(Pid0))))) & (all Z all Pid30 all Pid20 all Pid0 (elem(m_Down(Pid20),queue(host(Pid0))) & elec_1 = index(status,host(Pid0)) & host(Pid30) = host(Pid0) & host(Pid0) = nbr_proc & (all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Pid0))) | host(Pid20) = V0)) -> -(setIn(Z,alive) & elem(m_Down(Pid30),queue(host(Z)))))) & (all Z all Pid30 all Pid20 all Pid0 (setIn(Pid0,alive) & 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_Ack(Pid0,Pid30),queue(host(Pid0))) & elem(m_Down(Pid20),queue(host(Pid0))) -> -(index(status,host(Z)) = norm & index(ldr,host(Z)) = host(Z) & setIn(Z,alive)))) & cons(m_Ack(W,Y),V) = queue(host(X)) & (all Z all Pid20 all Pid0 (-leq(index(pendack,host(Pid0)),host(Z)) & elec_2 = index(status,host(Pid0)) & elem(m_Halt(Pid0),queue(host(Pid20))) & setIn(Pid0,alive) -> -(setIn(Z,alive) & norm = index(status,host(Z)) & host(Z) = index(ldr,host(Z))))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & index(status,host(Z)) = elec_2 & elec_2 = index(status,host(Pid0)) & host(Pid20) = host(Pid0) & setIn(Z,alive) -> -elem(m_Ack(Z,Pid20),queue(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 Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid0))) & setIn(Pid0,alive) -> leq(host(Z),index(pendack,host(Pid0))))) & (all Z all Pid0 (Pid0 != Z & host(Pid0) = host(Z) -> -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(status,host(X)) = elec_2 & index(pendack,host(X)) = host(Y) & W = index(elid,host(X)) -> (leq(nbr_proc,index(pendack,host(X))) -> (all Z (setIn(host(Z),index(acks,host(X))) | host(Y) = host(Z) -> (all V0 (host(X) != host(V0) -> (all W0 all X0 all Y0 (host(Z) = host(Y0) -> (host(Y0) != host(X) -> (setIn(Y0,alive) & 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))) & elem(m_Down(X0),snoc(queue(host(Y0)),m_Ldr(X))) & leq(nbr_proc,s(index(pendack,host(Y0)))) -> -(norm = index(status,host(V0)) & host(V0) = index(ldr,host(V0)) & setIn(V0,alive))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.59/0.96	
0.59/0.96	============================== end of process non-clausal formulas ===
0.59/0.96	
0.59/0.96	============================== PROCESS INITIAL CLAUSES ===============
0.59/0.96	
0.59/0.96	============================== PREDICATE ELIMINATION =================
0.59/0.96	
0.59/0.96	============================== end predicate elimination =============
0.59/0.96	
0.59/0.96	Auto_denials:  (non-Horn, no changes).
0.59/0.96	
0.59/0.96	Term ordering decisions:
0.59/0.96	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. f1=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. f2=1. f4=1.
0.59/0.96	
0.59/0.96	============================== end of process initial clauses ========
0.59/0.96	
0.59/0.96	============================== CLAUSES FOR SEARCH ====================
0.59/0.96	
0.59/0.96	============================== end of clauses for search =============
0.59/0.96	
0.59/0.96	============================== SEARCH ================================
0.59/0.96	
0.59/0.96	% Starting search at 0.03 seconds.
0.59/0.96	
0.59/0.96	============================== PROOF =================================
0.59/0.96	% SZS status Theorem
0.59/0.96	% SZS output start Refutation
0.59/0.96	
0.59/0.96	% Proof 1 at 0.11 (+ 0.00) seconds.
0.59/0.96	% Length of proof is 53.
0.59/0.96	% Level of proof is 11.
0.59/0.96	% Maximum clause weight is 66.000.
0.59/0.96	% Given clauses 299.
0.59/0.96	
0.59/0.96	5 (all X all Y all Z m_Ldr(Z) != m_Ack(X,Y)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.59/0.96	9 (all X all Y (leq(X,Y) & leq(Y,X) <-> X = Y)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.59/0.96	23 (all X all Y m_Ldr(Y) != m_Down(X)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.59/0.96	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.59/0.96	43 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.59/0.96	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 (elec_1 = index(status,host(Pid0)) & setIn(Pid0,alive) -> -elem(m_Ack(Pid0,Z),queue(host(Pid0))))) & (all Z (setIn(Z,alive) & (index(status,host(Z)) = elec_1 | index(status,host(Z)) = elec_2) -> index(elid,host(Z)) = Z)) & (all Z all Pid20 all Pid0 (host(Z) = host(Pid20) & elem(m_Down(Pid20),queue(host(Pid0))) & setIn(Pid0,alive) -> -(index(ldr,host(Z)) = host(Z) & index(status,host(Z)) = norm & setIn(Z,alive)))) & (all Z all Pid0 (setIn(Z,alive) & elec_2 = index(status,host(Z)) & index(status,host(Pid0)) = elec_2 & setIn(Pid0,alive) & -leq(host(Z),host(Pid0)) -> -leq(index(pendack,host(Z)),index(pendack,host(Pid0))))) & (all Z all Pid30 all Pid20 all Pid0 (elem(m_Down(Pid20),queue(host(Pid0))) & elec_1 = index(status,host(Pid0)) & host(Pid30) = host(Pid0) & host(Pid0) = nbr_proc & (all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Pid0))) | host(Pid20) = V0)) -> -(setIn(Z,alive) & elem(m_Down(Pid30),queue(host(Z)))))) & (all Z all Pid30 all Pid20 all Pid0 (setIn(Pid0,alive) & 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_Ack(Pid0,Pid30),queue(host(Pid0))) & elem(m_Down(Pid20),queue(host(Pid0))) -> -(index(status,host(Z)) = norm & index(ldr,host(Z)) = host(Z) & setIn(Z,alive)))) & cons(m_Ack(W,Y),V) = queue(host(X)) & (all Z all Pid20 all Pid0 (-leq(index(pendack,host(Pid0)),host(Z)) & elec_2 = index(status,host(Pid0)) & elem(m_Halt(Pid0),queue(host(Pid20))) & setIn(Pid0,alive) -> -(setIn(Z,alive) & norm = index(status,host(Z)) & host(Z) = index(ldr,host(Z))))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & index(status,host(Z)) = elec_2 & elec_2 = index(status,host(Pid0)) & host(Pid20) = host(Pid0) & setIn(Z,alive) -> -elem(m_Ack(Z,Pid20),queue(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 Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid0))) & setIn(Pid0,alive) -> leq(host(Z),index(pendack,host(Pid0))))) & (all Z all Pid0 (Pid0 != Z & host(Pid0) = host(Z) -> -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(status,host(X)) = elec_2 & index(pendack,host(X)) = host(Y) & W = index(elid,host(X)) -> (leq(nbr_proc,index(pendack,host(X))) -> (all Z (setIn(host(Z),index(acks,host(X))) | host(Y) = host(Z) -> (all V0 (host(X) != host(V0) -> (all W0 all X0 all Y0 (host(Z) = host(Y0) -> (host(Y0) != host(X) -> (setIn(Y0,alive) & 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))) & elem(m_Down(X0),snoc(queue(host(Y0)),m_Ldr(X))) & leq(nbr_proc,s(index(pendack,host(Y0)))) -> -(norm = index(status,host(V0)) & host(V0) = index(ldr,host(V0)) & setIn(V0,alive))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.59/0.96	65 m_Ack(A,B) != m_Ldr(C) # label(axiom_14) # label(axiom).  [clausify(5)].
0.59/0.96	77 -leq(A,B) | -leq(B,A) | B = A # label(axiom_61) # label(axiom).  [clausify(9)].
0.59/0.96	98 m_Ldr(A) != m_Down(B) # label(axiom_18) # label(axiom).  [clausify(23)].
0.59/0.96	111 -elem(A,snoc(B,C)) | C = A | elem(A,B) # label(axiom_47) # label(axiom).  [clausify(32)].
0.59/0.96	130 leq(host(A),nbr_proc) # label(axiom_04) # label(axiom).  [clausify(43)].
0.59/0.96	169 -setIn(A,alive) | -leq(nbr_proc,s(index(pendack,host(A)))) | s(index(pendack,host(A))) != host(B) | index(pendack,host(A)) != host(C) | index(status,host(A)) != elec_2 | -elem(m_Ack(A,C),queue(host(A))) | -elem(m_Down(B),queue(host(A))) | index(status,host(D)) != norm | index(ldr,host(D)) != host(D) | -setIn(D,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.59/0.96	180 index(status,host(c3)) = elec_2 # label(conj) # label(negated_conjecture).  [clausify(58)].
0.59/0.96	181 elec_2 = index(status,host(c3)).  [copy(180),flip(a)].
0.59/0.96	188 host(c9) = host(c5) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.59/0.96	189 host(c9) != host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.59/0.96	190 host(c5) != host(c3).  [copy(189),rewrite([188(2)])].
0.59/0.96	191 setIn(c9,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.59/0.96	192 s(index(pendack,host(c9))) = host(c8) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.59/0.96	193 s(index(pendack,host(c5))) = host(c8).  [copy(192),rewrite([188(3)])].
0.59/0.96	194 index(pendack,host(c9)) = host(c7) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.59/0.96	195 index(pendack,host(c5)) = host(c7).  [copy(194),rewrite([188(3)])].
0.59/0.96	196 index(status,host(c9)) = elec_2 # label(conj) # label(negated_conjecture).  [clausify(58)].
0.59/0.96	197 index(status,host(c5)) = index(status,host(c3)).  [copy(196),rewrite([188(3),181(5)])].
0.59/0.96	198 elem(m_Ack(c9,c7),snoc(queue(host(c9)),m_Ldr(c3))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.59/0.96	199 elem(m_Ack(c9,c7),snoc(queue(host(c5)),m_Ldr(c3))).  [copy(198),rewrite([188(5)])].
0.59/0.96	200 elem(m_Down(c8),snoc(queue(host(c9)),m_Ldr(c3))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.59/0.96	201 elem(m_Down(c8),snoc(queue(host(c5)),m_Ldr(c3))).  [copy(200),rewrite([188(4)])].
0.59/0.96	202 leq(nbr_proc,s(index(pendack,host(c9)))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.59/0.96	203 leq(nbr_proc,s(host(c7))).  [copy(202),rewrite([188(4),195(5)])].
0.59/0.96	204 index(status,host(c6)) = norm # label(conj) # label(negated_conjecture).  [clausify(58)].
0.59/0.96	205 norm = index(status,host(c6)).  [copy(204),flip(a)].
0.59/0.96	206 index(ldr,host(c6)) = host(c6) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.59/0.96	207 setIn(c6,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.59/0.96	214 -setIn(A,alive) | -leq(nbr_proc,s(index(pendack,host(A)))) | s(index(pendack,host(A))) != host(B) | index(pendack,host(A)) != host(C) | index(status,host(c3)) != index(status,host(A)) | -elem(m_Ack(A,C),queue(host(A))) | -elem(m_Down(B),queue(host(A))) | index(status,host(c6)) != index(status,host(D)) | index(ldr,host(D)) != host(D) | -setIn(D,alive).  [back_rewrite(169),rewrite([181(23),205(39)]),flip(e),flip(h)].
0.59/0.96	220 host(c5) = c_0.  [new_symbol(190)].
0.59/0.96	221 s(index(pendack,c_0)) = host(c8).  [back_rewrite(193),rewrite([220(3)])].
0.59/0.96	225 elem(m_Down(c8),snoc(queue(c_0),m_Ldr(c3))).  [back_rewrite(201),rewrite([220(4)])].
0.59/0.96	226 elem(m_Ack(c9,c7),snoc(queue(c_0),m_Ldr(c3))).  [back_rewrite(199),rewrite([220(5)])].
0.59/0.96	227 index(status,host(c3)) = index(status,c_0).  [back_rewrite(197),rewrite([220(3)]),flip(a)].
0.59/0.96	228 index(pendack,c_0) = host(c7).  [back_rewrite(195),rewrite([220(3)])].
0.59/0.96	230 host(c9) = c_0.  [back_rewrite(188),rewrite([220(4)])].
0.59/0.96	237 -setIn(A,alive) | -leq(nbr_proc,s(index(pendack,host(A)))) | s(index(pendack,host(A))) != host(B) | index(pendack,host(A)) != host(C) | index(status,host(A)) != index(status,c_0) | -elem(m_Ack(A,C),queue(host(A))) | -elem(m_Down(B),queue(host(A))) | index(status,host(c6)) != index(status,host(D)) | index(ldr,host(D)) != host(D) | -setIn(D,alive).  [back_rewrite(214),rewrite([227(23)]),flip(e)].
0.59/0.96	245 s(host(c7)) = host(c8).  [back_rewrite(221),rewrite([228(3)])].
0.59/0.96	246 leq(nbr_proc,host(c8)).  [back_rewrite(203),rewrite([245(4)])].
0.59/0.96	373 elem(m_Down(c8),queue(c_0)).  [resolve(225,a,111,a),unit_del(a,98)].
0.59/0.96	379 elem(m_Ack(c9,c7),queue(c_0)).  [resolve(226,a,111,a),flip(a),unit_del(a,65)].
0.59/0.96	416 host(c8) != host(A) | host(c7) != host(B) | -elem(m_Ack(c9,B),queue(c_0)) | -elem(m_Down(A),queue(c_0)) | index(status,host(c6)) != index(status,host(C)) | index(ldr,host(C)) != host(C) | -setIn(C,alive).  [resolve(237,a,191,a),rewrite([230(4),228(4),245(4),230(7),228(7),245(7),230(11),228(11),230(15),230(23),230(27)]),xx(d),unit_del(a,246)].
0.59/0.96	435 host(c8) = nbr_proc.  [resolve(246,a,77,b),flip(b),unit_del(a,130)].
0.59/0.96	442 host(A) != nbr_proc | host(c7) != host(B) | -elem(m_Ack(c9,B),queue(c_0)) | -elem(m_Down(A),queue(c_0)) | index(status,host(c6)) != index(status,host(C)) | index(ldr,host(C)) != host(C) | -setIn(C,alive).  [back_rewrite(416),rewrite([435(2)]),flip(a)].
0.59/0.96	929 host(A) != nbr_proc | host(c7) != host(B) | -elem(m_Ack(c9,B),queue(c_0)) | -elem(m_Down(A),queue(c_0)).  [resolve(442,g,207,a),rewrite([206(29)]),xx(e),xx(f)].
0.59/0.96	930 host(A) != nbr_proc | -elem(m_Down(A),queue(c_0)).  [resolve(929,c,379,a),xx(b)].
0.59/0.96	959 $F.  [resolve(930,b,373,a),rewrite([435(2)]),xx(a)].
0.59/0.96	
0.59/0.96	% SZS output end Refutation
0.59/0.96	============================== end of proof ==========================
0.59/0.96	
0.59/0.96	============================== STATISTICS ============================
0.59/0.96	
0.59/0.96	Given=299. Generated=2373. Kept=885. proofs=1.
0.59/0.96	Usable=276. Sos=497. Demods=33. Limbo=0, Disabled=247. Hints=0.
0.59/0.96	Megabytes=1.85.
0.59/0.96	User_CPU=0.11, System_CPU=0.00, Wall_clock=1.
0.59/0.96	
0.59/0.96	============================== end of statistics =====================
0.59/0.96	
0.59/0.96	============================== end of search =========================
0.59/0.96	
0.59/0.96	THEOREM PROVED
0.59/0.96	% SZS status Theorem
0.59/0.96	
0.59/0.96	Exiting with 1 proof.
0.59/0.96	
0.59/0.96	Process 5134 exit (max_proofs) Thu Jul  2 07:16:20 2020
0.59/0.96	Prover9 interrupted
0.59/0.96	EOF