0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer   : n008.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   : 180
0.12/0.33	% DateTime   : Thu Aug 29 10:16:23 EDT 2019
0.12/0.33	% CPUTime    : 
0.42/1.01	============================== Prover9 ===============================
0.42/1.01	Prover9 (32) version 2009-11A, November 2009.
0.42/1.01	Process 13863 was started by sandbox on n008.cluster.edu,
0.42/1.01	Thu Aug 29 10:16:24 2019
0.42/1.01	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 180 -f /tmp/Prover9_13710_n008.cluster.edu".
0.42/1.01	============================== end of head ===========================
0.42/1.01	
0.42/1.01	============================== INPUT =================================
0.42/1.01	
0.42/1.01	% Reading from file /tmp/Prover9_13710_n008.cluster.edu
0.42/1.01	
0.42/1.01	set(prolog_style_variables).
0.42/1.01	set(auto2).
0.42/1.01	    % set(auto2) -> set(auto).
0.42/1.01	    % set(auto) -> set(auto_inference).
0.42/1.01	    % set(auto) -> set(auto_setup).
0.42/1.01	    % set(auto_setup) -> set(predicate_elim).
0.42/1.01	    % set(auto_setup) -> assign(eq_defs, unfold).
0.42/1.01	    % set(auto) -> set(auto_limits).
0.42/1.01	    % set(auto_limits) -> assign(max_weight, "100.000").
0.42/1.01	    % set(auto_limits) -> assign(sos_limit, 20000).
0.42/1.01	    % set(auto) -> set(auto_denials).
0.42/1.01	    % set(auto) -> set(auto_process).
0.42/1.01	    % set(auto2) -> assign(new_constants, 1).
0.42/1.01	    % set(auto2) -> assign(fold_denial_max, 3).
0.42/1.01	    % set(auto2) -> assign(max_weight, "200.000").
0.42/1.01	    % set(auto2) -> assign(max_hours, 1).
0.42/1.01	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.42/1.01	    % set(auto2) -> assign(max_seconds, 0).
0.42/1.01	    % set(auto2) -> assign(max_minutes, 5).
0.42/1.01	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.42/1.01	    % set(auto2) -> set(sort_initial_sos).
0.42/1.01	    % set(auto2) -> assign(sos_limit, -1).
0.42/1.01	    % set(auto2) -> assign(lrs_ticks, 3000).
0.42/1.01	    % set(auto2) -> assign(max_megs, 400).
0.42/1.01	    % set(auto2) -> assign(stats, some).
0.42/1.01	    % set(auto2) -> clear(echo_input).
0.42/1.01	    % set(auto2) -> set(quiet).
0.42/1.01	    % set(auto2) -> clear(print_initial_clauses).
0.42/1.01	    % set(auto2) -> clear(print_given).
0.42/1.01	assign(lrs_ticks,-1).
0.42/1.01	assign(sos_limit,10000).
0.42/1.01	assign(order,kbo).
0.42/1.01	set(lex_order_vars).
0.42/1.01	clear(print_given).
0.42/1.01	
0.42/1.01	% formulas(sos).  % not echoed (67 formulas)
0.42/1.01	
0.42/1.01	============================== end of input ==========================
0.42/1.01	
0.42/1.01	% From the command line: assign(max_seconds, 180).
0.42/1.01	
0.42/1.01	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.42/1.01	
0.42/1.01	% Formulas that are not ordinary clauses:
0.42/1.01	1 (all X all Y (Y != X <-> m_NotNorm(Y) != m_NotNorm(X))) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	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.42/1.01	3 (all X all Y (Y != X <-> m_Ldr(Y) != m_Ldr(X))) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	4 (all X all Y (m_Down(Y) != m_Down(X) <-> X != Y)) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	5 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid2 != Pid)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	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.42/1.01	7 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	8 (all X all Y (Y != X <-> m_NormQ(X) != m_NormQ(Y))) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	9 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	10 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	11 (all X all Y all Z m_Ack(X,Y) != m_Halt(Z)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	12 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	13 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	14 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	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.42/1.01	16 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	17 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	18 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	19 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	20 (all X all Y (leq(Y,X) | leq(X,Y))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	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.42/1.01	22 (all X X = pidMsg(m_Down(X))) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	23 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	24 (all Q (Q = cons(head(Q),tail(Q)) | q_nil = Q)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	25 (all X all Y all Z m_NotNorm(Z) != m_Ack(X,Y)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	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.42/1.01	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.42/1.01	28 (all P all Q (s(host(P)) = host(Q) -> host(Q) != host(P))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	29 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	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.42/1.01	31 (all X all Q Q = tail(cons(X,Q))) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	32 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	33 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	34 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	35 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	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.42/1.01	37 (all Q (q_nil = Q | Q = snoc(init(Q),last(Q)))) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	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.42/1.01	39 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	40 (all X all Q head(cons(X,Q)) = X) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	41 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	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.42/1.01	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.42/1.01	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.42/1.01	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.42/1.01	46 (all X all Y m_Down(X) != m_NormQ(Y)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	47 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	48 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	49 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	50 (all X X = pidMsg(m_Halt(X))) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	51 (all X all Y m_Halt(Y) != m_Down(X)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	52 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	53 (all Y all Q last(snoc(Q,Y)) = Y) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	54 (all X all Y all Z m_Ack(X,Y) != m_Down(Z)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	55 (all X (ordered(snoc(q_nil,X)) & ordered(cons(X,q_nil)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	56 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	57 (all X all Y (m_Halt(Y) != m_Halt(X) <-> X != Y)) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.42/1.01	58 -(all V all W all X all Y ((all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Z) != host(Pid0))) & (all Z all Pid0 (elem(m_Halt(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (setIn(Pid0,alive) & elem(m_Ack(Pid0,Z),queue(host(Pid0))) -> leq(host(Z),index(pendack,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 all Pid30 all Pid20 all Pid0 (elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid20) = s(index(pendack,host(Pid0))) & index(pendack,host(Pid0)) = host(Pid30) & elec_2 = index(status,host(Pid0)) & leq(nbr_proc,s(index(pendack,host(Pid0)))) & elem(m_Ack(Pid0,Pid30),queue(host(Pid0))) & setIn(Pid0,alive) -> -(setIn(Z,alive) & index(status,host(Z)) = norm & host(Z) = index(ldr,host(Z))))) & queue(host(X)) = cons(m_Ack(W,Y),V) & (all Z all Pid30 all Pid20 all Pid0 (elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid0) = nbr_proc & host(Pid30) = host(Pid0) & index(status,host(Pid0)) = elec_1 & (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 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)) -> -(setIn(Z,alive) & host(Z) = index(ldr,host(Z)) & norm = index(status,host(Z))))) & (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 Pid20 all Pid0 (setIn(Z,alive) & elec_2 = index(status,host(Pid0)) & elec_2 = index(status,host(Z)) & host(Pid20) = host(Pid0) & setIn(Pid0,alive) -> -elem(m_Ack(Z,Pid20),queue(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(Pid0)),host(Z)))) & (all Z all Pid20 all Pid0 (elem(m_Down(Pid20),queue(host(Pid0))) & host(Z) = host(Pid20) & setIn(Pid0,alive) -> -(setIn(Z,alive) & norm = index(status,host(Z)) & host(Z) = index(ldr,host(Z))))) & (all Z (setIn(Z,alive) & (elec_1 = index(status,host(Z)) | index(status,host(Z)) = elec_2) -> index(elid,host(Z)) = Z)) & (all Z all Pid0 (host(Z) = host(Pid0) & Pid0 != Z -> -setIn(Pid0,alive) | -setIn(Z,alive))) & (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_Ldr(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) -> (setIn(X,alive) -> (index(status,host(X)) = elec_2 & host(Y) = index(pendack,host(X)) & W = index(elid,host(X)) -> (-leq(nbr_proc,index(pendack,host(X))) -> (all Z all W0 all X0 all Y0 (host(Y0) = s(index(pendack,host(X))) -> (host(Y0) != host(X) -> (leq(nbr_proc,s(index(pendack,host(Y0)))) & index(pendack,host(Y0)) = host(W0) & host(X0) = s(index(pendack,host(Y0))) & elec_2 = index(status,host(Y0)) & elem(m_Ack(Y0,W0),snoc(queue(host(Y0)),m_Halt(X))) & elem(m_Down(X0),snoc(queue(host(Y0)),m_Halt(X))) & setIn(Y0,alive) -> -(setIn(Z,alive) & host(Z) = index(ldr,host(Z)) & index(status,host(Z)) = norm)))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.72/1.12	
0.72/1.12	============================== end of process non-clausal formulas ===
0.72/1.12	
0.72/1.12	============================== PROCESS INITIAL CLAUSES ===============
0.72/1.12	
0.72/1.12	============================== PREDICATE ELIMINATION =================
0.72/1.12	
0.72/1.12	============================== end predicate elimination =============
0.72/1.12	
0.72/1.12	Auto_denials:  (non-Horn, no changes).
0.72/1.12	
0.72/1.12	Term ordering decisions:
0.72/1.12	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. down=1. nil=1. setEmpty=1. wait=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=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.72/1.12	
0.72/1.12	============================== end of process initial clauses ========
0.72/1.12	
0.72/1.12	============================== CLAUSES FOR SEARCH ====================
0.72/1.12	
0.72/1.12	============================== end of clauses for search =============
0.72/1.12	
0.72/1.12	============================== SEARCH ================================
0.72/1.12	
0.72/1.12	% Starting search at 0.04 seconds.
0.72/1.12	
0.72/1.12	============================== PROOF =================================
0.72/1.12	% SZS status Theorem
0.72/1.12	% SZS output start Refutation
0.72/1.12	
0.72/1.12	% Proof 1 at 0.13 (+ 0.00) seconds.
0.72/1.12	% Length of proof is 46.
0.72/1.12	% Level of proof is 9.
0.72/1.12	% Maximum clause weight is 66.000.
0.72/1.12	% Given clauses 265.
0.72/1.12	
0.72/1.12	11 (all X all Y all Z m_Ack(X,Y) != m_Halt(Z)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.72/1.12	13 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.72/1.12	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.72/1.12	49 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.72/1.12	51 (all X all Y m_Halt(Y) != m_Down(X)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.72/1.12	52 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.72/1.12	58 -(all V all W all X all Y ((all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Z) != host(Pid0))) & (all Z all Pid0 (elem(m_Halt(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (setIn(Pid0,alive) & elem(m_Ack(Pid0,Z),queue(host(Pid0))) -> leq(host(Z),index(pendack,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 all Pid30 all Pid20 all Pid0 (elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid20) = s(index(pendack,host(Pid0))) & index(pendack,host(Pid0)) = host(Pid30) & elec_2 = index(status,host(Pid0)) & leq(nbr_proc,s(index(pendack,host(Pid0)))) & elem(m_Ack(Pid0,Pid30),queue(host(Pid0))) & setIn(Pid0,alive) -> -(setIn(Z,alive) & index(status,host(Z)) = norm & host(Z) = index(ldr,host(Z))))) & queue(host(X)) = cons(m_Ack(W,Y),V) & (all Z all Pid30 all Pid20 all Pid0 (elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid0) = nbr_proc & host(Pid30) = host(Pid0) & index(status,host(Pid0)) = elec_1 & (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 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)) -> -(setIn(Z,alive) & host(Z) = index(ldr,host(Z)) & norm = index(status,host(Z))))) & (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 Pid20 all Pid0 (setIn(Z,alive) & elec_2 = index(status,host(Pid0)) & elec_2 = index(status,host(Z)) & host(Pid20) = host(Pid0) & setIn(Pid0,alive) -> -elem(m_Ack(Z,Pid20),queue(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(Pid0)),host(Z)))) & (all Z all Pid20 all Pid0 (elem(m_Down(Pid20),queue(host(Pid0))) & host(Z) = host(Pid20) & setIn(Pid0,alive) -> -(setIn(Z,alive) & norm = index(status,host(Z)) & host(Z) = index(ldr,host(Z))))) & (all Z (setIn(Z,alive) & (elec_1 = index(status,host(Z)) | index(status,host(Z)) = elec_2) -> index(elid,host(Z)) = Z)) & (all Z all Pid0 (host(Z) = host(Pid0) & Pid0 != Z -> -setIn(Pid0,alive) | -setIn(Z,alive))) & (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_Ldr(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) -> (setIn(X,alive) -> (index(status,host(X)) = elec_2 & host(Y) = index(pendack,host(X)) & W = index(elid,host(X)) -> (-leq(nbr_proc,index(pendack,host(X))) -> (all Z all W0 all X0 all Y0 (host(Y0) = s(index(pendack,host(X))) -> (host(Y0) != host(X) -> (leq(nbr_proc,s(index(pendack,host(Y0)))) & index(pendack,host(Y0)) = host(W0) & host(X0) = s(index(pendack,host(Y0))) & elec_2 = index(status,host(Y0)) & elem(m_Ack(Y0,W0),snoc(queue(host(Y0)),m_Halt(X))) & elem(m_Down(X0),snoc(queue(host(Y0)),m_Halt(X))) & setIn(Y0,alive) -> -(setIn(Z,alive) & host(Z) = index(ldr,host(Z)) & index(status,host(Z)) = norm)))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.72/1.12	76 m_Ack(A,B) != m_Halt(C) # label(axiom_11) # label(axiom).  [clausify(11)].
0.72/1.12	78 -leq(A,B) | -leq(B,A) | A = B # label(axiom_61) # label(axiom).  [clausify(13)].
0.72/1.12	127 A = B | elem(B,C) | -elem(B,snoc(C,A)) # label(axiom_47) # label(axiom).  [clausify(42)].
0.72/1.12	142 leq(A,A) # label(axiom_59) # label(axiom).  [clausify(49)].
0.72/1.12	149 m_Down(A) != m_Halt(B) # label(axiom_17) # label(axiom).  [clausify(51)].
0.72/1.12	150 leq(host(A),nbr_proc) # label(axiom_04) # label(axiom).  [clausify(52)].
0.72/1.12	162 -elem(m_Down(A),queue(host(B))) | s(index(pendack,host(B))) != host(A) | index(pendack,host(B)) != host(C) | index(status,host(B)) != elec_2 | -leq(nbr_proc,s(index(pendack,host(B)))) | -elem(m_Ack(B,C),queue(host(B))) | -setIn(B,alive) | -setIn(D,alive) | index(status,host(D)) != norm | index(ldr,host(D)) != host(D) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.72/1.12	176 -setIn(A,alive) | index(status,host(A)) != elec_2 | index(elid,host(A)) = A # label(conj) # label(negated_conjecture).  [clausify(58)].
0.72/1.12	180 setIn(c3,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.72/1.12	181 index(status,host(c3)) = elec_2 # label(conj) # label(negated_conjecture).  [clausify(58)].
0.72/1.12	182 elec_2 = index(status,host(c3)).  [copy(181),flip(a)].
0.72/1.12	184 index(elid,host(c3)) = c2 # label(conj) # label(negated_conjecture).  [clausify(58)].
0.72/1.12	190 leq(nbr_proc,s(index(pendack,host(c8)))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.72/1.12	191 index(pendack,host(c8)) = host(c6) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.72/1.12	192 s(index(pendack,host(c8))) = host(c7) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.72/1.12	193 s(host(c6)) = host(c7).  [copy(192),rewrite([191(4)])].
0.72/1.12	194 index(status,host(c8)) = elec_2 # label(conj) # label(negated_conjecture).  [clausify(58)].
0.72/1.12	195 index(status,host(c8)) = index(status,host(c3)).  [copy(194),rewrite([182(5)])].
0.72/1.12	196 elem(m_Ack(c8,c6),snoc(queue(host(c8)),m_Halt(c3))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.72/1.12	197 elem(m_Down(c7),snoc(queue(host(c8)),m_Halt(c3))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.72/1.12	198 setIn(c8,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.72/1.12	199 setIn(c5,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.72/1.12	200 index(ldr,host(c5)) = host(c5) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.72/1.12	201 index(status,host(c5)) = norm # label(conj) # label(negated_conjecture).  [clausify(58)].
0.72/1.12	202 norm = index(status,host(c5)).  [copy(201),flip(a)].
0.72/1.12	206 -setIn(A,alive) | index(status,host(c3)) != index(status,host(A)) | index(elid,host(A)) = A.  [back_rewrite(176),rewrite([182(6)]),flip(b)].
0.72/1.12	211 -elem(m_Down(A),queue(host(B))) | s(index(pendack,host(B))) != host(A) | index(pendack,host(B)) != host(C) | index(status,host(c3)) != index(status,host(B)) | -leq(nbr_proc,s(index(pendack,host(B)))) | -elem(m_Ack(B,C),queue(host(B))) | -setIn(B,alive) | -setIn(D,alive) | index(status,host(c5)) != index(status,host(D)) | index(ldr,host(D)) != host(D).  [back_rewrite(162),rewrite([182(19),202(41)]),flip(d),flip(i)].
0.72/1.12	215 leq(nbr_proc,host(c7)).  [back_rewrite(190),rewrite([191(5),193(4)])].
0.72/1.12	323 elem(m_Ack(c8,c6),queue(host(c8))).  [resolve(196,a,127,c),flip(a),unit_del(a,76)].
0.72/1.12	328 elem(m_Down(c7),queue(host(c8))).  [resolve(197,a,127,c),unit_del(a(flip),149)].
0.72/1.12	346 c3 = c2.  [resolve(206,a,180,a),rewrite([184(13)]),flip(b),xx(a)].
0.72/1.12	370 -elem(m_Down(A),queue(host(B))) | s(index(pendack,host(B))) != host(A) | index(pendack,host(B)) != host(C) | index(status,host(c2)) != index(status,host(B)) | -leq(nbr_proc,s(index(pendack,host(B)))) | -elem(m_Ack(B,C),queue(host(B))) | -setIn(B,alive) | -setIn(D,alive) | index(status,host(c5)) != index(status,host(D)) | index(ldr,host(D)) != host(D).  [back_rewrite(211),rewrite([346(17)])].
0.72/1.12	381 index(status,host(c8)) = index(status,host(c2)).  [back_rewrite(195),rewrite([346(6)])].
0.72/1.12	392 host(c7) = nbr_proc.  [resolve(215,a,78,b),unit_del(a,150)].
0.72/1.12	402 s(host(c6)) = nbr_proc.  [back_rewrite(193),rewrite([392(5)])].
0.72/1.12	790 -elem(m_Down(A),queue(host(c8))) | host(A) != nbr_proc | host(c6) != host(B) | -elem(m_Ack(c8,B),queue(host(c8))) | -setIn(C,alive) | index(status,host(c5)) != index(status,host(C)) | index(ldr,host(C)) != host(C).  [resolve(370,g,198,a),rewrite([191(9),402(8),191(12),381(20),191(26),402(25)]),flip(b),xx(d),unit_del(d,142)].
0.72/1.12	808 -elem(m_Down(A),queue(host(c8))) | host(A) != nbr_proc | host(c6) != host(B) | -elem(m_Ack(c8,B),queue(host(c8))).  [resolve(790,e,199,a),rewrite([200(31)]),xx(e),xx(f)].
0.72/1.12	810 -elem(m_Down(A),queue(host(c8))) | host(A) != nbr_proc.  [resolve(808,d,323,a),xx(c)].
0.72/1.12	811 $F.  [resolve(810,a,328,a),rewrite([392(2)]),xx(a)].
0.72/1.12	
0.72/1.12	% SZS output end Refutation
0.72/1.12	============================== end of proof ==========================
0.72/1.12	
0.72/1.12	============================== STATISTICS ============================
0.72/1.12	
0.72/1.12	Given=265. Generated=2153. Kept=739. proofs=1.
0.72/1.12	Usable=241. Sos=414. Demods=29. Limbo=0, Disabled=217. Hints=0.
0.72/1.12	Megabytes=1.67.
0.72/1.12	User_CPU=0.13, System_CPU=0.00, Wall_clock=0.
0.72/1.12	
0.72/1.12	============================== end of statistics =====================
0.72/1.12	
0.72/1.12	============================== end of search =========================
0.72/1.12	
0.72/1.12	THEOREM PROVED
0.72/1.12	% SZS status Theorem
0.72/1.12	
0.72/1.12	Exiting with 1 proof.
0.72/1.12	
0.72/1.12	Process 13863 exit (max_proofs) Thu Aug 29 10:16:24 2019
0.72/1.12	Prover9 interrupted
0.72/1.13	EOF