0.05/0.09	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.05/0.09	% Command  : tptp2X_and_run_prover9 %d %s
0.09/0.30	% Computer : n026.cluster.edu
0.09/0.30	% Model    : x86_64 x86_64
0.09/0.30	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.30	% Memory   : 8042.1875MB
0.09/0.30	% OS       : Linux 3.10.0-693.el7.x86_64
0.09/0.30	% CPULimit : 1440
0.09/0.30	% WCLimit  : 180
0.09/0.30	% DateTime : Mon Jul  3 08:09:07 EDT 2023
0.09/0.30	% CPUTime  : 
0.74/1.06	============================== Prover9 ===============================
0.74/1.06	Prover9 (32) version 2009-11A, November 2009.
0.74/1.06	Process 30808 was started by sandbox on n026.cluster.edu,
0.74/1.06	Mon Jul  3 08:09:08 2023
0.74/1.06	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_30655_n026.cluster.edu".
0.74/1.06	============================== end of head ===========================
0.74/1.06	
0.74/1.06	============================== INPUT =================================
0.74/1.06	
0.74/1.06	% Reading from file /tmp/Prover9_30655_n026.cluster.edu
0.74/1.06	
0.74/1.06	set(prolog_style_variables).
0.74/1.06	set(auto2).
0.74/1.06	    % set(auto2) -> set(auto).
0.74/1.06	    % set(auto) -> set(auto_inference).
0.74/1.06	    % set(auto) -> set(auto_setup).
0.74/1.06	    % set(auto_setup) -> set(predicate_elim).
0.74/1.06	    % set(auto_setup) -> assign(eq_defs, unfold).
0.74/1.06	    % set(auto) -> set(auto_limits).
0.74/1.06	    % set(auto_limits) -> assign(max_weight, "100.000").
0.74/1.06	    % set(auto_limits) -> assign(sos_limit, 20000).
0.74/1.06	    % set(auto) -> set(auto_denials).
0.74/1.06	    % set(auto) -> set(auto_process).
0.74/1.06	    % set(auto2) -> assign(new_constants, 1).
0.74/1.06	    % set(auto2) -> assign(fold_denial_max, 3).
0.74/1.06	    % set(auto2) -> assign(max_weight, "200.000").
0.74/1.06	    % set(auto2) -> assign(max_hours, 1).
0.74/1.06	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.74/1.06	    % set(auto2) -> assign(max_seconds, 0).
0.74/1.06	    % set(auto2) -> assign(max_minutes, 5).
0.74/1.06	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.74/1.06	    % set(auto2) -> set(sort_initial_sos).
0.74/1.06	    % set(auto2) -> assign(sos_limit, -1).
0.74/1.06	    % set(auto2) -> assign(lrs_ticks, 3000).
0.74/1.06	    % set(auto2) -> assign(max_megs, 400).
0.74/1.06	    % set(auto2) -> assign(stats, some).
0.74/1.06	    % set(auto2) -> clear(echo_input).
0.74/1.06	    % set(auto2) -> set(quiet).
0.74/1.06	    % set(auto2) -> clear(print_initial_clauses).
0.74/1.06	    % set(auto2) -> clear(print_given).
0.74/1.06	assign(lrs_ticks,-1).
0.74/1.06	assign(sos_limit,10000).
0.74/1.06	assign(order,kbo).
0.74/1.06	set(lex_order_vars).
0.74/1.06	clear(print_given).
0.74/1.06	
0.74/1.06	% formulas(sos).  % not echoed (67 formulas)
0.74/1.06	
0.74/1.06	============================== end of input ==========================
0.74/1.06	
0.74/1.06	% From the command line: assign(max_seconds, 1440).
0.74/1.06	
0.74/1.06	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.74/1.06	
0.74/1.06	% Formulas that are not ordinary clauses:
0.74/1.06	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.74/1.06	2 (all X all Y (m_Ldr(X) != m_Ldr(Y) <-> X != Y)) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	3 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	4 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	5 (all X (ordered(cons(X,q_nil)) & ordered(snoc(q_nil,X)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	6 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	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.74/1.06	8 (all X all Y (X != Y <-> m_NormQ(X) != m_NormQ(Y))) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	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.74/1.06	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.74/1.06	11 (all X all Y all Z m_Halt(Z) != m_Ack(X,Y)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	12 (all X all Y all Z m_NotNorm(Z) != m_Ack(X,Y)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	13 (all X all Y all Z m_Ack(X,Y) != m_Down(Z)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	14 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	15 (all X all Y (Y = X <-> leq(Y,X) & leq(X,Y))) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	16 (all X all Q X = head(cons(X,Q))) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	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.74/1.06	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.74/1.06	19 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	20 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	21 (all X all Y m_NormQ(Y) != m_Ldr(X)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	22 (all X X = pidMsg(m_Halt(X))) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	23 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	24 (all Q (cons(head(Q),tail(Q)) = Q | Q = q_nil)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	25 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	26 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	27 (all P all Q (host(Q) = s(host(P)) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	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.74/1.06	29 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	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.74/1.06	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.74/1.06	32 (all X all Y (m_Halt(Y) != m_Halt(X) <-> Y != X)) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	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.74/1.06	34 (all Y all Q Q = init(snoc(Q,Y))) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	35 (all Q (Q = q_nil | snoc(init(Q),last(Q)) = Q)) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	36 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	37 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	38 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	39 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	40 (all X all Y (m_Down(X) != m_Down(Y) <-> X != Y)) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	41 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	42 (all Y all Q Y = last(snoc(Q,Y))) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	43 (all X all Y m_Ldr(X) != m_NotNorm(Y)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	44 (all X all Y (Y != X <-> m_NotNorm(X) != m_NotNorm(Y))) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	45 (all X all Y m_NotNorm(Y) != m_NormQ(X)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	46 (all X all Y m_Ldr(Y) != m_Down(X)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	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.74/1.06	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.74/1.06	49 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.74/1.06	50 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.74/1.07	51 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.74/1.07	52 (all X all Y all Z m_Ldr(Z) != m_Ack(X,Y)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.74/1.07	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.74/1.07	54 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.74/1.07	55 (all X all Y m_NormQ(Y) != m_Down(X)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.74/1.07	56 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.74/1.07	57 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.74/1.07	58 -(all V all W all X ((all Y all Z (elem(m_Down(Z),queue(host(Y))) -> host(Z) != host(Y))) & (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_Ack(Z,Y),queue(host(Z))) & setIn(Z,alive) -> leq(host(Y),index(pendack,host(Z))))) & (all Y (setIn(Y,alive) & (index(status,host(Y)) = elec_1 | elec_2 = index(status,host(Y))) -> index(elid,host(Y)) = Y)) & (all Y all Z (-leq(host(Y),host(Z)) & setIn(Y,alive) & index(status,host(Y)) = elec_2 & elec_2 = index(status,host(Z)) & setIn(Z,alive) -> leq(index(pendack,host(Z)),host(Y)))) & (all Y all Z all Pid0 (setIn(Pid0,alive) & elem(m_Down(Z),queue(host(Pid0))) & host(Y) = host(Z) -> -(setIn(Y,alive) & index(status,host(Y)) = norm & host(Y) = index(ldr,host(Y))))) & (all Y all Z (-leq(host(Y),host(Z)) & setIn(Y,alive) & setIn(Z,alive) & elec_2 = index(status,host(Y)) & index(status,host(Z)) = elec_2 -> -leq(index(pendack,host(Y)),index(pendack,host(Z))))) & (all Y all Z all Pid20 all Pid0 (elem(m_Down(Pid20),queue(host(Pid0))) & leq(nbr_proc,s(index(pendack,host(Pid0)))) & host(Pid20) = s(index(pendack,host(Pid0))) & host(Z) = index(pendack,host(Pid0)) & elec_2 = index(status,host(Pid0)) & elem(m_Ack(Pid0,Z),queue(host(Pid0))) & setIn(Pid0,alive) -> -(index(ldr,host(Y)) = host(Y) & norm = index(status,host(Y)) & setIn(Y,alive)))) & queue(host(X)) = cons(m_NormQ(W),V) & (all Y all Z all Pid20 all Pid0 (index(status,host(Pid0)) = elec_1 & nbr_proc = host(Pid0) & host(Z) = 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)) -> -(setIn(Y,alive) & elem(m_Down(Z),queue(host(Y)))))) & (all Y all Z all Pid0 (elem(m_Halt(Pid0),queue(host(Z))) & index(status,host(Pid0)) = elec_2 & setIn(Pid0,alive) & -leq(index(pendack,host(Pid0)),host(Y)) -> -(index(status,host(Y)) = norm & host(Y) = index(ldr,host(Y)) & setIn(Y,alive)))) & (all Y all Z all Pid0 (setIn(Pid0,alive) & index(status,host(Y)) = elec_2 & elec_2 = index(status,host(Pid0)) & host(Pid0) = host(Z) & setIn(Y,alive) -> -elem(m_Ack(Y,Z),queue(host(Y))))) & (all Y all Z (setIn(Z,alive) & elec_1 = index(status,host(Z)) -> -elem(m_Ack(Z,Y),queue(host(Z))))) & (all Y all Z (host(Z) = host(Y) & Z != Y -> -setIn(Y,alive) | -setIn(Z,alive))) & (all Y all Z (elem(m_Halt(Z),queue(host(Y))) -> -leq(host(Y),host(Z)))) & (all Y all Z (elem(m_Ldr(Z),queue(host(Y))) -> -leq(host(Y),host(Z)))) -> (setIn(X,alive) -> (index(status,host(X)) != norm -> (all Y all Z all X0 all Y0 (host(Y0) = host(W) -> (host(Y0) = host(X) -> (setIn(Y0,alive) & elem(m_Ack(Y0,Z),snoc(V,m_NotNorm(W))) & host(X0) = s(index(pendack,host(Y0))) & index(pendack,host(Y0)) = host(Z) & elec_2 = index(status,host(Y0)) & leq(nbr_proc,s(index(pendack,host(Y0)))) & elem(m_Down(X0),snoc(V,m_NotNorm(W))) -> -(host(Y) = index(ldr,host(Y)) & norm = index(status,host(Y)) & setIn(Y,alive)))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.74/1.07	
0.74/1.07	============================== end of process non-clausal formulas ===
0.74/1.07	
0.74/1.07	============================== PROCESS INITIAL CLAUSES ===============
0.74/1.07	
0.74/1.07	============================== PREDICATE ELIMINATION =================
0.85/1.16	
0.85/1.16	============================== end predicate elimination =============
0.85/1.16	
0.85/1.16	Auto_denials:  (non-Horn, no changes).
0.85/1.16	
0.85/1.16	Term ordering decisions:
0.85/1.16	Function symbol KB weights:  alive=1. status=1. pendack=1. elec_2=1. q_nil=1. nbr_proc=1. zero=1. elec_1=1. elid=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. index=1. snoc=1. cons=1. m_Ack=1. f1=1. f2=1. host=1. pidMsg=1. s=1. m_Down=1. m_Halt=1. queue=1. m_NotNorm=1. m_Ldr=1. m_NormQ=1. head=1. init=1. last=1. tail=1. f3=1. f4=1.
0.85/1.16	
0.85/1.16	============================== end of process initial clauses ========
0.85/1.16	
0.85/1.16	============================== CLAUSES FOR SEARCH ====================
0.85/1.16	
0.85/1.16	============================== end of clauses for search =============
0.85/1.16	
0.85/1.16	============================== SEARCH ================================
0.85/1.16	
0.85/1.16	% Starting search at 0.03 seconds.
0.85/1.16	
0.85/1.16	============================== PROOF =================================
0.85/1.16	% SZS status Theorem
0.85/1.16	% SZS output start Refutation
0.85/1.16	
0.85/1.16	% Proof 1 at 0.10 (+ 0.00) seconds.
0.85/1.16	% Length of proof is 56.
0.85/1.16	% Level of proof is 9.
0.85/1.16	% Maximum clause weight is 66.000.
0.85/1.16	% Given clauses 273.
0.85/1.16	
0.85/1.16	12 (all X all Y all Z m_NotNorm(Z) != m_Ack(X,Y)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.85/1.16	15 (all X all Y (Y = X <-> leq(Y,X) & leq(X,Y))) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.85/1.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].
0.85/1.16	36 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.85/1.16	41 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.85/1.16	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.85/1.16	58 -(all V all W all X ((all Y all Z (elem(m_Down(Z),queue(host(Y))) -> host(Z) != host(Y))) & (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_Ack(Z,Y),queue(host(Z))) & setIn(Z,alive) -> leq(host(Y),index(pendack,host(Z))))) & (all Y (setIn(Y,alive) & (index(status,host(Y)) = elec_1 | elec_2 = index(status,host(Y))) -> index(elid,host(Y)) = Y)) & (all Y all Z (-leq(host(Y),host(Z)) & setIn(Y,alive) & index(status,host(Y)) = elec_2 & elec_2 = index(status,host(Z)) & setIn(Z,alive) -> leq(index(pendack,host(Z)),host(Y)))) & (all Y all Z all Pid0 (setIn(Pid0,alive) & elem(m_Down(Z),queue(host(Pid0))) & host(Y) = host(Z) -> -(setIn(Y,alive) & index(status,host(Y)) = norm & host(Y) = index(ldr,host(Y))))) & (all Y all Z (-leq(host(Y),host(Z)) & setIn(Y,alive) & setIn(Z,alive) & elec_2 = index(status,host(Y)) & index(status,host(Z)) = elec_2 -> -leq(index(pendack,host(Y)),index(pendack,host(Z))))) & (all Y all Z all Pid20 all Pid0 (elem(m_Down(Pid20),queue(host(Pid0))) & leq(nbr_proc,s(index(pendack,host(Pid0)))) & host(Pid20) = s(index(pendack,host(Pid0))) & host(Z) = index(pendack,host(Pid0)) & elec_2 = index(status,host(Pid0)) & elem(m_Ack(Pid0,Z),queue(host(Pid0))) & setIn(Pid0,alive) -> -(index(ldr,host(Y)) = host(Y) & norm = index(status,host(Y)) & setIn(Y,alive)))) & queue(host(X)) = cons(m_NormQ(W),V) & (all Y all Z all Pid20 all Pid0 (index(status,host(Pid0)) = elec_1 & nbr_proc = host(Pid0) & host(Z) = 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)) -> -(setIn(Y,alive) & elem(m_Down(Z),queue(host(Y)))))) & (all Y all Z all Pid0 (elem(m_Halt(Pid0),queue(host(Z))) & index(status,host(Pid0)) = elec_2 & setIn(Pid0,alive) & -leq(index(pendack,host(Pid0)),host(Y)) -> -(index(status,host(Y)) = norm & host(Y) = index(ldr,host(Y)) & setIn(Y,alive)))) & (all Y all Z all Pid0 (setIn(Pid0,alive) & index(status,host(Y)) = elec_2 & elec_2 = index(status,host(Pid0)) & host(Pid0) = host(Z) & setIn(Y,alive) -> -elem(m_Ack(Y,Z),queue(host(Y))))) & (all Y all Z (setIn(Z,alive) & elec_1 = index(status,host(Z)) -> -elem(m_Ack(Z,Y),queue(host(Z))))) & (all Y all Z (host(Z) = host(Y) & Z != Y -> -setIn(Y,alive) | -setIn(Z,alive))) & (all Y all Z (elem(m_Halt(Z),queue(host(Y))) -> -leq(host(Y),host(Z)))) & (all Y all Z (elem(m_Ldr(Z),queue(host(Y))) -> -leq(host(Y),host(Z)))) -> (setIn(X,alive) -> (index(status,host(X)) != norm -> (all Y all Z all X0 all Y0 (host(Y0) = host(W) -> (host(Y0) = host(X) -> (setIn(Y0,alive) & elem(m_Ack(Y0,Z),snoc(V,m_NotNorm(W))) & host(X0) = s(index(pendack,host(Y0))) & index(pendack,host(Y0)) = host(Z) & elec_2 = index(status,host(Y0)) & leq(nbr_proc,s(index(pendack,host(Y0)))) & elem(m_Down(X0),snoc(V,m_NotNorm(W))) -> -(host(Y) = index(ldr,host(Y)) & norm = index(status,host(Y)) & setIn(Y,alive)))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.85/1.16	81 m_NotNorm(A) != m_Ack(B,C) # label(axiom_13) # label(axiom).  [clausify(12)].
0.85/1.16	88 A = B | -leq(A,B) | -leq(B,A) # label(axiom_61) # label(axiom).  [clausify(15)].
0.85/1.16	111 -elem(A,B) | elem(A,cons(C,B)) # label(axiom_46) # label(axiom).  [clausify(30)].
0.85/1.16	121 leq(host(A),nbr_proc) # label(axiom_04) # label(axiom).  [clausify(36)].
0.85/1.16	129 m_NotNorm(A) != m_Down(B) # label(axiom_19) # label(axiom).  [clausify(41)].
0.85/1.16	138 A = B | elem(B,C) | -elem(B,snoc(C,A)) # label(axiom_47) # label(axiom).  [clausify(47)].
0.85/1.16	159 -setIn(A,alive) | index(status,host(A)) != elec_2 | index(elid,host(A)) = A # label(conj) # label(negated_conjecture).  [clausify(58)].
0.85/1.16	163 -elem(m_Down(A),queue(host(B))) | -leq(nbr_proc,s(index(pendack,host(B)))) | s(index(pendack,host(B))) != host(A) | index(pendack,host(B)) != host(C) | index(status,host(B)) != elec_2 | -elem(m_Ack(B,C),queue(host(B))) | -setIn(B,alive) | index(ldr,host(D)) != host(D) | index(status,host(D)) != norm | -setIn(D,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.85/1.16	164 queue(host(c3)) = cons(m_NormQ(c2),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.85/1.16	165 cons(m_NormQ(c2),c1) = queue(host(c3)).  [copy(164),flip(a)].
0.85/1.16	177 setIn(c3,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.85/1.16	179 host(c7) = host(c2) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.85/1.16	180 host(c7) = host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.85/1.16	181 host(c3) = host(c2).  [copy(180),rewrite([179(2)]),flip(a)].
0.85/1.16	182 setIn(c7,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.85/1.16	183 elem(m_Ack(c7,c5),snoc(c1,m_NotNorm(c2))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.85/1.16	184 s(index(pendack,host(c7))) = host(c6) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.85/1.16	185 s(index(pendack,host(c2))) = host(c6).  [copy(184),rewrite([179(3)])].
0.85/1.16	186 index(pendack,host(c7)) = host(c5) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.85/1.16	187 index(pendack,host(c2)) = host(c5).  [copy(186),rewrite([179(3)])].
0.85/1.16	188 index(status,host(c7)) = elec_2 # label(conj) # label(negated_conjecture).  [clausify(58)].
0.85/1.16	189 elec_2 = index(status,host(c2)).  [copy(188),rewrite([179(3)]),flip(a)].
0.85/1.16	190 leq(nbr_proc,s(index(pendack,host(c7)))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.85/1.16	191 leq(nbr_proc,s(host(c5))).  [copy(190),rewrite([179(4),187(5)])].
0.85/1.16	192 elem(m_Down(c6),snoc(c1,m_NotNorm(c2))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.85/1.16	193 index(ldr,host(c4)) = host(c4) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.85/1.16	194 index(status,host(c4)) = norm # label(conj) # label(negated_conjecture).  [clausify(58)].
0.85/1.16	195 norm = index(status,host(c4)).  [copy(194),flip(a)].
0.85/1.16	196 setIn(c4,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.85/1.16	205 cons(m_NormQ(c2),c1) = queue(host(c2)).  [back_rewrite(165),rewrite([181(6)])].
0.85/1.16	206 s(host(c5)) = host(c6).  [back_rewrite(185),rewrite([187(4)])].
0.85/1.16	209 -elem(m_Down(A),queue(host(B))) | -leq(nbr_proc,s(index(pendack,host(B)))) | s(index(pendack,host(B))) != host(A) | index(pendack,host(B)) != host(C) | index(status,host(c2)) != index(status,host(B)) | -elem(m_Ack(B,C),queue(host(B))) | -setIn(B,alive) | index(ldr,host(D)) != host(D) | index(status,host(c4)) != index(status,host(D)) | -setIn(D,alive).  [back_rewrite(163),rewrite([189(25),195(44)]),flip(e),flip(i)].
0.85/1.16	212 -setIn(A,alive) | index(status,host(c2)) != index(status,host(A)) | index(elid,host(A)) = A.  [back_rewrite(159),rewrite([189(6)]),flip(b)].
0.85/1.16	218 leq(nbr_proc,host(c6)).  [back_rewrite(191),rewrite([206(4)])].
0.85/1.16	316 elem(m_Ack(c7,c5),c1).  [resolve(183,a,138,c),flip(a),unit_del(a(flip),81)].
0.85/1.16	321 elem(m_Down(c6),c1).  [resolve(192,a,138,c),unit_del(a,129)].
0.85/1.16	352 -elem(m_Down(A),queue(host(c2))) | host(c6) != host(A) | host(c5) != host(B) | -elem(m_Ack(c3,B),queue(host(c2))) | index(ldr,host(C)) != host(C) | index(status,host(c4)) != index(status,host(C)) | -setIn(C,alive).  [resolve(209,g,177,a),rewrite([181(3),181(9),187(10),206(9),181(12),187(13),206(12),181(16),187(17),181(24),181(30)]),xx(e),unit_del(b,218)].
0.85/1.16	358 index(elid,host(c2)) = c7.  [resolve(212,a,182,a),rewrite([179(7),179(12)]),xx(a)].
0.85/1.16	359 c7 = c3.  [resolve(212,a,177,a),rewrite([181(7),181(12),358(13)]),xx(a)].
0.85/1.16	365 elem(m_Ack(c3,c5),c1).  [back_rewrite(316),rewrite([359(1)])].
0.85/1.16	372 host(c6) = nbr_proc.  [resolve(218,a,88,c),unit_del(b,121)].
0.85/1.16	373 -elem(m_Down(A),queue(host(c2))) | host(A) != nbr_proc | host(c5) != host(B) | -elem(m_Ack(c3,B),queue(host(c2))) | index(ldr,host(C)) != host(C) | index(status,host(c4)) != index(status,host(C)) | -setIn(C,alive).  [back_rewrite(352),rewrite([372(7)]),flip(b)].
0.85/1.16	401 elem(m_Down(c6),cons(A,c1)).  [resolve(321,a,111,a)].
0.85/1.16	460 elem(m_Ack(c3,c5),cons(A,c1)).  [resolve(365,a,111,a)].
0.85/1.16	519 elem(m_Down(c6),queue(host(c2))).  [para(205(a,1),401(a,2))].
0.85/1.16	522 -elem(m_Down(A),queue(host(c2))) | host(A) != nbr_proc | host(c5) != host(B) | -elem(m_Ack(c3,B),queue(host(c2))).  [resolve(373,g,196,a),rewrite([193(22)]),xx(e),xx(f)].
0.85/1.16	562 host(c5) != host(A) | -elem(m_Ack(c3,A),queue(host(c2))).  [resolve(519,a,522,a),rewrite([372(2)]),xx(a)].
0.85/1.16	679 elem(m_Ack(c3,c5),queue(host(c2))).  [para(205(a,1),460(a,2))].
0.85/1.16	805 $F.  [resolve(679,a,562,b),xx(a)].
0.85/1.16	
0.85/1.16	% SZS output end Refutation
0.85/1.16	============================== end of proof ==========================
0.85/1.16	
0.85/1.16	============================== STATISTICS ============================
0.85/1.16	
0.85/1.16	Given=273. Generated=2126. Kept=736. proofs=1.
0.85/1.16	Usable=261. Sos=406. Demods=26. Limbo=0, Disabled=199. Hints=0.
0.85/1.16	Megabytes=1.53.
0.85/1.16	User_CPU=0.11, System_CPU=0.00, Wall_clock=0.
0.85/1.16	
0.85/1.16	============================== end of statistics =====================
0.85/1.16	
0.85/1.16	============================== end of search =========================
0.85/1.16	
0.85/1.16	THEOREM PROVED
0.85/1.16	% SZS status Theorem
0.85/1.16	
0.85/1.16	Exiting with 1 proof.
0.85/1.16	
0.85/1.16	Process 30808 exit (max_proofs) Mon Jul  3 08:09:08 2023
0.85/1.16	Prover9 interrupted
0.85/1.16	EOF