0.07/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% Command  : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer : n015.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 : 960
0.12/0.33	% WCLimit  : 120
0.12/0.33	% DateTime : Tue Aug  9 06:01:56 EDT 2022
0.12/0.33	% CPUTime  : 
0.75/1.03	============================== Prover9 ===============================
0.75/1.03	Prover9 (32) version 2009-11A, November 2009.
0.75/1.03	Process 26746 was started by sandbox2 on n015.cluster.edu,
0.75/1.03	Tue Aug  9 06:01:57 2022
0.75/1.03	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_26593_n015.cluster.edu".
0.75/1.03	============================== end of head ===========================
0.75/1.03	
0.75/1.03	============================== INPUT =================================
0.75/1.03	
0.75/1.03	% Reading from file /tmp/Prover9_26593_n015.cluster.edu
0.75/1.03	
0.75/1.03	set(prolog_style_variables).
0.75/1.03	set(auto2).
0.75/1.03	    % set(auto2) -> set(auto).
0.75/1.03	    % set(auto) -> set(auto_inference).
0.75/1.03	    % set(auto) -> set(auto_setup).
0.75/1.03	    % set(auto_setup) -> set(predicate_elim).
0.75/1.03	    % set(auto_setup) -> assign(eq_defs, unfold).
0.75/1.03	    % set(auto) -> set(auto_limits).
0.75/1.03	    % set(auto_limits) -> assign(max_weight, "100.000").
0.75/1.03	    % set(auto_limits) -> assign(sos_limit, 20000).
0.75/1.03	    % set(auto) -> set(auto_denials).
0.75/1.03	    % set(auto) -> set(auto_process).
0.75/1.03	    % set(auto2) -> assign(new_constants, 1).
0.75/1.03	    % set(auto2) -> assign(fold_denial_max, 3).
0.75/1.03	    % set(auto2) -> assign(max_weight, "200.000").
0.75/1.03	    % set(auto2) -> assign(max_hours, 1).
0.75/1.03	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.75/1.03	    % set(auto2) -> assign(max_seconds, 0).
0.75/1.03	    % set(auto2) -> assign(max_minutes, 5).
0.75/1.03	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.75/1.03	    % set(auto2) -> set(sort_initial_sos).
0.75/1.03	    % set(auto2) -> assign(sos_limit, -1).
0.75/1.03	    % set(auto2) -> assign(lrs_ticks, 3000).
0.75/1.03	    % set(auto2) -> assign(max_megs, 400).
0.75/1.03	    % set(auto2) -> assign(stats, some).
0.75/1.03	    % set(auto2) -> clear(echo_input).
0.75/1.03	    % set(auto2) -> set(quiet).
0.75/1.03	    % set(auto2) -> clear(print_initial_clauses).
0.75/1.03	    % set(auto2) -> clear(print_given).
0.75/1.03	assign(lrs_ticks,-1).
0.75/1.03	assign(sos_limit,10000).
0.75/1.03	assign(order,kbo).
0.75/1.03	set(lex_order_vars).
0.75/1.03	clear(print_given).
0.75/1.03	
0.75/1.03	% formulas(sos).  % not echoed (67 formulas)
0.75/1.03	
0.75/1.03	============================== end of input ==========================
0.75/1.03	
0.75/1.03	% From the command line: assign(max_seconds, 960).
0.75/1.03	
0.75/1.03	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.75/1.03	
0.75/1.03	% Formulas that are not ordinary clauses:
0.75/1.03	1 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	2 (all X X = pidMsg(m_Halt(X))) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	3 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	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.75/1.03	5 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	6 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	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.75/1.03	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.75/1.03	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.75/1.03	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.75/1.03	11 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	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.75/1.03	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.75/1.03	14 (all X all Y m_NotNorm(Y) != m_NormQ(X)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	15 (all X all Y all Z m_NotNorm(Z) != m_Ack(X,Y)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	16 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	17 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid2 != Pid)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	18 (all P all Q (host(Q) = s(host(P)) -> host(Q) != host(P))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	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.75/1.03	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.75/1.03	21 (all X all Y (leq(X,Y) <-> leq(s(X),s(Y)))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	22 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	23 (all X all Y (Y != X <-> m_Halt(X) != m_Halt(Y))) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	24 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	25 (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.03	26 (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.03	27 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	28 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	29 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	30 (all X all Y all Z m_Ack(X,Y) != m_Halt(Z)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	31 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	32 (all X all Y m_Ldr(Y) != m_Down(X)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	33 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	34 (all X all Y m_NormQ(Y) != m_Down(X)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	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.75/1.03	36 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	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.75/1.03	38 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	39 (all X all Y (X != Y <-> m_NormQ(Y) != m_NormQ(X))) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	40 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	41 (all X all Y m_Halt(Y) != m_Ldr(X)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	42 (all Q (cons(head(Q),tail(Q)) = Q | Q = q_nil)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	43 (all X all Q X = head(cons(X,Q))) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	44 (all Q (Q = q_nil | snoc(init(Q),last(Q)) = Q)) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	45 (all Y all Q Y = last(snoc(Q,Y))) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	46 (all X all Y (m_NotNorm(Y) != m_NotNorm(X) <-> Y != X)) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	47 (all X (ordered(snoc(q_nil,X)) & ordered(cons(X,q_nil)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	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.75/1.03	49 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.75/1.03	50 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
1.10/1.38	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].
1.10/1.38	52 (all X all Y (X != Y <-> m_Down(Y) != m_Down(X))) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
1.10/1.38	53 (all X all Y m_Halt(Y) != m_Down(X)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
1.10/1.38	54 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
1.10/1.38	55 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
1.10/1.38	56 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
1.10/1.38	57 (all X all Y (m_Ldr(X) != m_Ldr(Y) <-> Y != X)) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
1.10/1.38	58 -(all V all W all X ((all Y all Z (host(Z) = nbr_proc -> -elem(m_NotNorm(Y),queue(host(Z))))) & (all Y all Z (Z != Y & host(Y) = host(Z) -> -setIn(Z,alive) | -setIn(Y,alive))) & (all Y all Z all Pid0 (setIn(Pid0,alive) & host(Y) = host(Pid0) & index(ldr,host(Pid0)) = host(Z) & index(status,host(Pid0)) = norm & host(Z) != host(Pid0) -> -elem(m_Down(Y),queue(host(Z))))) & (all Y all Z all Pid20 all Pid0 (host(Pid20) != host(Y) & setIn(Y,alive) & setIn(Pid20,alive) & host(Pid20) = host(Pid0) & host(Z) = host(Y) -> -(elem(m_Down(Pid0),queue(host(Y))) & setIn(host(Z),index(down,host(Pid20)))))) & (all Y all Z all Pid20 all Pid0 ((all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Pid0))) | V0 = host(Pid20))) & elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid0) = host(Z) & index(status,host(Pid0)) = elec_1 & nbr_proc = host(Pid0) -> -(elem(m_Down(Z),queue(host(Y))) & setIn(Y,alive)))) & queue(host(W)) = cons(m_Halt(X),V) & (all Y all Z all Pid20 all Pid0 (setIn(Y,alive) & host(Pid20) = host(Pid0) & host(Y) = host(Z) & setIn(Pid20,alive) & host(Pid20) != host(Y) -> -(elem(m_Down(Z),queue(host(Pid20))) & elem(m_Down(Pid0),queue(host(Y)))))) & (all Y all Z all Pid0 (host(Pid0) != host(Z) & host(Y) = host(Pid0) & host(Z) = host(index(elid,host(Pid0))) & index(status,host(Pid0)) = wait & setIn(Pid0,alive) -> -elem(m_Down(Y),queue(host(Z))))) & (all Y (setIn(Y,alive) & (index(status,host(Y)) = elec_1 | index(status,host(Y)) = elec_2) -> Y = index(elid,host(Y)))) & (all Y all Z (elem(m_Down(Z),queue(host(Y))) -> host(Y) != host(Z))) & (all Y all Z (elem(m_Ldr(Z),queue(host(Y))) -> -leq(host(Y),host(Z)))) -> (setIn(W,alive) -> (all Y (host(Y) = host(X) -> (host(W) = host(Y) -> (all Z all X0 all Y0 (host(Y0) != host(X) -> (host(Y0) != host(W) -> ((all V0 (-leq(host(Y0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Y0))) | host(X0) = V0)) & host(Z) = host(Y0) & elec_1 = index(status,host(Y0)) & host(Y0) = nbr_proc & elem(m_Down(X0),queue(host(Y0))) -> -(setIn(Y,alive) & elem(m_Down(Z),snoc(V,m_Ack(X,W)))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
1.10/1.38	
1.10/1.38	============================== end of process non-clausal formulas ===
1.10/1.38	
1.10/1.38	============================== PROCESS INITIAL CLAUSES ===============
1.10/1.38	
1.10/1.38	============================== PREDICATE ELIMINATION =================
1.10/1.38	
1.10/1.38	============================== end predicate elimination =============
1.10/1.38	
1.10/1.38	Auto_denials:  (non-Horn, no changes).
1.10/1.38	
1.10/1.38	Term ordering decisions:
1.10/1.38	Function symbol KB weights:  alive=1. q_nil=1. status=1. nbr_proc=1. zero=1. elec_1=1. elid=1. down=1. pids=1. elec_2=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. 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.
1.10/1.38	
1.10/1.38	============================== end of process initial clauses ========
1.10/1.38	
1.10/1.38	============================== CLAUSES FOR SEARCH ====================
1.10/1.38	
1.10/1.38	============================== end of clauses for search =============
1.10/1.38	
1.10/1.38	============================== SEARCH ================================
1.10/1.38	
1.10/1.38	% Starting search at 0.03 seconds.
1.10/1.38	
1.10/1.38	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 146 (0.00 of 0.36 sec).
23.93/24.23	
23.93/24.23	Low Water (keep): wt=16.000, iters=3740
23.93/24.23	
23.93/24.23	Low Water (keep): wt=15.000, iters=3546
23.93/24.23	
23.93/24.23	============================== PROOF =================================
23.93/24.23	% SZS status Theorem
23.93/24.23	% SZS output start Refutation
23.93/24.23	
23.93/24.23	% Proof 1 at 22.16 (+ 1.05) seconds.
23.93/24.23	% Length of proof is 54.
23.93/24.23	% Level of proof is 11.
23.93/24.23	% Maximum clause weight is 42.000.
23.93/24.23	% Given clauses 5626.
23.93/24.23	
23.93/24.23	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].
23.93/24.23	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].
23.93/24.23	26 (all X all Y all Z m_Down(Z) != m_Ack(X,Y)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
23.93/24.23	58 -(all V all W all X ((all Y all Z (host(Z) = nbr_proc -> -elem(m_NotNorm(Y),queue(host(Z))))) & (all Y all Z (Z != Y & host(Y) = host(Z) -> -setIn(Z,alive) | -setIn(Y,alive))) & (all Y all Z all Pid0 (setIn(Pid0,alive) & host(Y) = host(Pid0) & index(ldr,host(Pid0)) = host(Z) & index(status,host(Pid0)) = norm & host(Z) != host(Pid0) -> -elem(m_Down(Y),queue(host(Z))))) & (all Y all Z all Pid20 all Pid0 (host(Pid20) != host(Y) & setIn(Y,alive) & setIn(Pid20,alive) & host(Pid20) = host(Pid0) & host(Z) = host(Y) -> -(elem(m_Down(Pid0),queue(host(Y))) & setIn(host(Z),index(down,host(Pid20)))))) & (all Y all Z all Pid20 all Pid0 ((all V0 (-leq(host(Pid0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Pid0))) | V0 = host(Pid20))) & elem(m_Down(Pid20),queue(host(Pid0))) & host(Pid0) = host(Z) & index(status,host(Pid0)) = elec_1 & nbr_proc = host(Pid0) -> -(elem(m_Down(Z),queue(host(Y))) & setIn(Y,alive)))) & queue(host(W)) = cons(m_Halt(X),V) & (all Y all Z all Pid20 all Pid0 (setIn(Y,alive) & host(Pid20) = host(Pid0) & host(Y) = host(Z) & setIn(Pid20,alive) & host(Pid20) != host(Y) -> -(elem(m_Down(Z),queue(host(Pid20))) & elem(m_Down(Pid0),queue(host(Y)))))) & (all Y all Z all Pid0 (host(Pid0) != host(Z) & host(Y) = host(Pid0) & host(Z) = host(index(elid,host(Pid0))) & index(status,host(Pid0)) = wait & setIn(Pid0,alive) -> -elem(m_Down(Y),queue(host(Z))))) & (all Y (setIn(Y,alive) & (index(status,host(Y)) = elec_1 | index(status,host(Y)) = elec_2) -> Y = index(elid,host(Y)))) & (all Y all Z (elem(m_Down(Z),queue(host(Y))) -> host(Y) != host(Z))) & (all Y all Z (elem(m_Ldr(Z),queue(host(Y))) -> -leq(host(Y),host(Z)))) -> (setIn(W,alive) -> (all Y (host(Y) = host(X) -> (host(W) = host(Y) -> (all Z all X0 all Y0 (host(Y0) != host(X) -> (host(Y0) != host(W) -> ((all V0 (-leq(host(Y0),V0) & leq(s(zero),V0) -> setIn(V0,index(down,host(Y0))) | host(X0) = V0)) & host(Z) = host(Y0) & elec_1 = index(status,host(Y0)) & host(Y0) = nbr_proc & elem(m_Down(X0),queue(host(Y0))) -> -(setIn(Y,alive) & elem(m_Down(Z),snoc(V,m_Ack(X,W)))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
23.93/24.23	68 -elem(A,B) | elem(A,cons(C,B)) # label(axiom_46) # label(axiom).  [clausify(7)].
23.93/24.23	95 elem(A,B) | C = A | -elem(A,snoc(B,C)) # label(axiom_47) # label(axiom).  [clausify(19)].
23.93/24.23	104 m_Down(A) != m_Ack(B,C) # label(axiom_12) # label(axiom).  [clausify(26)].
23.93/24.23	162 -leq(host(A),f4(B,C,D,A)) | -elem(m_Down(D),queue(host(A))) | host(A) != host(C) | index(status,host(A)) != elec_1 | host(A) != nbr_proc | -elem(m_Down(C),queue(host(B))) | -setIn(B,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.93/24.23	163 leq(s(zero),f4(A,B,C,D)) | -elem(m_Down(C),queue(host(D))) | host(D) != host(B) | index(status,host(D)) != elec_1 | host(D) != nbr_proc | -elem(m_Down(B),queue(host(A))) | -setIn(A,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.93/24.23	164 -setIn(f4(A,B,C,D),index(down,host(D))) | -elem(m_Down(C),queue(host(D))) | host(D) != host(B) | index(status,host(D)) != elec_1 | host(D) != nbr_proc | -elem(m_Down(B),queue(host(A))) | -setIn(A,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.93/24.23	165 host(A) != f4(B,C,A,D) | -elem(m_Down(A),queue(host(D))) | host(D) != host(C) | index(status,host(D)) != elec_1 | host(D) != nbr_proc | -elem(m_Down(C),queue(host(B))) | -setIn(B,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.93/24.23	166 f4(A,B,C,D) != host(C) | -elem(m_Down(C),queue(host(D))) | host(D) != host(B) | index(status,host(D)) != elec_1 | host(D) != nbr_proc | -elem(m_Down(B),queue(host(A))) | -setIn(A,alive).  [copy(165),flip(a)].
23.93/24.23	167 queue(host(c2)) = cons(m_Halt(c3),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.93/24.23	168 cons(m_Halt(c3),c1) = queue(host(c2)).  [copy(167),flip(a)].
23.93/24.23	175 setIn(c2,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.93/24.23	176 host(c4) = host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.93/24.23	177 host(c2) = host(c4) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.93/24.23	178 host(c3) = host(c2).  [copy(177),rewrite([176(4)]),flip(a)].
23.93/24.23	179 host(c7) != host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.93/24.23	180 host(c7) != host(c2).  [copy(179),rewrite([178(4)])].
23.93/24.23	181 leq(host(c7),A) | -leq(s(zero),A) | setIn(A,index(down,host(c7))) | host(c6) = A # label(conj) # label(negated_conjecture).  [clausify(58)].
23.93/24.23	182 host(c7) = host(c5) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.93/24.23	183 index(status,host(c7)) = elec_1 # label(conj) # label(negated_conjecture).  [clausify(58)].
23.93/24.23	184 elec_1 = index(status,host(c5)).  [copy(183),rewrite([182(3)]),flip(a)].
23.93/24.23	185 host(c7) = nbr_proc # label(conj) # label(negated_conjecture).  [clausify(58)].
23.93/24.23	186 nbr_proc = host(c5).  [copy(185),rewrite([182(2)]),flip(a)].
23.93/24.23	187 elem(m_Down(c6),queue(host(c7))) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.93/24.23	188 elem(m_Down(c6),queue(host(c5))).  [copy(187),rewrite([182(4)])].
23.93/24.23	190 elem(m_Down(c5),snoc(c1,m_Ack(c3,c2))) # label(conj) # label(negated_conjecture).  [clausify(58)].
23.93/24.23	196 host(c5) = c_0.  [new_symbol(180),rewrite([182(2)])].
23.93/24.23	197 leq(c_0,A) | -leq(s(zero),A) | setIn(A,index(down,c_0)) | host(c6) = A.  [back_rewrite(181),rewrite([182(2),196(2),182(8),196(8)])].
23.93/24.23	200 f4(A,B,C,D) != host(C) | -elem(m_Down(C),queue(host(D))) | host(D) != host(B) | index(status,host(D)) != index(status,c_0) | host(D) != c_0 | -elem(m_Down(B),queue(host(A))) | -setIn(A,alive).  [back_rewrite(166),rewrite([184(14),196(16),186(19),196(20)])].
23.93/24.23	201 -setIn(f4(A,B,C,D),index(down,host(D))) | -elem(m_Down(C),queue(host(D))) | host(D) != host(B) | index(status,host(D)) != index(status,c_0) | host(D) != c_0 | -elem(m_Down(B),queue(host(A))) | -setIn(A,alive).  [back_rewrite(164),rewrite([184(16),196(18),186(21),196(22)])].
23.93/24.23	202 leq(s(zero),f4(A,B,C,D)) | -elem(m_Down(C),queue(host(D))) | host(D) != host(B) | index(status,host(D)) != index(status,c_0) | host(D) != c_0 | -elem(m_Down(B),queue(host(A))) | -setIn(A,alive).  [back_rewrite(163),rewrite([184(15),196(17),186(20),196(21)])].
23.93/24.23	203 -leq(host(A),f4(B,C,D,A)) | -elem(m_Down(D),queue(host(A))) | host(A) != host(C) | index(status,host(A)) != index(status,c_0) | host(A) != c_0 | -elem(m_Down(C),queue(host(B))) | -setIn(B,alive).  [back_rewrite(162),rewrite([184(14),196(16),186(19),196(20)])].
23.93/24.23	218 elem(m_Down(c6),queue(c_0)).  [back_rewrite(188),rewrite([196(4)])].
23.93/24.23	316 elem(m_Down(c5),c1).  [resolve(190,a,95,c),unit_del(b(flip),104)].
23.93/24.23	336 f4(c2,A,B,C) != host(B) | -elem(m_Down(B),queue(host(C))) | host(C) != host(A) | index(status,host(C)) != index(status,c_0) | host(C) != c_0 | -elem(m_Down(A),queue(host(c2))).  [resolve(200,g,175,a)].
23.93/24.23	337 -setIn(f4(A,B,C,c5),index(down,c_0)) | -elem(m_Down(C),queue(c_0)) | host(B) != c_0 | -elem(m_Down(B),queue(host(A))) | -setIn(A,alive).  [para(196(a,1),201(a,2,2)),rewrite([196(9),196(12),196(16),196(22)]),flip(c),xx(d),xx(e)].
23.93/24.23	339 leq(s(zero),f4(c2,A,B,C)) | -elem(m_Down(B),queue(host(C))) | host(C) != host(A) | index(status,host(C)) != index(status,c_0) | host(C) != c_0 | -elem(m_Down(A),queue(host(c2))).  [resolve(202,g,175,a)].
23.93/24.23	341 -leq(host(A),f4(c2,B,C,A)) | -elem(m_Down(C),queue(host(A))) | host(A) != host(B) | index(status,host(A)) != index(status,c_0) | host(A) != c_0 | -elem(m_Down(B),queue(host(c2))).  [resolve(203,g,175,a)].
23.93/24.23	372 elem(m_Down(c5),cons(A,c1)).  [resolve(316,a,68,a)].
23.93/24.23	453 f4(c2,A,B,c5) != host(B) | -elem(m_Down(B),queue(c_0)) | host(A) != c_0 | -elem(m_Down(A),queue(host(c2))).  [para(196(a,1),336(b,2,1)),rewrite([196(11),196(15),196(21)]),flip(c),xx(d),xx(e)].
23.93/24.23	479 f4(c2,A,c6,c5) != host(c6) | host(A) != c_0 | -elem(m_Down(A),queue(host(c2))).  [resolve(453,b,218,a)].
23.93/24.23	490 elem(m_Down(c5),queue(host(c2))).  [para(168(a,1),372(a,2))].
23.93/24.23	517 -leq(c_0,f4(c2,A,B,c5)) | -elem(m_Down(B),queue(c_0)) | host(A) != c_0 | -elem(m_Down(A),queue(host(c2))).  [para(196(a,1),341(b,2,1)),rewrite([196(2),196(11),196(15),196(21)]),flip(c),xx(d),xx(e)].
23.93/24.23	519 -leq(c_0,f4(c2,A,c6,c5)) | host(A) != c_0 | -elem(m_Down(A),queue(host(c2))).  [resolve(517,b,218,a)].
23.93/24.23	552 -leq(c_0,f4(c2,c5,c6,c5)).  [resolve(490,a,519,c),rewrite([196(9)]),xx(b)].
23.93/24.23	560 f4(c2,c5,c6,c5) != host(c6).  [resolve(490,a,479,c),rewrite([196(10)]),xx(b)].
23.93/24.23	2844 leq(s(zero),f4(c2,c5,A,B)) | -elem(m_Down(A),queue(host(B))) | host(B) != c_0 | index(status,host(B)) != index(status,c_0).  [resolve(339,f,490,a),rewrite([196(13)]),merge(e)].
23.93/24.23	15035 leq(s(zero),f4(c2,c5,A,c5)) | -elem(m_Down(A),queue(c_0)).  [para(196(a,1),2844(b,2,1)),rewrite([196(13),196(17)]),xx(c),xx(d)].
23.93/24.23	15037 leq(s(zero),f4(c2,c5,c6,c5)).  [resolve(15035,b,218,a)].
23.93/24.23	15074 setIn(f4(c2,c5,c6,c5),index(down,c_0)).  [resolve(15037,a,197,b),flip(c),unit_del(a,552),unit_del(c,560)].
23.93/24.23	15105 $F.  [resolve(15074,a,337,a),rewrite([196(7)]),xx(b),unit_del(a,218),unit_del(b,490),unit_del(c,175)].
23.93/24.23	
23.93/24.23	% SZS output end Refutation
23.93/24.23	============================== end of proof ==========================
23.93/24.23	
23.93/24.23	============================== STATISTICS ============================
23.93/24.23	
23.93/24.23	Given=5626. Generated=1966072. Kept=15035. proofs=1.
23.93/24.23	Usable=5499. Sos=9064. Demods=30. Limbo=0, Disabled=595. Hints=0.
23.93/24.23	Megabytes=23.86.
23.93/24.23	User_CPU=22.16, System_CPU=1.05, Wall_clock=23.
23.93/24.23	
23.93/24.23	============================== end of statistics =====================
23.93/24.23	
23.93/24.23	============================== end of search =========================
23.93/24.23	
23.93/24.23	THEOREM PROVED
23.93/24.23	% SZS status Theorem
23.93/24.23	
23.93/24.23	Exiting with 1 proof.
23.93/24.23	
23.93/24.23	Process 26746 exit (max_proofs) Tue Aug  9 06:02:20 2022
23.93/24.23	Prover9 interrupted
23.93/24.23	EOF