0.02/0.09	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.02/0.09	% Command  : tptp2X_and_run_prover9 %d %s
0.09/0.29	% Computer : n018.cluster.edu
0.09/0.29	% Model    : x86_64 x86_64
0.09/0.29	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.29	% Memory   : 8042.1875MB
0.09/0.29	% OS       : Linux 3.10.0-693.el7.x86_64
0.09/0.29	% CPULimit : 960
0.09/0.29	% WCLimit  : 120
0.09/0.29	% DateTime : Tue Aug  9 05:47:00 EDT 2022
0.09/0.29	% CPUTime  : 
0.73/1.02	============================== Prover9 ===============================
0.73/1.02	Prover9 (32) version 2009-11A, November 2009.
0.73/1.02	Process 10099 was started by sandbox on n018.cluster.edu,
0.73/1.02	Tue Aug  9 05:47:01 2022
0.73/1.02	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_9946_n018.cluster.edu".
0.73/1.02	============================== end of head ===========================
0.73/1.02	
0.73/1.02	============================== INPUT =================================
0.73/1.02	
0.73/1.02	% Reading from file /tmp/Prover9_9946_n018.cluster.edu
0.73/1.02	
0.73/1.02	set(prolog_style_variables).
0.73/1.02	set(auto2).
0.73/1.02	    % set(auto2) -> set(auto).
0.73/1.02	    % set(auto) -> set(auto_inference).
0.73/1.02	    % set(auto) -> set(auto_setup).
0.73/1.02	    % set(auto_setup) -> set(predicate_elim).
0.73/1.02	    % set(auto_setup) -> assign(eq_defs, unfold).
0.73/1.02	    % set(auto) -> set(auto_limits).
0.73/1.02	    % set(auto_limits) -> assign(max_weight, "100.000").
0.73/1.02	    % set(auto_limits) -> assign(sos_limit, 20000).
0.73/1.02	    % set(auto) -> set(auto_denials).
0.73/1.02	    % set(auto) -> set(auto_process).
0.73/1.02	    % set(auto2) -> assign(new_constants, 1).
0.73/1.02	    % set(auto2) -> assign(fold_denial_max, 3).
0.73/1.02	    % set(auto2) -> assign(max_weight, "200.000").
0.73/1.02	    % set(auto2) -> assign(max_hours, 1).
0.73/1.02	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.73/1.02	    % set(auto2) -> assign(max_seconds, 0).
0.73/1.02	    % set(auto2) -> assign(max_minutes, 5).
0.73/1.02	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.73/1.02	    % set(auto2) -> set(sort_initial_sos).
0.73/1.02	    % set(auto2) -> assign(sos_limit, -1).
0.73/1.02	    % set(auto2) -> assign(lrs_ticks, 3000).
0.73/1.02	    % set(auto2) -> assign(max_megs, 400).
0.73/1.02	    % set(auto2) -> assign(stats, some).
0.73/1.02	    % set(auto2) -> clear(echo_input).
0.73/1.02	    % set(auto2) -> set(quiet).
0.73/1.02	    % set(auto2) -> clear(print_initial_clauses).
0.73/1.02	    % set(auto2) -> clear(print_given).
0.73/1.02	assign(lrs_ticks,-1).
0.73/1.02	assign(sos_limit,10000).
0.73/1.02	assign(order,kbo).
0.73/1.02	set(lex_order_vars).
0.73/1.02	clear(print_given).
0.73/1.02	
0.73/1.02	% formulas(sos).  % not echoed (67 formulas)
0.73/1.02	
0.73/1.02	============================== end of input ==========================
0.73/1.02	
0.73/1.02	% From the command line: assign(max_seconds, 960).
0.73/1.02	
0.73/1.02	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.73/1.02	
0.73/1.02	% Formulas that are not ordinary clauses:
0.73/1.02	1 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	2 (all X X = pidMsg(m_Halt(X))) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	3 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	4 (all X1 all X2 all Y1 all Y2 (Y1 != Y2 -> m_Ack(X1,Y1) != m_Ack(X2,Y2))) # label(axiom_32) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	5 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	6 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	7 (all X all Y all Q (elem(X,Q) | Y = X <-> elem(X,cons(Y,Q)))) # label(axiom_46) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	8 (all X all Y all Q snoc(cons(X,Q),Y) = cons(X,snoc(Q,Y))) # label(axiom_44) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	9 (all Pid all Pid2 (elem(m_Ack(Pid,Pid2),queue(host(Pid))) -> setIn(Pid2,pids) & setIn(Pid,pids))) # label(axiom) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	10 (all X all Y (leq(X,s(Y)) <-> s(Y) = X | leq(X,Y))) # label(axiom_64) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	11 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	12 (all X ((exists Y (m_Halt(Y) = X | m_Down(Y) = X)) <-> pidElem(X))) # label(axiom_48) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	13 (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.73/1.02	14 (all X all Y m_NotNorm(Y) != m_NormQ(X)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	15 (all X all Y all Z m_NotNorm(Z) != m_Ack(X,Y)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	16 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	17 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid2 != Pid)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	18 (all P all Q (host(Q) = s(host(P)) -> host(Q) != host(P))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	19 (all X all Y all Q (elem(X,Q) | X = Y <-> elem(X,snoc(Q,Y)))) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	20 (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.73/1.02	21 (all X all Y (leq(X,Y) <-> leq(s(X),s(Y)))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	22 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	23 (all X all Y (Y != X <-> m_Halt(X) != m_Halt(Y))) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	24 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	25 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	26 (all X all Y all Z m_Down(Z) != m_Ack(X,Y)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	27 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	28 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	29 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	30 (all X all Y all Z m_Ack(X,Y) != m_Halt(Z)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	31 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	32 (all X all Y m_Ldr(Y) != m_Down(X)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	33 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	34 (all X all Y m_NormQ(Y) != m_Down(X)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	35 (all X all Q (ordered(cons(X,Q)) <-> (all Y (pidElem(X) & pidElem(Y) & host(pidMsg(Y)) = host(pidMsg(X)) & elem(Y,Q) -> leq(pidMsg(X),pidMsg(Y)))) & ordered(Q))) # label(axiom_53) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	36 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	37 (all X all Q (ordered(snoc(Q,X)) <-> (all Y (elem(Y,Q) & pidElem(Y) & host(pidMsg(X)) = host(pidMsg(Y)) & pidElem(X) -> leq(pidMsg(Y),pidMsg(X)))) & ordered(Q))) # label(axiom_54) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	38 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	39 (all X all Y (X != Y <-> m_NormQ(Y) != m_NormQ(X))) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	40 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	41 (all X all Y m_Halt(Y) != m_Ldr(X)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	42 (all Q (cons(head(Q),tail(Q)) = Q | Q = q_nil)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	43 (all X all Q X = head(cons(X,Q))) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	44 (all Q (Q = q_nil | snoc(init(Q),last(Q)) = Q)) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	45 (all Y all Q Y = last(snoc(Q,Y))) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	46 (all X all Y (m_NotNorm(Y) != m_NotNorm(X) <-> Y != X)) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	47 (all X (ordered(snoc(q_nil,X)) & ordered(cons(X,q_nil)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	48 (all X1 all X2 all Y1 all Y2 (X2 != X1 -> m_Ack(X2,Y2) != m_Ack(X1,Y1))) # label(axiom_31) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	49 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	50 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	51 (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.73/1.03	52 (all X all Y (X != Y <-> m_Down(Y) != m_Down(X))) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	53 (all X all Y m_Halt(Y) != m_Down(X)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	54 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	55 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	56 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	57 (all X all Y (m_Ldr(X) != m_Ldr(Y) <-> Y != X)) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	58 -(all V all W all X all Y ((all Z all Pid0 (Pid0 != Z & host(Pid0) = host(Z) -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (all Z (setIn(Z,alive) & (elec_1 = index(status,host(Z)) | elec_2 = index(status,host(Z))) -> Z = index(elid,host(Z)))) & (all Z all Pid30 all Pid20 all Pid0 ((all V0 (leq(s(zero),V0) & -leq(host(Pid0),V0) -> host(Pid20) = V0 | setIn(V0,index(down,host(Pid0))))) & elem(m_Down(Pid20),queue(host(Pid0))) & nbr_proc = host(Pid0) & index(status,host(Pid0)) = elec_1 & host(Pid30) = host(Pid0) -> -(elem(m_Down(Pid30),queue(host(Z))) & setIn(Z,alive)))) & cons(m_Ack(W,Y),V) = queue(host(X)) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) = host(Pid0) & host(Z) = host(Pid30) & setIn(Pid20,alive) & setIn(Z,alive) & host(Z) != host(Pid20) -> -(setIn(host(Pid30),index(down,host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) != host(Z) & setIn(Z,alive) & host(Z) = host(Pid30) & host(Pid0) = host(Pid20) & setIn(Pid20,alive) -> -(elem(m_Down(Pid0),queue(host(Z))) & elem(m_Down(Pid30),queue(host(Pid20)))))) & (all Z all Pid20 all Pid0 (host(Pid0) = host(Z) & host(index(elid,host(Pid0))) = host(Pid20) & wait = index(status,host(Pid0)) & setIn(Pid0,alive) & host(Pid20) != host(Pid0) -> -elem(m_Down(Z),queue(host(Pid20))))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & index(status,host(Pid0)) = norm & index(ldr,host(Pid0)) = host(Pid20) & host(Pid0) = host(Z) & host(Pid0) != host(Pid20) -> -elem(m_Down(Z),queue(host(Pid20))))) & (all Z all Pid0 (nbr_proc = host(Pid0) -> -elem(m_NotNorm(Z),queue(host(Pid0))))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Pid0) != host(Z))) & (all Z all Pid0 (elem(m_Ldr(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) -> (setIn(X,alive) -> (index(status,host(X)) = elec_2 & index(pendack,host(X)) = host(Y) & index(elid,host(X)) = W -> (-leq(nbr_proc,index(pendack,host(X))) -> (all Z (s(index(pendack,host(X))) = host(Z) -> (host(Z) = host(X) -> (all W0 all X0 all Y0 (s(index(pendack,host(X))) != host(Y0) -> (host(X) != host(Y0) -> (elem(m_Down(X0),queue(host(Y0))) & host(Y0) = host(W0) & elec_1 = index(status,host(Y0)) & host(Y0) = nbr_proc & (all V0 (-leq(host(Y0),V0) & leq(s(zero),V0) -> V0 = host(X0) | setIn(V0,index(down,host(Y0))))) -> -(elem(m_Down(W0),snoc(V,m_Halt(X))) & setIn(Z,alive)))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.73/1.03	
0.73/1.03	============================== end of process non-clausal formulas ===
0.73/1.03	
0.73/1.03	============================== PROCESS INITIAL CLAUSES ===============
0.73/1.03	
0.73/1.03	============================== PREDICATE ELIMINATION =================
0.73/1.03	
0.73/1.03	============================== end predicate elimination =============
0.73/1.03	
0.73/1.03	Auto_denials:  (non-Horn, no changes).
0.73/1.03	
0.73/1.03	Term ordering decisions:
0.73/1.03	Function symbol KB weights:  alive=1. q_nil=1. status=1. elid=1. nbr_proc=1. zero=1. elec_1=1. down=1. elec_2=1. pendack=1. pids=1. ldr=1. norm=1. wait=1. nil=1. setEmpty=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. snoc=1. cons=1. index=1. m_Ack=1. f2=1. f3=1. host=1. pidMsg=1. m_Down=1. s=1. queue=1. m_Halt=1. m_Ldr=1. m_NormQ=1. m_NotNorm=1. head=1. init=1. last=1. tail=1. f1=1. f4=1.
0.73/1.03	
0.73/1.03	============================== end of process initial clauses ========
39.42/39.80	
39.42/39.80	============================== CLAUSES FOR SEARCH ====================
39.42/39.80	
39.42/39.80	============================== end of clauses for search =============
39.42/39.80	
39.42/39.80	============================== SEARCH ================================
39.42/39.80	
39.42/39.80	% Starting search at 0.02 seconds.
39.42/39.80	
39.42/39.80	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 70 (0.00 of 0.45 sec).
39.42/39.80	
39.42/39.80	Low Water (keep): wt=47.000, iters=3386
39.42/39.80	
39.42/39.80	Low Water (keep): wt=35.000, iters=3353
39.42/39.80	
39.42/39.80	Low Water (keep): wt=32.000, iters=3381
39.42/39.80	
39.42/39.80	Low Water (keep): wt=31.000, iters=3394
39.42/39.80	
39.42/39.80	Low Water (keep): wt=28.000, iters=3348
39.42/39.80	
39.42/39.80	Low Water (keep): wt=27.000, iters=3356
39.42/39.80	
39.42/39.80	Low Water (keep): wt=26.000, iters=3342
39.42/39.80	
39.42/39.80	Low Water (keep): wt=25.000, iters=3370
39.42/39.80	
39.42/39.80	Low Water (keep): wt=23.000, iters=3333
39.42/39.80	
39.42/39.80	Low Water (keep): wt=16.000, iters=4348
39.42/39.80	
39.42/39.80	Low Water (keep): wt=15.000, iters=3502
39.42/39.80	
39.42/39.80	============================== PROOF =================================
39.42/39.80	% SZS status Theorem
39.42/39.80	% SZS output start Refutation
39.42/39.80	
39.42/39.80	% Proof 1 at 37.28 (+ 1.43) seconds.
39.42/39.80	% Length of proof is 54.
39.42/39.80	% Level of proof is 11.
39.42/39.80	% Maximum clause weight is 40.000.
39.42/39.80	% Given clauses 4901.
39.42/39.80	
39.42/39.80	7 (all X all Y all Q (elem(X,Q) | Y = X <-> elem(X,cons(Y,Q)))) # label(axiom_46) # label(axiom) # label(non_clause).  [assumption].
39.42/39.80	19 (all X all Y all Q (elem(X,Q) | X = Y <-> elem(X,snoc(Q,Y)))) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
39.42/39.80	53 (all X all Y m_Halt(Y) != m_Down(X)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
39.42/39.80	58 -(all V all W all X all Y ((all Z all Pid0 (Pid0 != Z & host(Pid0) = host(Z) -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (all Z (setIn(Z,alive) & (elec_1 = index(status,host(Z)) | elec_2 = index(status,host(Z))) -> Z = index(elid,host(Z)))) & (all Z all Pid30 all Pid20 all Pid0 ((all V0 (leq(s(zero),V0) & -leq(host(Pid0),V0) -> host(Pid20) = V0 | setIn(V0,index(down,host(Pid0))))) & elem(m_Down(Pid20),queue(host(Pid0))) & nbr_proc = host(Pid0) & index(status,host(Pid0)) = elec_1 & host(Pid30) = host(Pid0) -> -(elem(m_Down(Pid30),queue(host(Z))) & setIn(Z,alive)))) & cons(m_Ack(W,Y),V) = queue(host(X)) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) = host(Pid0) & host(Z) = host(Pid30) & setIn(Pid20,alive) & setIn(Z,alive) & host(Z) != host(Pid20) -> -(setIn(host(Pid30),index(down,host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) != host(Z) & setIn(Z,alive) & host(Z) = host(Pid30) & host(Pid0) = host(Pid20) & setIn(Pid20,alive) -> -(elem(m_Down(Pid0),queue(host(Z))) & elem(m_Down(Pid30),queue(host(Pid20)))))) & (all Z all Pid20 all Pid0 (host(Pid0) = host(Z) & host(index(elid,host(Pid0))) = host(Pid20) & wait = index(status,host(Pid0)) & setIn(Pid0,alive) & host(Pid20) != host(Pid0) -> -elem(m_Down(Z),queue(host(Pid20))))) & (all Z all Pid20 all Pid0 (setIn(Pid0,alive) & index(status,host(Pid0)) = norm & index(ldr,host(Pid0)) = host(Pid20) & host(Pid0) = host(Z) & host(Pid0) != host(Pid20) -> -elem(m_Down(Z),queue(host(Pid20))))) & (all Z all Pid0 (nbr_proc = host(Pid0) -> -elem(m_NotNorm(Z),queue(host(Pid0))))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Pid0) != host(Z))) & (all Z all Pid0 (elem(m_Ldr(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) -> (setIn(X,alive) -> (index(status,host(X)) = elec_2 & index(pendack,host(X)) = host(Y) & index(elid,host(X)) = W -> (-leq(nbr_proc,index(pendack,host(X))) -> (all Z (s(index(pendack,host(X))) = host(Z) -> (host(Z) = host(X) -> (all W0 all X0 all Y0 (s(index(pendack,host(X))) != host(Y0) -> (host(X) != host(Y0) -> (elem(m_Down(X0),queue(host(Y0))) & host(Y0) = host(W0) & elec_1 = index(status,host(Y0)) & host(Y0) = nbr_proc & (all V0 (-leq(host(Y0),V0) & leq(s(zero),V0) -> V0 = host(X0) | setIn(V0,index(down,host(Y0))))) -> -(elem(m_Down(W0),snoc(V,m_Halt(X))) & setIn(Z,alive)))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
39.42/39.80	68 -elem(A,B) | elem(A,cons(C,B)) # label(axiom_46) # label(axiom).  [clausify(7)].
39.42/39.80	95 elem(A,B) | C = A | -elem(A,snoc(B,C)) # label(axiom_47) # label(axiom).  [clausify(19)].
39.42/39.80	152 m_Down(A) != m_Halt(B) # label(axiom_17) # label(axiom).  [clausify(53)].
39.42/39.80	160 -setIn(A,alive) | index(status,host(A)) != elec_2 | index(elid,host(A)) = A # label(conj) # label(negated_conjecture).  [clausify(58)].
39.42/39.80	161 leq(s(zero),f4(A,B,C,D)) | -elem(m_Down(C),queue(host(D))) | host(D) != nbr_proc | index(status,host(D)) != elec_1 | host(B) != host(D) | -elem(m_Down(B),queue(host(A))) | -setIn(A,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
39.42/39.80	162 -leq(host(A),f4(B,C,D,A)) | -elem(m_Down(D),queue(host(A))) | host(A) != nbr_proc | index(status,host(A)) != elec_1 | host(C) != host(A) | -elem(m_Down(C),queue(host(B))) | -setIn(B,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
39.42/39.80	163 host(A) != f4(B,C,A,D) | -elem(m_Down(A),queue(host(D))) | host(D) != nbr_proc | index(status,host(D)) != elec_1 | host(C) != host(D) | -elem(m_Down(C),queue(host(B))) | -setIn(B,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
39.42/39.80	164 f4(A,B,C,D) != host(C) | -elem(m_Down(C),queue(host(D))) | host(D) != nbr_proc | index(status,host(D)) != elec_1 | host(B) != host(D) | -elem(m_Down(B),queue(host(A))) | -setIn(A,alive).  [copy(163),flip(a)].
39.42/39.80	165 -setIn(f4(A,B,C,D),index(down,host(D))) | -elem(m_Down(C),queue(host(D))) | host(D) != nbr_proc | index(status,host(D)) != elec_1 | host(B) != host(D) | -elem(m_Down(B),queue(host(A))) | -setIn(A,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
39.42/39.80	166 queue(host(c3)) = cons(m_Ack(c2,c4),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
39.42/39.80	167 cons(m_Ack(c2,c4),c1) = queue(host(c3)).  [copy(166),flip(a)].
39.42/39.80	175 setIn(c3,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
39.42/39.80	176 index(status,host(c3)) = elec_2 # label(conj) # label(negated_conjecture).  [clausify(58)].
39.42/39.80	178 index(elid,host(c3)) = c2 # label(conj) # label(negated_conjecture).  [clausify(58)].
39.42/39.80	186 elem(m_Down(c7),queue(host(c8))) # label(conj) # label(negated_conjecture).  [clausify(58)].
39.42/39.80	187 host(c8) = host(c6) # label(conj) # label(negated_conjecture).  [clausify(58)].
39.42/39.80	188 index(status,host(c8)) = elec_1 # label(conj) # label(negated_conjecture).  [clausify(58)].
39.42/39.80	189 index(status,host(c6)) = elec_1.  [copy(188),rewrite([187(3)])].
39.42/39.80	190 host(c8) = nbr_proc # label(conj) # label(negated_conjecture).  [clausify(58)].
39.42/39.80	191 host(c6) = nbr_proc.  [copy(190),rewrite([187(2)])].
39.42/39.80	192 leq(host(c8),A) | -leq(s(zero),A) | host(c7) = A | setIn(A,index(down,host(c8))) # label(conj) # label(negated_conjecture).  [clausify(58)].
39.42/39.80	193 leq(nbr_proc,A) | -leq(s(zero),A) | host(c7) = A | setIn(A,index(down,nbr_proc)).  [copy(192),rewrite([187(2),191(2),187(11),191(11)])].
39.42/39.80	194 elem(m_Down(c6),snoc(c1,m_Halt(c3))) # label(conj) # label(negated_conjecture).  [clausify(58)].
39.42/39.80	198 elem(m_Down(c7),queue(nbr_proc)).  [back_rewrite(186),rewrite([187(4),191(4)])].
39.42/39.80	200 index(status,nbr_proc) = elec_1.  [back_rewrite(189),rewrite([191(3)])].
39.42/39.80	291 f4(c3,A,B,C) != host(B) | -elem(m_Down(B),queue(host(C))) | host(C) != nbr_proc | index(status,host(C)) != elec_1 | host(A) != host(C) | -elem(m_Down(A),queue(host(c3))).  [resolve(175,a,164,g)].
39.42/39.80	292 -leq(host(A),f4(c3,B,C,A)) | -elem(m_Down(C),queue(host(A))) | host(A) != nbr_proc | index(status,host(A)) != elec_1 | host(B) != host(A) | -elem(m_Down(B),queue(host(c3))).  [resolve(175,a,162,g)].
39.42/39.80	293 leq(s(zero),f4(c3,A,B,C)) | -elem(m_Down(B),queue(host(C))) | host(C) != nbr_proc | index(status,host(C)) != elec_1 | host(A) != host(C) | -elem(m_Down(A),queue(host(c3))).  [resolve(175,a,161,g)].
39.42/39.80	294 c3 = c2.  [resolve(175,a,160,a),rewrite([176(4),178(7)]),flip(b),xx(a)].
39.42/39.80	300 leq(s(zero),f4(c2,A,B,C)) | -elem(m_Down(B),queue(host(C))) | host(C) != nbr_proc | index(status,host(C)) != elec_1 | host(A) != host(C) | -elem(m_Down(A),queue(host(c2))).  [back_rewrite(293),rewrite([294(3),294(22)])].
39.42/39.80	301 -leq(host(A),f4(c2,B,C,A)) | -elem(m_Down(C),queue(host(A))) | host(A) != nbr_proc | index(status,host(A)) != elec_1 | host(B) != host(A) | -elem(m_Down(B),queue(host(c2))).  [back_rewrite(292),rewrite([294(2),294(21)])].
39.42/39.80	302 f4(c2,A,B,C) != host(B) | -elem(m_Down(B),queue(host(C))) | host(C) != nbr_proc | index(status,host(C)) != elec_1 | host(A) != host(C) | -elem(m_Down(A),queue(host(c2))).  [back_rewrite(291),rewrite([294(1),294(21)])].
39.42/39.80	313 elem(m_Down(c6),snoc(c1,m_Halt(c2))).  [back_rewrite(194),rewrite([294(4)])].
39.42/39.80	318 setIn(c2,alive).  [back_rewrite(175),rewrite([294(1)])].
39.42/39.80	319 cons(m_Ack(c2,c4),c1) = queue(host(c2)).  [back_rewrite(167),rewrite([294(6)])].
39.42/39.80	324 -setIn(f4(A,B,C,c6),index(down,nbr_proc)) | -elem(m_Down(C),queue(nbr_proc)) | host(B) != nbr_proc | -elem(m_Down(B),queue(host(A))) | -setIn(A,alive).  [para(191(a,1),165(a,2,2)),rewrite([191(9),191(12),191(16),200(16),191(19)]),xx(c),xx(d)].
39.42/39.80	376 -leq(nbr_proc,f4(c2,A,B,c6)) | -elem(m_Down(B),queue(nbr_proc)) | host(A) != nbr_proc | -elem(m_Down(A),queue(host(c2))).  [para(191(a,1),301(b,2,1)),rewrite([191(2),191(11),191(15),200(15),191(18)]),xx(c),xx(d)].
39.42/39.80	404 -leq(nbr_proc,f4(c2,A,c7,c6)) | host(A) != nbr_proc | -elem(m_Down(A),queue(host(c2))).  [resolve(376,b,198,a)].
39.42/39.80	431 f4(c2,A,B,c6) != host(B) | -elem(m_Down(B),queue(nbr_proc)) | host(A) != nbr_proc | -elem(m_Down(A),queue(host(c2))).  [para(191(a,1),302(b,2,1)),rewrite([191(11),191(15),200(15),191(18)]),xx(c),xx(d)].
39.42/39.80	433 f4(c2,A,c7,c6) != host(c7) | host(A) != nbr_proc | -elem(m_Down(A),queue(host(c2))).  [resolve(431,b,198,a)].
39.42/39.80	549 elem(m_Down(c6),c1).  [resolve(313,a,95,c),unit_del(b(flip),152)].
39.42/39.80	556 elem(m_Down(c6),cons(A,c1)).  [resolve(549,a,68,a)].
39.42/39.80	1148 elem(m_Down(c6),queue(host(c2))).  [para(319(a,1),556(a,2))].
39.42/39.80	1172 f4(c2,c6,c7,c6) != host(c7).  [resolve(1148,a,433,c),rewrite([191(10)]),xx(b)].
39.42/39.80	1176 -leq(nbr_proc,f4(c2,c6,c7,c6)).  [resolve(1148,a,404,c),rewrite([191(9)]),xx(b)].
39.42/39.80	2190 leq(s(zero),f4(c2,c6,A,B)) | -elem(m_Down(A),queue(host(B))) | host(B) != nbr_proc | index(status,host(B)) != elec_1.  [resolve(300,f,1148,a),rewrite([191(20)]),flip(e),merge(e)].
39.42/39.80	13452 leq(s(zero),f4(c2,c6,A,c6)) | -elem(m_Down(A),queue(nbr_proc)).  [para(191(a,1),2190(b,2,1)),rewrite([191(13),191(17),200(17)]),xx(c),xx(d)].
39.42/39.80	13454 leq(s(zero),f4(c2,c6,c7,c6)).  [resolve(13452,b,198,a)].
39.42/39.80	13487 setIn(f4(c2,c6,c7,c6),index(down,nbr_proc)).  [resolve(13454,a,193,b),flip(b),unit_del(a,1176),unit_del(b,1172)].
39.42/39.80	13535 $F.  [resolve(13487,a,324,a),rewrite([191(7)]),xx(b),unit_del(a,198),unit_del(b,1148),unit_del(c,318)].
39.42/39.80	
39.42/39.80	% SZS output end Refutation
39.42/39.80	============================== end of proof ==========================
39.42/39.80	
39.42/39.80	============================== STATISTICS ============================
39.42/39.80	
39.42/39.80	Given=4901. Generated=1516395. Kept=13464. proofs=1.
39.42/39.80	Usable=4881. Sos=8494. Demods=58. Limbo=0, Disabled=216. Hints=0.
39.42/39.80	Megabytes=24.90.
39.42/39.80	User_CPU=37.28, System_CPU=1.43, Wall_clock=39.
39.42/39.80	
39.42/39.80	============================== end of statistics =====================
39.42/39.80	
39.42/39.80	============================== end of search =========================
39.42/39.80	
39.42/39.80	THEOREM PROVED
39.42/39.80	% SZS status Theorem
39.42/39.80	
39.42/39.80	Exiting with 1 proof.
39.42/39.80	
39.42/39.80	Process 10099 exit (max_proofs) Tue Aug  9 05:47:40 2022
39.42/39.80	Prover9 interrupted
39.42/39.80	EOF