0.11/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.12	% Command  : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer : n004.cluster.edu
0.12/0.33	% Model    : x86_64 x86_64
0.12/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory   : 8042.1875MB
0.12/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit : 1440
0.12/0.33	% WCLimit  : 180
0.12/0.33	% DateTime : Mon Jul  3 06:39:00 EDT 2023
0.12/0.33	% CPUTime  : 
0.72/1.02	============================== Prover9 ===============================
0.72/1.02	Prover9 (32) version 2009-11A, November 2009.
0.72/1.02	Process 10810 was started by sandbox on n004.cluster.edu,
0.72/1.02	Mon Jul  3 06:39:01 2023
0.72/1.02	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_10657_n004.cluster.edu".
0.72/1.02	============================== end of head ===========================
0.72/1.02	
0.72/1.02	============================== INPUT =================================
0.72/1.02	
0.72/1.02	% Reading from file /tmp/Prover9_10657_n004.cluster.edu
0.72/1.02	
0.72/1.02	set(prolog_style_variables).
0.72/1.02	set(auto2).
0.72/1.02	    % set(auto2) -> set(auto).
0.72/1.02	    % set(auto) -> set(auto_inference).
0.72/1.02	    % set(auto) -> set(auto_setup).
0.72/1.02	    % set(auto_setup) -> set(predicate_elim).
0.72/1.02	    % set(auto_setup) -> assign(eq_defs, unfold).
0.72/1.02	    % set(auto) -> set(auto_limits).
0.72/1.02	    % set(auto_limits) -> assign(max_weight, "100.000").
0.72/1.02	    % set(auto_limits) -> assign(sos_limit, 20000).
0.72/1.02	    % set(auto) -> set(auto_denials).
0.72/1.02	    % set(auto) -> set(auto_process).
0.72/1.02	    % set(auto2) -> assign(new_constants, 1).
0.72/1.02	    % set(auto2) -> assign(fold_denial_max, 3).
0.72/1.02	    % set(auto2) -> assign(max_weight, "200.000").
0.72/1.02	    % set(auto2) -> assign(max_hours, 1).
0.72/1.02	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.72/1.02	    % set(auto2) -> assign(max_seconds, 0).
0.72/1.02	    % set(auto2) -> assign(max_minutes, 5).
0.72/1.02	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.72/1.02	    % set(auto2) -> set(sort_initial_sos).
0.72/1.02	    % set(auto2) -> assign(sos_limit, -1).
0.72/1.02	    % set(auto2) -> assign(lrs_ticks, 3000).
0.72/1.02	    % set(auto2) -> assign(max_megs, 400).
0.72/1.02	    % set(auto2) -> assign(stats, some).
0.72/1.02	    % set(auto2) -> clear(echo_input).
0.72/1.02	    % set(auto2) -> set(quiet).
0.72/1.02	    % set(auto2) -> clear(print_initial_clauses).
0.72/1.02	    % set(auto2) -> clear(print_given).
0.72/1.02	assign(lrs_ticks,-1).
0.72/1.02	assign(sos_limit,10000).
0.72/1.02	assign(order,kbo).
0.72/1.02	set(lex_order_vars).
0.72/1.02	clear(print_given).
0.72/1.02	
0.72/1.02	% formulas(sos).  % not echoed (67 formulas)
0.72/1.02	
0.72/1.02	============================== end of input ==========================
0.72/1.02	
0.72/1.02	% From the command line: assign(max_seconds, 1440).
0.72/1.02	
0.72/1.02	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.72/1.02	
0.72/1.02	% Formulas that are not ordinary clauses:
0.72/1.02	1 (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.02	2 (all X all Y (m_Ldr(X) != m_Ldr(Y) <-> X != Y)) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	3 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	4 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	5 (all X (ordered(cons(X,q_nil)) & ordered(snoc(q_nil,X)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	6 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	7 (all X all Q (ordered(cons(X,Q)) <-> ordered(Q) & (all Y (pidElem(Y) & host(pidMsg(X)) = host(pidMsg(Y)) & pidElem(X) & elem(Y,Q) -> leq(pidMsg(X),pidMsg(Y)))))) # label(axiom_53) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	8 (all X all Y (X != Y <-> m_NormQ(X) != m_NormQ(Y))) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	9 (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.72/1.02	10 (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.02	11 (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.02	12 (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.02	13 (all X all Y all Z m_Ack(X,Y) != m_Down(Z)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	14 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	15 (all X all Y (Y = X <-> leq(Y,X) & leq(X,Y))) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	16 (all X all Q X = head(cons(X,Q))) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	17 (all X all Q (ordered(snoc(Q,X)) <-> ordered(Q) & (all Y (elem(Y,Q) & pidElem(Y) & host(pidMsg(X)) = host(pidMsg(Y)) & pidElem(X) -> leq(pidMsg(Y),pidMsg(X)))))) # label(axiom_54) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	18 (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.02	19 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	20 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	21 (all X all Y m_NormQ(Y) != m_Ldr(X)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	22 (all X X = pidMsg(m_Halt(X))) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	23 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	24 (all Q (cons(head(Q),tail(Q)) = Q | Q = q_nil)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	25 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	26 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	27 (all P all Q (host(Q) = s(host(P)) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	28 (all Q all X all Y (elem(m_Down(Y),Q) & host(X) = host(Y) & ordered(cons(m_Halt(X),Q)) -> leq(X,Y))) # label(axiom_57) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	29 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	30 (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.72/1.02	31 (all X (pidElem(X) <-> (exists Y (m_Down(Y) = X | m_Halt(Y) = X)))) # label(axiom_48) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	32 (all X all Y (m_Halt(Y) != m_Halt(X) <-> Y != X)) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	33 (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.02	34 (all Y all Q Q = init(snoc(Q,Y))) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	35 (all Q (Q = q_nil | snoc(init(Q),last(Q)) = Q)) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	36 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	37 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	38 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	39 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	40 (all X all Y (m_Down(X) != m_Down(Y) <-> X != Y)) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	41 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	42 (all Y all Q Y = last(snoc(Q,Y))) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	43 (all X all Y m_Ldr(X) != m_NotNorm(Y)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	44 (all X all Y (Y != X <-> m_NotNorm(X) != m_NotNorm(Y))) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	45 (all X all Y m_NotNorm(Y) != m_NormQ(X)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	46 (all X all Y m_Ldr(Y) != m_Down(X)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	47 (all X all Y all Q (Y = X | elem(X,Q) <-> elem(X,snoc(Q,Y)))) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	48 (all X all Y (leq(X,Y) | s(Y) = X <-> leq(X,s(Y)))) # label(axiom_64) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	49 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.72/1.02	50 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.72/1.04	51 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.72/1.04	52 (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.04	53 (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.72/1.04	54 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.72/1.04	55 (all X all Y m_NormQ(Y) != m_Down(X)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.72/1.04	56 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.72/1.04	57 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.72/1.04	58 -(all V all W all X ((all Y all Z (elem(m_Ldr(Z),queue(host(Y))) -> -leq(host(Y),host(Z)))) & (all Y all Z (Z != Y & host(Y) = host(Z) -> -setIn(Y,alive) | -setIn(Z,alive))) & (all Y all Z (index(status,host(Z)) = elec_1 & setIn(Z,alive) -> -elem(m_Ack(Y,Z),queue(host(Y))))) & (all Y all Z all Pid0 (elem(m_Down(Y),queue(host(Z))) & host(Pid0) = host(Y) & elem(m_Ack(Pid0,Z),queue(host(Pid0))) -> -setIn(Pid0,alive))) & (all Y all Z all Pid0 (setIn(Z,alive) & setIn(Pid0,alive) & host(Z) = host(Y) & elem(m_Ack(Pid0,Y),queue(host(Pid0))) -> -setIn(host(Pid0),index(down,host(Z))))) & (all Y all Z (-leq(host(Y),host(Z)) & setIn(Y,alive) & index(status,host(Z)) = elec_2 & index(status,host(Y)) = elec_2 & setIn(Z,alive) -> -leq(index(pendack,host(Y)),index(pendack,host(Z))))) & (all Y all Z all Pid0 (setIn(Pid0,alive) & elec_2 = index(status,host(Pid0)) & elem(m_Halt(Pid0),queue(host(Z))) & -leq(index(pendack,host(Pid0)),host(Y)) -> -(setIn(Y,alive) & index(ldr,host(Y)) = host(Y) & norm = index(status,host(Y))))) & queue(host(W)) = cons(m_Halt(X),V) & (all Y all Z all Pid0 (setIn(Pid0,alive) & leq(nbr_proc,index(pendack,host(Pid0))) & index(pendack,host(Pid0)) = host(Z) & index(status,host(Pid0)) = elec_2 & elem(m_Ack(Pid0,Z),queue(host(Pid0))) -> -(host(Y) = index(ldr,host(Y)) & norm = index(status,host(Y)) & setIn(Y,alive)))) & (all Y ((index(status,host(Y)) = elec_1 | index(status,host(Y)) = elec_2) & setIn(Y,alive) -> index(elid,host(Y)) = Y)) & (all Y all Z (setIn(Z,alive) & index(status,host(Z)) = elec_1 -> -elem(m_Ack(Z,Y),queue(host(Z))))) & (all Y all Z (elem(m_Ack(Z,Y),queue(host(Z))) & setIn(Z,alive) -> leq(host(Y),index(pendack,host(Z))))) & (all Y all Z (-setIn(Y,alive) & leq(Z,Y) & host(Z) = host(Y) -> -setIn(Z,alive))) & (all Y all Z all Pid0 (elem(m_Ack(Pid0,Y),queue(host(Z))) -> -leq(host(Y),host(Pid0)))) & (all Y all Z (elem(m_Down(Z),queue(host(Y))) -> -setIn(Z,alive))) & (all Y all Z (elem(m_Ack(Z,Y),queue(host(Z))) -> setIn(Z,pids))) -> (setIn(W,alive) -> (all Y (host(Y) != host(W) -> (all Z all X0 (host(X0) = host(X) -> (host(W) != host(X0) -> (setIn(X0,alive) & index(pendack,host(X0)) = host(Z) & index(status,host(X0)) = elec_2 & elem(m_Ack(X0,Z),snoc(queue(host(X0)),m_Ack(X,W))) & leq(nbr_proc,index(pendack,host(X0))) -> -(setIn(Y,alive) & index(status,host(Y)) = norm & host(Y) = index(ldr,host(Y)))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.72/1.04	
0.72/1.04	============================== end of process non-clausal formulas ===
0.72/1.04	
0.72/1.04	============================== PROCESS INITIAL CLAUSES ===============
0.72/1.04	
0.72/1.04	============================== PREDICATE ELIMINATION =================
0.72/1.04	
0.72/1.04	============================== end predicate elimination =============
0.72/1.04	
0.72/1.04	Auto_denials:  (non-Horn, no changes).
0.72/1.04	
0.72/1.04	Term ordering decisions:
0.72/1.04	Function symbol KB weights:  alive=1. status=1. q_nil=1. pendack=1. elec_2=1. nbr_proc=1. pids=1. elid=1. ldr=1. norm=1. zero=1. elec_1=1. down=1. nil=1. setEmpty=1. wait=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. snoc=1. cons=1. index=1. m_Ack=1. f1=1. f2=1. host=1. pidMsg=1. s=1. m_Halt=1. m_Down=1. queue=1. m_Ldr=1. m_NormQ=1. m_NotNorm=1. head=1. init=1. last=1. tail=1. f3=1.
0.72/1.04	
0.72/1.04	============================== end of process initial clauses ========
1.06/1.34	
1.06/1.34	============================== CLAUSES FOR SEARCH ====================
1.06/1.34	
1.06/1.34	============================== end of clauses for search =============
1.06/1.34	
1.06/1.34	============================== SEARCH ================================
1.06/1.34	
1.06/1.34	% Starting search at 0.03 seconds.
1.06/1.34	
1.06/1.34	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 182 (0.00 of 0.30 sec).
1.06/1.34	
1.06/1.34	============================== PROOF =================================
1.06/1.34	% SZS status Theorem
1.06/1.34	% SZS output start Refutation
1.06/1.34	
1.06/1.34	% Proof 1 at 0.33 (+ 0.01) seconds.
1.06/1.34	% Length of proof is 62.
1.06/1.34	% Level of proof is 14.
1.06/1.34	% Maximum clause weight is 50.000.
1.06/1.34	% Given clauses 542.
1.06/1.34	
1.06/1.34	1 (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].
1.06/1.34	15 (all X all Y (Y = X <-> leq(Y,X) & leq(X,Y))) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
1.06/1.34	18 (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].
1.06/1.34	22 (all X X = pidMsg(m_Halt(X))) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
1.06/1.34	30 (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].
1.06/1.34	36 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
1.06/1.34	37 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
1.06/1.34	47 (all X all Y all Q (Y = X | elem(X,Q) <-> elem(X,snoc(Q,Y)))) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
1.06/1.34	58 -(all V all W all X ((all Y all Z (elem(m_Ldr(Z),queue(host(Y))) -> -leq(host(Y),host(Z)))) & (all Y all Z (Z != Y & host(Y) = host(Z) -> -setIn(Y,alive) | -setIn(Z,alive))) & (all Y all Z (index(status,host(Z)) = elec_1 & setIn(Z,alive) -> -elem(m_Ack(Y,Z),queue(host(Y))))) & (all Y all Z all Pid0 (elem(m_Down(Y),queue(host(Z))) & host(Pid0) = host(Y) & elem(m_Ack(Pid0,Z),queue(host(Pid0))) -> -setIn(Pid0,alive))) & (all Y all Z all Pid0 (setIn(Z,alive) & setIn(Pid0,alive) & host(Z) = host(Y) & elem(m_Ack(Pid0,Y),queue(host(Pid0))) -> -setIn(host(Pid0),index(down,host(Z))))) & (all Y all Z (-leq(host(Y),host(Z)) & setIn(Y,alive) & index(status,host(Z)) = elec_2 & index(status,host(Y)) = elec_2 & setIn(Z,alive) -> -leq(index(pendack,host(Y)),index(pendack,host(Z))))) & (all Y all Z all Pid0 (setIn(Pid0,alive) & elec_2 = index(status,host(Pid0)) & elem(m_Halt(Pid0),queue(host(Z))) & -leq(index(pendack,host(Pid0)),host(Y)) -> -(setIn(Y,alive) & index(ldr,host(Y)) = host(Y) & norm = index(status,host(Y))))) & queue(host(W)) = cons(m_Halt(X),V) & (all Y all Z all Pid0 (setIn(Pid0,alive) & leq(nbr_proc,index(pendack,host(Pid0))) & index(pendack,host(Pid0)) = host(Z) & index(status,host(Pid0)) = elec_2 & elem(m_Ack(Pid0,Z),queue(host(Pid0))) -> -(host(Y) = index(ldr,host(Y)) & norm = index(status,host(Y)) & setIn(Y,alive)))) & (all Y ((index(status,host(Y)) = elec_1 | index(status,host(Y)) = elec_2) & setIn(Y,alive) -> index(elid,host(Y)) = Y)) & (all Y all Z (setIn(Z,alive) & index(status,host(Z)) = elec_1 -> -elem(m_Ack(Z,Y),queue(host(Z))))) & (all Y all Z (elem(m_Ack(Z,Y),queue(host(Z))) & setIn(Z,alive) -> leq(host(Y),index(pendack,host(Z))))) & (all Y all Z (-setIn(Y,alive) & leq(Z,Y) & host(Z) = host(Y) -> -setIn(Z,alive))) & (all Y all Z all Pid0 (elem(m_Ack(Pid0,Y),queue(host(Z))) -> -leq(host(Y),host(Pid0)))) & (all Y all Z (elem(m_Down(Z),queue(host(Y))) -> -setIn(Z,alive))) & (all Y all Z (elem(m_Ack(Z,Y),queue(host(Z))) -> setIn(Z,pids))) -> (setIn(W,alive) -> (all Y (host(Y) != host(W) -> (all Z all X0 (host(X0) = host(X) -> (host(W) != host(X0) -> (setIn(X0,alive) & index(pendack,host(X0)) = host(Z) & index(status,host(X0)) = elec_2 & elem(m_Ack(X0,Z),snoc(queue(host(X0)),m_Ack(X,W))) & leq(nbr_proc,index(pendack,host(X0))) -> -(setIn(Y,alive) & index(status,host(Y)) = norm & host(Y) = index(ldr,host(Y)))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
1.06/1.34	59 A = B | m_Ack(C,A) != m_Ack(D,B) # label(axiom_32) # label(axiom).  [clausify(1)].
1.06/1.34	88 A = B | -leq(A,B) | -leq(B,A) # label(axiom_61) # label(axiom).  [clausify(15)].
1.06/1.34	97 A = B | m_Ack(A,C) != m_Ack(B,D) # label(axiom_31) # label(axiom).  [clausify(18)].
1.06/1.34	102 pidMsg(m_Halt(A)) = A # label(axiom_49) # label(axiom).  [clausify(22)].
1.06/1.34	110 A != B | elem(B,cons(A,C)) # label(axiom_46) # label(axiom).  [clausify(30)].
1.06/1.34	121 leq(host(A),nbr_proc) # label(axiom_04) # label(axiom).  [clausify(36)].
1.06/1.34	124 leq(A,A) # label(axiom_59) # label(axiom).  [clausify(37)].
1.06/1.34	139 A = B | elem(B,C) | -elem(B,snoc(C,A)) # label(axiom_47) # label(axiom).  [clausify(47)].
1.06/1.34	162 -setIn(A,alive) | index(status,host(A)) != elec_2 | -elem(m_Halt(A),queue(host(B))) | leq(index(pendack,host(A)),host(C)) | -setIn(C,alive) | index(ldr,host(C)) != host(C) | index(status,host(C)) != norm # label(conj) # label(negated_conjecture).  [clausify(58)].
1.06/1.34	163 queue(host(c2)) = cons(m_Halt(c3),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.06/1.34	164 cons(m_Halt(c3),c1) = queue(host(c2)).  [copy(163),flip(a)].
1.06/1.34	165 -setIn(A,alive) | -leq(nbr_proc,index(pendack,host(A))) | index(pendack,host(A)) != host(B) | index(status,host(A)) != elec_2 | -elem(m_Ack(A,B),queue(host(A))) | index(ldr,host(C)) != host(C) | index(status,host(C)) != norm | -setIn(C,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.06/1.34	174 host(c2) != host(c4) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.06/1.34	175 host(c4) != host(c2).  [copy(174),flip(a)].
1.06/1.34	176 host(c6) = host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.06/1.34	179 setIn(c6,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.06/1.34	180 index(pendack,host(c6)) = host(c5) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.06/1.34	181 index(pendack,host(c3)) = host(c5).  [copy(180),rewrite([176(3)])].
1.06/1.34	182 index(status,host(c6)) = elec_2 # label(conj) # label(negated_conjecture).  [clausify(58)].
1.06/1.34	183 elec_2 = index(status,host(c3)).  [copy(182),rewrite([176(3)]),flip(a)].
1.06/1.34	184 elem(m_Ack(c6,c5),snoc(queue(host(c6)),m_Ack(c3,c2))) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.06/1.34	185 elem(m_Ack(c6,c5),snoc(queue(host(c3)),m_Ack(c3,c2))).  [copy(184),rewrite([176(5)])].
1.06/1.34	186 leq(nbr_proc,index(pendack,host(c6))) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.06/1.34	187 leq(nbr_proc,host(c5)).  [copy(186),rewrite([176(4),181(5)])].
1.06/1.34	188 setIn(c4,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.06/1.34	189 index(status,host(c4)) = norm # label(conj) # label(negated_conjecture).  [clausify(58)].
1.06/1.34	190 norm = index(status,host(c4)).  [copy(189),flip(a)].
1.06/1.34	191 index(ldr,host(c4)) = host(c4) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.06/1.34	195 host(c4) = c_0.  [new_symbol(175)].
1.06/1.34	197 -setIn(A,alive) | -leq(nbr_proc,index(pendack,host(A))) | index(pendack,host(A)) != host(B) | index(status,host(c3)) != index(status,host(A)) | -elem(m_Ack(A,B),queue(host(A))) | index(ldr,host(C)) != host(C) | index(status,host(C)) != index(status,c_0) | -setIn(C,alive).  [back_rewrite(165),rewrite([183(16),190(33),195(35)]),flip(d)].
1.06/1.34	198 -setIn(A,alive) | index(status,host(c3)) != index(status,host(A)) | -elem(m_Halt(A),queue(host(B))) | leq(index(pendack,host(A)),host(C)) | -setIn(C,alive) | index(ldr,host(C)) != host(C) | index(status,host(C)) != index(status,c_0).  [back_rewrite(162),rewrite([183(6),190(30),195(32)]),flip(b)].
1.06/1.34	207 index(ldr,c_0) = c_0.  [back_rewrite(191),rewrite([195(3),195(5)])].
1.06/1.34	209 host(c2) != c_0.  [back_rewrite(175),rewrite([195(2)]),flip(a)].
1.06/1.34	234 elem(A,cons(A,B)).  [resolve(110,a,102,a),rewrite([102(2)])].
1.06/1.34	314 m_Ack(c6,c5) = m_Ack(c3,c2) | elem(m_Ack(c6,c5),queue(host(c3))).  [resolve(185,a,139,c),flip(a)].
1.06/1.34	321 host(c5) = nbr_proc.  [resolve(187,a,88,c),unit_del(b,121)].
1.06/1.34	322 index(pendack,host(c3)) = nbr_proc.  [back_rewrite(181),rewrite([321(6)])].
1.06/1.34	333 leq(c_0,nbr_proc).  [para(195(a,1),121(a,1))].
1.06/1.34	342 host(A) != nbr_proc | -elem(m_Ack(c6,A),queue(host(c3))) | index(ldr,host(B)) != host(B) | index(status,host(B)) != index(status,c_0) | -setIn(B,alive).  [resolve(197,a,179,a),rewrite([176(4),322(5),176(6),322(7),176(13),176(19)]),flip(b),xx(c),unit_del(a,124)].
1.06/1.34	347 -setIn(A,alive) | index(status,host(c3)) != index(status,host(A)) | -elem(m_Halt(A),queue(host(B))) | leq(index(pendack,host(A)),c_0).  [resolve(198,e,188,a),rewrite([195(19),195(22),207(22),195(22),195(25)]),xx(e),xx(f)].
1.06/1.34	370 c_0 = nbr_proc | -leq(nbr_proc,c_0).  [resolve(333,a,88,c),flip(a)].
1.06/1.34	407 elem(m_Halt(c3),queue(host(c2))).  [para(164(a,1),234(a,2))].
1.06/1.34	676 host(A) != nbr_proc | -elem(m_Ack(c6,A),queue(host(c3))).  [resolve(342,e,188,a),rewrite([195(12),207(12),195(12),195(15)]),xx(c),xx(d)].
1.06/1.34	2296 m_Ack(c6,c5) = m_Ack(c3,c2).  [resolve(314,b,676,b),rewrite([321(9)]),xx(b)].
1.06/1.34	2300 c6 = c3.  [resolve(2296,a,97,b)].
1.06/1.34	2305 c5 = c2.  [resolve(2296,a,59,b)].
1.06/1.34	2383 setIn(c3,alive).  [back_rewrite(179),rewrite([2300(1)])].
1.06/1.34	2405 host(c2) = nbr_proc.  [back_rewrite(321),rewrite([2305(1)])].
1.06/1.34	2493 elem(m_Halt(c3),queue(nbr_proc)).  [back_rewrite(407),rewrite([2405(4)])].
1.06/1.34	2511 c_0 != nbr_proc.  [back_rewrite(209),rewrite([2405(2)]),flip(a)].
1.06/1.34	2514 -leq(nbr_proc,c_0).  [back_unit_del(370),unit_del(a,2511)].
1.06/1.34	2575 -elem(m_Halt(c3),queue(host(A))).  [resolve(347,a,2383,a),rewrite([322(18)]),xx(a),unit_del(b,2514)].
1.06/1.34	2578 $F.  [para(2405(a,1),2575(a,2,1)),unit_del(a,2493)].
1.06/1.34	
1.06/1.34	% SZS output end Refutation
1.06/1.34	============================== end of proof ==========================
1.06/1.34	
1.06/1.34	============================== STATISTICS ============================
1.06/1.34	
1.06/1.34	Given=542. Generated=10130. Kept=2508. proofs=1.
1.06/1.34	Usable=475. Sos=1746. Demods=32. Limbo=1, Disabled=411. Hints=0.
1.06/1.34	Megabytes=3.91.
1.06/1.34	User_CPU=0.33, System_CPU=0.01, Wall_clock=0.
1.06/1.34	
1.06/1.34	============================== end of statistics =====================
1.06/1.34	
1.06/1.34	============================== end of search =========================
1.06/1.34	
1.06/1.34	THEOREM PROVED
1.06/1.34	% SZS status Theorem
1.06/1.34	
1.06/1.34	Exiting with 1 proof.
1.06/1.34	
1.06/1.34	Process 10810 exit (max_proofs) Mon Jul  3 06:39:01 2023
1.06/1.34	Prover9 interrupted
1.06/1.34	EOF