0.00/0.04	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.04	% Command    : tptp2X_and_run_prover9 %d %s
0.02/0.23	% Computer   : n156.star.cs.uiowa.edu
0.02/0.23	% Model      : x86_64 x86_64
0.02/0.23	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.02/0.23	% Memory     : 32218.625MB
0.02/0.23	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.02/0.23	% CPULimit   : 300
0.02/0.23	% DateTime   : Sat Jul 14 05:40:11 CDT 2018
0.02/0.23	% CPUTime    : 
0.07/0.50	============================== Prover9 ===============================
0.07/0.50	Prover9 (32) version 2009-11A, November 2009.
0.07/0.50	Process 36319 was started by sandbox2 on n156.star.cs.uiowa.edu,
0.07/0.50	Sat Jul 14 05:40:12 2018
0.07/0.50	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_36287_n156.star.cs.uiowa.edu".
0.07/0.50	============================== end of head ===========================
0.07/0.50	
0.07/0.50	============================== INPUT =================================
0.07/0.50	
0.07/0.50	% Reading from file /tmp/Prover9_36287_n156.star.cs.uiowa.edu
0.07/0.50	
0.07/0.50	set(prolog_style_variables).
0.07/0.50	set(auto2).
0.07/0.50	    % set(auto2) -> set(auto).
0.07/0.50	    % set(auto) -> set(auto_inference).
0.07/0.50	    % set(auto) -> set(auto_setup).
0.07/0.50	    % set(auto_setup) -> set(predicate_elim).
0.07/0.50	    % set(auto_setup) -> assign(eq_defs, unfold).
0.07/0.50	    % set(auto) -> set(auto_limits).
0.07/0.50	    % set(auto_limits) -> assign(max_weight, "100.000").
0.07/0.50	    % set(auto_limits) -> assign(sos_limit, 20000).
0.07/0.50	    % set(auto) -> set(auto_denials).
0.07/0.50	    % set(auto) -> set(auto_process).
0.07/0.50	    % set(auto2) -> assign(new_constants, 1).
0.07/0.50	    % set(auto2) -> assign(fold_denial_max, 3).
0.07/0.50	    % set(auto2) -> assign(max_weight, "200.000").
0.07/0.50	    % set(auto2) -> assign(max_hours, 1).
0.07/0.50	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.07/0.50	    % set(auto2) -> assign(max_seconds, 0).
0.07/0.50	    % set(auto2) -> assign(max_minutes, 5).
0.07/0.50	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.07/0.50	    % set(auto2) -> set(sort_initial_sos).
0.07/0.50	    % set(auto2) -> assign(sos_limit, -1).
0.07/0.50	    % set(auto2) -> assign(lrs_ticks, 3000).
0.07/0.50	    % set(auto2) -> assign(max_megs, 400).
0.07/0.50	    % set(auto2) -> assign(stats, some).
0.07/0.50	    % set(auto2) -> clear(echo_input).
0.07/0.50	    % set(auto2) -> set(quiet).
0.07/0.50	    % set(auto2) -> clear(print_initial_clauses).
0.07/0.50	    % set(auto2) -> clear(print_given).
0.07/0.50	assign(lrs_ticks,-1).
0.07/0.50	assign(sos_limit,10000).
0.07/0.50	assign(order,kbo).
0.07/0.50	set(lex_order_vars).
0.07/0.50	clear(print_given).
0.07/0.50	
0.07/0.50	% formulas(sos).  % not echoed (67 formulas)
0.07/0.50	
0.07/0.50	============================== end of input ==========================
0.07/0.50	
0.07/0.50	% From the command line: assign(max_seconds, 300).
0.07/0.50	
0.07/0.50	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.07/0.50	
0.07/0.50	% Formulas that are not ordinary clauses:
0.07/0.50	1 (all X all Y (s(Y) = X | leq(X,Y) <-> leq(X,s(Y)))) # label(axiom_64) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	2 (all X pidMsg(m_Halt(X)) = X) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	3 (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.07/0.50	4 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	5 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	6 (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.07/0.50	7 (all X all Y all Q (elem(X,snoc(Q,Y)) <-> elem(X,Q) | Y = X)) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	8 (all X ((exists Y (m_Down(Y) = X | X = m_Halt(Y))) <-> pidElem(X))) # label(axiom_48) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	9 (all X all Y m_Down(X) != m_NotNorm(Y)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	10 (all X all Y m_NormQ(X) != m_Halt(Y)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	11 (all X all Y m_Halt(Y) != m_Ldr(X)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	12 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	13 (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.07/0.50	14 (all X all Y all Z m_Ack(X,Y) != m_Halt(Z)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	15 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	16 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	17 (all X all Q (ordered(snoc(Q,X)) <-> (all Y (elem(Y,Q) & host(pidMsg(Y)) = host(pidMsg(X)) & pidElem(Y) & pidElem(X) -> leq(pidMsg(Y),pidMsg(X)))) & ordered(Q))) # label(axiom_54) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	18 (all X all Y (X != Y <-> m_NormQ(X) != m_NormQ(Y))) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	19 (all X all Y all Z m_Ack(X,Y) != m_NotNorm(Z)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	20 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	21 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	22 (all X1 all X2 all Y1 all Y2 (X1 != X2 -> m_Ack(X1,Y1) != m_Ack(X2,Y2))) # label(axiom_31) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	23 (all X (ordered(snoc(q_nil,X)) & ordered(cons(X,q_nil)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	24 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	25 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	26 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	27 (all X1 all X2 all Y1 all Y2 (Y1 != Y2 -> m_Ack(X2,Y2) != m_Ack(X1,Y1))) # label(axiom_32) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	28 (all Y all Q Y = last(snoc(Q,Y))) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	29 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	30 (all X all Q X = head(cons(X,Q))) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	31 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	32 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	33 (all Q (q_nil = Q | Q = cons(head(Q),tail(Q)))) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	34 (all Q (snoc(init(Q),last(Q)) = Q | q_nil = Q)) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	35 (all X all Y all Z (leq(Y,Z) & leq(X,Y) -> leq(X,Z))) # label(axiom_62) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	36 (all X all Y (Y != X <-> m_Ldr(Y) != m_Ldr(X))) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	37 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	38 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	39 (all X all Q (ordered(cons(X,Q)) <-> (all Y (elem(Y,Q) & pidElem(Y) & host(pidMsg(Y)) = host(pidMsg(X)) & pidElem(X) -> leq(pidMsg(X),pidMsg(Y)))) & ordered(Q))) # label(axiom_53) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	40 (all X all Y all Z m_Ack(X,Y) != m_Down(Z)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	41 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	42 (all P all Q (host(Q) = s(host(P)) -> host(Q) != host(P))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	43 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	44 (all X all Y (X != Y <-> m_Down(X) != m_Down(Y))) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	45 (all X all Y all Q (elem(X,cons(Y,Q)) <-> elem(X,Q) | X = Y)) # label(axiom_46) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	46 (all X all Y (m_Halt(X) != m_Halt(Y) <-> X != Y)) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	47 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	48 (all Pid all Pid2 (host(Pid2) != host(Pid) -> Pid2 != Pid)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	49 (all X X = pidMsg(m_Down(X))) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	50 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	51 (all X all Y (m_NotNorm(Y) != m_NotNorm(X) <-> Y != X)) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	52 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	53 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	54 (all X all Y m_NormQ(Y) != m_Down(X)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	55 (all X all Y all Q cons(X,snoc(Q,Y)) = snoc(cons(X,Q),Y)) # label(axiom_44) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	56 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	57 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.07/0.50	58 -(all V all W all X all Y ((all Z all Pid0 (host(Z) = host(Pid0) & Z != Pid0 -> -setIn(Pid0,alive) | -setIn(Z,alive))) & (all Z ((elec_2 = index(status,host(Z)) | index(status,host(Z)) = elec_1) & setIn(Z,alive) -> Z = index(elid,host(Z)))) & (all Z all Pid20 all Pid0 (-leq(host(Pid0),host(Z)) & setIn(Z,alive) & setIn(Pid0,alive) & index(status,host(Pid0)) = elec_2 & host(Pid20) = host(Pid0) -> -elem(m_Down(Pid20),queue(host(Z))))) & (all Z all Pid0 (setIn(Z,alive) & elec_2 = index(status,host(Pid0)) & elec_2 = index(status,host(Z)) & setIn(Pid0,alive) & -leq(host(Z),host(Pid0)) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & host(Pid20) = host(Z) & elem(m_Ack(Pid0,Pid20),queue(host(Pid0))) -> -(index(ldr,host(Z)) = host(Z) & index(status,host(Z)) = norm & setIn(Z,alive)))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & host(Pid0) = host(Pid20) & index(status,host(Pid0)) = norm & index(ldr,host(Pid0)) = host(Pid0) -> -(setIn(Z,alive) & elem(m_Down(Pid20),queue(host(Z)))))) & (all Z all Pid20 all Pid0 (elec_2 = index(status,host(Pid0)) & host(Z) = host(Pid20) & elem(m_Down(Pid20),queue(host(Pid0))) & setIn(Pid0,alive) -> -(host(Z) = index(ldr,host(Z)) & index(status,host(Z)) = norm & setIn(Z,alive)))) & cons(m_Down(Y),V) = queue(host(X)) & (all Z all Pid20 all Pid0 ((all V0 (leq(s(zero),V0) & -leq(host(Pid0),V0) -> host(Pid20) = V0 | setIn(V0,index(down,host(Pid0))))) & -leq(host(Pid0),host(Z)) & elem(m_Down(Pid20),queue(host(Pid0))) & elec_1 = index(status,host(Pid0)) -> -(host(Z) = index(ldr,host(Z)) & index(status,host(Z)) = norm & setIn(Z,alive)))) & (all Z all Pid0 (setIn(Z,alive) & index(status,host(Z)) = elec_2 & elec_2 = index(status,host(Pid0)) & setIn(Pid0,alive) & -leq(host(Z),host(Pid0)) -> -leq(index(pendack,host(Z)),index(pendack,host(Pid0))))) & (all Z all Pid0 (index(status,host(Pid0)) = elec_2 & setIn(Pid0,alive) & -leq(index(pendack,host(Pid0)),host(Z)) -> -(setIn(Z,alive) & norm = index(status,host(Z)) & index(ldr,host(Z)) = host(Z)))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & elec_2 = index(status,host(Pid0)) & host(Pid0) = host(Pid20) & elem(m_Down(Pid20),queue(host(Z))) & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (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 (host(Pid0) = index(ldr,host(Pid0)) & index(status,host(Pid0)) = norm & setIn(Pid0,alive) -> -(setIn(Z,alive) & setIn(host(Pid0),index(down,host(Z)))))) & (all Z all Pid0 (setIn(Z,alive) & elec_2 = index(status,host(Pid0)) & setIn(host(Pid0),index(down,host(Z))) & setIn(Pid0,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid0 (setIn(Pid0,alive) & elec_2 = index(status,host(Pid0)) -> -elem(m_Ack(Z,Pid0),queue(host(Z))))) & (all Z all Pid0 (elem(m_Ldr(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) -> (setIn(X,alive) -> (-leq(host(X),host(Y)) -> (-(wait = index(status,host(X)) & host(Y) = host(index(elid,host(X))) | index(ldr,host(X)) = host(Y) & norm = index(status,host(X))) -> ((all Z (-leq(host(X),Z) & leq(s(zero),Z) -> Z = host(Y) | setIn(Z,index(down,host(X))))) & index(status,host(X)) = elec_1 -> (-leq(nbr_proc,host(X)) -> (all Z (host(Z) != host(X) -> (all W0 (host(W0) = host(X) -> (setIn(W0,alive) & -leq(s(host(X)),host(Z)) -> -(setIn(Z,alive) & host(Z) = index(ldr,host(Z)) & norm = index(status,host(Z))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
26.86/27.09	
26.86/27.09	============================== end of process non-clausal formulas ===
26.86/27.09	
26.86/27.09	============================== PROCESS INITIAL CLAUSES ===============
26.86/27.09	
26.86/27.09	============================== PREDICATE ELIMINATION =================
26.86/27.09	
26.86/27.09	============================== end predicate elimination =============
26.86/27.09	
26.86/27.09	Auto_denials:  (non-Horn, no changes).
26.86/27.09	
26.86/27.09	Term ordering decisions:
26.86/27.09	Function symbol KB weights:  alive=1. status=1. elec_2=1. q_nil=1. elec_1=1. ldr=1. norm=1. pendack=1. zero=1. down=1. elid=1. nbr_proc=1. pids=1. nil=1. setEmpty=1. wait=1. c1=1. c3=1. c4=1. c5=1. c6=1. index=1. cons=1. snoc=1. m_Ack=1. f2=1. f3=1. host=1. pidMsg=1. m_Down=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. f1=1. f4=1.
26.86/27.09	
26.86/27.09	============================== end of process initial clauses ========
26.86/27.09	
26.86/27.09	============================== CLAUSES FOR SEARCH ====================
26.86/27.09	
26.86/27.09	============================== end of clauses for search =============
26.86/27.09	
26.86/27.09	============================== SEARCH ================================
26.86/27.09	
26.86/27.09	% Starting search at 0.02 seconds.
26.86/27.09	
26.86/27.09	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 190 (0.00 of 0.40 sec).
26.86/27.09	
26.86/27.09	Low Water (keep): wt=41.000, iters=3333
26.86/27.09	
26.86/27.09	Low Water (keep): wt=39.000, iters=3399
26.86/27.09	
26.86/27.09	Low Water (keep): wt=37.000, iters=3358
26.86/27.09	
26.86/27.09	Low Water (keep): wt=34.000, iters=3335
26.86/27.09	
26.86/27.09	Low Water (keep): wt=33.000, iters=3358
26.86/27.09	
26.86/27.09	Low Water (keep): wt=16.000, iters=4271
26.86/27.09	
26.86/27.09	Low Water (keep): wt=15.000, iters=3525
26.86/27.09	
26.86/27.09	Low Water (displace): id=4098, wt=75.000
26.86/27.09	
26.86/27.09	Low Water (displace): id=4464, wt=72.000
26.86/27.09	
26.86/27.09	Low Water (displace): id=3604, wt=61.000
26.86/27.09	
26.86/27.09	Low Water (displace): id=4549, wt=60.000
26.86/27.09	
26.86/27.09	Low Water (displace): id=4099, wt=57.000
26.86/27.09	
26.86/27.09	Low Water (displace): id=14975, wt=14.000
26.86/27.09	
26.86/27.09	============================== PROOF =================================
26.86/27.09	% SZS status Theorem
26.86/27.09	% SZS output start Refutation
26.86/27.09	
26.86/27.09	% Proof 1 at 25.81 (+ 0.79) seconds.
26.86/27.09	% Length of proof is 41.
26.86/27.09	% Level of proof is 8.
26.86/27.09	% Maximum clause weight is 33.000.
26.86/27.09	% Given clauses 5171.
26.86/27.09	
26.86/27.09	1 (all X all Y (s(Y) = X | leq(X,Y) <-> leq(X,s(Y)))) # label(axiom_64) # label(axiom) # label(non_clause).  [assumption].
26.86/27.09	25 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
26.86/27.09	26 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
26.86/27.09	32 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
26.86/27.09	38 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
26.86/27.09	43 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
26.86/27.09	45 (all X all Y all Q (elem(X,cons(Y,Q)) <-> elem(X,Q) | X = Y)) # label(axiom_46) # label(axiom) # label(non_clause).  [assumption].
26.86/27.09	58 -(all V all W all X all Y ((all Z all Pid0 (host(Z) = host(Pid0) & Z != Pid0 -> -setIn(Pid0,alive) | -setIn(Z,alive))) & (all Z ((elec_2 = index(status,host(Z)) | index(status,host(Z)) = elec_1) & setIn(Z,alive) -> Z = index(elid,host(Z)))) & (all Z all Pid20 all Pid0 (-leq(host(Pid0),host(Z)) & setIn(Z,alive) & setIn(Pid0,alive) & index(status,host(Pid0)) = elec_2 & host(Pid20) = host(Pid0) -> -elem(m_Down(Pid20),queue(host(Z))))) & (all Z all Pid0 (setIn(Z,alive) & elec_2 = index(status,host(Pid0)) & elec_2 = index(status,host(Z)) & setIn(Pid0,alive) & -leq(host(Z),host(Pid0)) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & host(Pid20) = host(Z) & elem(m_Ack(Pid0,Pid20),queue(host(Pid0))) -> -(index(ldr,host(Z)) = host(Z) & index(status,host(Z)) = norm & setIn(Z,alive)))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & host(Pid0) = host(Pid20) & index(status,host(Pid0)) = norm & index(ldr,host(Pid0)) = host(Pid0) -> -(setIn(Z,alive) & elem(m_Down(Pid20),queue(host(Z)))))) & (all Z all Pid20 all Pid0 (elec_2 = index(status,host(Pid0)) & host(Z) = host(Pid20) & elem(m_Down(Pid20),queue(host(Pid0))) & setIn(Pid0,alive) -> -(host(Z) = index(ldr,host(Z)) & index(status,host(Z)) = norm & setIn(Z,alive)))) & cons(m_Down(Y),V) = queue(host(X)) & (all Z all Pid20 all Pid0 ((all V0 (leq(s(zero),V0) & -leq(host(Pid0),V0) -> host(Pid20) = V0 | setIn(V0,index(down,host(Pid0))))) & -leq(host(Pid0),host(Z)) & elem(m_Down(Pid20),queue(host(Pid0))) & elec_1 = index(status,host(Pid0)) -> -(host(Z) = index(ldr,host(Z)) & index(status,host(Z)) = norm & setIn(Z,alive)))) & (all Z all Pid0 (setIn(Z,alive) & index(status,host(Z)) = elec_2 & elec_2 = index(status,host(Pid0)) & setIn(Pid0,alive) & -leq(host(Z),host(Pid0)) -> -leq(index(pendack,host(Z)),index(pendack,host(Pid0))))) & (all Z all Pid0 (index(status,host(Pid0)) = elec_2 & setIn(Pid0,alive) & -leq(index(pendack,host(Pid0)),host(Z)) -> -(setIn(Z,alive) & norm = index(status,host(Z)) & index(ldr,host(Z)) = host(Z)))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & elec_2 = index(status,host(Pid0)) & host(Pid0) = host(Pid20) & elem(m_Down(Pid20),queue(host(Z))) & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (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 (host(Pid0) = index(ldr,host(Pid0)) & index(status,host(Pid0)) = norm & setIn(Pid0,alive) -> -(setIn(Z,alive) & setIn(host(Pid0),index(down,host(Z)))))) & (all Z all Pid0 (setIn(Z,alive) & elec_2 = index(status,host(Pid0)) & setIn(host(Pid0),index(down,host(Z))) & setIn(Pid0,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid0 (setIn(Pid0,alive) & elec_2 = index(status,host(Pid0)) -> -elem(m_Ack(Z,Pid0),queue(host(Z))))) & (all Z all Pid0 (elem(m_Ldr(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) -> (setIn(X,alive) -> (-leq(host(X),host(Y)) -> (-(wait = index(status,host(X)) & host(Y) = host(index(elid,host(X))) | index(ldr,host(X)) = host(Y) & norm = index(status,host(X))) -> ((all Z (-leq(host(X),Z) & leq(s(zero),Z) -> Z = host(Y) | setIn(Z,index(down,host(X))))) & index(status,host(X)) = elec_1 -> (-leq(nbr_proc,host(X)) -> (all Z (host(Z) != host(X) -> (all W0 (host(W0) = host(X) -> (setIn(W0,alive) & -leq(s(host(X)),host(Z)) -> -(setIn(Z,alive) & host(Z) = index(ldr,host(Z)) & norm = index(status,host(Z))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
26.86/27.09	61 s(A) = B | leq(B,A) | -leq(B,s(A)) # label(axiom_64) # label(axiom).  [clausify(1)].
26.86/27.09	103 leq(A,B) | leq(B,A) # label(axiom_60) # label(axiom).  [clausify(25)].
26.86/27.09	104 leq(s(zero),host(A)) # label(axiom_02) # label(axiom).  [clausify(26)].
26.86/27.09	110 -leq(A,B) | -leq(B,A) | A = B # label(axiom_61) # label(axiom).  [clausify(32)].
26.86/27.09	122 leq(A,A) # label(axiom_59) # label(axiom).  [clausify(38)].
26.86/27.09	136 init(snoc(A,B)) = A # label(axiom_38) # label(axiom).  [clausify(43)].
26.86/27.09	141 elem(A,cons(B,C)) | B != A # label(axiom_46) # label(axiom).  [clausify(45)].
26.86/27.09	167 -setIn(A,alive) | host(B) != host(A) | index(status,host(A)) != norm | index(ldr,host(A)) != host(A) | -setIn(C,alive) | -elem(m_Down(B),queue(host(C))) # label(conj) # label(negated_conjecture).  [clausify(58)].
26.86/27.09	168 queue(host(c3)) = cons(m_Down(c4),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
26.86/27.09	169 cons(m_Down(c4),c1) = queue(host(c3)).  [copy(168),flip(a)].
26.86/27.09	179 index(ldr,host(A)) != host(A) | index(status,host(A)) != norm | -setIn(A,alive) | -setIn(B,alive) | -setIn(host(A),index(down,host(B))) # label(conj) # label(negated_conjecture).  [clausify(58)].
26.86/27.09	183 setIn(c3,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
26.86/27.09	187 leq(host(c3),A) | -leq(s(zero),A) | host(c4) = A | setIn(A,index(down,host(c3))) # label(conj) # label(negated_conjecture).  [clausify(58)].
26.86/27.09	191 host(c5) != host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
26.86/27.10	194 -leq(s(host(c3)),host(c5)) # label(conj) # label(negated_conjecture).  [clausify(58)].
26.86/27.10	195 setIn(c5,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
26.86/27.10	196 index(ldr,host(c5)) = host(c5) # label(conj) # label(negated_conjecture).  [clausify(58)].
26.86/27.10	197 index(status,host(c5)) = norm # label(conj) # label(negated_conjecture).  [clausify(58)].
26.86/27.10	198 norm = index(status,host(c5)).  [copy(197),flip(a)].
26.86/27.10	214 index(ldr,host(A)) != host(A) | index(status,host(c5)) != index(status,host(A)) | -setIn(A,alive) | -setIn(B,alive) | -setIn(host(A),index(down,host(B))).  [back_rewrite(179),rewrite([198(9)]),flip(b)].
26.86/27.10	216 -setIn(A,alive) | host(B) != host(A) | index(status,host(c5)) != index(status,host(A)) | index(ldr,host(A)) != host(A) | -setIn(C,alive) | -elem(m_Down(B),queue(host(C))).  [back_rewrite(167),rewrite([198(9)]),flip(c)].
26.86/27.10	271 elem(A,cons(A,B)).  [resolve(141,b,136,a),rewrite([136(2)])].
26.86/27.10	310 leq(host(c3),host(A)) | host(c4) = host(A) | setIn(host(A),index(down,host(c3))).  [resolve(187,b,104,a)].
26.86/27.10	320 leq(host(c5),s(host(c3))).  [resolve(194,a,103,b)].
26.86/27.10	356 elem(m_Down(c4),queue(host(c3))).  [para(169(a,1),271(a,2))].
26.86/27.10	430 s(host(c3)) = host(c5) | leq(host(c5),host(c3)).  [resolve(320,a,61,c)].
26.86/27.10	447 -setIn(A,alive) | host(c4) != host(A) | index(status,host(c5)) != index(status,host(A)) | index(ldr,host(A)) != host(A).  [resolve(356,a,216,f),unit_del(e,183)].
26.86/27.10	467 host(c5) != host(c4).  [resolve(447,a,195,a),rewrite([196(18)]),flip(a),xx(b),xx(c)].
26.86/27.10	2173 leq(host(c3),host(A)) | host(c4) = host(A) | index(ldr,host(A)) != host(A) | index(status,host(c5)) != index(status,host(A)) | -setIn(A,alive).  [resolve(310,c,214,e),unit_del(f,183)].
26.86/27.10	3706 s(host(c3)) = host(c5) | -leq(host(c3),host(c5)).  [resolve(430,b,110,b),flip(c),unit_del(c,191)].
26.86/27.10	15302 leq(host(c3),host(c5)).  [resolve(2173,e,195,a),rewrite([196(14)]),flip(b),xx(c),xx(d),unit_del(b,467)].
26.86/27.10	15305 s(host(c3)) = host(c5).  [back_unit_del(3706),unit_del(b,15302)].
26.86/27.10	15528 $F.  [back_rewrite(194),rewrite([15305(3)]),unit_del(a,122)].
26.86/27.10	
26.86/27.10	% SZS output end Refutation
26.86/27.10	============================== end of proof ==========================
26.86/27.10	
26.86/27.10	============================== STATISTICS ============================
26.86/27.10	
26.86/27.10	Given=5171. Generated=1595639. Kept=15459. proofs=1.
26.86/27.10	Usable=4797. Sos=9159. Demods=56. Limbo=223, Disabled=1411. Hints=0.
26.86/27.10	Megabytes=26.33.
26.86/27.10	User_CPU=25.82, System_CPU=0.79, Wall_clock=26.
26.86/27.10	
26.86/27.10	============================== end of statistics =====================
26.86/27.10	
26.86/27.10	============================== end of search =========================
26.86/27.10	
26.86/27.10	THEOREM PROVED
26.86/27.10	% SZS status Theorem
26.86/27.10	
26.86/27.10	Exiting with 1 proof.
26.86/27.10	
26.86/27.10	Process 36319 exit (max_proofs) Sat Jul 14 05:40:38 2018
26.86/27.10	Prover9 interrupted
26.86/27.10	EOF