0.00/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.11	% Command    : tptp2X_and_run_prover9 %d %s
0.10/0.32	% Computer   : n020.cluster.edu
0.10/0.32	% Model      : x86_64 x86_64
0.10/0.32	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.32	% Memory     : 8042.1875MB
0.10/0.32	% OS         : Linux 3.10.0-693.el7.x86_64
0.10/0.32	% CPULimit   : 960
0.10/0.32	% DateTime   : Thu Jul  2 07:55:47 EDT 2020
0.10/0.32	% CPUTime    : 
0.84/1.14	============================== Prover9 ===============================
0.84/1.14	Prover9 (32) version 2009-11A, November 2009.
0.84/1.14	Process 2438 was started by sandbox2 on n020.cluster.edu,
0.84/1.14	Thu Jul  2 07:55:48 2020
0.84/1.14	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_2284_n020.cluster.edu".
0.84/1.14	============================== end of head ===========================
0.84/1.14	
0.84/1.14	============================== INPUT =================================
0.84/1.14	
0.84/1.14	% Reading from file /tmp/Prover9_2284_n020.cluster.edu
0.84/1.14	
0.84/1.14	set(prolog_style_variables).
0.84/1.14	set(auto2).
0.84/1.14	    % set(auto2) -> set(auto).
0.84/1.14	    % set(auto) -> set(auto_inference).
0.84/1.14	    % set(auto) -> set(auto_setup).
0.84/1.14	    % set(auto_setup) -> set(predicate_elim).
0.84/1.14	    % set(auto_setup) -> assign(eq_defs, unfold).
0.84/1.14	    % set(auto) -> set(auto_limits).
0.84/1.14	    % set(auto_limits) -> assign(max_weight, "100.000").
0.84/1.14	    % set(auto_limits) -> assign(sos_limit, 20000).
0.84/1.14	    % set(auto) -> set(auto_denials).
0.84/1.14	    % set(auto) -> set(auto_process).
0.84/1.14	    % set(auto2) -> assign(new_constants, 1).
0.84/1.14	    % set(auto2) -> assign(fold_denial_max, 3).
0.84/1.14	    % set(auto2) -> assign(max_weight, "200.000").
0.84/1.14	    % set(auto2) -> assign(max_hours, 1).
0.84/1.14	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.84/1.14	    % set(auto2) -> assign(max_seconds, 0).
0.84/1.14	    % set(auto2) -> assign(max_minutes, 5).
0.84/1.14	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.84/1.14	    % set(auto2) -> set(sort_initial_sos).
0.84/1.14	    % set(auto2) -> assign(sos_limit, -1).
0.84/1.14	    % set(auto2) -> assign(lrs_ticks, 3000).
0.84/1.14	    % set(auto2) -> assign(max_megs, 400).
0.84/1.14	    % set(auto2) -> assign(stats, some).
0.84/1.14	    % set(auto2) -> clear(echo_input).
0.84/1.14	    % set(auto2) -> set(quiet).
0.84/1.14	    % set(auto2) -> clear(print_initial_clauses).
0.84/1.14	    % set(auto2) -> clear(print_given).
0.84/1.14	assign(lrs_ticks,-1).
0.84/1.14	assign(sos_limit,10000).
0.84/1.14	assign(order,kbo).
0.84/1.14	set(lex_order_vars).
0.84/1.14	clear(print_given).
0.84/1.14	
0.84/1.14	% formulas(sos).  % not echoed (67 formulas)
0.84/1.14	
0.84/1.14	============================== end of input ==========================
0.84/1.14	
0.84/1.14	% From the command line: assign(max_seconds, 960).
0.84/1.14	
0.84/1.14	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.84/1.14	
0.84/1.14	% Formulas that are not ordinary clauses:
0.84/1.14	1 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	2 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	3 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	4 (all X all Y (m_NormQ(X) != m_NormQ(Y) <-> Y != X)) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	5 (all X all Y all Z m_Ldr(Z) != m_Ack(X,Y)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	6 (all Q (q_nil = Q | cons(head(Q),tail(Q)) = Q)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	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.84/1.14	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.84/1.14	9 (all X all Y (leq(X,Y) & leq(Y,X) <-> X = Y)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	10 (all Pid all Pid2 (host(Pid2) != host(Pid) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	11 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	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.84/1.14	13 (all X all Y m_Down(X) != m_NormQ(Y)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	14 (all X all Y m_NormQ(Y) != m_Ldr(X)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	15 (all X all Y all Z m_NotNorm(Z) != m_Ack(X,Y)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	16 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	17 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	18 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	19 (all X (ordered(snoc(q_nil,X)) & ordered(cons(X,q_nil)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	20 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	21 (all X all Y m_Halt(Y) != m_Ldr(X)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	22 (all X all Y (m_Down(X) != m_Down(Y) <-> X != Y)) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	23 (all X all Y m_Ldr(Y) != m_Down(X)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	24 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	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.84/1.14	26 (all Y all Q last(snoc(Q,Y)) = Y) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	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.84/1.14	28 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	29 (all X all Y all Z m_Halt(Z) != m_Ack(X,Y)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	30 (all X all Y (Y != X <-> m_Ldr(Y) != m_Ldr(X))) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	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.84/1.14	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.84/1.14	33 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	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.84/1.14	35 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	36 (all P all Q (s(host(P)) = host(Q) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	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.84/1.14	38 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	39 (all X all Q cons(X,Q) != q_nil) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	40 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	41 (all X pidMsg(m_Halt(X)) = X) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	42 (all X all Y all Z m_Down(Z) != m_Ack(X,Y)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	43 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	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.84/1.14	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.84/1.14	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.84/1.14	47 (all X cons(X,q_nil) = snoc(q_nil,X)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	48 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	49 (all Q (Q = q_nil | Q = snoc(init(Q),last(Q)))) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	50 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	51 (all X all Y (m_NotNorm(X) != m_NotNorm(Y) <-> X != Y)) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	52 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	53 (all X all Y (leq(Y,X) | leq(X,Y))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	54 (all X all Y (m_Halt(Y) != m_Halt(X) <-> Y != X)) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	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.84/1.15	56 (all X all Q head(cons(X,Q)) = X) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	57 (all X all Y all Z m_NormQ(Z) != m_Ack(X,Y)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	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 ((index(status,host(Z)) = elec_1 | elec_2 = index(status,host(Z))) & setIn(Z,alive) -> Z = index(elid,host(Z)))) & (all Z all Pid0 (setIn(Z,alive) & setIn(host(Pid0),index(down,host(Z))) & elec_2 = index(status,host(Pid0)) & setIn(Pid0,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & host(Pid20) = host(Pid0) & index(status,host(Pid0)) = norm & host(Pid0) = index(ldr,host(Pid0)) -> -(elem(m_Down(Pid20),queue(host(Z))) & setIn(Z,alive)))) & (all Z all Pid0 (setIn(Z,alive) & setIn(Pid0,alive) & norm = index(status,host(Z)) & index(ldr,host(Pid0)) = host(Pid0) & index(status,host(Pid0)) = norm & host(Z) = index(ldr,host(Z)) -> Pid0 = Z)) & (all Z all Pid20 all Pid0 (-leq(host(Pid20),host(Pid0)) & host(Pid20) = host(Z) & 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 Pid30 all Pid20 all Pid0 (host(Pid20) != host(Z) & setIn(Pid20,alive) & host(Z) = host(Pid30) & host(Pid0) = host(Pid20) & setIn(Z,alive) -> -(elem(m_Down(Pid0),queue(host(Z))) & elem(m_Down(Pid30),queue(host(Pid20)))))) & (all Z all Pid30 all Pid20 all Pid0 ((all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> V0 = host(Pid20) | setIn(V0,index(down,host(Pid0))))) & leq(host(Z),host(Pid0)) & elem(m_Down(Pid20),queue(host(Pid0))) & index(status,host(Pid0)) = elec_1 & index(status,host(Z)) = elec_2 & host(Pid0) = host(Pid30) & setIn(Z,alive) -> -elem(m_Ack(Z,Pid30),queue(host(Z))))) & (all Z all Pid30 all Pid20 all Pid0 (leq(nbr_proc,s(host(Pid0))) & elem(m_Down(Pid30),queue(host(Pid0))) & host(Pid30) = s(host(Pid0)) & elec_1 = index(status,host(Pid0)) & elem(m_Down(Pid20),queue(host(Pid0))) & setIn(Pid0,alive) & (all V0 (leq(s(zero),V0) & -leq(host(Pid0),V0) -> setIn(V0,index(down,host(Pid0))) | host(Pid20) = V0)) -> -(index(status,host(Z)) = norm & host(Z) = index(ldr,host(Z)) & setIn(Z,alive)))) & cons(m_Ack(W,Y),V) = queue(host(X)) & (all Z all Pid20 all Pid0 (host(Pid20) != host(Pid0) & host(Z) = host(Pid20) & wait = index(status,host(Pid0)) & host(Pid20) = host(index(elid,host(Pid0))) & elem(m_Down(Z),queue(host(Pid0))) & setIn(Pid0,alive) -> -(setIn(Pid20,alive) & host(Pid20) = index(ldr,host(Pid20)) & norm = index(status,host(Pid20))))) & (all Z all Pid20 all Pid0 (host(Pid0) != host(Pid20) & host(Pid20) = host(Z) & norm = index(status,host(Pid0)) & index(ldr,host(Pid0)) = host(Pid20) & elem(m_Down(Z),queue(host(Pid0))) & setIn(Pid0,alive) -> -(index(status,host(Pid20)) = norm & index(ldr,host(Pid20)) = host(Pid20) & setIn(Pid20,alive)))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) != host(Z) & setIn(Z,alive) & setIn(Pid20,alive) & host(Pid0) = host(Pid20) & host(Pid30) = host(Z) -> -(elem(m_Down(Pid0),queue(host(Z))) & setIn(host(Pid30),index(down,host(Pid20)))))) & (all Z all Pid20 all Pid0 (setIn(Z,alive) & elem(m_Down(Pid20),queue(host(Z))) & elec_2 = index(status,host(Pid0)) & host(Pid20) = host(Pid0) & setIn(Pid0,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid0 (setIn(Pid0,alive) & index(ldr,host(Pid0)) = host(Pid0) & norm = index(status,host(Pid0)) -> -(setIn(Z,alive) & setIn(host(Pid0),index(down,host(Z)))))) & (all Z all Pid0 (host(Pid0) = host(Z) & Pid0 != Z -> -setIn(Pid0,alive) | -setIn(Z,alive))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Z) != host(Pid0))) -> (setIn(X,alive) -> (elec_2 = index(status,host(X)) & index(pendack,host(X)) = host(Y) & index(elid,host(X)) = W -> (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(X) != host(Y0) -> (setIn(Y0,alive) & elem(m_Down(W0),queue(host(Y0))) & elem(m_Down(X0),queue(host(Y0))) & host(W0) = s(host(Y0)) & elec_1 = index(status,host(Y0)) & leq(nbr_proc,s(host(Y0))) & (all V1 (-leq(host(Y0),V1) & leq(s(zero),V1) -> host(X0) = V1 | setIn(V1,index(down,host(Y0))))) -> -(setIn(V0,alive) & host(V0) = host(X))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.89/1.58	
0.89/1.58	============================== end of process non-clausal formulas ===
0.89/1.58	
0.89/1.58	============================== PROCESS INITIAL CLAUSES ===============
0.89/1.58	
0.89/1.58	============================== PREDICATE ELIMINATION =================
0.89/1.58	
0.89/1.58	============================== end predicate elimination =============
0.89/1.58	
0.89/1.58	Auto_denials:  (non-Horn, no changes).
0.89/1.58	
0.89/1.58	Term ordering decisions:
0.89/1.58	Function symbol KB weights:  alive=1. status=1. ldr=1. norm=1. q_nil=1. elec_2=1. nbr_proc=1. zero=1. elec_1=1. elid=1. pendack=1. down=1. pids=1. acks=1. wait=1. nil=1. setEmpty=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. index=1. cons=1. snoc=1. m_Ack=1. f1=1. f3=1. host=1. m_Down=1. pidMsg=1. s=1. queue=1. m_Halt=1. m_Ldr=1. m_NormQ=1. m_NotNorm=1. head=1. init=1. last=1. tail=1. f2=1. f4=1. f5=1.
0.89/1.58	
0.89/1.58	============================== end of process initial clauses ========
0.89/1.58	
0.89/1.58	============================== CLAUSES FOR SEARCH ====================
0.89/1.58	
0.89/1.58	============================== end of clauses for search =============
0.89/1.58	
0.89/1.58	============================== SEARCH ================================
0.89/1.58	
0.89/1.58	% Starting search at 0.04 seconds.
0.89/1.58	
0.89/1.58	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 161 (0.00 of 0.31 sec).
0.89/1.58	
0.89/1.58	============================== PROOF =================================
0.89/1.58	% SZS status Theorem
0.89/1.58	% SZS output start Refutation
0.89/1.58	
0.89/1.58	% Proof 1 at 0.45 (+ 0.01) seconds.
0.89/1.58	% Length of proof is 60.
0.89/1.58	% Level of proof is 10.
0.89/1.58	% Maximum clause weight is 33.000.
0.89/1.58	% Given clauses 682.
0.89/1.58	
0.89/1.58	9 (all X all Y (leq(X,Y) & leq(Y,X) <-> X = Y)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.89/1.58	24 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.89/1.58	43 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.89/1.58	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.89/1.58	52 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.89/1.58	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 ((index(status,host(Z)) = elec_1 | elec_2 = index(status,host(Z))) & setIn(Z,alive) -> Z = index(elid,host(Z)))) & (all Z all Pid0 (setIn(Z,alive) & setIn(host(Pid0),index(down,host(Z))) & elec_2 = index(status,host(Pid0)) & setIn(Pid0,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & host(Pid20) = host(Pid0) & index(status,host(Pid0)) = norm & host(Pid0) = index(ldr,host(Pid0)) -> -(elem(m_Down(Pid20),queue(host(Z))) & setIn(Z,alive)))) & (all Z all Pid0 (setIn(Z,alive) & setIn(Pid0,alive) & norm = index(status,host(Z)) & index(ldr,host(Pid0)) = host(Pid0) & index(status,host(Pid0)) = norm & host(Z) = index(ldr,host(Z)) -> Pid0 = Z)) & (all Z all Pid20 all Pid0 (-leq(host(Pid20),host(Pid0)) & host(Pid20) = host(Z) & 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 Pid30 all Pid20 all Pid0 (host(Pid20) != host(Z) & setIn(Pid20,alive) & host(Z) = host(Pid30) & host(Pid0) = host(Pid20) & setIn(Z,alive) -> -(elem(m_Down(Pid0),queue(host(Z))) & elem(m_Down(Pid30),queue(host(Pid20)))))) & (all Z all Pid30 all Pid20 all Pid0 ((all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> V0 = host(Pid20) | setIn(V0,index(down,host(Pid0))))) & leq(host(Z),host(Pid0)) & elem(m_Down(Pid20),queue(host(Pid0))) & index(status,host(Pid0)) = elec_1 & index(status,host(Z)) = elec_2 & host(Pid0) = host(Pid30) & setIn(Z,alive) -> -elem(m_Ack(Z,Pid30),queue(host(Z))))) & (all Z all Pid30 all Pid20 all Pid0 (leq(nbr_proc,s(host(Pid0))) & elem(m_Down(Pid30),queue(host(Pid0))) & host(Pid30) = s(host(Pid0)) & elec_1 = index(status,host(Pid0)) & elem(m_Down(Pid20),queue(host(Pid0))) & setIn(Pid0,alive) & (all V0 (leq(s(zero),V0) & -leq(host(Pid0),V0) -> setIn(V0,index(down,host(Pid0))) | host(Pid20) = V0)) -> -(index(status,host(Z)) = norm & host(Z) = index(ldr,host(Z)) & setIn(Z,alive)))) & cons(m_Ack(W,Y),V) = queue(host(X)) & (all Z all Pid20 all Pid0 (host(Pid20) != host(Pid0) & host(Z) = host(Pid20) & wait = index(status,host(Pid0)) & host(Pid20) = host(index(elid,host(Pid0))) & elem(m_Down(Z),queue(host(Pid0))) & setIn(Pid0,alive) -> -(setIn(Pid20,alive) & host(Pid20) = index(ldr,host(Pid20)) & norm = index(status,host(Pid20))))) & (all Z all Pid20 all Pid0 (host(Pid0) != host(Pid20) & host(Pid20) = host(Z) & norm = index(status,host(Pid0)) & index(ldr,host(Pid0)) = host(Pid20) & elem(m_Down(Z),queue(host(Pid0))) & setIn(Pid0,alive) -> -(index(status,host(Pid20)) = norm & index(ldr,host(Pid20)) = host(Pid20) & setIn(Pid20,alive)))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) != host(Z) & setIn(Z,alive) & setIn(Pid20,alive) & host(Pid0) = host(Pid20) & host(Pid30) = host(Z) -> -(elem(m_Down(Pid0),queue(host(Z))) & setIn(host(Pid30),index(down,host(Pid20)))))) & (all Z all Pid20 all Pid0 (setIn(Z,alive) & elem(m_Down(Pid20),queue(host(Z))) & elec_2 = index(status,host(Pid0)) & host(Pid20) = host(Pid0) & setIn(Pid0,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid0 (setIn(Pid0,alive) & index(ldr,host(Pid0)) = host(Pid0) & norm = index(status,host(Pid0)) -> -(setIn(Z,alive) & setIn(host(Pid0),index(down,host(Z)))))) & (all Z all Pid0 (host(Pid0) = host(Z) & Pid0 != Z -> -setIn(Pid0,alive) | -setIn(Z,alive))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Z) != host(Pid0))) -> (setIn(X,alive) -> (elec_2 = index(status,host(X)) & index(pendack,host(X)) = host(Y) & index(elid,host(X)) = W -> (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(X) != host(Y0) -> (setIn(Y0,alive) & elem(m_Down(W0),queue(host(Y0))) & elem(m_Down(X0),queue(host(Y0))) & host(W0) = s(host(Y0)) & elec_1 = index(status,host(Y0)) & leq(nbr_proc,s(host(Y0))) & (all V1 (-leq(host(Y0),V1) & leq(s(zero),V1) -> host(X0) = V1 | setIn(V1,index(down,host(Y0))))) -> -(setIn(V0,alive) & host(V0) = host(X))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.89/1.58	77 -leq(A,B) | -leq(B,A) | B = A # label(axiom_61) # label(axiom).  [clausify(9)].
0.89/1.58	99 -leq(s(A),A) # label(axiom_58) # label(axiom).  [clausify(24)].
0.89/1.58	130 leq(host(A),nbr_proc) # label(axiom_04) # label(axiom).  [clausify(43)].
0.89/1.58	134 s(A) = B | leq(B,A) | -leq(B,s(A)) # label(axiom_64) # label(axiom).  [clausify(46)].
0.89/1.58	142 leq(s(zero),host(A)) # label(axiom_02) # label(axiom).  [clausify(52)].
0.89/1.58	161 index(status,host(A)) != elec_2 | -setIn(A,alive) | index(elid,host(A)) = A # label(conj) # label(negated_conjecture).  [clausify(58)].
0.89/1.58	162 -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)].
0.89/1.58	181 -setIn(A,alive) | -elem(m_Down(B),queue(host(A))) | index(status,host(C)) != elec_2 | host(B) != host(C) | -setIn(C,alive) | leq(index(pendack,host(C)),host(A)) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.89/1.58	185 setIn(c3,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.89/1.58	186 index(status,host(c3)) = elec_2 # label(conj) # label(negated_conjecture).  [clausify(58)].
0.89/1.58	187 elec_2 = index(status,host(c3)).  [copy(186),flip(a)].
0.89/1.58	188 index(pendack,host(c3)) = host(c4) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.89/1.58	189 index(elid,host(c3)) = c2 # label(conj) # label(negated_conjecture).  [clausify(58)].
0.89/1.58	190 leq(nbr_proc,index(pendack,host(c3))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.89/1.58	191 leq(nbr_proc,host(c4)).  [copy(190),rewrite([188(5)])].
0.89/1.58	193 host(c6) = host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.89/1.58	195 host(c9) != host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.89/1.58	196 setIn(c9,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.89/1.58	197 elem(m_Down(c7),queue(host(c9))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.89/1.58	198 elem(m_Down(c8),queue(host(c9))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.89/1.58	199 s(host(c9)) = host(c7) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.89/1.58	202 leq(nbr_proc,s(host(c9))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.89/1.58	203 leq(nbr_proc,host(c7)).  [copy(202),rewrite([199(4)])].
0.89/1.58	204 leq(host(c9),A) | -leq(s(zero),A) | host(c8) = A | setIn(A,index(down,host(c9))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.89/1.58	205 setIn(c6,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.89/1.58	217 -setIn(A,alive) | -elem(m_Down(B),queue(host(A))) | index(status,host(c3)) != index(status,host(C)) | host(B) != host(C) | -setIn(C,alive) | leq(index(pendack,host(C)),host(A)).  [back_rewrite(181),rewrite([187(10)]),flip(c)].
0.89/1.58	222 -setIn(A,alive) | -setIn(host(B),index(down,host(A))) | index(status,host(c3)) != index(status,host(B)) | -setIn(B,alive) | leq(index(pendack,host(B)),host(A)).  [back_rewrite(162),rewrite([187(11)]),flip(c)].
0.89/1.58	223 index(status,host(c3)) != index(status,host(A)) | -setIn(A,alive) | index(elid,host(A)) = A.  [back_rewrite(161),rewrite([187(4)]),flip(a)].
0.89/1.58	331 host(c4) = nbr_proc.  [resolve(191,a,77,b),flip(b),unit_del(a,130)].
0.89/1.58	333 index(pendack,host(c3)) = nbr_proc.  [back_rewrite(188),rewrite([331(6)])].
0.89/1.58	364 -leq(host(c7),host(c9)).  [para(199(a,1),99(a,1))].
0.89/1.58	366 host(c7) = A | leq(A,host(c9)) | -leq(A,host(c7)).  [para(199(a,1),134(c,2)),rewrite([199(3)])].
0.89/1.58	371 host(c7) = nbr_proc.  [resolve(203,a,77,b),flip(b),unit_del(a,130)].
0.89/1.58	372 nbr_proc = A | leq(A,host(c9)) | -leq(A,nbr_proc).  [back_rewrite(366),rewrite([371(2),371(7)])].
0.89/1.58	374 -leq(nbr_proc,host(c9)).  [back_rewrite(364),rewrite([371(2)])].
0.89/1.58	386 leq(host(c9),host(A)) | host(c8) = host(A) | setIn(host(A),index(down,host(c9))).  [resolve(204,b,142,a)].
0.89/1.58	398 index(status,host(c3)) != index(status,host(A)) | host(c8) != host(A) | -setIn(A,alive) | leq(index(pendack,host(A)),host(c9)).  [resolve(217,b,198,a),unit_del(a,196)].
0.89/1.58	399 index(status,host(c3)) != index(status,host(A)) | host(A) != nbr_proc | -setIn(A,alive) | leq(index(pendack,host(A)),host(c9)).  [resolve(217,b,197,a),rewrite([371(13)]),flip(c),unit_del(a,196)].
0.89/1.58	413 -setIn(A,alive) | -setIn(host(c3),index(down,host(A))) | leq(nbr_proc,host(A)).  [para(193(a,1),222(b,1)),rewrite([193(15),193(23),333(24)]),xx(c),unit_del(c,205)].
0.89/1.58	415 c6 = c2.  [resolve(223,b,205,a),rewrite([193(7),193(12),189(13)]),flip(b),xx(a)].
0.89/1.58	416 c3 = c2.  [resolve(223,b,185,a),rewrite([189(13)]),flip(b),xx(a)].
0.89/1.58	422 setIn(c2,alive).  [back_rewrite(205),rewrite([415(1)])].
0.89/1.58	424 -setIn(A,alive) | -setIn(host(c2),index(down,host(A))) | leq(nbr_proc,host(A)).  [back_rewrite(413),rewrite([416(3)])].
0.89/1.58	434 index(status,host(c2)) != index(status,host(A)) | host(A) != nbr_proc | -setIn(A,alive) | leq(index(pendack,host(A)),host(c9)).  [back_rewrite(399),rewrite([416(2)])].
0.89/1.58	435 index(status,host(c2)) != index(status,host(A)) | host(c8) != host(A) | -setIn(A,alive) | leq(index(pendack,host(A)),host(c9)).  [back_rewrite(398),rewrite([416(2)])].
0.89/1.58	444 index(pendack,host(c2)) = nbr_proc.  [back_rewrite(333),rewrite([416(2)])].
0.89/1.58	463 host(c9) != host(c2).  [back_rewrite(195),rewrite([416(3)])].
0.89/1.58	2656 host(A) = nbr_proc | leq(host(A),host(c9)).  [resolve(372,c,130,a),flip(a)].
0.89/1.58	3214 leq(host(c9),host(c2)) | host(c8) = host(c2).  [resolve(424,b,386,c),unit_del(a,196),unit_del(b,374)].
0.89/1.58	3333 host(c2) != nbr_proc.  [resolve(434,c,422,a),rewrite([444(17)]),xx(a),unit_del(b,374)].
0.89/1.58	3403 host(c8) != host(c2).  [resolve(435,c,422,a),rewrite([444(18)]),xx(a),unit_del(b,374)].
0.89/1.58	3404 leq(host(c9),host(c2)).  [back_unit_del(3214),unit_del(b,3403)].
0.89/1.58	3414 -leq(host(c2),host(c9)).  [resolve(3404,a,77,b),unit_del(b,463)].
0.89/1.58	3444 $F.  [resolve(3414,a,2656,b),unit_del(a,3333)].
0.89/1.58	
0.89/1.58	% SZS output end Refutation
0.89/1.58	============================== end of proof ==========================
0.89/1.58	
0.89/1.58	============================== STATISTICS ============================
0.89/1.58	
0.89/1.58	Given=682. Generated=12899. Kept=3373. proofs=1.
0.89/1.58	Usable=660. Sos=2598. Demods=35. Limbo=0, Disabled=252. Hints=0.
0.89/1.58	Megabytes=7.32.
0.89/1.58	User_CPU=0.46, System_CPU=0.01, Wall_clock=0.
0.89/1.58	
0.89/1.58	============================== end of statistics =====================
0.89/1.58	
0.89/1.58	============================== end of search =========================
0.89/1.58	
0.89/1.58	THEOREM PROVED
0.89/1.58	% SZS status Theorem
0.89/1.58	
0.89/1.58	Exiting with 1 proof.
0.89/1.58	
0.89/1.58	Process 2438 exit (max_proofs) Thu Jul  2 07:55:48 2020
0.89/1.58	Prover9 interrupted
0.89/1.59	EOF