0.00/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.34	% Computer   : n011.cluster.edu
0.12/0.34	% Model      : x86_64 x86_64
0.12/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory     : 8042.1875MB
0.12/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 1200
0.12/0.34	% DateTime   : Wed Jul 14 14:24:25 EDT 2021
0.12/0.34	% CPUTime    : 
0.76/1.05	============================== Prover9 ===============================
0.76/1.05	Prover9 (32) version 2009-11A, November 2009.
0.76/1.05	Process 1168 was started by sandbox on n011.cluster.edu,
0.76/1.05	Wed Jul 14 14:24:25 2021
0.76/1.05	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_988_n011.cluster.edu".
0.76/1.05	============================== end of head ===========================
0.76/1.05	
0.76/1.05	============================== INPUT =================================
0.76/1.05	
0.76/1.05	% Reading from file /tmp/Prover9_988_n011.cluster.edu
0.76/1.05	
0.76/1.05	set(prolog_style_variables).
0.76/1.05	set(auto2).
0.76/1.05	    % set(auto2) -> set(auto).
0.76/1.05	    % set(auto) -> set(auto_inference).
0.76/1.05	    % set(auto) -> set(auto_setup).
0.76/1.05	    % set(auto_setup) -> set(predicate_elim).
0.76/1.05	    % set(auto_setup) -> assign(eq_defs, unfold).
0.76/1.05	    % set(auto) -> set(auto_limits).
0.76/1.05	    % set(auto_limits) -> assign(max_weight, "100.000").
0.76/1.05	    % set(auto_limits) -> assign(sos_limit, 20000).
0.76/1.05	    % set(auto) -> set(auto_denials).
0.76/1.05	    % set(auto) -> set(auto_process).
0.76/1.05	    % set(auto2) -> assign(new_constants, 1).
0.76/1.05	    % set(auto2) -> assign(fold_denial_max, 3).
0.76/1.05	    % set(auto2) -> assign(max_weight, "200.000").
0.76/1.05	    % set(auto2) -> assign(max_hours, 1).
0.76/1.05	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.76/1.05	    % set(auto2) -> assign(max_seconds, 0).
0.76/1.05	    % set(auto2) -> assign(max_minutes, 5).
0.76/1.05	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.76/1.05	    % set(auto2) -> set(sort_initial_sos).
0.76/1.05	    % set(auto2) -> assign(sos_limit, -1).
0.76/1.05	    % set(auto2) -> assign(lrs_ticks, 3000).
0.76/1.05	    % set(auto2) -> assign(max_megs, 400).
0.76/1.05	    % set(auto2) -> assign(stats, some).
0.76/1.05	    % set(auto2) -> clear(echo_input).
0.76/1.05	    % set(auto2) -> set(quiet).
0.76/1.05	    % set(auto2) -> clear(print_initial_clauses).
0.76/1.05	    % set(auto2) -> clear(print_given).
0.76/1.05	assign(lrs_ticks,-1).
0.76/1.05	assign(sos_limit,10000).
0.76/1.05	assign(order,kbo).
0.76/1.05	set(lex_order_vars).
0.76/1.05	clear(print_given).
0.76/1.05	
0.76/1.05	% formulas(sos).  % not echoed (67 formulas)
0.76/1.05	
0.76/1.05	============================== end of input ==========================
0.76/1.05	
0.76/1.05	% From the command line: assign(max_seconds, 1200).
0.76/1.05	
0.76/1.05	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.76/1.05	
0.76/1.05	% Formulas that are not ordinary clauses:
0.76/1.05	1 (all X (ordered(cons(X,q_nil)) & ordered(snoc(q_nil,X)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	2 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	3 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	4 (all X all Y all Z m_Down(Z) != m_Ack(X,Y)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	5 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	6 (all X all Q X = head(cons(X,Q))) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	7 (all X all Y all Z (leq(X,Y) & leq(Y,Z) -> leq(X,Z))) # label(axiom_62) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	8 (all Q (cons(head(Q),tail(Q)) = Q | q_nil = Q)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	9 (all X all Y (X != Y <-> m_Halt(X) != m_Halt(Y))) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	10 (all Pid all Pid2 (host(Pid2) != host(Pid) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	11 (all X all Y m_Down(X) != m_NotNorm(Y)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	12 (all X all Y (leq(Y,X) | leq(X,Y))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	13 (all P all Q (s(host(P)) = host(Q) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	14 (all X all Y (m_NormQ(Y) != m_NormQ(X) <-> X != Y)) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	15 (all X all Y all Z m_Halt(Z) != m_Ack(X,Y)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	16 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	17 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	18 (all X1 all X2 all Y1 all Y2 (Y2 != Y1 -> m_Ack(X1,Y1) != m_Ack(X2,Y2))) # label(axiom_32) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	19 (all X (pidElem(X) <-> (exists Y (X = m_Down(Y) | m_Halt(Y) = X)))) # label(axiom_48) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	20 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	21 (all X all Y (X = s(Y) | leq(X,Y) <-> leq(X,s(Y)))) # label(axiom_64) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	22 (all X pidMsg(m_Halt(X)) = X) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	23 (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.76/1.05	24 (all X all Y (m_NotNorm(X) != m_NotNorm(Y) <-> X != Y)) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	25 (all Y all Q last(snoc(Q,Y)) = Y) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	26 (all X all Y (X != Y <-> m_Ldr(Y) != m_Ldr(X))) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	27 (all X all Y all Q (elem(X,Q) | Y = X <-> elem(X,snoc(Q,Y)))) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	28 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	29 (all Q (Q = snoc(init(Q),last(Q)) | q_nil = Q)) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	30 (all X cons(X,q_nil) = snoc(q_nil,X)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	31 (all X all Y (X = Y <-> leq(X,Y) & leq(Y,X))) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	32 (all X all Y m_NormQ(X) != m_Halt(Y)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	33 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	34 (all X all Y all Z m_Ack(X,Y) != m_NotNorm(Z)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	35 (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.76/1.05	36 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	37 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	38 (all X all Y m_NotNorm(X) != m_Halt(Y)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	39 (all X all Y all Q (elem(X,cons(Y,Q)) <-> X = Y | elem(X,Q))) # label(axiom_46) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	40 (all X all Y m_NormQ(Y) != m_Down(X)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	41 (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.76/1.05	42 (all X all Y all Z m_NormQ(Z) != m_Ack(X,Y)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	43 (all X all Y (m_Down(Y) != m_Down(X) <-> Y != X)) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	44 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	45 (all Y all Q Q = init(snoc(Q,Y))) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	46 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	47 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	48 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	49 (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.76/1.05	50 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	51 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.76/1.05	52 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
1.04/1.32	53 (all X all Q (ordered(cons(X,Q)) <-> (all Y (elem(Y,Q) & pidElem(Y) & host(pidMsg(Y)) = host(pidMsg(X)) & pidElem(X) -> leq(pidMsg(X),pidMsg(Y)))) & ordered(Q))) # label(axiom_53) # label(axiom) # label(non_clause).  [assumption].
1.04/1.32	54 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
1.04/1.32	55 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
1.04/1.32	56 (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].
1.04/1.32	57 (all X all Q ((all Y (elem(Y,Q) & pidElem(X) & host(pidMsg(Y)) = host(pidMsg(X)) & pidElem(Y) -> leq(pidMsg(Y),pidMsg(X)))) & ordered(Q) <-> ordered(snoc(Q,X)))) # label(axiom_54) # label(axiom) # label(non_clause).  [assumption].
1.04/1.32	58 -(all V all W all X all Y ((all Z all Pid0 (setIn(Pid0,alive) -> -elem(m_Down(Pid0),queue(host(Z))))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> -setIn(Pid0,alive))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Z) != host(Pid0))) & (all Z all Pid0 (elem(m_Halt(Pid0),queue(host(Z))) -> -leq(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 (-setIn(Z,alive) & host(Pid0) = host(Z) & leq(Pid0,Z) -> -setIn(Pid0,alive))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) != host(Z) & setIn(Pid20,alive) & host(Pid30) = host(Z) & host(Pid20) = host(Pid0) & setIn(Z,alive) -> -(elem(m_Down(Pid0),queue(host(Z))) & elem(m_Down(Pid30),queue(host(Pid20)))))) & cons(m_Ack(W,Y),V) = queue(host(X)) & (all Z all Pid0 (Z != Pid0 & host(Z) = host(Pid0) -> -setIn(Pid0,alive) | -setIn(Z,alive))) -> (setIn(X,alive) -> (elec_2 = index(status,host(X)) & index(pendack,host(X)) = host(Y) & W = index(elid,host(X)) -> (leq(nbr_proc,index(pendack,host(X))) -> (all Z (setIn(host(Z),index(acks,host(X))) | host(Z) = host(Y) -> (all V0 (host(Z) != host(V0) -> (host(X) = host(V0) -> (all W0 all X0 (host(Z) = host(X0) -> (host(X) != host(X0) -> (all Y0 (host(Y0) = host(X0) & host(V0) = host(W0) & setIn(X0,alive) & setIn(V0,alive) & host(V0) != host(X0) -> -(elem(m_Down(Y0),V) & elem(m_Down(W0),snoc(queue(host(X0)),m_Ldr(X))))))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
1.04/1.32	
1.04/1.32	============================== end of process non-clausal formulas ===
1.04/1.32	
1.04/1.32	============================== PROCESS INITIAL CLAUSES ===============
1.04/1.32	
1.04/1.32	============================== PREDICATE ELIMINATION =================
1.04/1.32	
1.04/1.32	============================== end predicate elimination =============
1.04/1.32	
1.04/1.32	Auto_denials:  (non-Horn, no changes).
1.04/1.32	
1.04/1.32	Term ordering decisions:
1.04/1.32	Function symbol KB weights:  alive=1. q_nil=1. nbr_proc=1. pendack=1. pids=1. zero=1. acks=1. elec_2=1. elid=1. status=1. elec_1=1. nil=1. norm=1. setEmpty=1. wait=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. snoc=1. cons=1. m_Ack=1. index=1. f2=1. f3=1. host=1. pidMsg=1. m_Down=1. s=1. m_Halt=1. m_Ldr=1. queue=1. m_NormQ=1. m_NotNorm=1. head=1. init=1. last=1. tail=1. f1=1.
1.04/1.32	
1.04/1.32	============================== end of process initial clauses ========
1.04/1.32	
1.04/1.32	============================== CLAUSES FOR SEARCH ====================
1.04/1.32	
1.04/1.32	============================== end of clauses for search =============
1.04/1.32	
1.04/1.32	============================== SEARCH ================================
1.04/1.32	
1.04/1.32	% Starting search at 0.03 seconds.
1.04/1.32	
1.04/1.32	============================== PROOF =================================
1.04/1.32	% SZS status Theorem
1.04/1.32	% SZS output start Refutation
1.04/1.32	
1.04/1.32	% Proof 1 at 0.27 (+ 0.01) seconds.
1.04/1.32	% Length of proof is 35.
1.04/1.32	% Level of proof is 7.
1.04/1.32	% Maximum clause weight is 33.000.
1.04/1.32	% Given clauses 442.
1.04/1.32	
1.04/1.32	27 (all X all Y all Q (elem(X,Q) | Y = X <-> elem(X,snoc(Q,Y)))) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
1.04/1.32	39 (all X all Y all Q (elem(X,cons(Y,Q)) <-> X = Y | elem(X,Q))) # label(axiom_46) # label(axiom) # label(non_clause).  [assumption].
1.04/1.32	44 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
1.04/1.32	58 -(all V all W all X all Y ((all Z all Pid0 (setIn(Pid0,alive) -> -elem(m_Down(Pid0),queue(host(Z))))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> -setIn(Pid0,alive))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Z) != host(Pid0))) & (all Z all Pid0 (elem(m_Halt(Pid0),queue(host(Z))) -> -leq(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 (-setIn(Z,alive) & host(Pid0) = host(Z) & leq(Pid0,Z) -> -setIn(Pid0,alive))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) != host(Z) & setIn(Pid20,alive) & host(Pid30) = host(Z) & host(Pid20) = host(Pid0) & setIn(Z,alive) -> -(elem(m_Down(Pid0),queue(host(Z))) & elem(m_Down(Pid30),queue(host(Pid20)))))) & cons(m_Ack(W,Y),V) = queue(host(X)) & (all Z all Pid0 (Z != Pid0 & host(Z) = host(Pid0) -> -setIn(Pid0,alive) | -setIn(Z,alive))) -> (setIn(X,alive) -> (elec_2 = index(status,host(X)) & index(pendack,host(X)) = host(Y) & W = index(elid,host(X)) -> (leq(nbr_proc,index(pendack,host(X))) -> (all Z (setIn(host(Z),index(acks,host(X))) | host(Z) = host(Y) -> (all V0 (host(Z) != host(V0) -> (host(X) = host(V0) -> (all W0 all X0 (host(Z) = host(X0) -> (host(X) != host(X0) -> (all Y0 (host(Y0) = host(X0) & host(V0) = host(W0) & setIn(X0,alive) & setIn(V0,alive) & host(V0) != host(X0) -> -(elem(m_Down(Y0),V) & elem(m_Down(W0),snoc(queue(host(X0)),m_Ldr(X))))))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
1.04/1.32	102 elem(A,B) | C = A | -elem(A,snoc(B,C)) # label(axiom_47) # label(axiom).  [clausify(27)].
1.04/1.32	124 elem(A,cons(B,C)) | -elem(A,C) # label(axiom_46) # label(axiom).  [clausify(39)].
1.04/1.32	131 m_Ldr(A) != m_Down(B) # label(axiom_18) # label(axiom).  [clausify(44)].
1.04/1.32	165 host(A) = host(B) | -setIn(A,alive) | host(C) != host(B) | host(A) != host(D) | -setIn(B,alive) | -elem(m_Down(D),queue(host(B))) | -elem(m_Down(C),queue(host(A))) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.04/1.32	166 queue(host(c3)) = cons(m_Ack(c2,c4),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.04/1.32	167 cons(m_Ack(c2,c4),c1) = queue(host(c3)).  [copy(166),flip(a)].
1.04/1.32	169 setIn(c3,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.04/1.32	178 host(c6) = host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.04/1.32	179 host(c8) = host(c5) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.04/1.32	180 host(c8) != host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.04/1.32	181 host(c5) != host(c3).  [copy(180),rewrite([179(2)])].
1.04/1.32	182 host(c9) = host(c8) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.04/1.32	183 host(c9) = host(c5).  [copy(182),rewrite([179(4)])].
1.04/1.32	184 host(c7) = host(c6) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.04/1.32	185 host(c7) = host(c3).  [copy(184),rewrite([178(4)])].
1.04/1.32	186 setIn(c8,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.04/1.32	189 elem(m_Down(c9),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.04/1.32	190 elem(m_Down(c7),snoc(queue(host(c8)),m_Ldr(c3))) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.04/1.32	191 elem(m_Down(c7),snoc(queue(host(c5)),m_Ldr(c3))).  [copy(190),rewrite([179(4)])].
1.04/1.32	195 host(c5) = c_0.  [new_symbol(181)].
1.04/1.32	196 elem(m_Down(c7),snoc(queue(c_0),m_Ldr(c3))).  [back_rewrite(191),rewrite([195(4)])].
1.04/1.32	197 host(c9) = c_0.  [back_rewrite(183),rewrite([195(4)])].
1.04/1.32	198 host(c3) != c_0.  [back_rewrite(181),rewrite([195(2)]),flip(a)].
1.04/1.32	199 host(c8) = c_0.  [back_rewrite(179),rewrite([195(4)])].
1.04/1.32	288 host(c3) = host(A) | -setIn(A,alive) | host(c3) != host(B) | host(A) != host(C) | -elem(m_Down(C),queue(host(c3))) | -elem(m_Down(B),queue(host(A))).  [resolve(169,a,165,e),flip(a),flip(c)].
1.04/1.32	313 elem(m_Down(c9),cons(A,c1)).  [resolve(189,a,124,b)].
1.04/1.32	328 elem(m_Down(c7),queue(c_0)).  [resolve(196,a,102,c),unit_del(b,131)].
1.04/1.32	570 elem(m_Down(c9),queue(host(c3))).  [para(167(a,1),313(a,2))].
1.04/1.32	1920 host(c3) != host(A) | host(B) != c_0 | -elem(m_Down(B),queue(host(c3))) | -elem(m_Down(A),queue(c_0)).  [resolve(288,b,186,a),rewrite([199(4),199(10),199(19)]),flip(c),unit_del(a,198)].
1.04/1.32	1921 host(c3) != host(A) | -elem(m_Down(A),queue(c_0)).  [resolve(1920,c,570,a),rewrite([197(6)]),xx(b)].
1.04/1.32	1923 $F.  [resolve(1921,b,328,a),rewrite([185(4)]),xx(a)].
1.04/1.32	
1.04/1.32	% SZS output end Refutation
1.04/1.32	============================== end of proof ==========================
1.04/1.32	
1.04/1.32	============================== STATISTICS ============================
1.04/1.32	
1.04/1.32	Given=442. Generated=7245. Kept=1851. proofs=1.
1.04/1.32	Usable=431. Sos=1375. Demods=32. Limbo=0, Disabled=167. Hints=0.
1.04/1.32	Megabytes=3.84.
1.04/1.32	User_CPU=0.27, System_CPU=0.01, Wall_clock=1.
1.04/1.32	
1.04/1.32	============================== end of statistics =====================
1.04/1.32	
1.04/1.32	============================== end of search =========================
1.04/1.32	
1.04/1.32	THEOREM PROVED
1.04/1.32	% SZS status Theorem
1.04/1.32	
1.04/1.32	Exiting with 1 proof.
1.04/1.32	
1.04/1.32	Process 1168 exit (max_proofs) Wed Jul 14 14:24:26 2021
1.04/1.32	Prover9 interrupted
1.04/1.32	EOF