0.06/0.11	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.11	% Command  : tptp2X_and_run_prover9 %d %s
0.10/0.31	% Computer : n024.cluster.edu
0.10/0.31	% Model    : x86_64 x86_64
0.10/0.31	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.31	% Memory   : 8042.1875MB
0.10/0.31	% OS       : Linux 3.10.0-693.el7.x86_64
0.10/0.31	% CPULimit : 1440
0.10/0.31	% WCLimit  : 180
0.10/0.31	% DateTime : Mon Jul  3 06:22:08 EDT 2023
0.10/0.32	% CPUTime  : 
0.78/0.99	============================== Prover9 ===============================
0.78/0.99	Prover9 (32) version 2009-11A, November 2009.
0.78/0.99	Process 19741 was started by sandbox2 on n024.cluster.edu,
0.78/0.99	Mon Jul  3 06:22:08 2023
0.78/0.99	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1440 -f /tmp/Prover9_19588_n024.cluster.edu".
0.78/0.99	============================== end of head ===========================
0.78/0.99	
0.78/0.99	============================== INPUT =================================
0.78/0.99	
0.78/0.99	% Reading from file /tmp/Prover9_19588_n024.cluster.edu
0.78/0.99	
0.78/0.99	set(prolog_style_variables).
0.78/0.99	set(auto2).
0.78/0.99	    % set(auto2) -> set(auto).
0.78/0.99	    % set(auto) -> set(auto_inference).
0.78/0.99	    % set(auto) -> set(auto_setup).
0.78/0.99	    % set(auto_setup) -> set(predicate_elim).
0.78/0.99	    % set(auto_setup) -> assign(eq_defs, unfold).
0.78/0.99	    % set(auto) -> set(auto_limits).
0.78/0.99	    % set(auto_limits) -> assign(max_weight, "100.000").
0.78/0.99	    % set(auto_limits) -> assign(sos_limit, 20000).
0.78/0.99	    % set(auto) -> set(auto_denials).
0.78/0.99	    % set(auto) -> set(auto_process).
0.78/0.99	    % set(auto2) -> assign(new_constants, 1).
0.78/0.99	    % set(auto2) -> assign(fold_denial_max, 3).
0.78/0.99	    % set(auto2) -> assign(max_weight, "200.000").
0.78/0.99	    % set(auto2) -> assign(max_hours, 1).
0.78/0.99	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.78/0.99	    % set(auto2) -> assign(max_seconds, 0).
0.78/0.99	    % set(auto2) -> assign(max_minutes, 5).
0.78/0.99	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.78/0.99	    % set(auto2) -> set(sort_initial_sos).
0.78/0.99	    % set(auto2) -> assign(sos_limit, -1).
0.78/0.99	    % set(auto2) -> assign(lrs_ticks, 3000).
0.78/0.99	    % set(auto2) -> assign(max_megs, 400).
0.78/0.99	    % set(auto2) -> assign(stats, some).
0.78/0.99	    % set(auto2) -> clear(echo_input).
0.78/0.99	    % set(auto2) -> set(quiet).
0.78/0.99	    % set(auto2) -> clear(print_initial_clauses).
0.78/0.99	    % set(auto2) -> clear(print_given).
0.78/0.99	assign(lrs_ticks,-1).
0.78/0.99	assign(sos_limit,10000).
0.78/0.99	assign(order,kbo).
0.78/0.99	set(lex_order_vars).
0.78/0.99	clear(print_given).
0.78/0.99	
0.78/0.99	% formulas(sos).  % not echoed (67 formulas)
0.78/0.99	
0.78/0.99	============================== end of input ==========================
0.78/0.99	
0.78/0.99	% From the command line: assign(max_seconds, 1440).
0.78/0.99	
0.78/0.99	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.78/0.99	
0.78/0.99	% Formulas that are not ordinary clauses:
0.78/0.99	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.78/0.99	2 (all X all Y (m_Ldr(X) != m_Ldr(Y) <-> X != Y)) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	3 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	4 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	5 (all X (ordered(cons(X,q_nil)) & ordered(snoc(q_nil,X)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	6 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	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.78/0.99	8 (all X all Y (X != Y <-> m_NormQ(X) != m_NormQ(Y))) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	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.78/0.99	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.78/0.99	11 (all X all Y all Z m_Halt(Z) != m_Ack(X,Y)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	12 (all X all Y all Z m_NotNorm(Z) != m_Ack(X,Y)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	13 (all X all Y all Z m_Ack(X,Y) != m_Down(Z)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	14 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	15 (all X all Y (Y = X <-> leq(Y,X) & leq(X,Y))) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	16 (all X all Q X = head(cons(X,Q))) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	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.78/0.99	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.78/0.99	19 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	20 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	21 (all X all Y m_NormQ(Y) != m_Ldr(X)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	22 (all X X = pidMsg(m_Halt(X))) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	23 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	24 (all Q (cons(head(Q),tail(Q)) = Q | Q = q_nil)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	25 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	26 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	27 (all P all Q (host(Q) = s(host(P)) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	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.78/0.99	29 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	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.78/0.99	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.78/0.99	32 (all X all Y (m_Halt(Y) != m_Halt(X) <-> Y != X)) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	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.78/0.99	34 (all Y all Q Q = init(snoc(Q,Y))) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	35 (all Q (Q = q_nil | snoc(init(Q),last(Q)) = Q)) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	36 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	37 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	38 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	39 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	40 (all X all Y (m_Down(X) != m_Down(Y) <-> X != Y)) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	41 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	42 (all Y all Q Y = last(snoc(Q,Y))) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	43 (all X all Y m_Ldr(X) != m_NotNorm(Y)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	44 (all X all Y (Y != X <-> m_NotNorm(X) != m_NotNorm(Y))) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	45 (all X all Y m_NotNorm(Y) != m_NormQ(X)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	46 (all X all Y m_Ldr(Y) != m_Down(X)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	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.78/0.99	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.78/0.99	49 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.78/0.99	50 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.78/1.01	51 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.78/1.01	52 (all X all Y all Z m_Ldr(Z) != m_Ack(X,Y)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.78/1.01	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.78/1.01	54 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.78/1.01	55 (all X all Y m_NormQ(Y) != m_Down(X)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.78/1.01	56 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.78/1.01	57 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.78/1.01	58 -(all V all W all X all Y ((all Z all Pid0 (Pid0 != Z & host(Z) = host(Pid0) -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (all Z all Pid0 (setIn(Pid0,alive) & index(status,host(Pid0)) = elec_2 -> -elem(m_Ack(Z,Pid0),queue(host(Z))))) & (all Z all Pid0 (setIn(Z,alive) & setIn(Pid0,alive) & elec_2 = index(status,host(Pid0)) & elec_2 = index(status,host(Z)) & -leq(host(Z),host(Pid0)) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid20 all Pid0 (setIn(Z,alive) & host(Pid20) = host(Pid0) & elec_2 = index(status,host(Pid0)) & elec_2 = index(status,host(Z)) & setIn(Pid0,alive) -> -elem(m_Ack(Z,Pid20),queue(host(Z))))) & (all Z all Pid0 (-leq(host(Z),host(Pid0)) & setIn(Pid0,alive) & index(status,host(Pid0)) = elec_2 & index(status,host(Z)) = elec_2 & setIn(Z,alive) -> -leq(index(pendack,host(Z)),index(pendack,host(Pid0))))) & cons(m_Down(Y),V) = queue(host(X)) & (all Z all Pid20 all Pid0 (elem(m_Down(Pid20),queue(host(Z))) & host(Pid0) = host(Pid20) & elec_2 = index(status,host(Pid0)) & setIn(Pid0,alive) & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid20 all Pid0 (index(status,host(Pid0)) = elec_2 & host(Pid0) = host(Pid20) & setIn(Pid0,alive) & setIn(Z,alive) & -leq(host(Pid0),host(Z)) -> -elem(m_Down(Pid20),queue(host(Z))))) & (all Z all Pid0 (setIn(Pid0,alive) & elec_2 = index(status,host(Pid0)) & setIn(host(Pid0),index(down,host(Z))) & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z (setIn(Z,alive) & (index(status,host(Z)) = elec_1 | elec_2 = index(status,host(Z))) -> index(elid,host(Z)) = Z)) & (all Z all Pid20 all Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid20))) -> -leq(host(Z),host(Pid0)))) & (all Z (elec_2 = index(status,host(Z)) -> -leq(index(pendack,host(Z)),host(Z)))) & (all Z all Pid0 (elem(m_Halt(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) -> (setIn(X,alive) -> (-leq(host(X),host(Y)) -> (-(norm = index(status,host(X)) & host(Y) = index(ldr,host(X)) | host(index(elid,host(X))) = host(Y) & index(status,host(X)) = wait) -> (index(status,host(X)) = elec_1 & (all Z (leq(s(zero),Z) & -leq(host(X),Z) -> Z = host(Y) | setIn(Z,index(down,host(X))))) -> (-leq(nbr_proc,host(X)) -> (all Z (host(Z) = host(X) -> (all W0 (host(X) != host(W0) -> (-leq(host(Z),host(W0)) & setIn(W0,alive) & elec_2 = index(status,host(W0)) & setIn(Z,alive) -> -leq(s(host(X)),index(pendack,host(W0))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.78/1.01	
0.78/1.01	============================== end of process non-clausal formulas ===
0.78/1.01	
0.78/1.01	============================== PROCESS INITIAL CLAUSES ===============
0.78/1.01	
0.78/1.01	============================== PREDICATE ELIMINATION =================
0.78/1.01	
0.78/1.01	============================== end predicate elimination =============
0.78/1.01	
0.78/1.01	Auto_denials:  (non-Horn, no changes).
0.78/1.01	
0.78/1.01	Term ordering decisions:
0.78/1.01	Function symbol KB weights:  alive=1. status=1. elec_2=1. q_nil=1. pendack=1. zero=1. down=1. elec_1=1. elid=1. nbr_proc=1. pids=1. ldr=1. nil=1. norm=1. setEmpty=1. wait=1. c1=1. c3=1. c4=1. c5=1. c6=1. index=1. cons=1. snoc=1. m_Ack=1. f1=1. f2=1. host=1. pidMsg=1. s=1. m_Down=1. m_Halt=1. m_Ldr=1. queue=1. m_NormQ=1. m_NotNorm=1. head=1. init=1. last=1. tail=1. f3=1.
0.78/1.01	
0.78/1.01	============================== end of process initial clauses ========
32.89/33.16	
32.89/33.16	============================== CLAUSES FOR SEARCH ====================
32.89/33.16	
32.89/33.16	============================== end of clauses for search =============
32.89/33.16	
32.89/33.16	============================== SEARCH ================================
32.89/33.16	
32.89/33.16	% Starting search at 0.02 seconds.
32.89/33.16	
32.89/33.16	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 191 (0.00 of 0.53 sec).
32.89/33.16	
32.89/33.16	Low Water (keep): wt=53.000, iters=3348
32.89/33.16	
32.89/33.16	Low Water (keep): wt=37.000, iters=3390
32.89/33.16	
32.89/33.16	Low Water (keep): wt=33.000, iters=3350
32.89/33.16	
32.89/33.16	Low Water (keep): wt=30.000, iters=3350
32.89/33.16	
32.89/33.16	Low Water (keep): wt=29.000, iters=3355
32.89/33.16	
32.89/33.16	Low Water (keep): wt=28.000, iters=3348
32.89/33.16	
32.89/33.16	Low Water (keep): wt=27.000, iters=3377
32.89/33.16	
32.89/33.16	Low Water (keep): wt=25.000, iters=3348
32.89/33.16	
32.89/33.16	Low Water (keep): wt=24.000, iters=3340
32.89/33.16	
32.89/33.16	Low Water (keep): wt=23.000, iters=3365
32.89/33.16	
32.89/33.16	Low Water (keep): wt=22.000, iters=3370
32.89/33.16	
32.89/33.16	Low Water (keep): wt=21.000, iters=3344
32.89/33.16	
32.89/33.16	Low Water (keep): wt=16.000, iters=5015
32.89/33.16	
32.89/33.16	Low Water (keep): wt=15.000, iters=3908
32.89/33.16	
32.89/33.16	============================== PROOF =================================
32.89/33.16	% SZS status Theorem
32.89/33.16	% SZS output start Refutation
32.89/33.16	
32.89/33.16	% Proof 1 at 30.82 (+ 1.35) seconds.
32.89/33.16	% Length of proof is 59.
32.89/33.16	% Level of proof is 11.
32.89/33.16	% Maximum clause weight is 33.000.
32.89/33.16	% Given clauses 4331.
32.89/33.16	
32.89/33.16	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].
32.89/33.16	15 (all X all Y (Y = X <-> leq(Y,X) & leq(X,Y))) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
32.89/33.16	20 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
32.89/33.16	22 (all X X = pidMsg(m_Halt(X))) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
32.89/33.16	25 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
32.89/33.16	27 (all P all Q (host(Q) = s(host(P)) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
32.89/33.16	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].
32.89/33.16	35 (all Q (Q = q_nil | snoc(init(Q),last(Q)) = Q)) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
32.89/33.16	49 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
32.89/33.16	54 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
32.89/33.16	58 -(all V all W all X all Y ((all Z all Pid0 (Pid0 != Z & host(Z) = host(Pid0) -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (all Z all Pid0 (setIn(Pid0,alive) & index(status,host(Pid0)) = elec_2 -> -elem(m_Ack(Z,Pid0),queue(host(Z))))) & (all Z all Pid0 (setIn(Z,alive) & setIn(Pid0,alive) & elec_2 = index(status,host(Pid0)) & elec_2 = index(status,host(Z)) & -leq(host(Z),host(Pid0)) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid20 all Pid0 (setIn(Z,alive) & host(Pid20) = host(Pid0) & elec_2 = index(status,host(Pid0)) & elec_2 = index(status,host(Z)) & setIn(Pid0,alive) -> -elem(m_Ack(Z,Pid20),queue(host(Z))))) & (all Z all Pid0 (-leq(host(Z),host(Pid0)) & setIn(Pid0,alive) & index(status,host(Pid0)) = elec_2 & index(status,host(Z)) = elec_2 & setIn(Z,alive) -> -leq(index(pendack,host(Z)),index(pendack,host(Pid0))))) & cons(m_Down(Y),V) = queue(host(X)) & (all Z all Pid20 all Pid0 (elem(m_Down(Pid20),queue(host(Z))) & host(Pid0) = host(Pid20) & elec_2 = index(status,host(Pid0)) & setIn(Pid0,alive) & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid20 all Pid0 (index(status,host(Pid0)) = elec_2 & host(Pid0) = host(Pid20) & setIn(Pid0,alive) & setIn(Z,alive) & -leq(host(Pid0),host(Z)) -> -elem(m_Down(Pid20),queue(host(Z))))) & (all Z all Pid0 (setIn(Pid0,alive) & elec_2 = index(status,host(Pid0)) & setIn(host(Pid0),index(down,host(Z))) & setIn(Z,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z (setIn(Z,alive) & (index(status,host(Z)) = elec_1 | elec_2 = index(status,host(Z))) -> index(elid,host(Z)) = Z)) & (all Z all Pid20 all Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid20))) -> -leq(host(Z),host(Pid0)))) & (all Z (elec_2 = index(status,host(Z)) -> -leq(index(pendack,host(Z)),host(Z)))) & (all Z all Pid0 (elem(m_Halt(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) -> (setIn(X,alive) -> (-leq(host(X),host(Y)) -> (-(norm = index(status,host(X)) & host(Y) = index(ldr,host(X)) | host(index(elid,host(X))) = host(Y) & index(status,host(X)) = wait) -> (index(status,host(X)) = elec_1 & (all Z (leq(s(zero),Z) & -leq(host(X),Z) -> Z = host(Y) | setIn(Z,index(down,host(X))))) -> (-leq(nbr_proc,host(X)) -> (all Z (host(Z) = host(X) -> (all W0 (host(X) != host(W0) -> (-leq(host(Z),host(W0)) & setIn(W0,alive) & elec_2 = index(status,host(W0)) & setIn(Z,alive) -> -leq(s(host(X)),index(pendack,host(W0))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
32.89/33.16	77 -leq(A,B) | -leq(C,A) | leq(C,B) # label(axiom_62) # label(axiom).  [clausify(9)].
32.89/33.16	89 A = B | -leq(A,B) | -leq(B,A) # label(axiom_61) # label(axiom).  [clausify(15)].
32.89/33.16	101 leq(A,B) | leq(B,A) # label(axiom_60) # label(axiom).  [clausify(20)].
32.89/33.16	103 pidMsg(m_Halt(A)) = A # label(axiom_49) # label(axiom).  [clausify(22)].
32.89/33.16	106 -leq(s(A),A) # label(axiom_58) # label(axiom).  [clausify(25)].
32.89/33.16	108 s(host(A)) != host(B) | host(A) != host(B) # label(axiom_01) # label(axiom).  [clausify(27)].
32.89/33.16	111 A != B | elem(B,cons(A,C)) # label(axiom_46) # label(axiom).  [clausify(30)].
32.89/33.16	121 q_nil = A | snoc(init(A),last(A)) = A # label(axiom_40) # label(axiom).  [clausify(35)].
32.89/33.16	144 leq(s(zero),host(A)) # label(axiom_02) # label(axiom).  [clausify(49)].
32.89/33.16	151 host(A) = host(B) | A != B # label(axiom_33) # label(axiom).  [clausify(54)].
32.89/33.16	162 queue(host(c3)) = cons(m_Down(c4),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
32.89/33.16	163 cons(m_Down(c4),c1) = queue(host(c3)).  [copy(162),flip(a)].
32.89/33.16	164 -elem(m_Down(A),queue(host(B))) | host(A) != host(C) | index(status,host(C)) != elec_2 | -setIn(C,alive) | -setIn(B,alive) | leq(index(pendack,host(C)),host(B)) # label(conj) # label(negated_conjecture).  [clausify(58)].
32.89/33.16	166 -setIn(A,alive) | index(status,host(A)) != elec_2 | -setIn(host(A),index(down,host(B))) | -setIn(B,alive) | leq(index(pendack,host(A)),host(B)) # label(conj) # label(negated_conjecture).  [clausify(58)].
32.89/33.16	172 setIn(c3,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
32.89/33.16	178 -leq(s(zero),A) | leq(host(c3),A) | host(c4) = A | setIn(A,index(down,host(c3))) # label(conj) # label(negated_conjecture).  [clausify(58)].
32.89/33.16	180 host(c5) = host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
32.89/33.16	182 -leq(host(c5),host(c6)) # label(conj) # label(negated_conjecture).  [clausify(58)].
32.89/33.16	183 -leq(host(c3),host(c6)).  [copy(182),rewrite([180(2)])].
32.89/33.16	184 setIn(c6,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
32.89/33.16	185 index(status,host(c6)) = elec_2 # label(conj) # label(negated_conjecture).  [clausify(58)].
32.89/33.16	186 elec_2 = index(status,host(c6)).  [copy(185),flip(a)].
32.89/33.16	188 leq(s(host(c3)),index(pendack,host(c6))) # label(conj) # label(negated_conjecture).  [clausify(58)].
32.89/33.16	198 -setIn(A,alive) | index(status,host(c6)) != index(status,host(A)) | -setIn(host(A),index(down,host(B))) | -setIn(B,alive) | leq(index(pendack,host(A)),host(B)).  [back_rewrite(166),rewrite([186(6)]),flip(b)].
32.89/33.16	200 -elem(m_Down(A),queue(host(B))) | host(A) != host(C) | index(status,host(c6)) != index(status,host(C)) | -setIn(C,alive) | -setIn(B,alive) | leq(index(pendack,host(C)),host(B)).  [back_rewrite(164),rewrite([186(11)]),flip(c)].
32.89/33.16	228 leq(A,s(A)).  [resolve(106,a,101,b)].
32.89/33.16	230 elem(A,cons(A,B)).  [resolve(111,a,103,a),rewrite([103(2)])].
32.89/33.16	286 host(snoc(init(A),last(A))) = host(A) | q_nil = A.  [resolve(151,b,121,b)].
32.89/33.16	296 leq(host(c3),host(A)) | host(c4) = host(A) | setIn(host(A),index(down,host(c3))).  [resolve(178,a,144,a)].
32.89/33.16	301 s(host(A)) != host(c3) | host(c3) != host(A).  [para(180(a,1),108(a,2)),rewrite([180(8)]),flip(b)].
32.89/33.16	307 index(pendack,host(c6)) = s(host(c3)) | -leq(index(pendack,host(c6)),s(host(c3))).  [resolve(188,a,89,c)].
32.89/33.16	308 -leq(index(pendack,host(c6)),A) | leq(s(host(c3)),A).  [resolve(188,a,77,b)].
32.89/33.16	333 -leq(s(A),B) | leq(A,B).  [resolve(228,a,77,b)].
32.89/33.16	340 elem(m_Down(c4),queue(host(c3))).  [para(163(a,1),230(a,2))].
32.89/33.16	431 host(c4) != host(A) | index(status,host(c6)) != index(status,host(A)) | -setIn(A,alive) | leq(index(pendack,host(A)),host(c3)).  [resolve(340,a,200,a),unit_del(d,172)].
32.89/33.16	540 leq(host(c3),index(pendack,host(c6))).  [resolve(333,a,188,a)].
32.89/33.16	718 index(pendack,host(c6)) = host(c3) | -leq(index(pendack,host(c6)),host(c3)).  [resolve(540,a,89,c)].
32.89/33.16	1803 q_nil = A | s(host(A)) != host(B) | host(snoc(init(A),last(A))) != host(B).  [para(286(a,1),108(a,1,1))].
32.89/33.16	1990 leq(host(c3),host(A)) | host(c4) = host(A) | -setIn(A,alive) | index(status,host(c6)) != index(status,host(A)) | leq(index(pendack,host(A)),host(c3)).  [resolve(296,c,198,c),unit_del(e,172)].
32.89/33.16	4973 host(c6) != host(c4) | leq(index(pendack,host(c6)),host(c3)).  [resolve(431,c,184,a),flip(a),xx(b)].
32.89/33.16	12779 q_nil = A | s(host(A)) != host(A).  [resolve(1803,c,286,a),merge(c)].
32.89/33.16	13494 host(c6) = host(c4) | leq(index(pendack,host(c6)),host(c3)).  [resolve(1990,c,184,a),flip(b),xx(c),unit_del(a,183)].
32.89/33.16	13518 host(c6) = host(c4).  [resolve(13494,b,308,a),unit_del(b,106)].
32.89/33.16	13717 leq(index(pendack,host(c4)),host(c3)).  [back_rewrite(4973),rewrite([13518(2),13518(8)]),xx(a)].
32.89/33.16	14017 index(pendack,host(c4)) = host(c3).  [back_rewrite(718),rewrite([13518(3),13518(10)]),unit_del(b,13717)].
32.89/33.16	14022 s(host(c3)) = host(c3).  [back_rewrite(307),rewrite([13518(3),14017(4),13518(9),14017(10)]),flip(a),unit_del(b,228)].
32.89/33.16	14273 c3 = q_nil.  [resolve(14022,a,12779,b),flip(a)].
32.89/33.16	14274 $F.  [resolve(14022,a,301,a),rewrite([14273(1),14273(3)]),xx(a)].
32.89/33.16	
32.89/33.16	% SZS output end Refutation
32.89/33.16	============================== end of proof ==========================
32.89/33.16	
32.89/33.16	============================== STATISTICS ============================
32.89/33.16	
32.89/33.16	Given=4331. Generated=1189637. Kept=14207. proofs=1.
32.89/33.16	Usable=3458. Sos=7485. Demods=58. Limbo=1, Disabled=3387. Hints=0.
32.89/33.16	Megabytes=19.34.
32.89/33.16	User_CPU=30.82, System_CPU=1.35, Wall_clock=33.
32.89/33.16	
32.89/33.16	============================== end of statistics =====================
32.89/33.16	
32.89/33.16	============================== end of search =========================
32.89/33.16	
32.89/33.16	THEOREM PROVED
32.89/33.16	% SZS status Theorem
32.89/33.16	
32.89/33.16	Exiting with 1 proof.
32.89/33.16	
32.89/33.16	Process 19741 exit (max_proofs) Mon Jul  3 06:22:41 2023
32.89/33.16	Prover9 interrupted
32.89/33.16	EOF