0.04/0.13	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.14	% Command  : tptp2X_and_run_prover9 %d %s
0.15/0.36	% Computer : n014.cluster.edu
0.15/0.36	% Model    : x86_64 x86_64
0.15/0.36	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.15/0.36	% Memory   : 8042.1875MB
0.15/0.36	% OS       : Linux 3.10.0-693.el7.x86_64
0.15/0.36	% CPULimit : 1440
0.15/0.36	% WCLimit  : 180
0.15/0.36	% DateTime : Mon Jul  3 08:19:39 EDT 2023
0.15/0.36	% CPUTime  : 
0.81/1.11	============================== Prover9 ===============================
0.81/1.11	Prover9 (32) version 2009-11A, November 2009.
0.81/1.11	Process 4676 was started by sandbox2 on n014.cluster.edu,
0.81/1.11	Mon Jul  3 08:19:39 2023
0.81/1.11	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1440 -f /tmp/Prover9_4523_n014.cluster.edu".
0.81/1.11	============================== end of head ===========================
0.81/1.11	
0.81/1.11	============================== INPUT =================================
0.81/1.11	
0.81/1.11	% Reading from file /tmp/Prover9_4523_n014.cluster.edu
0.81/1.11	
0.81/1.11	set(prolog_style_variables).
0.81/1.11	set(auto2).
0.81/1.11	    % set(auto2) -> set(auto).
0.81/1.11	    % set(auto) -> set(auto_inference).
0.81/1.11	    % set(auto) -> set(auto_setup).
0.81/1.11	    % set(auto_setup) -> set(predicate_elim).
0.81/1.11	    % set(auto_setup) -> assign(eq_defs, unfold).
0.81/1.11	    % set(auto) -> set(auto_limits).
0.81/1.11	    % set(auto_limits) -> assign(max_weight, "100.000").
0.81/1.11	    % set(auto_limits) -> assign(sos_limit, 20000).
0.81/1.11	    % set(auto) -> set(auto_denials).
0.81/1.11	    % set(auto) -> set(auto_process).
0.81/1.11	    % set(auto2) -> assign(new_constants, 1).
0.81/1.11	    % set(auto2) -> assign(fold_denial_max, 3).
0.81/1.11	    % set(auto2) -> assign(max_weight, "200.000").
0.81/1.11	    % set(auto2) -> assign(max_hours, 1).
0.81/1.11	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.81/1.11	    % set(auto2) -> assign(max_seconds, 0).
0.81/1.11	    % set(auto2) -> assign(max_minutes, 5).
0.81/1.11	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.81/1.11	    % set(auto2) -> set(sort_initial_sos).
0.81/1.11	    % set(auto2) -> assign(sos_limit, -1).
0.81/1.11	    % set(auto2) -> assign(lrs_ticks, 3000).
0.81/1.11	    % set(auto2) -> assign(max_megs, 400).
0.81/1.11	    % set(auto2) -> assign(stats, some).
0.81/1.11	    % set(auto2) -> clear(echo_input).
0.81/1.11	    % set(auto2) -> set(quiet).
0.81/1.11	    % set(auto2) -> clear(print_initial_clauses).
0.81/1.11	    % set(auto2) -> clear(print_given).
0.81/1.11	assign(lrs_ticks,-1).
0.81/1.11	assign(sos_limit,10000).
0.81/1.11	assign(order,kbo).
0.81/1.11	set(lex_order_vars).
0.81/1.11	clear(print_given).
0.81/1.11	
0.81/1.11	% formulas(sos).  % not echoed (67 formulas)
0.81/1.11	
0.81/1.11	============================== end of input ==========================
0.81/1.11	
0.81/1.11	% From the command line: assign(max_seconds, 1440).
0.81/1.11	
0.81/1.11	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.81/1.11	
0.81/1.11	% Formulas that are not ordinary clauses:
0.81/1.11	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.81/1.11	2 (all X all Y (m_Ldr(X) != m_Ldr(Y) <-> X != Y)) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	3 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	4 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	5 (all X (ordered(cons(X,q_nil)) & ordered(snoc(q_nil,X)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	6 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	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.81/1.11	8 (all X all Y (X != Y <-> m_NormQ(X) != m_NormQ(Y))) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	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.81/1.11	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.81/1.11	11 (all X all Y all Z m_Halt(Z) != m_Ack(X,Y)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	12 (all X all Y all Z m_NotNorm(Z) != m_Ack(X,Y)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	13 (all X all Y all Z m_Ack(X,Y) != m_Down(Z)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	14 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	15 (all X all Y (Y = X <-> leq(Y,X) & leq(X,Y))) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	16 (all X all Q X = head(cons(X,Q))) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	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.81/1.11	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.81/1.11	19 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	20 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	21 (all X all Y m_NormQ(Y) != m_Ldr(X)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	22 (all X X = pidMsg(m_Halt(X))) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	23 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	24 (all Q (cons(head(Q),tail(Q)) = Q | Q = q_nil)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	25 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	26 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	27 (all P all Q (host(Q) = s(host(P)) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	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.81/1.11	29 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	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.81/1.11	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.81/1.11	32 (all X all Y (m_Halt(Y) != m_Halt(X) <-> Y != X)) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	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.81/1.11	34 (all Y all Q Q = init(snoc(Q,Y))) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	35 (all Q (Q = q_nil | snoc(init(Q),last(Q)) = Q)) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	36 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	37 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	38 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	39 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	40 (all X all Y (m_Down(X) != m_Down(Y) <-> X != Y)) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	41 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	42 (all Y all Q Y = last(snoc(Q,Y))) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	43 (all X all Y m_Ldr(X) != m_NotNorm(Y)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	44 (all X all Y (Y != X <-> m_NotNorm(X) != m_NotNorm(Y))) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	45 (all X all Y m_NotNorm(Y) != m_NormQ(X)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	46 (all X all Y m_Ldr(Y) != m_Down(X)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	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.81/1.11	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.81/1.11	49 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.81/1.11	50 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.86/1.45	51 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.86/1.45	52 (all X all Y all Z m_Ldr(Z) != m_Ack(X,Y)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.86/1.45	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.86/1.45	54 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.86/1.45	55 (all X all Y m_NormQ(Y) != m_Down(X)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.86/1.45	56 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.86/1.45	57 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.86/1.45	58 -(all V all W all X ((all Y all Z (elem(m_Ldr(Z),queue(host(Y))) -> -leq(host(Y),host(Z)))) & (all Y all Z (elem(m_Down(Z),queue(host(Y))) -> host(Y) != host(Z))) & (all Y all Z (Y != Z & host(Y) = host(Z) -> -setIn(Z,alive) | -setIn(Y,alive))) & (all Y all Z all Pid0 (norm = index(status,host(Pid0)) & index(ldr,host(Pid0)) = host(Z) & host(Pid0) = host(Y) & setIn(Pid0,alive) & host(Z) != host(Pid0) -> -elem(m_Down(Y),queue(host(Z))))) & (all Y all Z all Pid20 all Pid0 (setIn(Y,alive) & host(Pid0) = host(Pid20) & host(Z) = host(Y) & setIn(Pid20,alive) & host(Y) != host(Pid20) -> -(elem(m_Down(Pid0),queue(host(Y))) & setIn(host(Z),index(down,host(Pid20)))))) & queue(host(W)) = cons(m_Halt(X),V) & (all Y all Z all Pid20 all Pid0 ((all V0 (leq(s(zero),V0) & -leq(host(Pid0),V0) -> setIn(V0,index(down,host(Pid0))) | V0 = host(Pid20))) & host(Pid0) = host(Z) & nbr_proc = host(Pid0) & elec_1 = index(status,host(Pid0)) & elem(m_Down(Pid20),queue(host(Pid0))) -> -(setIn(Y,alive) & elem(m_Down(Z),queue(host(Y)))))) & (all Y all Z all Pid20 all Pid0 (host(Y) != host(Pid20) & setIn(Y,alive) & setIn(Pid20,alive) & host(Pid20) = host(Pid0) & host(Z) = host(Y) -> -(elem(m_Down(Pid0),queue(host(Y))) & elem(m_Down(Z),queue(host(Pid20)))))) & (all Y all Z all Pid0 (host(Pid0) != host(Z) & setIn(Pid0,alive) & host(Y) = host(Pid0) & host(index(elid,host(Pid0))) = host(Z) & index(status,host(Pid0)) = wait -> -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 (nbr_proc = host(Z) -> -elem(m_NotNorm(Y),queue(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(s(zero),V0) & -leq(host(Y0),V0) -> setIn(V0,index(down,host(Y0))) | host(X0) = V0)) & elem(m_Down(X0),snoc(queue(host(Y0)),m_Ack(X,W))) & host(Z) = host(Y0) & host(Y0) = nbr_proc & elec_1 = index(status,host(Y0)) -> -(setIn(Y,alive) & elem(m_Down(Z),V)))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.86/1.45	
0.86/1.45	============================== end of process non-clausal formulas ===
0.86/1.45	
0.86/1.45	============================== PROCESS INITIAL CLAUSES ===============
0.86/1.45	
0.86/1.45	============================== PREDICATE ELIMINATION =================
0.86/1.45	
0.86/1.45	============================== end predicate elimination =============
0.86/1.45	
0.86/1.45	Auto_denials:  (non-Horn, no changes).
0.86/1.45	
0.86/1.45	Term ordering decisions:
0.86/1.45	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. f1=1. f2=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. f3=1. f4=1.
0.86/1.45	
0.86/1.45	============================== end of process initial clauses ========
0.86/1.45	
0.86/1.45	============================== CLAUSES FOR SEARCH ====================
0.86/1.45	
0.86/1.45	============================== end of clauses for search =============
0.86/1.45	
0.86/1.45	============================== SEARCH ================================
0.86/1.45	
0.86/1.45	% Starting search at 0.04 seconds.
0.86/1.45	
0.86/1.45	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 159 (0.00 of 0.35 sec).
27.99/28.25	
27.99/28.25	Low Water (keep): wt=57.000, iters=3333
27.99/28.25	
27.99/28.25	Low Water (keep): wt=16.000, iters=3976
27.99/28.25	
27.99/28.25	Low Water (keep): wt=15.000, iters=3620
27.99/28.25	
27.99/28.25	============================== PROOF =================================
27.99/28.25	% SZS status Theorem
27.99/28.25	% SZS output start Refutation
27.99/28.25	
27.99/28.25	% Proof 1 at 26.09 (+ 1.06) seconds.
27.99/28.25	% Length of proof is 55.
27.99/28.25	% Level of proof is 10.
27.99/28.25	% Maximum clause weight is 42.000.
27.99/28.25	% Given clauses 5934.
27.99/28.25	
27.99/28.25	13 (all X all Y all Z m_Ack(X,Y) != m_Down(Z)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
27.99/28.25	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].
27.99/28.25	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].
27.99/28.25	58 -(all V all W all X ((all Y all Z (elem(m_Ldr(Z),queue(host(Y))) -> -leq(host(Y),host(Z)))) & (all Y all Z (elem(m_Down(Z),queue(host(Y))) -> host(Y) != host(Z))) & (all Y all Z (Y != Z & host(Y) = host(Z) -> -setIn(Z,alive) | -setIn(Y,alive))) & (all Y all Z all Pid0 (norm = index(status,host(Pid0)) & index(ldr,host(Pid0)) = host(Z) & host(Pid0) = host(Y) & setIn(Pid0,alive) & host(Z) != host(Pid0) -> -elem(m_Down(Y),queue(host(Z))))) & (all Y all Z all Pid20 all Pid0 (setIn(Y,alive) & host(Pid0) = host(Pid20) & host(Z) = host(Y) & setIn(Pid20,alive) & host(Y) != host(Pid20) -> -(elem(m_Down(Pid0),queue(host(Y))) & setIn(host(Z),index(down,host(Pid20)))))) & queue(host(W)) = cons(m_Halt(X),V) & (all Y all Z all Pid20 all Pid0 ((all V0 (leq(s(zero),V0) & -leq(host(Pid0),V0) -> setIn(V0,index(down,host(Pid0))) | V0 = host(Pid20))) & host(Pid0) = host(Z) & nbr_proc = host(Pid0) & elec_1 = index(status,host(Pid0)) & elem(m_Down(Pid20),queue(host(Pid0))) -> -(setIn(Y,alive) & elem(m_Down(Z),queue(host(Y)))))) & (all Y all Z all Pid20 all Pid0 (host(Y) != host(Pid20) & setIn(Y,alive) & setIn(Pid20,alive) & host(Pid20) = host(Pid0) & host(Z) = host(Y) -> -(elem(m_Down(Pid0),queue(host(Y))) & elem(m_Down(Z),queue(host(Pid20)))))) & (all Y all Z all Pid0 (host(Pid0) != host(Z) & setIn(Pid0,alive) & host(Y) = host(Pid0) & host(index(elid,host(Pid0))) = host(Z) & index(status,host(Pid0)) = wait -> -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 (nbr_proc = host(Z) -> -elem(m_NotNorm(Y),queue(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(s(zero),V0) & -leq(host(Y0),V0) -> setIn(V0,index(down,host(Y0))) | host(X0) = V0)) & elem(m_Down(X0),snoc(queue(host(Y0)),m_Ack(X,W))) & host(Z) = host(Y0) & host(Y0) = nbr_proc & elec_1 = index(status,host(Y0)) -> -(setIn(Y,alive) & elem(m_Down(Z),V)))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
27.99/28.25	82 m_Down(A) != m_Ack(B,C) # label(axiom_12) # label(axiom).  [clausify(13)].
27.99/28.25	111 -elem(A,B) | elem(A,cons(C,B)) # label(axiom_46) # label(axiom).  [clausify(30)].
27.99/28.25	138 A = B | elem(B,C) | -elem(B,snoc(C,A)) # label(axiom_47) # label(axiom).  [clausify(47)].
27.99/28.25	161 queue(host(c2)) = cons(m_Halt(c3),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
27.99/28.25	162 cons(m_Halt(c3),c1) = queue(host(c2)).  [copy(161),flip(a)].
27.99/28.25	163 leq(s(zero),f4(A,B,C,D)) | host(D) != host(B) | host(D) != nbr_proc | index(status,host(D)) != elec_1 | -elem(m_Down(C),queue(host(D))) | -setIn(A,alive) | -elem(m_Down(B),queue(host(A))) # label(conj) # label(negated_conjecture).  [clausify(58)].
27.99/28.25	164 -leq(host(A),f4(B,C,D,A)) | host(A) != host(C) | host(A) != nbr_proc | index(status,host(A)) != elec_1 | -elem(m_Down(D),queue(host(A))) | -setIn(B,alive) | -elem(m_Down(C),queue(host(B))) # label(conj) # label(negated_conjecture).  [clausify(58)].
27.99/28.25	165 -setIn(f4(A,B,C,D),index(down,host(D))) | host(D) != host(B) | host(D) != nbr_proc | index(status,host(D)) != elec_1 | -elem(m_Down(C),queue(host(D))) | -setIn(A,alive) | -elem(m_Down(B),queue(host(A))) # label(conj) # label(negated_conjecture).  [clausify(58)].
27.99/28.25	166 host(A) != f4(B,C,A,D) | host(D) != host(C) | host(D) != nbr_proc | index(status,host(D)) != elec_1 | -elem(m_Down(A),queue(host(D))) | -setIn(B,alive) | -elem(m_Down(C),queue(host(B))) # label(conj) # label(negated_conjecture).  [clausify(58)].
27.99/28.25	167 f4(A,B,C,D) != host(C) | host(D) != host(B) | host(D) != nbr_proc | index(status,host(D)) != elec_1 | -elem(m_Down(C),queue(host(D))) | -setIn(A,alive) | -elem(m_Down(B),queue(host(A))).  [copy(166),flip(a)].
27.99/28.25	173 setIn(c2,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
27.99/28.25	177 host(c7) = host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
27.99/28.25	178 host(c7) != host(c2) # label(conj) # label(negated_conjecture).  [clausify(58)].
27.99/28.25	179 host(c3) != host(c2).  [copy(178),rewrite([177(2)])].
27.99/28.25	180 -leq(s(zero),A) | leq(host(c7),A) | setIn(A,index(down,host(c7))) | host(c6) = A # label(conj) # label(negated_conjecture).  [clausify(58)].
27.99/28.25	181 -leq(s(zero),A) | leq(host(c3),A) | setIn(A,index(down,host(c3))) | host(c6) = A.  [copy(180),rewrite([177(5),177(9)])].
27.99/28.25	182 elem(m_Down(c6),snoc(queue(host(c7)),m_Ack(c3,c2))) # label(conj) # label(negated_conjecture).  [clausify(58)].
27.99/28.25	183 elem(m_Down(c6),snoc(queue(host(c3)),m_Ack(c3,c2))).  [copy(182),rewrite([177(4)])].
27.99/28.25	184 host(c7) = host(c5) # label(conj) # label(negated_conjecture).  [clausify(58)].
27.99/28.25	185 host(c5) = host(c3).  [copy(184),rewrite([177(2)]),flip(a)].
27.99/28.25	186 host(c7) = nbr_proc # label(conj) # label(negated_conjecture).  [clausify(58)].
27.99/28.25	187 nbr_proc = host(c3).  [copy(186),rewrite([177(2)]),flip(a)].
27.99/28.25	188 index(status,host(c7)) = elec_1 # label(conj) # label(negated_conjecture).  [clausify(58)].
27.99/28.25	189 elec_1 = index(status,host(c3)).  [copy(188),rewrite([177(3)]),flip(a)].
27.99/28.25	191 elem(m_Down(c5),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
27.99/28.25	196 host(c3) = c_0.  [new_symbol(179)].
27.99/28.25	198 f4(A,B,C,D) != host(C) | host(D) != host(B) | host(D) != c_0 | index(status,host(D)) != index(status,c_0) | -elem(m_Down(C),queue(host(D))) | -setIn(A,alive) | -elem(m_Down(B),queue(host(A))).  [back_rewrite(167),rewrite([187(8),196(9),189(13),196(15)])].
27.99/28.25	199 -setIn(f4(A,B,C,D),index(down,host(D))) | host(D) != host(B) | host(D) != c_0 | index(status,host(D)) != index(status,c_0) | -elem(m_Down(C),queue(host(D))) | -setIn(A,alive) | -elem(m_Down(B),queue(host(A))).  [back_rewrite(165),rewrite([187(10),196(11),189(15),196(17)])].
27.99/28.25	200 -leq(host(A),f4(B,C,D,A)) | host(A) != host(C) | host(A) != c_0 | index(status,host(A)) != index(status,c_0) | -elem(m_Down(D),queue(host(A))) | -setIn(B,alive) | -elem(m_Down(C),queue(host(B))).  [back_rewrite(164),rewrite([187(8),196(9),189(13),196(15)])].
27.99/28.25	201 leq(s(zero),f4(A,B,C,D)) | host(D) != host(B) | host(D) != c_0 | index(status,host(D)) != index(status,c_0) | -elem(m_Down(C),queue(host(D))) | -setIn(A,alive) | -elem(m_Down(B),queue(host(A))).  [back_rewrite(163),rewrite([187(9),196(10),189(14),196(16)])].
27.99/28.25	218 host(c5) = c_0.  [back_rewrite(185),rewrite([196(4)])].
27.99/28.25	219 elem(m_Down(c6),snoc(queue(c_0),m_Ack(c3,c2))).  [back_rewrite(183),rewrite([196(4)])].
27.99/28.25	220 -leq(s(zero),A) | leq(c_0,A) | setIn(A,index(down,c_0)) | host(c6) = A.  [back_rewrite(181),rewrite([196(5),196(8)])].
27.99/28.25	314 elem(m_Down(c5),cons(A,c1)).  [resolve(191,a,111,a)].
27.99/28.25	328 f4(c2,A,B,C) != host(B) | host(C) != host(A) | host(C) != c_0 | index(status,host(C)) != index(status,c_0) | -elem(m_Down(B),queue(host(C))) | -elem(m_Down(A),queue(host(c2))).  [resolve(198,f,173,a)].
27.99/28.25	329 -setIn(f4(A,B,C,c3),index(down,c_0)) | host(B) != c_0 | -elem(m_Down(C),queue(c_0)) | -setIn(A,alive) | -elem(m_Down(B),queue(host(A))).  [para(196(a,1),199(a,2,2)),rewrite([196(8),196(11),196(15),196(22)]),flip(b),xx(c),xx(d)].
27.99/28.25	331 -leq(host(A),f4(c2,B,C,A)) | host(A) != host(B) | host(A) != c_0 | index(status,host(A)) != index(status,c_0) | -elem(m_Down(C),queue(host(A))) | -elem(m_Down(B),queue(host(c2))).  [resolve(200,f,173,a)].
27.99/28.25	333 leq(s(zero),f4(c2,A,B,C)) | host(C) != host(A) | host(C) != c_0 | index(status,host(C)) != index(status,c_0) | -elem(m_Down(B),queue(host(C))) | -elem(m_Down(A),queue(host(c2))).  [resolve(201,f,173,a)].
27.99/28.25	350 elem(m_Down(c6),queue(c_0)).  [resolve(219,a,138,c),unit_del(a(flip),82)].
27.99/28.25	471 f4(c2,A,B,c3) != host(B) | host(A) != c_0 | -elem(m_Down(B),queue(c_0)) | -elem(m_Down(A),queue(host(c2))).  [para(196(a,1),328(e,2,1)),rewrite([196(7),196(10),196(14)]),flip(b),xx(c),xx(d)].
27.99/28.25	474 f4(c2,A,c6,c3) != host(c6) | host(A) != c_0 | -elem(m_Down(A),queue(host(c2))).  [resolve(471,c,350,a)].
27.99/28.25	479 elem(m_Down(c5),queue(host(c2))).  [para(162(a,1),314(a,2))].
27.99/28.25	543 -leq(c_0,f4(c2,A,B,c3)) | host(A) != c_0 | -elem(m_Down(B),queue(c_0)) | -elem(m_Down(A),queue(host(c2))).  [para(196(a,1),331(e,2,1)),rewrite([196(2),196(7),196(10),196(14)]),flip(b),xx(c),xx(d)].
27.99/28.25	554 f4(c2,c5,c6,c3) != host(c6).  [resolve(479,a,474,c),rewrite([218(10)]),xx(b)].
27.99/28.25	660 -leq(c_0,f4(c2,c5,A,c3)) | -elem(m_Down(A),queue(c_0)).  [resolve(543,d,479,a),rewrite([218(8)]),xx(b)].
27.99/28.25	661 -leq(c_0,f4(c2,c5,c6,c3)).  [resolve(660,b,350,a)].
27.99/28.25	2698 leq(s(zero),f4(c2,c5,A,B)) | host(B) != c_0 | index(status,host(B)) != index(status,c_0) | -elem(m_Down(A),queue(host(B))).  [resolve(333,f,479,a),rewrite([218(9)]),merge(c)].
27.99/28.25	14715 leq(s(zero),f4(c2,c5,A,c3)) | -elem(m_Down(A),queue(c_0)).  [para(196(a,1),2698(d,2,1)),rewrite([196(9),196(13)]),xx(b),xx(c)].
27.99/28.25	14730 leq(s(zero),f4(c2,c5,c6,c3)).  [resolve(14715,b,350,a)].
27.99/28.25	14756 setIn(f4(c2,c5,c6,c3),index(down,c_0)).  [resolve(14730,a,220,a),flip(c),unit_del(a,661),unit_del(c,554)].
27.99/28.25	14799 $F.  [resolve(14756,a,329,a),rewrite([218(2)]),xx(a),unit_del(a,350),unit_del(b,173),unit_del(c,479)].
27.99/28.25	
27.99/28.25	% SZS output end Refutation
27.99/28.25	============================== end of proof ==========================
27.99/28.25	
27.99/28.25	============================== STATISTICS ============================
27.99/28.25	
27.99/28.25	Given=5934. Generated=1974642. Kept=14728. proofs=1.
27.99/28.25	Usable=5876. Sos=8558. Demods=48. Limbo=0, Disabled=417. Hints=0.
27.99/28.25	Megabytes=22.63.
27.99/28.25	User_CPU=26.09, System_CPU=1.06, Wall_clock=28.
27.99/28.25	
27.99/28.25	============================== end of statistics =====================
27.99/28.25	
27.99/28.25	============================== end of search =========================
27.99/28.25	
27.99/28.25	THEOREM PROVED
27.99/28.25	% SZS status Theorem
27.99/28.25	
27.99/28.25	Exiting with 1 proof.
27.99/28.25	
27.99/28.25	Process 4676 exit (max_proofs) Mon Jul  3 08:20:07 2023
27.99/28.25	Prover9 interrupted
27.99/28.25	EOF