0.10/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer   : n026.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   : 1200
0.12/0.33	% DateTime   : Wed Jul 14 15:09:15 EDT 2021
0.12/0.33	% CPUTime    : 
0.75/1.05	============================== Prover9 ===============================
0.75/1.05	Prover9 (32) version 2009-11A, November 2009.
0.75/1.05	Process 20407 was started by sandbox on n026.cluster.edu,
0.75/1.05	Wed Jul 14 15:09:15 2021
0.75/1.05	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_20254_n026.cluster.edu".
0.75/1.05	============================== end of head ===========================
0.75/1.05	
0.75/1.05	============================== INPUT =================================
0.75/1.05	
0.75/1.05	% Reading from file /tmp/Prover9_20254_n026.cluster.edu
0.75/1.05	
0.75/1.05	set(prolog_style_variables).
0.75/1.05	set(auto2).
0.75/1.05	    % set(auto2) -> set(auto).
0.75/1.05	    % set(auto) -> set(auto_inference).
0.75/1.05	    % set(auto) -> set(auto_setup).
0.75/1.05	    % set(auto_setup) -> set(predicate_elim).
0.75/1.05	    % set(auto_setup) -> assign(eq_defs, unfold).
0.75/1.05	    % set(auto) -> set(auto_limits).
0.75/1.05	    % set(auto_limits) -> assign(max_weight, "100.000").
0.75/1.05	    % set(auto_limits) -> assign(sos_limit, 20000).
0.75/1.05	    % set(auto) -> set(auto_denials).
0.75/1.05	    % set(auto) -> set(auto_process).
0.75/1.05	    % set(auto2) -> assign(new_constants, 1).
0.75/1.05	    % set(auto2) -> assign(fold_denial_max, 3).
0.75/1.05	    % set(auto2) -> assign(max_weight, "200.000").
0.75/1.05	    % set(auto2) -> assign(max_hours, 1).
0.75/1.05	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.75/1.05	    % set(auto2) -> assign(max_seconds, 0).
0.75/1.05	    % set(auto2) -> assign(max_minutes, 5).
0.75/1.05	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.75/1.05	    % set(auto2) -> set(sort_initial_sos).
0.75/1.05	    % set(auto2) -> assign(sos_limit, -1).
0.75/1.05	    % set(auto2) -> assign(lrs_ticks, 3000).
0.75/1.05	    % set(auto2) -> assign(max_megs, 400).
0.75/1.05	    % set(auto2) -> assign(stats, some).
0.75/1.05	    % set(auto2) -> clear(echo_input).
0.75/1.05	    % set(auto2) -> set(quiet).
0.75/1.05	    % set(auto2) -> clear(print_initial_clauses).
0.75/1.05	    % set(auto2) -> clear(print_given).
0.75/1.05	assign(lrs_ticks,-1).
0.75/1.05	assign(sos_limit,10000).
0.75/1.05	assign(order,kbo).
0.75/1.05	set(lex_order_vars).
0.75/1.05	clear(print_given).
0.75/1.05	
0.75/1.05	% formulas(sos).  % not echoed (67 formulas)
0.75/1.05	
0.75/1.05	============================== end of input ==========================
0.75/1.05	
0.75/1.05	% From the command line: assign(max_seconds, 1200).
0.75/1.05	
0.75/1.05	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.75/1.05	
0.75/1.05	% Formulas that are not ordinary clauses:
0.75/1.05	1 (all X (ordered(cons(X,q_nil)) & ordered(snoc(q_nil,X)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	2 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	3 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	4 (all X all Y all Z m_Down(Z) != m_Ack(X,Y)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	5 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	6 (all X all Q X = head(cons(X,Q))) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	7 (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.75/1.05	8 (all Q (cons(head(Q),tail(Q)) = Q | q_nil = Q)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	9 (all X all Y (X != Y <-> m_Halt(X) != m_Halt(Y))) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	10 (all Pid all Pid2 (host(Pid2) != host(Pid) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	11 (all X all Y m_Down(X) != m_NotNorm(Y)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	12 (all X all Y (leq(Y,X) | leq(X,Y))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	13 (all P all Q (s(host(P)) = host(Q) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	14 (all X all Y (m_NormQ(Y) != m_NormQ(X) <-> X != Y)) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	15 (all X all Y all Z m_Halt(Z) != m_Ack(X,Y)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	16 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	17 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	18 (all X1 all X2 all Y1 all Y2 (Y2 != Y1 -> m_Ack(X1,Y1) != m_Ack(X2,Y2))) # label(axiom_32) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	19 (all X (pidElem(X) <-> (exists Y (X = m_Down(Y) | m_Halt(Y) = X)))) # label(axiom_48) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	20 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	21 (all X all Y (X = s(Y) | leq(X,Y) <-> leq(X,s(Y)))) # label(axiom_64) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	22 (all X pidMsg(m_Halt(X)) = X) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	23 (all Q all X all Y (ordered(cons(m_Halt(X),Q)) & host(X) = host(Y) & elem(m_Down(Y),Q) -> leq(X,Y))) # label(axiom_57) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	24 (all X all Y (m_NotNorm(X) != m_NotNorm(Y) <-> X != Y)) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	25 (all Y all Q last(snoc(Q,Y)) = Y) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	26 (all X all Y (X != Y <-> m_Ldr(Y) != m_Ldr(X))) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	27 (all X all Y all Q (elem(X,Q) | Y = X <-> elem(X,snoc(Q,Y)))) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	28 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	29 (all Q (Q = snoc(init(Q),last(Q)) | q_nil = Q)) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	30 (all X cons(X,q_nil) = snoc(q_nil,X)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	31 (all X all Y (X = Y <-> leq(X,Y) & leq(Y,X))) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	32 (all X all Y m_NormQ(X) != m_Halt(Y)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	33 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	34 (all X all Y all Z m_Ack(X,Y) != m_NotNorm(Z)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	35 (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.75/1.05	36 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	37 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	38 (all X all Y m_NotNorm(X) != m_Halt(Y)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	39 (all X all Y all Q (elem(X,cons(Y,Q)) <-> X = Y | elem(X,Q))) # label(axiom_46) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	40 (all X all Y m_NormQ(Y) != m_Down(X)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	41 (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.75/1.05	42 (all X all Y all Z m_NormQ(Z) != m_Ack(X,Y)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	43 (all X all Y (m_Down(Y) != m_Down(X) <-> Y != X)) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	44 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	45 (all Y all Q Q = init(snoc(Q,Y))) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	46 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	47 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	48 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	49 (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.75/1.05	50 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	51 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	52 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	53 (all X all Q (ordered(cons(X,Q)) <-> (all Y (elem(Y,Q) & pidElem(Y) & host(pidMsg(Y)) = host(pidMsg(X)) & pidElem(X) -> leq(pidMsg(X),pidMsg(Y)))) & ordered(Q))) # label(axiom_53) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	54 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	55 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	56 (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.75/1.05	57 (all X all Q ((all Y (elem(Y,Q) & pidElem(X) & host(pidMsg(Y)) = host(pidMsg(X)) & pidElem(Y) -> leq(pidMsg(Y),pidMsg(X)))) & ordered(Q) <-> ordered(snoc(Q,X)))) # label(axiom_54) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	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 (elem(m_Down(Pid0),queue(host(Z))) -> host(Pid0) != host(Z))) & (all Z all Pid0 (elem(m_Halt(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid20 all Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid20))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (setIn(Pid0,alive) & index(status,host(Pid0)) = elec_1 -> -elem(m_Ack(Pid0,Z),queue(host(Pid0))))) & (all Z all Pid20 all Pid0 (elem(m_Halt(Pid0),queue(host(Pid20))) & index(status,host(Pid0)) = elec_2 & setIn(Pid0,alive) & -leq(index(pendack,host(Pid0)),host(Z)) -> -(index(status,host(Z)) = norm & host(Z) = index(ldr,host(Z)) & setIn(Z,alive)))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid30) = host(Pid0) & index(status,host(Pid0)) = elec_1 & host(Pid0) = nbr_proc & elem(m_Down(Pid20),queue(host(Pid0))) & (all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> V0 = host(Pid20) | setIn(V0,index(down,host(Pid0))))) -> -(setIn(Z,alive) & elem(m_Down(Pid30),queue(host(Z)))))) & (all Z all Pid30 all Pid20 all Pid0 (setIn(Pid0,alive) & elem(m_Down(Pid20),queue(host(Pid0))) & leq(nbr_proc,s(index(pendack,host(Pid0)))) & index(status,host(Pid0)) = elec_2 & host(Pid30) = index(pendack,host(Pid0)) & s(index(pendack,host(Pid0))) = host(Pid20) & elem(m_Ack(Pid0,Pid30),queue(host(Pid0))) -> -(index(status,host(Z)) = norm & index(ldr,host(Z)) = host(Z) & setIn(Z,alive)))) & queue(host(X)) = cons(m_Ack(W,Y),V) & (all Z all Pid0 (-leq(host(Z),host(Pid0)) & index(status,host(Z)) = elec_2 & index(status,host(Pid0)) = elec_2 & setIn(Pid0,alive) & setIn(Z,alive) -> -leq(index(pendack,host(Z)),index(pendack,host(Pid0))))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & index(status,host(Pid0)) = elec_2 & index(status,host(Z)) = elec_2 & host(Pid20) = host(Pid0) & setIn(Z,alive) -> -elem(m_Ack(Z,Pid20),queue(host(Z))))) & (all Z all Pid0 (-leq(host(Z),host(Pid0)) & setIn(Z,alive) & elec_2 = index(status,host(Pid0)) & elec_2 = index(status,host(Z)) & setIn(Pid0,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid20) = host(Z) -> -(setIn(Z,alive) & index(ldr,host(Z)) = host(Z) & norm = index(status,host(Z))))) & (all Z ((elec_2 = index(status,host(Z)) | index(status,host(Z)) = elec_1) & setIn(Z,alive) -> index(elid,host(Z)) = Z)) & (all Z all Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid0))) & setIn(Pid0,alive) -> leq(host(Z),index(pendack,host(Pid0))))) & (all Z all Pid0 (Z != Pid0 & host(Z) = host(Pid0) -> -setIn(Pid0,alive) | -setIn(Z,alive))) -> (setIn(X,alive) -> (elec_2 = index(status,host(X)) & host(Y) = index(pendack,host(X)) & W = index(elid,host(X)) -> (-leq(nbr_proc,index(pendack,host(X))) -> (all Z all W0 all X0 all Y0 (s(index(pendack,host(X))) = host(Y0) -> (host(Y0) != host(X) -> (setIn(Y0,alive) & leq(nbr_proc,s(index(pendack,host(Y0)))) & elem(m_Down(X0),snoc(queue(host(Y0)),m_Halt(X))) & elem(m_Ack(Y0,W0),snoc(queue(host(Y0)),m_Halt(X))) & s(index(pendack,host(Y0))) = host(X0) & host(W0) = index(pendack,host(Y0)) & elec_2 = index(status,host(Y0)) -> -(index(ldr,host(Z)) = host(Z) & norm = index(status,host(Z)) & setIn(Z,alive))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.78/1.16	
0.78/1.16	============================== end of process non-clausal formulas ===
0.78/1.16	
0.78/1.16	============================== PROCESS INITIAL CLAUSES ===============
0.78/1.16	
0.78/1.16	============================== PREDICATE ELIMINATION =================
0.78/1.16	
0.78/1.16	============================== end predicate elimination =============
0.78/1.16	
0.78/1.16	Auto_denials:  (non-Horn, no changes).
0.78/1.16	
0.78/1.16	Term ordering decisions:
0.78/1.16	Function symbol KB weights:  alive=1. status=1. pendack=1. elec_2=1. q_nil=1. nbr_proc=1. elid=1. zero=1. elec_1=1. ldr=1. norm=1. pids=1. down=1. nil=1. setEmpty=1. wait=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. index=1. snoc=1. cons=1. m_Ack=1. f2=1. f3=1. host=1. pidMsg=1. s=1. m_Down=1. m_Halt=1. queue=1. m_Ldr=1. m_NormQ=1. m_NotNorm=1. head=1. init=1. last=1. tail=1. f1=1. f4=1.
0.78/1.16	
0.78/1.16	============================== end of process initial clauses ========
0.78/1.16	
0.78/1.16	============================== CLAUSES FOR SEARCH ====================
0.78/1.16	
0.78/1.16	============================== end of clauses for search =============
0.78/1.16	
0.78/1.16	============================== SEARCH ================================
0.78/1.16	
0.78/1.16	% Starting search at 0.04 seconds.
0.78/1.16	
0.78/1.16	============================== PROOF =================================
0.78/1.16	% SZS status Theorem
0.78/1.16	% SZS output start Refutation
0.78/1.16	
0.78/1.16	% Proof 1 at 0.12 (+ 0.00) seconds.
0.78/1.16	% Length of proof is 48.
0.78/1.16	% Level of proof is 10.
0.78/1.16	% Maximum clause weight is 66.000.
0.78/1.16	% Given clauses 265.
0.78/1.16	
0.78/1.16	15 (all X all Y all Z m_Halt(Z) != m_Ack(X,Y)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.78/1.16	27 (all X all Y all Q (elem(X,Q) | Y = X <-> elem(X,snoc(Q,Y)))) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
0.78/1.16	31 (all X all Y (X = Y <-> leq(X,Y) & leq(Y,X))) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.78/1.16	46 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.78/1.16	51 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.78/1.16	55 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.78/1.16	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 (elem(m_Down(Pid0),queue(host(Z))) -> host(Pid0) != host(Z))) & (all Z all Pid0 (elem(m_Halt(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid20 all Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid20))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (setIn(Pid0,alive) & index(status,host(Pid0)) = elec_1 -> -elem(m_Ack(Pid0,Z),queue(host(Pid0))))) & (all Z all Pid20 all Pid0 (elem(m_Halt(Pid0),queue(host(Pid20))) & index(status,host(Pid0)) = elec_2 & setIn(Pid0,alive) & -leq(index(pendack,host(Pid0)),host(Z)) -> -(index(status,host(Z)) = norm & host(Z) = index(ldr,host(Z)) & setIn(Z,alive)))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid30) = host(Pid0) & index(status,host(Pid0)) = elec_1 & host(Pid0) = nbr_proc & elem(m_Down(Pid20),queue(host(Pid0))) & (all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> V0 = host(Pid20) | setIn(V0,index(down,host(Pid0))))) -> -(setIn(Z,alive) & elem(m_Down(Pid30),queue(host(Z)))))) & (all Z all Pid30 all Pid20 all Pid0 (setIn(Pid0,alive) & elem(m_Down(Pid20),queue(host(Pid0))) & leq(nbr_proc,s(index(pendack,host(Pid0)))) & index(status,host(Pid0)) = elec_2 & host(Pid30) = index(pendack,host(Pid0)) & s(index(pendack,host(Pid0))) = host(Pid20) & elem(m_Ack(Pid0,Pid30),queue(host(Pid0))) -> -(index(status,host(Z)) = norm & index(ldr,host(Z)) = host(Z) & setIn(Z,alive)))) & queue(host(X)) = cons(m_Ack(W,Y),V) & (all Z all Pid0 (-leq(host(Z),host(Pid0)) & index(status,host(Z)) = elec_2 & index(status,host(Pid0)) = elec_2 & setIn(Pid0,alive) & setIn(Z,alive) -> -leq(index(pendack,host(Z)),index(pendack,host(Pid0))))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & index(status,host(Pid0)) = elec_2 & index(status,host(Z)) = elec_2 & host(Pid20) = host(Pid0) & setIn(Z,alive) -> -elem(m_Ack(Z,Pid20),queue(host(Z))))) & (all Z all Pid0 (-leq(host(Z),host(Pid0)) & setIn(Z,alive) & elec_2 = index(status,host(Pid0)) & elec_2 = index(status,host(Z)) & setIn(Pid0,alive) -> leq(index(pendack,host(Pid0)),host(Z)))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid20) = host(Z) -> -(setIn(Z,alive) & index(ldr,host(Z)) = host(Z) & norm = index(status,host(Z))))) & (all Z ((elec_2 = index(status,host(Z)) | index(status,host(Z)) = elec_1) & setIn(Z,alive) -> index(elid,host(Z)) = Z)) & (all Z all Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid0))) & setIn(Pid0,alive) -> leq(host(Z),index(pendack,host(Pid0))))) & (all Z all Pid0 (Z != Pid0 & host(Z) = host(Pid0) -> -setIn(Pid0,alive) | -setIn(Z,alive))) -> (setIn(X,alive) -> (elec_2 = index(status,host(X)) & host(Y) = index(pendack,host(X)) & W = index(elid,host(X)) -> (-leq(nbr_proc,index(pendack,host(X))) -> (all Z all W0 all X0 all Y0 (s(index(pendack,host(X))) = host(Y0) -> (host(Y0) != host(X) -> (setIn(Y0,alive) & leq(nbr_proc,s(index(pendack,host(Y0)))) & elem(m_Down(X0),snoc(queue(host(Y0)),m_Halt(X))) & elem(m_Ack(Y0,W0),snoc(queue(host(Y0)),m_Halt(X))) & s(index(pendack,host(Y0))) = host(X0) & host(W0) = index(pendack,host(Y0)) & elec_2 = index(status,host(Y0)) -> -(index(ldr,host(Z)) = host(Z) & norm = index(status,host(Z)) & setIn(Z,alive))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.78/1.16	82 m_Halt(A) != m_Ack(B,C) # label(axiom_11) # label(axiom).  [clausify(15)].
0.78/1.16	102 elem(A,B) | C = A | -elem(A,snoc(B,C)) # label(axiom_47) # label(axiom).  [clausify(27)].
0.78/1.16	111 A = B | -leq(B,A) | -leq(A,B) # label(axiom_61) # label(axiom).  [clausify(31)].
0.78/1.16	133 leq(host(A),nbr_proc) # label(axiom_04) # label(axiom).  [clausify(46)].
0.78/1.16	138 leq(A,A) # label(axiom_59) # label(axiom).  [clausify(51)].
0.78/1.16	150 m_Halt(A) != m_Down(B) # label(axiom_17) # label(axiom).  [clausify(55)].
0.78/1.16	171 -setIn(A,alive) | -elem(m_Down(B),queue(host(A))) | -leq(nbr_proc,s(index(pendack,host(A)))) | index(status,host(A)) != elec_2 | index(pendack,host(A)) != host(C) | host(B) != s(index(pendack,host(A))) | -elem(m_Ack(A,C),queue(host(A))) | index(status,host(D)) != norm | index(ldr,host(D)) != host(D) | -setIn(D,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.78/1.16	178 index(status,host(A)) != elec_2 | -setIn(A,alive) | index(elid,host(A)) = A # label(conj) # label(negated_conjecture).  [clausify(58)].
0.78/1.16	182 setIn(c3,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.78/1.16	183 index(status,host(c3)) = elec_2 # label(conj) # label(negated_conjecture).  [clausify(58)].
0.78/1.16	184 elec_2 = index(status,host(c3)).  [copy(183),flip(a)].
0.78/1.16	186 index(elid,host(c3)) = c2 # label(conj) # label(negated_conjecture).  [clausify(58)].
0.78/1.16	192 setIn(c8,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.78/1.16	193 leq(nbr_proc,s(index(pendack,host(c8)))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.78/1.16	194 elem(m_Down(c7),snoc(queue(host(c8)),m_Halt(c3))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.78/1.16	195 elem(m_Ack(c8,c6),snoc(queue(host(c8)),m_Halt(c3))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.78/1.16	196 host(c7) = s(index(pendack,host(c8))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.78/1.16	197 s(index(pendack,host(c8))) = host(c7).  [copy(196),flip(a)].
0.78/1.16	198 index(pendack,host(c8)) = host(c6) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.78/1.16	199 index(status,host(c8)) = elec_2 # label(conj) # label(negated_conjecture).  [clausify(58)].
0.78/1.16	200 index(status,host(c8)) = index(status,host(c3)).  [copy(199),rewrite([184(5)])].
0.78/1.16	201 index(ldr,host(c5)) = host(c5) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.78/1.16	202 index(status,host(c5)) = norm # label(conj) # label(negated_conjecture).  [clausify(58)].
0.78/1.16	203 norm = index(status,host(c5)).  [copy(202),flip(a)].
0.78/1.16	204 setIn(c5,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.78/1.16	208 index(status,host(c3)) != index(status,host(A)) | -setIn(A,alive) | index(elid,host(A)) = A.  [back_rewrite(178),rewrite([184(4)]),flip(a)].
0.78/1.16	212 -setIn(A,alive) | -elem(m_Down(B),queue(host(A))) | -leq(nbr_proc,s(index(pendack,host(A)))) | index(status,host(c3)) != index(status,host(A)) | index(pendack,host(A)) != host(C) | host(B) != s(index(pendack,host(A))) | -elem(m_Ack(A,C),queue(host(A))) | index(status,host(c5)) != index(status,host(D)) | index(ldr,host(D)) != host(D) | -setIn(D,alive).  [back_rewrite(171),rewrite([184(16),203(39)]),flip(d),flip(h)].
0.78/1.16	217 leq(nbr_proc,s(host(c6))).  [back_rewrite(193),rewrite([198(5)])].
0.78/1.16	218 s(host(c6)) = host(c7).  [back_rewrite(197),rewrite([198(4)])].
0.78/1.16	222 leq(nbr_proc,host(c7)).  [back_rewrite(217),rewrite([218(4)])].
0.78/1.16	328 elem(m_Down(c7),queue(host(c8))).  [resolve(194,a,102,c),unit_del(b,150)].
0.78/1.16	334 elem(m_Ack(c8,c6),queue(host(c8))).  [resolve(195,a,102,c),flip(b),unit_del(b(flip),82)].
0.78/1.16	344 c3 = c2.  [resolve(208,b,182,a),rewrite([186(13)]),flip(b),xx(a)].
0.78/1.16	369 -setIn(A,alive) | -elem(m_Down(B),queue(host(A))) | -leq(nbr_proc,s(index(pendack,host(A)))) | index(status,host(c2)) != index(status,host(A)) | index(pendack,host(A)) != host(C) | host(B) != s(index(pendack,host(A))) | -elem(m_Ack(A,C),queue(host(A))) | index(status,host(c5)) != index(status,host(D)) | index(ldr,host(D)) != host(D) | -setIn(D,alive).  [back_rewrite(212),rewrite([344(14)])].
0.78/1.16	377 index(status,host(c8)) = index(status,host(c2)).  [back_rewrite(200),rewrite([344(6)])].
0.78/1.16	396 host(c7) = nbr_proc.  [resolve(222,a,111,c),flip(a),unit_del(b,133)].
0.78/1.16	406 s(host(c6)) = nbr_proc.  [back_rewrite(218),rewrite([396(5)])].
0.78/1.16	751 -elem(m_Down(A),queue(host(c8))) | host(c6) != host(B) | host(A) != nbr_proc | -elem(m_Ack(c8,B),queue(host(c8))) | index(status,host(c5)) != index(status,host(C)) | index(ldr,host(C)) != host(C) | -setIn(C,alive).  [resolve(369,a,192,a),rewrite([198(10),406(9),377(16),198(21),198(26),406(25)]),xx(c),unit_del(b,138)].
0.78/1.16	760 -elem(m_Down(A),queue(host(c8))) | host(c6) != host(B) | host(A) != nbr_proc | -elem(m_Ack(c8,B),queue(host(c8))).  [resolve(751,g,204,a),rewrite([201(31)]),xx(e),xx(f)].
0.78/1.16	762 -elem(m_Down(A),queue(host(c8))) | host(A) != nbr_proc.  [resolve(760,d,334,a),xx(b)].
0.78/1.16	763 $F.  [resolve(762,a,328,a),rewrite([396(2)]),xx(a)].
0.78/1.16	
0.78/1.16	% SZS output end Refutation
0.78/1.16	============================== end of proof ==========================
0.78/1.16	
0.78/1.16	============================== STATISTICS ============================
0.78/1.16	
0.78/1.16	Given=265. Generated=2118. Kept=691. proofs=1.
0.78/1.16	Usable=241. Sos=368. Demods=29. Limbo=0, Disabled=215. Hints=0.
0.78/1.16	Megabytes=1.57.
0.78/1.16	User_CPU=0.12, System_CPU=0.00, Wall_clock=0.
0.78/1.16	
0.78/1.16	============================== end of statistics =====================
0.78/1.16	
0.78/1.16	============================== end of search =========================
0.78/1.16	
0.78/1.16	THEOREM PROVED
0.78/1.16	% SZS status Theorem
0.78/1.16	
0.78/1.16	Exiting with 1 proof.
0.78/1.16	
0.78/1.16	Process 20407 exit (max_proofs) Wed Jul 14 15:09:15 2021
0.78/1.16	Prover9 interrupted
0.78/1.16	EOF