0.12/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer   : n012.cluster.edu
0.13/0.34	% Model      : x86_64 x86_64
0.13/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory     : 8042.1875MB
0.13/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 180
0.13/0.34	% DateTime   : Thu Aug 29 11:53:42 EDT 2019
0.13/0.34	% CPUTime    : 
0.79/1.08	============================== Prover9 ===============================
0.79/1.08	Prover9 (32) version 2009-11A, November 2009.
0.79/1.08	Process 1035 was started by sandbox2 on n012.cluster.edu,
0.79/1.08	Thu Aug 29 11:53:42 2019
0.79/1.08	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 180 -f /tmp/Prover9_659_n012.cluster.edu".
0.79/1.08	============================== end of head ===========================
0.79/1.08	
0.79/1.08	============================== INPUT =================================
0.79/1.08	
0.79/1.08	% Reading from file /tmp/Prover9_659_n012.cluster.edu
0.79/1.08	
0.79/1.08	set(prolog_style_variables).
0.79/1.08	set(auto2).
0.79/1.08	    % set(auto2) -> set(auto).
0.79/1.08	    % set(auto) -> set(auto_inference).
0.79/1.08	    % set(auto) -> set(auto_setup).
0.79/1.08	    % set(auto_setup) -> set(predicate_elim).
0.79/1.08	    % set(auto_setup) -> assign(eq_defs, unfold).
0.79/1.08	    % set(auto) -> set(auto_limits).
0.79/1.08	    % set(auto_limits) -> assign(max_weight, "100.000").
0.79/1.08	    % set(auto_limits) -> assign(sos_limit, 20000).
0.79/1.08	    % set(auto) -> set(auto_denials).
0.79/1.08	    % set(auto) -> set(auto_process).
0.79/1.08	    % set(auto2) -> assign(new_constants, 1).
0.79/1.08	    % set(auto2) -> assign(fold_denial_max, 3).
0.79/1.08	    % set(auto2) -> assign(max_weight, "200.000").
0.79/1.08	    % set(auto2) -> assign(max_hours, 1).
0.79/1.08	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.79/1.08	    % set(auto2) -> assign(max_seconds, 0).
0.79/1.08	    % set(auto2) -> assign(max_minutes, 5).
0.79/1.08	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.79/1.08	    % set(auto2) -> set(sort_initial_sos).
0.79/1.08	    % set(auto2) -> assign(sos_limit, -1).
0.79/1.08	    % set(auto2) -> assign(lrs_ticks, 3000).
0.79/1.08	    % set(auto2) -> assign(max_megs, 400).
0.79/1.08	    % set(auto2) -> assign(stats, some).
0.79/1.08	    % set(auto2) -> clear(echo_input).
0.79/1.08	    % set(auto2) -> set(quiet).
0.79/1.08	    % set(auto2) -> clear(print_initial_clauses).
0.79/1.08	    % set(auto2) -> clear(print_given).
0.79/1.08	assign(lrs_ticks,-1).
0.79/1.08	assign(sos_limit,10000).
0.79/1.08	assign(order,kbo).
0.79/1.08	set(lex_order_vars).
0.79/1.08	clear(print_given).
0.79/1.08	
0.79/1.08	% formulas(sos).  % not echoed (67 formulas)
0.79/1.08	
0.79/1.08	============================== end of input ==========================
0.79/1.08	
0.79/1.08	% From the command line: assign(max_seconds, 180).
0.79/1.08	
0.79/1.08	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.79/1.08	
0.79/1.08	% Formulas that are not ordinary clauses:
0.79/1.08	1 (all X all Y (Y != X <-> m_NotNorm(Y) != m_NotNorm(X))) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	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.79/1.08	3 (all X all Y (Y != X <-> m_Ldr(Y) != m_Ldr(X))) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	4 (all X all Y (m_Down(Y) != m_Down(X) <-> X != Y)) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	5 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid2 != Pid)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	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.79/1.08	7 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	8 (all X all Y (Y != X <-> m_NormQ(X) != m_NormQ(Y))) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	9 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	10 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	11 (all X all Y all Z m_Ack(X,Y) != m_Halt(Z)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	12 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	13 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	14 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	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.79/1.08	16 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	17 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	18 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	19 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	20 (all X all Y (leq(Y,X) | leq(X,Y))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	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.79/1.08	22 (all X X = pidMsg(m_Down(X))) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	23 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	24 (all Q (Q = cons(head(Q),tail(Q)) | q_nil = Q)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	25 (all X all Y all Z m_NotNorm(Z) != m_Ack(X,Y)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	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.79/1.08	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.79/1.08	28 (all P all Q (s(host(P)) = host(Q) -> host(Q) != host(P))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	29 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	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.79/1.08	31 (all X all Q Q = tail(cons(X,Q))) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	32 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	33 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	34 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	35 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	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.79/1.08	37 (all Q (q_nil = Q | Q = snoc(init(Q),last(Q)))) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	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.79/1.08	39 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	40 (all X all Q head(cons(X,Q)) = X) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	41 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	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.79/1.08	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.79/1.08	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.79/1.08	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.79/1.08	46 (all X all Y m_Down(X) != m_NormQ(Y)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	47 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	48 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	49 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	50 (all X X = pidMsg(m_Halt(X))) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	51 (all X all Y m_Halt(Y) != m_Down(X)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	52 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	53 (all Y all Q last(snoc(Q,Y)) = Y) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	54 (all X all Y all Z m_Ack(X,Y) != m_Down(Z)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	55 (all X (ordered(snoc(q_nil,X)) & ordered(cons(X,q_nil)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	56 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	57 (all X all Y (m_Halt(Y) != m_Halt(X) <-> X != Y)) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	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 Pid0 (setIn(Z,alive) & norm = index(status,host(Pid0)) & host(Pid0) = index(ldr,host(Pid0)) & index(status,host(Z)) = norm & host(Z) = index(ldr,host(Z)) & setIn(Pid0,alive) -> Z = Pid0)) & (all Z all Pid20 all Pid0 (host(Pid20) = host(Z) & elem(m_Down(Pid20),queue(host(Pid0))) & setIn(Pid0,alive) & -leq(host(Pid20),host(Pid0)) -> -(setIn(Z,alive) & index(ldr,host(Z)) = host(Z) & norm = index(status,host(Z))))) & (all Z all Pid20 all Pid0 (host(Pid0) != host(Pid20) & setIn(Pid0,alive) & elem(m_Down(Z),queue(host(Pid0))) & host(Z) = host(Pid20) & host(Pid20) = index(ldr,host(Pid0)) & norm = index(status,host(Pid0)) -> -(setIn(Pid20,alive) & norm = index(status,host(Pid20)) & index(ldr,host(Pid20)) = host(Pid20)))) & (all Z all Pid20 all Pid0 (host(Pid20) != host(Pid0) & setIn(Pid0,alive) & host(index(elid,host(Pid0))) = host(Pid20) & wait = index(status,host(Pid0)) & host(Pid20) = host(Z) & elem(m_Down(Z),queue(host(Pid0))) -> -(setIn(Pid20,alive) & host(Pid20) = index(ldr,host(Pid20)) & index(status,host(Pid20)) = norm))) & (all Z all Pid30 all Pid20 all Pid0 ((all V0 (leq(s(zero),V0) & -leq(host(Pid0),V0) -> host(Pid20) = V0 | setIn(V0,index(down,host(Pid0))))) & elem(m_Down(Pid20),queue(host(Pid0))) & index(status,host(Pid0)) = elec_1 & index(status,host(Z)) = elec_2 & host(Pid30) = host(Pid0) & leq(host(Z),host(Pid0)) & setIn(Z,alive) -> -elem(m_Ack(Z,Pid30),queue(host(Z))))) & (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))))) & elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid30) = s(host(Pid0)) & index(status,host(Pid0)) = elec_1 & elem(m_Down(Pid30),queue(host(Pid0))) & leq(nbr_proc,s(host(Pid0))) & setIn(Pid0,alive) -> -(setIn(Z,alive) & index(ldr,host(Z)) = host(Z) & norm = index(status,host(Z))))) & cons(m_Ack(W,Y),V) = queue(host(X)) & (all Z all Pid30 all Pid20 all Pid0 (setIn(Z,alive) & setIn(Pid20,alive) & host(Pid20) = host(Pid0) & host(Z) = host(Pid30) & host(Z) != host(Pid20) -> -(setIn(host(Pid30),index(down,host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) != host(Z) & host(Pid0) = host(Pid20) & host(Z) = host(Pid30) & setIn(Pid20,alive) & setIn(Z,alive) -> -(elem(m_Down(Pid30),queue(host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & (all Z all Pid20 all Pid0 (host(Pid0) = host(Pid20) & host(Pid0) = index(ldr,host(Pid0)) & index(status,host(Pid0)) = norm & setIn(Pid0,alive) -> -(setIn(Z,alive) & elem(m_Down(Pid20),queue(host(Z)))))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & host(Pid0) = host(Pid20) & elec_2 = index(status,host(Pid0)) & elem(m_Down(Pid20),queue(host(Z))) & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid0 (setIn(Pid0,alive) & norm = index(status,host(Pid0)) & index(ldr,host(Pid0)) = host(Pid0) -> -(setIn(host(Pid0),index(down,host(Z))) & setIn(Z,alive)))) & (all Z all Pid0 (setIn(Pid0,alive) & setIn(host(Pid0),index(down,host(Z))) & index(status,host(Pid0)) = elec_2 & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z (setIn(Z,alive) & (index(status,host(Z)) = elec_2 | index(status,host(Z)) = elec_1) -> index(elid,host(Z)) = Z)) & (all Z all Pid0 (Pid0 != Z & host(Pid0) = host(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) -> (index(pendack,host(X)) = host(Y) & elec_2 = index(status,host(X)) & 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(Y0) != host(Z) -> (host(X) != host(Y0) -> (setIn(Y0,alive) & leq(nbr_proc,s(host(Y0))) & elec_1 = index(status,host(Y0)) & host(W0) = s(host(Y0)) & elem(m_Down(X0),queue(host(Y0))) & elem(m_Down(W0),queue(host(Y0))) & (all V1 (leq(s(zero),V1) & -leq(host(Y0),V1) -> host(X0) = V1 | setIn(V1,index(down,host(Y0))))) -> -(host(X) = host(V0) & setIn(V0,alive))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
52.51/52.81	
52.51/52.81	============================== end of process non-clausal formulas ===
52.51/52.81	
52.51/52.81	============================== PROCESS INITIAL CLAUSES ===============
52.51/52.81	
52.51/52.81	============================== PREDICATE ELIMINATION =================
52.51/52.81	
52.51/52.81	============================== end predicate elimination =============
52.51/52.81	
52.51/52.81	Auto_denials:  (non-Horn, no changes).
52.51/52.81	
52.51/52.81	Term ordering decisions:
52.51/52.81	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. f2=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. f1=1. f4=1. f5=1.
52.51/52.81	
52.51/52.81	============================== end of process initial clauses ========
52.51/52.81	
52.51/52.81	============================== CLAUSES FOR SEARCH ====================
52.51/52.81	
52.51/52.81	============================== end of clauses for search =============
52.51/52.81	
52.51/52.81	============================== SEARCH ================================
52.51/52.81	
52.51/52.81	% Starting search at 0.05 seconds.
52.51/52.81	
52.51/52.81	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 109 (0.00 of 0.36 sec).
52.51/52.81	
52.51/52.81	Low Water (keep): wt=29.000, iters=3334
52.51/52.81	
52.51/52.81	Low Water (keep): wt=28.000, iters=3391
52.51/52.81	
52.51/52.81	Low Water (keep): wt=25.000, iters=3355
52.51/52.81	
52.51/52.81	Low Water (keep): wt=24.000, iters=3336
52.51/52.81	
52.51/52.81	Low Water (keep): wt=23.000, iters=3360
52.51/52.81	
52.51/52.81	Low Water (keep): wt=16.000, iters=4241
52.51/52.81	
52.51/52.81	Low Water (keep): wt=15.000, iters=3349
52.51/52.81	
52.51/52.81	Low Water (displace): id=13222, wt=14.000
52.51/52.81	
52.51/52.81	Low Water (displace): id=13250, wt=13.000
52.51/52.81	
52.51/52.81	============================== PROOF =================================
52.51/52.81	% SZS status Theorem
52.51/52.81	% SZS output start Refutation
52.51/52.81	
52.51/52.81	% Proof 1 at 50.05 (+ 1.70) seconds.
52.51/52.81	% Length of proof is 73.
52.51/52.81	% Level of proof is 12.
52.51/52.81	% Maximum clause weight is 34.000.
52.51/52.81	% Given clauses 10692.
52.51/52.81	
52.51/52.81	13 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
52.51/52.81	20 (all X all Y (leq(Y,X) | leq(X,Y))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
52.51/52.81	27 (all X all Y (X = s(Y) | leq(X,Y) <-> leq(X,s(Y)))) # label(axiom_64) # label(axiom) # label(non_clause).  [assumption].
52.51/52.81	47 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
52.51/52.81	48 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
52.51/52.81	52 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
52.51/52.81	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 Pid0 (setIn(Z,alive) & norm = index(status,host(Pid0)) & host(Pid0) = index(ldr,host(Pid0)) & index(status,host(Z)) = norm & host(Z) = index(ldr,host(Z)) & setIn(Pid0,alive) -> Z = Pid0)) & (all Z all Pid20 all Pid0 (host(Pid20) = host(Z) & elem(m_Down(Pid20),queue(host(Pid0))) & setIn(Pid0,alive) & -leq(host(Pid20),host(Pid0)) -> -(setIn(Z,alive) & index(ldr,host(Z)) = host(Z) & norm = index(status,host(Z))))) & (all Z all Pid20 all Pid0 (host(Pid0) != host(Pid20) & setIn(Pid0,alive) & elem(m_Down(Z),queue(host(Pid0))) & host(Z) = host(Pid20) & host(Pid20) = index(ldr,host(Pid0)) & norm = index(status,host(Pid0)) -> -(setIn(Pid20,alive) & norm = index(status,host(Pid20)) & index(ldr,host(Pid20)) = host(Pid20)))) & (all Z all Pid20 all Pid0 (host(Pid20) != host(Pid0) & setIn(Pid0,alive) & host(index(elid,host(Pid0))) = host(Pid20) & wait = index(status,host(Pid0)) & host(Pid20) = host(Z) & elem(m_Down(Z),queue(host(Pid0))) -> -(setIn(Pid20,alive) & host(Pid20) = index(ldr,host(Pid20)) & index(status,host(Pid20)) = norm))) & (all Z all Pid30 all Pid20 all Pid0 ((all V0 (leq(s(zero),V0) & -leq(host(Pid0),V0) -> host(Pid20) = V0 | setIn(V0,index(down,host(Pid0))))) & elem(m_Down(Pid20),queue(host(Pid0))) & index(status,host(Pid0)) = elec_1 & index(status,host(Z)) = elec_2 & host(Pid30) = host(Pid0) & leq(host(Z),host(Pid0)) & setIn(Z,alive) -> -elem(m_Ack(Z,Pid30),queue(host(Z))))) & (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))))) & elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid30) = s(host(Pid0)) & index(status,host(Pid0)) = elec_1 & elem(m_Down(Pid30),queue(host(Pid0))) & leq(nbr_proc,s(host(Pid0))) & setIn(Pid0,alive) -> -(setIn(Z,alive) & index(ldr,host(Z)) = host(Z) & norm = index(status,host(Z))))) & cons(m_Ack(W,Y),V) = queue(host(X)) & (all Z all Pid30 all Pid20 all Pid0 (setIn(Z,alive) & setIn(Pid20,alive) & host(Pid20) = host(Pid0) & host(Z) = host(Pid30) & host(Z) != host(Pid20) -> -(setIn(host(Pid30),index(down,host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) != host(Z) & host(Pid0) = host(Pid20) & host(Z) = host(Pid30) & setIn(Pid20,alive) & setIn(Z,alive) -> -(elem(m_Down(Pid30),queue(host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & (all Z all Pid20 all Pid0 (host(Pid0) = host(Pid20) & host(Pid0) = index(ldr,host(Pid0)) & index(status,host(Pid0)) = norm & setIn(Pid0,alive) -> -(setIn(Z,alive) & elem(m_Down(Pid20),queue(host(Z)))))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & host(Pid0) = host(Pid20) & elec_2 = index(status,host(Pid0)) & elem(m_Down(Pid20),queue(host(Z))) & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid0 (setIn(Pid0,alive) & norm = index(status,host(Pid0)) & index(ldr,host(Pid0)) = host(Pid0) -> -(setIn(host(Pid0),index(down,host(Z))) & setIn(Z,alive)))) & (all Z all Pid0 (setIn(Pid0,alive) & setIn(host(Pid0),index(down,host(Z))) & index(status,host(Pid0)) = elec_2 & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z (setIn(Z,alive) & (index(status,host(Z)) = elec_2 | index(status,host(Z)) = elec_1) -> index(elid,host(Z)) = Z)) & (all Z all Pid0 (Pid0 != Z & host(Pid0) = host(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) -> (index(pendack,host(X)) = host(Y) & elec_2 = index(status,host(X)) & 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(Y0) != host(Z) -> (host(X) != host(Y0) -> (setIn(Y0,alive) & leq(nbr_proc,s(host(Y0))) & elec_1 = index(status,host(Y0)) & host(W0) = s(host(Y0)) & elem(m_Down(X0),queue(host(Y0))) & elem(m_Down(W0),queue(host(Y0))) & (all V1 (leq(s(zero),V1) & -leq(host(Y0),V1) -> host(X0) = V1 | setIn(V1,index(down,host(Y0))))) -> -(host(X) = host(V0) & setIn(V0,alive))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
52.51/52.81	77 -leq(A,B) | -leq(B,A) | A = B # label(axiom_61) # label(axiom).  [clausify(13)].
52.51/52.81	88 leq(A,B) | leq(B,A) # label(axiom_60) # label(axiom).  [clausify(20)].
52.51/52.81	104 s(A) = B | leq(B,A) | -leq(B,s(A)) # label(axiom_64) # label(axiom).  [clausify(27)].
52.51/52.81	109 leq(s(zero),nbr_proc) # label(axiom_03) # label(axiom).  [assumption].
52.51/52.81	139 -leq(s(A),A) # label(axiom_58) # label(axiom).  [clausify(47)].
52.51/52.81	140 leq(s(zero),host(A)) # label(axiom_02) # label(axiom).  [clausify(48)].
52.51/52.81	150 leq(host(A),nbr_proc) # label(axiom_04) # label(axiom).  [clausify(52)].
52.51/52.81	178 -setIn(A,alive) | host(B) != host(A) | index(status,host(A)) != elec_2 | -elem(m_Down(B),queue(host(C))) | -setIn(C,alive) | leq(index(pendack,host(A)),host(C)) # label(conj) # label(negated_conjecture).  [clausify(58)].
52.51/52.81	180 -setIn(A,alive) | -setIn(host(A),index(down,host(B))) | index(status,host(A)) != elec_2 | -setIn(B,alive) | leq(index(pendack,host(A)),host(B)) # label(conj) # label(negated_conjecture).  [clausify(58)].
52.51/52.81	181 -setIn(A,alive) | index(status,host(A)) != elec_2 | index(elid,host(A)) = A # label(conj) # label(negated_conjecture).  [clausify(58)].
52.51/52.81	185 setIn(c3,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
52.51/52.81	186 index(pendack,host(c3)) = host(c4) # label(conj) # label(negated_conjecture).  [clausify(58)].
52.51/52.81	187 index(status,host(c3)) = elec_2 # label(conj) # label(negated_conjecture).  [clausify(58)].
52.51/52.81	188 elec_2 = index(status,host(c3)).  [copy(187),flip(a)].
52.51/52.81	189 index(elid,host(c3)) = c2 # label(conj) # label(negated_conjecture).  [clausify(58)].
52.51/52.81	190 leq(nbr_proc,index(pendack,host(c3))) # label(conj) # label(negated_conjecture).  [clausify(58)].
52.51/52.81	191 leq(nbr_proc,host(c4)).  [copy(190),rewrite([186(5)])].
52.51/52.81	193 host(c6) = host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
52.51/52.81	195 host(c9) != host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
52.51/52.81	196 setIn(c9,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
52.51/52.81	197 leq(nbr_proc,s(host(c9))) # label(conj) # label(negated_conjecture).  [clausify(58)].
52.51/52.81	200 s(host(c9)) = host(c7) # label(conj) # label(negated_conjecture).  [clausify(58)].
52.51/52.81	201 elem(m_Down(c8),queue(host(c9))) # label(conj) # label(negated_conjecture).  [clausify(58)].
52.51/52.81	202 elem(m_Down(c7),queue(host(c9))) # label(conj) # label(negated_conjecture).  [clausify(58)].
52.51/52.81	203 -leq(s(zero),A) | leq(host(c9),A) | host(c8) = A | setIn(A,index(down,host(c9))) # label(conj) # label(negated_conjecture).  [clausify(58)].
52.51/52.81	204 setIn(c6,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
52.51/52.81	216 -setIn(A,alive) | index(status,host(c3)) != index(status,host(A)) | index(elid,host(A)) = A.  [back_rewrite(181),rewrite([188(6)]),flip(b)].
52.51/52.81	217 -setIn(A,alive) | -setIn(host(A),index(down,host(B))) | index(status,host(c3)) != index(status,host(A)) | -setIn(B,alive) | leq(index(pendack,host(A)),host(B)).  [back_rewrite(180),rewrite([188(11)]),flip(c)].
52.51/52.81	218 -setIn(A,alive) | host(B) != host(A) | index(status,host(c3)) != index(status,host(A)) | -elem(m_Down(B),queue(host(C))) | -setIn(C,alive) | leq(index(pendack,host(A)),host(C)).  [back_rewrite(178),rewrite([188(9)]),flip(c)].
52.51/52.81	233 leq(nbr_proc,host(c7)).  [back_rewrite(197),rewrite([200(4)])].
52.51/52.81	260 s(A) = B | leq(B,A) | leq(s(A),B).  [resolve(104,c,88,b)].
52.51/52.81	262 -leq(nbr_proc,s(zero)) | s(zero) = nbr_proc.  [resolve(109,a,77,b),flip(b)].
52.51/52.81	297 -leq(host(A),s(zero)) | s(zero) = host(A).  [resolve(140,a,77,b),flip(b)].
52.51/52.81	330 host(c4) = nbr_proc.  [resolve(191,a,77,b),unit_del(a,150)].
52.51/52.81	332 index(pendack,host(c3)) = nbr_proc.  [back_rewrite(186),rewrite([330(6)])].
52.51/52.81	344 host(c7) = A | leq(A,host(c9)) | -leq(A,host(c7)).  [para(200(a,1),104(c,2)),rewrite([200(3)])].
52.51/52.81	348 -leq(host(c7),host(c9)).  [para(200(a,1),139(a,1))].
52.51/52.81	367 leq(host(c9),host(A)) | host(c8) = host(A) | setIn(host(A),index(down,host(c9))).  [resolve(203,a,140,a)].
52.51/52.81	368 leq(host(c9),A) | host(c8) = A | setIn(A,index(down,host(c9))) | leq(A,s(zero)).  [resolve(203,a,88,b)].
52.51/52.81	379 c6 = c2.  [resolve(216,a,204,a),rewrite([193(7),193(12),189(13)]),flip(b),xx(a)].
52.51/52.81	380 c3 = c2.  [resolve(216,a,185,a),rewrite([189(13)]),flip(b),xx(a)].
52.51/52.81	382 setIn(c2,alive).  [back_rewrite(204),rewrite([379(1)])].
52.51/52.81	391 index(pendack,host(c2)) = nbr_proc.  [back_rewrite(332),rewrite([380(2)])].
52.51/52.81	406 -setIn(A,alive) | host(B) != host(A) | index(status,host(c2)) != index(status,host(A)) | -elem(m_Down(B),queue(host(C))) | -setIn(C,alive) | leq(index(pendack,host(A)),host(C)).  [back_rewrite(218),rewrite([380(7)])].
52.51/52.81	407 -setIn(A,alive) | -setIn(host(A),index(down,host(B))) | index(status,host(c2)) != index(status,host(A)) | -setIn(B,alive) | leq(index(pendack,host(A)),host(B)).  [back_rewrite(217),rewrite([380(9)])].
52.51/52.81	410 host(c9) != host(c2).  [back_rewrite(195),rewrite([380(3)])].
52.51/52.81	435 host(c7) = nbr_proc.  [resolve(233,a,77,b),unit_del(a,150)].
52.51/52.81	459 -leq(nbr_proc,host(c9)).  [back_rewrite(348),rewrite([435(2)])].
52.51/52.81	463 nbr_proc = A | leq(A,host(c9)) | -leq(A,nbr_proc).  [back_rewrite(344),rewrite([435(2),435(7)])].
52.51/52.81	465 s(host(c9)) = nbr_proc.  [back_rewrite(200),rewrite([435(5)])].
52.51/52.81	1082 nbr_proc = A | leq(A,host(c9)) | leq(nbr_proc,A).  [para(465(a,1),260(c,1)),rewrite([465(3)])].
52.51/52.81	2613 host(A) = nbr_proc | leq(host(A),host(c9)).  [resolve(463,c,150,a),flip(a)].
52.51/52.81	2618 host(A) = nbr_proc | -leq(host(c9),host(A)) | host(c9) = host(A).  [resolve(2613,b,77,b)].
52.51/52.81	3029 nbr_proc = A | leq(nbr_proc,A) | -leq(host(c9),A) | host(c9) = A.  [resolve(1082,b,77,b)].
52.51/52.81	3277 -setIn(A,alive) | host(A) != nbr_proc | index(status,host(c2)) != index(status,host(A)) | leq(index(pendack,host(A)),host(c9)).  [resolve(406,d,202,a),rewrite([435(4)]),flip(b),unit_del(d,196)].
52.51/52.81	3278 -setIn(A,alive) | host(c8) != host(A) | index(status,host(c2)) != index(status,host(A)) | leq(index(pendack,host(A)),host(c9)).  [resolve(406,d,201,a),unit_del(d,196)].
52.51/52.81	3363 -setIn(A,alive) | index(status,host(c2)) != index(status,host(A)) | leq(index(pendack,host(A)),host(c9)) | leq(host(c9),host(A)) | host(c8) = host(A) | leq(host(A),s(zero)).  [resolve(407,b,368,c),unit_del(c,196)].
52.51/52.81	3364 -setIn(A,alive) | index(status,host(c2)) != index(status,host(A)) | leq(index(pendack,host(A)),host(c9)) | leq(host(c9),host(A)) | host(c8) = host(A).  [resolve(407,b,367,c),unit_del(c,196)].
52.51/52.81	36610 host(c2) != nbr_proc.  [resolve(3277,a,382,a),rewrite([391(17)]),xx(b),unit_del(b,459)].
52.51/52.81	36613 host(c8) != host(c2).  [resolve(3278,a,382,a),rewrite([391(18)]),xx(b),unit_del(b,459)].
52.51/52.81	38495 leq(host(c9),host(c2)) | leq(host(c2),s(zero)).  [resolve(3363,a,382,a),rewrite([391(13)]),xx(a),unit_del(a,459),unit_del(c,36613)].
52.51/52.81	38556 leq(host(c2),s(zero)).  [resolve(38495,a,2618,b),unit_del(b,36610),unit_del(c,410)].
52.51/52.81	38645 s(zero) = host(c2).  [resolve(38556,a,297,a)].
52.51/52.81	39097 -leq(nbr_proc,host(c2)).  [back_rewrite(262),rewrite([38645(3),38645(6)]),unit_del(b,36610)].
52.51/52.81	39196 leq(host(c9),host(c2)).  [resolve(3364,a,382,a),rewrite([391(13)]),xx(a),unit_del(a,459),unit_del(c,36613)].
52.51/52.81	39236 $F.  [resolve(39196,a,3029,c),flip(a),unit_del(a,36610),unit_del(b,39097),unit_del(c,410)].
52.51/52.81	
52.51/52.81	% SZS output end Refutation
52.51/52.81	============================== end of proof ==========================
52.51/52.81	
52.51/52.81	============================== STATISTICS ============================
52.51/52.81	
52.51/52.81	Given=10692. Generated=3239107. Kept=39166. proofs=1.
52.51/52.81	Usable=9367. Sos=8919. Demods=73. Limbo=39, Disabled=20978. Hints=0.
52.51/52.81	Megabytes=66.01.
52.51/52.81	User_CPU=50.05, System_CPU=1.70, Wall_clock=52.
52.51/52.81	
52.51/52.81	============================== end of statistics =====================
52.51/52.81	
52.51/52.81	============================== end of search =========================
52.51/52.81	
52.51/52.81	THEOREM PROVED
52.51/52.81	% SZS status Theorem
52.51/52.81	
52.51/52.81	Exiting with 1 proof.
52.51/52.81	
52.51/52.81	Process 1035 exit (max_proofs) Thu Aug 29 11:54:34 2019
52.51/52.81	Prover9 interrupted
52.51/52.81	EOF