0.10/0.16	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.17	% Command    : tptp2X_and_run_prover9 %d %s
0.13/0.38	% Computer   : n020.cluster.edu
0.13/0.38	% Model      : x86_64 x86_64
0.13/0.38	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.38	% Memory     : 8042.1875MB
0.13/0.38	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.38	% CPULimit   : 960
0.13/0.38	% DateTime   : Thu Jul  2 08:33:37 EDT 2020
0.13/0.38	% CPUTime    : 
0.72/1.10	============================== Prover9 ===============================
0.72/1.10	Prover9 (32) version 2009-11A, November 2009.
0.72/1.10	Process 19258 was started by sandbox2 on n020.cluster.edu,
0.72/1.10	Thu Jul  2 08:33:37 2020
0.72/1.10	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_19072_n020.cluster.edu".
0.72/1.10	============================== end of head ===========================
0.72/1.10	
0.72/1.10	============================== INPUT =================================
0.72/1.10	
0.72/1.10	% Reading from file /tmp/Prover9_19072_n020.cluster.edu
0.72/1.10	
0.72/1.10	set(prolog_style_variables).
0.72/1.10	set(auto2).
0.72/1.10	    % set(auto2) -> set(auto).
0.72/1.10	    % set(auto) -> set(auto_inference).
0.72/1.10	    % set(auto) -> set(auto_setup).
0.72/1.10	    % set(auto_setup) -> set(predicate_elim).
0.72/1.10	    % set(auto_setup) -> assign(eq_defs, unfold).
0.72/1.10	    % set(auto) -> set(auto_limits).
0.72/1.10	    % set(auto_limits) -> assign(max_weight, "100.000").
0.72/1.10	    % set(auto_limits) -> assign(sos_limit, 20000).
0.72/1.10	    % set(auto) -> set(auto_denials).
0.72/1.10	    % set(auto) -> set(auto_process).
0.72/1.10	    % set(auto2) -> assign(new_constants, 1).
0.72/1.10	    % set(auto2) -> assign(fold_denial_max, 3).
0.72/1.10	    % set(auto2) -> assign(max_weight, "200.000").
0.72/1.10	    % set(auto2) -> assign(max_hours, 1).
0.72/1.10	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.72/1.10	    % set(auto2) -> assign(max_seconds, 0).
0.72/1.10	    % set(auto2) -> assign(max_minutes, 5).
0.72/1.10	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.72/1.10	    % set(auto2) -> set(sort_initial_sos).
0.72/1.10	    % set(auto2) -> assign(sos_limit, -1).
0.72/1.10	    % set(auto2) -> assign(lrs_ticks, 3000).
0.72/1.10	    % set(auto2) -> assign(max_megs, 400).
0.72/1.10	    % set(auto2) -> assign(stats, some).
0.72/1.10	    % set(auto2) -> clear(echo_input).
0.72/1.10	    % set(auto2) -> set(quiet).
0.72/1.10	    % set(auto2) -> clear(print_initial_clauses).
0.72/1.10	    % set(auto2) -> clear(print_given).
0.72/1.10	assign(lrs_ticks,-1).
0.72/1.10	assign(sos_limit,10000).
0.72/1.10	assign(order,kbo).
0.72/1.10	set(lex_order_vars).
0.72/1.10	clear(print_given).
0.72/1.10	
0.72/1.10	% formulas(sos).  % not echoed (67 formulas)
0.72/1.10	
0.72/1.10	============================== end of input ==========================
0.72/1.10	
0.72/1.10	% From the command line: assign(max_seconds, 960).
0.72/1.10	
0.72/1.10	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.72/1.10	
0.72/1.10	% Formulas that are not ordinary clauses:
0.72/1.10	1 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	2 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	3 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	4 (all X all Y (m_NormQ(X) != m_NormQ(Y) <-> Y != X)) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	5 (all X all Y all Z m_Ldr(Z) != m_Ack(X,Y)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	6 (all Q (q_nil = Q | cons(head(Q),tail(Q)) = Q)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	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.72/1.10	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.72/1.10	9 (all X all Y (leq(X,Y) & leq(Y,X) <-> X = Y)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	10 (all Pid all Pid2 (host(Pid2) != host(Pid) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	11 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	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.72/1.10	13 (all X all Y m_Down(X) != m_NormQ(Y)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	14 (all X all Y m_NormQ(Y) != m_Ldr(X)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	15 (all X all Y all Z m_NotNorm(Z) != m_Ack(X,Y)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	16 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	17 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	18 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	19 (all X (ordered(snoc(q_nil,X)) & ordered(cons(X,q_nil)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	20 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	21 (all X all Y m_Halt(Y) != m_Ldr(X)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	22 (all X all Y (m_Down(X) != m_Down(Y) <-> X != Y)) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	23 (all X all Y m_Ldr(Y) != m_Down(X)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	24 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	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.72/1.10	26 (all Y all Q last(snoc(Q,Y)) = Y) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	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.72/1.10	28 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	29 (all X all Y all Z m_Halt(Z) != m_Ack(X,Y)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	30 (all X all Y (Y != X <-> m_Ldr(Y) != m_Ldr(X))) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	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.72/1.10	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.72/1.10	33 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	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.72/1.10	35 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	36 (all P all Q (s(host(P)) = host(Q) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	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.72/1.10	38 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	39 (all X all Q cons(X,Q) != q_nil) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	40 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	41 (all X pidMsg(m_Halt(X)) = X) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	42 (all X all Y all Z m_Down(Z) != m_Ack(X,Y)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	43 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	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.72/1.10	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.72/1.10	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.72/1.10	47 (all X cons(X,q_nil) = snoc(q_nil,X)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	48 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	49 (all Q (Q = q_nil | Q = snoc(init(Q),last(Q)))) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	50 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.72/1.10	51 (all X all Y (m_NotNorm(X) != m_NotNorm(Y) <-> X != Y)) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.72/1.11	52 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.72/1.11	53 (all X all Y (leq(Y,X) | leq(X,Y))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.72/1.11	54 (all X all Y (m_Halt(Y) != m_Halt(X) <-> Y != X)) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.72/1.11	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.72/1.11	56 (all X all Q head(cons(X,Q)) = X) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.72/1.11	57 (all X all Y all Z m_NormQ(Z) != m_Ack(X,Y)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.72/1.11	58 -(all V all W all X all Y ((all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Pid0) != host(Z))) & (all Z all Pid0 (host(Pid0) = nbr_proc -> -elem(m_NotNorm(Z),queue(host(Pid0))))) & (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 (host(Pid0) != host(Pid20) & host(Pid0) = host(Z) & index(status,host(Pid0)) = wait & host(Pid20) = host(index(elid,host(Pid0))) & setIn(Pid0,alive) -> -elem(m_Down(Z),queue(host(Pid20))))) & (all Z all Pid30 all Pid20 all Pid0 (nbr_proc = host(Pid0) & host(Pid0) = host(Pid30) & elec_1 = index(status,host(Pid0)) & elem(m_Down(Pid20),queue(host(Pid0))) & (all V0 (leq(s(zero),V0) & -leq(host(Pid0),V0) -> setIn(V0,index(down,host(Pid0))) | host(Pid20) = V0)) -> -(elem(m_Down(Pid30),queue(host(Z))) & setIn(Z,alive)))) & queue(host(X)) = cons(m_Ack(W,Y),V) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) != host(Z) & setIn(Z,alive) & host(Z) = host(Pid30) & host(Pid0) = host(Pid20) & setIn(Pid20,alive) -> -(elem(m_Down(Pid0),queue(host(Z))) & setIn(host(Pid30),index(down,host(Pid20)))))) & (all Z all Pid30 all Pid20 all Pid0 (host(Z) != host(Pid20) & setIn(Pid20,alive) & host(Pid0) = host(Pid20) & host(Z) = host(Pid30) & 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) & setIn(Pid0,alive) & host(Pid20) = index(ldr,host(Pid0)) & index(status,host(Pid0)) = norm & host(Pid0) = host(Z) -> -elem(m_Down(Z),queue(host(Pid20))))) & (all Z all Pid0 (host(Pid0) = host(Z) & Pid0 != Z -> -setIn(Pid0,alive) | -setIn(Z,alive))) & (all Z all Pid0 (elem(m_Ldr(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) -> (setIn(X,alive) -> (index(elid,host(X)) = W & index(status,host(X)) = elec_2 & host(Y) = index(pendack,host(X)) -> (-leq(nbr_proc,index(pendack,host(X))) -> (all Z (host(Z) = s(index(pendack,host(X))) -> (host(X) = host(Z) -> (all W0 all X0 all Y0 (s(index(pendack,host(X))) != host(Y0) -> (host(X) != host(Y0) -> (nbr_proc = host(Y0) & index(status,host(Y0)) = elec_1 & host(Y0) = host(W0) & elem(m_Down(X0),queue(host(Y0))) & (all V0 (leq(s(zero),V0) & -leq(host(Y0),V0) -> host(X0) = V0 | setIn(V0,index(down,host(Y0))))) -> -(elem(m_Down(W0),snoc(V,m_Halt(X))) & setIn(Z,alive)))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.72/1.11	
0.72/1.11	============================== end of process non-clausal formulas ===
0.72/1.11	
0.72/1.11	============================== PROCESS INITIAL CLAUSES ===============
0.72/1.11	
0.72/1.11	============================== PREDICATE ELIMINATION =================
0.72/1.11	
0.72/1.11	============================== end predicate elimination =============
0.72/1.11	
0.72/1.11	Auto_denials:  (non-Horn, no changes).
0.72/1.11	
0.72/1.11	Term ordering decisions:
0.72/1.11	Function symbol KB weights:  alive=1. q_nil=1. status=1. elid=1. nbr_proc=1. zero=1. elec_1=1. down=1. elec_2=1. pendack=1. pids=1. ldr=1. norm=1. wait=1. nil=1. setEmpty=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. snoc=1. cons=1. index=1. m_Ack=1. f1=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. f2=1. f4=1.
0.72/1.11	
0.72/1.11	============================== end of process initial clauses ========
23.48/23.86	
23.48/23.86	============================== CLAUSES FOR SEARCH ====================
23.48/23.86	
23.48/23.86	============================== end of clauses for search =============
23.48/23.86	
23.48/23.86	============================== SEARCH ================================
23.48/23.86	
23.48/23.86	% Starting search at 0.02 seconds.
23.48/23.86	
23.48/23.86	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 69 (0.00 of 0.26 sec).
23.48/23.86	
23.48/23.86	Low Water (keep): wt=23.000, iters=3538
23.48/23.86	
23.48/23.86	Low Water (keep): wt=21.000, iters=3416
23.48/23.86	
23.48/23.86	Low Water (keep): wt=18.000, iters=4312
23.48/23.86	
23.48/23.86	Low Water (keep): wt=17.000, iters=4039
23.48/23.86	
23.48/23.86	Low Water (keep): wt=16.000, iters=3628
23.48/23.86	
23.48/23.86	Low Water (keep): wt=15.000, iters=3337
23.48/23.86	
23.48/23.86	Low Water (keep): wt=14.000, iters=3333
23.48/23.86	
23.48/23.86	============================== PROOF =================================
23.48/23.86	% SZS status Theorem
23.48/23.86	% SZS output start Refutation
23.48/23.86	
23.48/23.86	% Proof 1 at 22.09 (+ 0.66) seconds.
23.48/23.86	% Length of proof is 53.
23.48/23.86	% Level of proof is 11.
23.48/23.86	% Maximum clause weight is 40.000.
23.48/23.86	% Given clauses 6503.
23.48/23.86	
23.48/23.86	20 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
23.48/23.86	32 (all X all Y all Q (elem(X,snoc(Q,Y)) <-> X = Y | elem(X,Q))) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
23.48/23.86	37 (all X all Y all Q (elem(X,Q) | Y = X <-> elem(X,cons(Y,Q)))) # label(axiom_46) # label(axiom) # label(non_clause).  [assumption].
23.48/23.86	58 -(all V all W all X all Y ((all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Pid0) != host(Z))) & (all Z all Pid0 (host(Pid0) = nbr_proc -> -elem(m_NotNorm(Z),queue(host(Pid0))))) & (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 (host(Pid0) != host(Pid20) & host(Pid0) = host(Z) & index(status,host(Pid0)) = wait & host(Pid20) = host(index(elid,host(Pid0))) & setIn(Pid0,alive) -> -elem(m_Down(Z),queue(host(Pid20))))) & (all Z all Pid30 all Pid20 all Pid0 (nbr_proc = host(Pid0) & host(Pid0) = host(Pid30) & elec_1 = index(status,host(Pid0)) & elem(m_Down(Pid20),queue(host(Pid0))) & (all V0 (leq(s(zero),V0) & -leq(host(Pid0),V0) -> setIn(V0,index(down,host(Pid0))) | host(Pid20) = V0)) -> -(elem(m_Down(Pid30),queue(host(Z))) & setIn(Z,alive)))) & queue(host(X)) = cons(m_Ack(W,Y),V) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) != host(Z) & setIn(Z,alive) & host(Z) = host(Pid30) & host(Pid0) = host(Pid20) & setIn(Pid20,alive) -> -(elem(m_Down(Pid0),queue(host(Z))) & setIn(host(Pid30),index(down,host(Pid20)))))) & (all Z all Pid30 all Pid20 all Pid0 (host(Z) != host(Pid20) & setIn(Pid20,alive) & host(Pid0) = host(Pid20) & host(Z) = host(Pid30) & 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) & setIn(Pid0,alive) & host(Pid20) = index(ldr,host(Pid0)) & index(status,host(Pid0)) = norm & host(Pid0) = host(Z) -> -elem(m_Down(Z),queue(host(Pid20))))) & (all Z all Pid0 (host(Pid0) = host(Z) & Pid0 != Z -> -setIn(Pid0,alive) | -setIn(Z,alive))) & (all Z all Pid0 (elem(m_Ldr(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) -> (setIn(X,alive) -> (index(elid,host(X)) = W & index(status,host(X)) = elec_2 & host(Y) = index(pendack,host(X)) -> (-leq(nbr_proc,index(pendack,host(X))) -> (all Z (host(Z) = s(index(pendack,host(X))) -> (host(X) = host(Z) -> (all W0 all X0 all Y0 (s(index(pendack,host(X))) != host(Y0) -> (host(X) != host(Y0) -> (nbr_proc = host(Y0) & index(status,host(Y0)) = elec_1 & host(Y0) = host(W0) & elem(m_Down(X0),queue(host(Y0))) & (all V0 (leq(s(zero),V0) & -leq(host(Y0),V0) -> host(X0) = V0 | setIn(V0,index(down,host(Y0))))) -> -(elem(m_Down(W0),snoc(V,m_Halt(X))) & setIn(Z,alive)))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
23.48/23.86	92 m_Halt(A) != m_Down(B) # label(axiom_17) # label(axiom).  [clausify(20)].
23.48/23.86	111 -elem(A,snoc(B,C)) | C = A | elem(A,B) # label(axiom_47) # label(axiom).  [clausify(32)].
23.48/23.86	118 -elem(A,B) | elem(A,cons(C,B)) # label(axiom_46) # label(axiom).  [clausify(37)].
23.48/23.86	160 index(status,host(A)) != elec_2 | -setIn(A,alive) | index(elid,host(A)) = A # label(conj) # label(negated_conjecture).  [clausify(58)].
23.48/23.86	163 host(A) != nbr_proc | host(B) != host(A) | index(status,host(A)) != elec_1 | -elem(m_Down(C),queue(host(A))) | leq(s(zero),f4(D,B,C,A)) | -elem(m_Down(B),queue(host(D))) | -setIn(D,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.48/23.86	164 host(A) != nbr_proc | host(B) != host(A) | index(status,host(A)) != elec_1 | -elem(m_Down(C),queue(host(A))) | -leq(host(A),f4(D,B,C,A)) | -elem(m_Down(B),queue(host(D))) | -setIn(D,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.48/23.86	165 host(A) != nbr_proc | host(B) != host(A) | index(status,host(A)) != elec_1 | -elem(m_Down(C),queue(host(A))) | -setIn(f4(D,B,C,A),index(down,host(A))) | -elem(m_Down(B),queue(host(D))) | -setIn(D,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.48/23.86	166 host(A) != nbr_proc | host(B) != host(A) | index(status,host(A)) != elec_1 | -elem(m_Down(C),queue(host(A))) | host(C) != f4(D,B,C,A) | -elem(m_Down(B),queue(host(D))) | -setIn(D,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.48/23.86	167 host(A) != nbr_proc | host(B) != host(A) | index(status,host(A)) != elec_1 | -elem(m_Down(C),queue(host(A))) | f4(D,B,C,A) != host(C) | -elem(m_Down(B),queue(host(D))) | -setIn(D,alive).  [copy(166),flip(e)].
23.48/23.86	168 queue(host(c3)) = cons(m_Ack(c2,c4),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.48/23.86	169 cons(m_Ack(c2,c4),c1) = queue(host(c3)).  [copy(168),flip(a)].
23.48/23.86	175 setIn(c3,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.48/23.86	176 index(elid,host(c3)) = c2 # label(conj) # label(negated_conjecture).  [clausify(58)].
23.48/23.86	177 index(status,host(c3)) = elec_2 # label(conj) # label(negated_conjecture).  [clausify(58)].
23.48/23.86	186 host(c8) = nbr_proc # label(conj) # label(negated_conjecture).  [clausify(58)].
23.48/23.86	187 index(status,host(c8)) = elec_1 # label(conj) # label(negated_conjecture).  [clausify(58)].
23.48/23.86	188 index(status,nbr_proc) = elec_1.  [copy(187),rewrite([186(3)])].
23.48/23.86	189 host(c8) = host(c6) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.48/23.86	190 host(c6) = nbr_proc.  [copy(189),rewrite([186(2)]),flip(a)].
23.48/23.86	191 elem(m_Down(c7),queue(host(c8))) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.48/23.86	192 elem(m_Down(c7),queue(nbr_proc)).  [copy(191),rewrite([186(4)])].
23.48/23.86	193 -leq(s(zero),A) | leq(host(c8),A) | host(c7) = A | setIn(A,index(down,host(c8))) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.48/23.86	194 -leq(s(zero),A) | leq(nbr_proc,A) | host(c7) = A | setIn(A,index(down,nbr_proc)).  [copy(193),rewrite([186(5),186(11)])].
23.48/23.86	195 elem(m_Down(c6),snoc(c1,m_Halt(c3))) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.48/23.86	291 host(A) != nbr_proc | host(B) != host(A) | index(status,host(A)) != elec_1 | -elem(m_Down(C),queue(host(A))) | f4(c3,B,C,A) != host(C) | -elem(m_Down(B),queue(host(c3))).  [resolve(175,a,167,g)].
23.48/23.86	292 host(A) != nbr_proc | host(B) != host(A) | index(status,host(A)) != elec_1 | -elem(m_Down(C),queue(host(A))) | -leq(host(A),f4(c3,B,C,A)) | -elem(m_Down(B),queue(host(c3))).  [resolve(175,a,164,g)].
23.48/23.86	293 host(A) != nbr_proc | host(B) != host(A) | index(status,host(A)) != elec_1 | -elem(m_Down(C),queue(host(A))) | leq(s(zero),f4(c3,B,C,A)) | -elem(m_Down(B),queue(host(c3))).  [resolve(175,a,163,g)].
23.48/23.86	294 c3 = c2.  [resolve(175,a,160,b),rewrite([177(4),176(7)]),flip(b),xx(a)].
23.48/23.86	298 host(A) != nbr_proc | host(B) != host(A) | index(status,host(A)) != elec_1 | -elem(m_Down(C),queue(host(A))) | leq(s(zero),f4(c2,B,C,A)) | -elem(m_Down(B),queue(host(c2))).  [back_rewrite(293),rewrite([294(18),294(22)])].
23.48/23.86	299 host(A) != nbr_proc | host(B) != host(A) | index(status,host(A)) != elec_1 | -elem(m_Down(C),queue(host(A))) | -leq(host(A),f4(c2,B,C,A)) | -elem(m_Down(B),queue(host(c2))).  [back_rewrite(292),rewrite([294(17),294(21)])].
23.48/23.86	300 host(A) != nbr_proc | host(B) != host(A) | index(status,host(A)) != elec_1 | -elem(m_Down(C),queue(host(A))) | f4(c2,B,C,A) != host(C) | -elem(m_Down(B),queue(host(c2))).  [back_rewrite(291),rewrite([294(16),294(21)])].
23.48/23.86	312 elem(m_Down(c6),snoc(c1,m_Halt(c2))).  [back_rewrite(195),rewrite([294(4)])].
23.48/23.86	317 setIn(c2,alive).  [back_rewrite(175),rewrite([294(1)])].
23.48/23.86	318 cons(m_Ack(c2,c4),c1) = queue(host(c2)).  [back_rewrite(169),rewrite([294(6)])].
23.48/23.86	325 host(A) != nbr_proc | -elem(m_Down(B),queue(nbr_proc)) | -setIn(f4(C,A,B,c8),index(down,nbr_proc)) | -elem(m_Down(A),queue(host(C))) | -setIn(C,alive).  [para(186(a,1),165(e,2,2)),rewrite([186(2),186(6),186(9),188(9),186(12)]),xx(a),xx(c)].
23.48/23.86	380 host(A) != nbr_proc | -elem(m_Down(B),queue(nbr_proc)) | -leq(nbr_proc,f4(c2,A,B,c8)) | -elem(m_Down(A),queue(host(c2))).  [para(186(a,1),299(d,2,1)),rewrite([186(2),186(6),186(9),188(9),186(15)]),xx(a),xx(c)].
23.48/23.86	406 host(A) != nbr_proc | -leq(nbr_proc,f4(c2,A,c7,c8)) | -elem(m_Down(A),queue(host(c2))).  [resolve(380,b,192,a)].
23.48/23.86	433 host(A) != nbr_proc | -elem(m_Down(B),queue(nbr_proc)) | f4(c2,A,B,c8) != host(B) | -elem(m_Down(A),queue(host(c2))).  [para(186(a,1),300(d,2,1)),rewrite([186(2),186(6),186(9),188(9)]),xx(a),xx(c)].
23.48/23.86	435 host(A) != nbr_proc | f4(c2,A,c7,c8) != host(c7) | -elem(m_Down(A),queue(host(c2))).  [resolve(433,b,192,a)].
23.48/23.86	631 elem(m_Down(c6),c1).  [resolve(312,a,111,a),unit_del(a,92)].
23.48/23.86	635 elem(m_Down(c6),cons(A,c1)).  [resolve(631,a,118,a)].
23.48/23.86	1400 elem(m_Down(c6),queue(host(c2))).  [para(318(a,1),635(a,2))].
23.48/23.86	1410 f4(c2,c6,c7,c8) != host(c7).  [resolve(1400,a,435,c),rewrite([190(2)]),xx(a)].
23.48/23.86	1414 -leq(nbr_proc,f4(c2,c6,c7,c8)).  [resolve(1400,a,406,c),rewrite([190(2)]),xx(a)].
23.48/23.86	1829 host(A) != nbr_proc | index(status,host(A)) != elec_1 | -elem(m_Down(B),queue(host(A))) | leq(s(zero),f4(c2,c6,B,A)).  [resolve(298,f,1400,a),rewrite([190(5)]),flip(b),merge(b)].
23.48/23.86	15558 -elem(m_Down(A),queue(nbr_proc)) | leq(s(zero),f4(c2,c6,A,c8)).  [para(186(a,1),1829(c,2,1)),rewrite([186(2),186(6),188(6)]),xx(a),xx(b)].
23.48/23.86	15560 leq(s(zero),f4(c2,c6,c7,c8)).  [resolve(15558,a,192,a)].
23.48/23.86	15589 setIn(f4(c2,c6,c7,c8),index(down,nbr_proc)).  [resolve(15560,a,194,a),flip(b),unit_del(a,1414),unit_del(b,1410)].
23.48/23.86	15635 $F.  [resolve(15589,a,325,c),rewrite([190(2)]),xx(a),unit_del(a,192),unit_del(b,1400),unit_del(c,317)].
23.48/23.86	
23.48/23.86	% SZS output end Refutation
23.48/23.86	============================== end of proof ==========================
23.48/23.86	
23.48/23.86	============================== STATISTICS ============================
23.48/23.86	
23.48/23.86	Given=6503. Generated=1029001. Kept=15563. proofs=1.
23.48/23.86	Usable=4639. Sos=8258. Demods=34. Limbo=0, Disabled=2793. Hints=0.
23.48/23.86	Megabytes=28.98.
23.48/23.86	User_CPU=22.10, System_CPU=0.66, Wall_clock=23.
23.48/23.86	
23.48/23.86	============================== end of statistics =====================
23.48/23.86	
23.48/23.86	============================== end of search =========================
23.48/23.86	
23.48/23.86	THEOREM PROVED
23.48/23.86	% SZS status Theorem
23.48/23.86	
23.48/23.86	Exiting with 1 proof.
23.48/23.86	
23.48/23.86	Process 19258 exit (max_proofs) Thu Jul  2 08:34:00 2020
23.48/23.86	Prover9 interrupted
23.48/23.86	EOF