0.00/0.11	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.12	% Command  : tptp2X_and_run_prover9 %d %s
0.13/0.33	% Computer : n008.cluster.edu
0.13/0.33	% Model    : x86_64 x86_64
0.13/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.33	% Memory   : 8042.1875MB
0.13/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.33	% CPULimit : 1440
0.13/0.33	% WCLimit  : 180
0.13/0.33	% DateTime : Mon Jul  3 06:45:34 EDT 2023
0.13/0.33	% CPUTime  : 
0.77/1.02	============================== Prover9 ===============================
0.77/1.02	Prover9 (32) version 2009-11A, November 2009.
0.77/1.02	Process 20060 was started by sandbox on n008.cluster.edu,
0.77/1.02	Mon Jul  3 06:45:35 2023
0.77/1.02	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_19907_n008.cluster.edu".
0.77/1.02	============================== end of head ===========================
0.77/1.02	
0.77/1.02	============================== INPUT =================================
0.77/1.02	
0.77/1.02	% Reading from file /tmp/Prover9_19907_n008.cluster.edu
0.77/1.02	
0.77/1.02	set(prolog_style_variables).
0.77/1.02	set(auto2).
0.77/1.02	    % set(auto2) -> set(auto).
0.77/1.02	    % set(auto) -> set(auto_inference).
0.77/1.02	    % set(auto) -> set(auto_setup).
0.77/1.02	    % set(auto_setup) -> set(predicate_elim).
0.77/1.02	    % set(auto_setup) -> assign(eq_defs, unfold).
0.77/1.02	    % set(auto) -> set(auto_limits).
0.77/1.02	    % set(auto_limits) -> assign(max_weight, "100.000").
0.77/1.02	    % set(auto_limits) -> assign(sos_limit, 20000).
0.77/1.02	    % set(auto) -> set(auto_denials).
0.77/1.02	    % set(auto) -> set(auto_process).
0.77/1.02	    % set(auto2) -> assign(new_constants, 1).
0.77/1.02	    % set(auto2) -> assign(fold_denial_max, 3).
0.77/1.02	    % set(auto2) -> assign(max_weight, "200.000").
0.77/1.02	    % set(auto2) -> assign(max_hours, 1).
0.77/1.02	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.77/1.02	    % set(auto2) -> assign(max_seconds, 0).
0.77/1.02	    % set(auto2) -> assign(max_minutes, 5).
0.77/1.02	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.77/1.02	    % set(auto2) -> set(sort_initial_sos).
0.77/1.02	    % set(auto2) -> assign(sos_limit, -1).
0.77/1.02	    % set(auto2) -> assign(lrs_ticks, 3000).
0.77/1.02	    % set(auto2) -> assign(max_megs, 400).
0.77/1.02	    % set(auto2) -> assign(stats, some).
0.77/1.02	    % set(auto2) -> clear(echo_input).
0.77/1.02	    % set(auto2) -> set(quiet).
0.77/1.02	    % set(auto2) -> clear(print_initial_clauses).
0.77/1.02	    % set(auto2) -> clear(print_given).
0.77/1.02	assign(lrs_ticks,-1).
0.77/1.02	assign(sos_limit,10000).
0.77/1.02	assign(order,kbo).
0.77/1.02	set(lex_order_vars).
0.77/1.02	clear(print_given).
0.77/1.02	
0.77/1.02	% formulas(sos).  % not echoed (67 formulas)
0.77/1.02	
0.77/1.02	============================== end of input ==========================
0.77/1.02	
0.77/1.02	% From the command line: assign(max_seconds, 1440).
0.77/1.02	
0.77/1.02	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.77/1.02	
0.77/1.02	% Formulas that are not ordinary clauses:
0.77/1.02	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.77/1.02	2 (all X all Y (m_Ldr(X) != m_Ldr(Y) <-> X != Y)) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	3 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	4 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	5 (all X (ordered(cons(X,q_nil)) & ordered(snoc(q_nil,X)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	6 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	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.77/1.02	8 (all X all Y (X != Y <-> m_NormQ(X) != m_NormQ(Y))) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	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.77/1.02	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.77/1.02	11 (all X all Y all Z m_Halt(Z) != m_Ack(X,Y)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	12 (all X all Y all Z m_NotNorm(Z) != m_Ack(X,Y)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	13 (all X all Y all Z m_Ack(X,Y) != m_Down(Z)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	14 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	15 (all X all Y (Y = X <-> leq(Y,X) & leq(X,Y))) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	16 (all X all Q X = head(cons(X,Q))) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	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.77/1.02	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.77/1.02	19 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	20 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	21 (all X all Y m_NormQ(Y) != m_Ldr(X)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	22 (all X X = pidMsg(m_Halt(X))) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	23 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	24 (all Q (cons(head(Q),tail(Q)) = Q | Q = q_nil)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	25 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	26 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	27 (all P all Q (host(Q) = s(host(P)) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	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.77/1.02	29 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	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.77/1.02	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.77/1.02	32 (all X all Y (m_Halt(Y) != m_Halt(X) <-> Y != X)) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	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.77/1.02	34 (all Y all Q Q = init(snoc(Q,Y))) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	35 (all Q (Q = q_nil | snoc(init(Q),last(Q)) = Q)) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	36 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	37 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	38 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	39 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	40 (all X all Y (m_Down(X) != m_Down(Y) <-> X != Y)) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	41 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	42 (all Y all Q Y = last(snoc(Q,Y))) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	43 (all X all Y m_Ldr(X) != m_NotNorm(Y)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	44 (all X all Y (Y != X <-> m_NotNorm(X) != m_NotNorm(Y))) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	45 (all X all Y m_NotNorm(Y) != m_NormQ(X)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	46 (all X all Y m_Ldr(Y) != m_Down(X)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	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.77/1.02	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.77/1.02	49 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.77/1.02	50 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
12.47/12.77	51 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
12.47/12.77	52 (all X all Y all Z m_Ldr(Z) != m_Ack(X,Y)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
12.47/12.77	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].
12.47/12.77	54 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
12.47/12.77	55 (all X all Y m_NormQ(Y) != m_Down(X)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
12.47/12.77	56 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
12.47/12.77	57 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
12.47/12.77	58 -(all V all W all X all Y ((all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Z) != host(Pid0))) & (all Z all Pid20 all Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid20))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (host(Pid0) = host(Z) & Z != Pid0 -> -setIn(Pid0,alive) | -setIn(Z,alive))) & queue(host(X)) = cons(m_Down(Y),V) & (all Z all Pid30 all Pid20 all Pid0 (setIn(Z,alive) & setIn(Pid20,alive) & host(Pid20) = host(Pid0) & host(Z) = host(Pid30) & host(Pid20) != host(Z) -> -(setIn(host(Pid30),index(down,host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & (all Z all Pid30 all Pid20 all Pid0 (setIn(Z,alive) & host(Pid20) = host(Pid0) & host(Pid30) = host(Z) & setIn(Pid20,alive) & host(Z) != host(Pid20) -> -(elem(m_Down(Pid30),queue(host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & (all Z all Pid0 (leq(Pid0,Z) & host(Z) = host(Pid0) & -setIn(Z,alive) -> -setIn(Pid0,alive))) & (all Z all Pid0 (elem(m_Halt(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> -setIn(Pid0,alive))) -> (setIn(X,alive) -> (-leq(host(X),host(Y)) -> (norm = index(status,host(X)) & index(ldr,host(X)) = host(Y) | host(Y) = host(index(elid,host(X))) & wait = index(status,host(X)) -> ((all Z (host(X) = host(Z) -> leq(Z,W))) & host(X) = host(W) & -setIn(W,pids) -> (host(W) != s(zero) -> (all Z (host(Z) = host(X) -> (all X0 all Y0 (host(Y0) != host(W) -> (host(Y0) != host(X) -> (all Z0 ((W = Y0 | X != Y0 & setIn(Y0,alive)) & host(Z0) = host(Y0) & host(X0) = host(Z) & host(Z) != host(Y0) & (W = Z | Z != X & setIn(Z,alive)) -> -(setIn(host(X0),index(down,host(Y0))) & elem(m_Down(Z0),V)))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
12.47/12.77	
12.47/12.77	============================== end of process non-clausal formulas ===
12.47/12.77	
12.47/12.77	============================== PROCESS INITIAL CLAUSES ===============
12.47/12.77	
12.47/12.77	============================== PREDICATE ELIMINATION =================
12.47/12.77	
12.47/12.77	============================== end predicate elimination =============
12.47/12.77	
12.47/12.77	Auto_denials:  (non-Horn, no changes).
12.47/12.77	
12.47/12.77	Term ordering decisions:
12.47/12.77	Function symbol KB weights:  alive=1. q_nil=1. status=1. down=1. elid=1. ldr=1. nbr_proc=1. norm=1. pids=1. wait=1. zero=1. elec_1=1. elec_2=1. nil=1. setEmpty=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. cons=1. snoc=1. index=1. m_Ack=1. f1=1. f2=1. host=1. pidMsg=1. m_Down=1. s=1. m_Halt=1. queue=1. m_Ldr=1. m_NormQ=1. m_NotNorm=1. head=1. init=1. last=1. tail=1. f3=1.
12.47/12.77	
12.47/12.77	============================== end of process initial clauses ========
12.47/12.77	
12.47/12.77	============================== CLAUSES FOR SEARCH ====================
12.47/12.77	
12.47/12.77	============================== end of clauses for search =============
12.47/12.77	
12.47/12.77	============================== SEARCH ================================
12.47/12.77	
12.47/12.77	% Starting search at 0.03 seconds.
12.47/12.77	
12.47/12.77	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 113 (0.00 of 0.35 sec).
12.47/12.77	
12.47/12.77	Low Water (keep): wt=16.000, iters=3523
12.47/12.77	
12.47/12.77	Low Water (keep): wt=15.000, iters=3714
12.47/12.77	
12.47/12.77	Low Water (keep): wt=14.000, iters=3586
12.47/12.77	
12.47/12.77	============================== PROOF =================================
12.47/12.77	% SZS status Theorem
12.47/12.77	% SZS output start Refutation
12.47/12.77	
12.47/12.77	% Proof 1 at 11.28 (+ 0.49) seconds.
12.47/12.77	% Length of proof is 27.
12.47/12.77	% Level of proof is 9.
12.47/12.77	% Maximum clause weight is 34.000.
12.47/12.77	% Given clauses 4204.
12.47/12.77	
12.47/12.77	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].
12.47/12.77	58 -(all V all W all X all Y ((all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Z) != host(Pid0))) & (all Z all Pid20 all Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid20))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (host(Pid0) = host(Z) & Z != Pid0 -> -setIn(Pid0,alive) | -setIn(Z,alive))) & queue(host(X)) = cons(m_Down(Y),V) & (all Z all Pid30 all Pid20 all Pid0 (setIn(Z,alive) & setIn(Pid20,alive) & host(Pid20) = host(Pid0) & host(Z) = host(Pid30) & host(Pid20) != host(Z) -> -(setIn(host(Pid30),index(down,host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & (all Z all Pid30 all Pid20 all Pid0 (setIn(Z,alive) & host(Pid20) = host(Pid0) & host(Pid30) = host(Z) & setIn(Pid20,alive) & host(Z) != host(Pid20) -> -(elem(m_Down(Pid30),queue(host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & (all Z all Pid0 (leq(Pid0,Z) & host(Z) = host(Pid0) & -setIn(Z,alive) -> -setIn(Pid0,alive))) & (all Z all Pid0 (elem(m_Halt(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> -setIn(Pid0,alive))) -> (setIn(X,alive) -> (-leq(host(X),host(Y)) -> (norm = index(status,host(X)) & index(ldr,host(X)) = host(Y) | host(Y) = host(index(elid,host(X))) & wait = index(status,host(X)) -> ((all Z (host(X) = host(Z) -> leq(Z,W))) & host(X) = host(W) & -setIn(W,pids) -> (host(W) != s(zero) -> (all Z (host(Z) = host(X) -> (all X0 all Y0 (host(Y0) != host(W) -> (host(Y0) != host(X) -> (all Z0 ((W = Y0 | X != Y0 & setIn(Y0,alive)) & host(Z0) = host(Y0) & host(X0) = host(Z) & host(Z) != host(Y0) & (W = Z | Z != X & setIn(Z,alive)) -> -(setIn(host(X0),index(down,host(Y0))) & elem(m_Down(Z0),V)))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
12.47/12.77	112 -elem(A,B) | elem(A,cons(C,B)) # label(axiom_46) # label(axiom).  [clausify(30)].
12.47/12.77	163 queue(host(c3)) = cons(m_Down(c4),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
12.47/12.77	164 cons(m_Down(c4),c1) = queue(host(c3)).  [copy(163),flip(a)].
12.47/12.77	165 -setIn(A,alive) | -setIn(B,alive) | host(B) != host(C) | host(D) != host(A) | host(B) = host(A) | -setIn(host(D),index(down,host(B))) | -elem(m_Down(C),queue(host(A))) # label(conj) # label(negated_conjecture).  [clausify(58)].
12.47/12.77	170 setIn(c3,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
12.47/12.77	178 host(c2) = host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
12.47/12.77	179 host(c3) = host(c2).  [copy(178),flip(a)].
12.47/12.77	182 host(c5) = host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
12.47/12.77	183 host(c5) = host(c2).  [copy(182),rewrite([179(4)])].
12.47/12.77	184 host(c7) != host(c2) # label(conj) # label(negated_conjecture).  [clausify(58)].
12.47/12.77	187 c7 = c2 | setIn(c7,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
12.47/12.77	188 host(c8) = host(c7) # label(conj) # label(negated_conjecture).  [clausify(58)].
12.47/12.77	189 host(c6) = host(c5) # label(conj) # label(negated_conjecture).  [clausify(58)].
12.47/12.77	190 host(c6) = host(c2).  [copy(189),rewrite([183(4)])].
12.47/12.77	196 setIn(host(c6),index(down,host(c7))) # label(conj) # label(negated_conjecture).  [clausify(58)].
12.47/12.77	197 setIn(host(c2),index(down,host(c7))).  [copy(196),rewrite([190(2)])].
12.47/12.77	198 elem(m_Down(c8),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
12.47/12.77	205 cons(m_Down(c4),c1) = queue(host(c2)).  [back_rewrite(164),rewrite([179(6)])].
12.47/12.77	291 -setIn(A,alive) | host(A) != host(B) | host(c2) != host(C) | host(c2) = host(A) | -setIn(host(C),index(down,host(A))) | -elem(m_Down(B),queue(host(c2))).  [resolve(170,a,165,a),rewrite([179(8),179(12),179(21)]),flip(c),flip(d)].
12.47/12.77	319 elem(m_Down(c8),cons(A,c1)).  [resolve(198,a,112,a)].
12.47/12.77	586 elem(m_Down(c8),queue(host(c2))).  [para(205(a,1),319(a,2))].
12.47/12.77	2196 -setIn(c7,alive) | host(c7) != host(A) | -elem(m_Down(A),queue(host(c2))).  [resolve(291,e,197,a),flip(d),xx(c),unit_del(c,184)].
12.47/12.77	2207 host(c7) != host(A) | -elem(m_Down(A),queue(host(c2))) | c7 = c2.  [resolve(2196,a,187,b)].
12.47/12.77	12464 c7 = c2.  [resolve(2207,b,586,a),rewrite([188(4)]),xx(a)].
12.47/12.77	12489 $F.  [back_rewrite(184),rewrite([12464(1)]),xx(a)].
12.47/12.77	
12.47/12.77	% SZS output end Refutation
12.47/12.77	============================== end of proof ==========================
12.47/12.77	
12.47/12.77	============================== STATISTICS ============================
12.47/12.77	
12.47/12.77	Given=4204. Generated=937151. Kept=12413. proofs=1.
12.47/12.77	Usable=4020. Sos=7488. Demods=39. Limbo=25, Disabled=1007. Hints=0.
12.47/12.77	Megabytes=16.06.
12.47/12.77	User_CPU=11.28, System_CPU=0.49, Wall_clock=11.
12.47/12.77	
12.47/12.77	============================== end of statistics =====================
12.47/12.77	
12.47/12.77	============================== end of search =========================
12.47/12.77	
12.47/12.77	THEOREM PROVED
12.47/12.77	% SZS status Theorem
12.47/12.77	
12.47/12.77	Exiting with 1 proof.
12.47/12.77	
12.47/12.77	Process 20060 exit (max_proofs) Mon Jul  3 06:45:46 2023
12.47/12.77	Prover9 interrupted
12.47/12.77	EOF