0.13/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.13/0.14	% Command    : tptp2X_and_run_prover9 %d %s
0.14/0.35	% Computer   : n011.cluster.edu
0.14/0.35	% Model      : x86_64 x86_64
0.14/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.35	% Memory     : 8042.1875MB
0.14/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.35	% CPULimit   : 180
0.14/0.35	% DateTime   : Thu Aug 29 10:42:12 EDT 2019
0.14/0.35	% CPUTime    : 
0.81/1.08	============================== Prover9 ===============================
0.81/1.08	Prover9 (32) version 2009-11A, November 2009.
0.81/1.08	Process 17472 was started by sandbox on n011.cluster.edu,
0.81/1.08	Thu Aug 29 10:42:13 2019
0.81/1.08	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 180 -f /tmp/Prover9_17319_n011.cluster.edu".
0.81/1.08	============================== end of head ===========================
0.81/1.08	
0.81/1.08	============================== INPUT =================================
0.81/1.08	
0.81/1.08	% Reading from file /tmp/Prover9_17319_n011.cluster.edu
0.81/1.08	
0.81/1.08	set(prolog_style_variables).
0.81/1.08	set(auto2).
0.81/1.08	    % set(auto2) -> set(auto).
0.81/1.08	    % set(auto) -> set(auto_inference).
0.81/1.08	    % set(auto) -> set(auto_setup).
0.81/1.08	    % set(auto_setup) -> set(predicate_elim).
0.81/1.08	    % set(auto_setup) -> assign(eq_defs, unfold).
0.81/1.08	    % set(auto) -> set(auto_limits).
0.81/1.08	    % set(auto_limits) -> assign(max_weight, "100.000").
0.81/1.08	    % set(auto_limits) -> assign(sos_limit, 20000).
0.81/1.08	    % set(auto) -> set(auto_denials).
0.81/1.08	    % set(auto) -> set(auto_process).
0.81/1.08	    % set(auto2) -> assign(new_constants, 1).
0.81/1.08	    % set(auto2) -> assign(fold_denial_max, 3).
0.81/1.08	    % set(auto2) -> assign(max_weight, "200.000").
0.81/1.08	    % set(auto2) -> assign(max_hours, 1).
0.81/1.08	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.81/1.08	    % set(auto2) -> assign(max_seconds, 0).
0.81/1.08	    % set(auto2) -> assign(max_minutes, 5).
0.81/1.08	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.81/1.08	    % set(auto2) -> set(sort_initial_sos).
0.81/1.08	    % set(auto2) -> assign(sos_limit, -1).
0.81/1.08	    % set(auto2) -> assign(lrs_ticks, 3000).
0.81/1.08	    % set(auto2) -> assign(max_megs, 400).
0.81/1.08	    % set(auto2) -> assign(stats, some).
0.81/1.08	    % set(auto2) -> clear(echo_input).
0.81/1.08	    % set(auto2) -> set(quiet).
0.81/1.08	    % set(auto2) -> clear(print_initial_clauses).
0.81/1.08	    % set(auto2) -> clear(print_given).
0.81/1.08	assign(lrs_ticks,-1).
0.81/1.08	assign(sos_limit,10000).
0.81/1.08	assign(order,kbo).
0.81/1.08	set(lex_order_vars).
0.81/1.08	clear(print_given).
0.81/1.08	
0.81/1.08	% formulas(sos).  % not echoed (67 formulas)
0.81/1.08	
0.81/1.08	============================== end of input ==========================
0.81/1.08	
0.81/1.08	% From the command line: assign(max_seconds, 180).
0.81/1.08	
0.81/1.08	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.81/1.08	
0.81/1.08	% Formulas that are not ordinary clauses:
0.81/1.08	1 (all X all Y (Y != X <-> m_NotNorm(Y) != m_NotNorm(X))) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	2 (all X (pidElem(X) <-> (exists Y (m_Halt(Y) = X | m_Down(Y) = X)))) # label(axiom_48) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	3 (all X all Y (Y != X <-> m_Ldr(Y) != m_Ldr(X))) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	4 (all X all Y (m_Down(Y) != m_Down(X) <-> X != Y)) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	5 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid2 != Pid)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	6 (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.81/1.08	7 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	8 (all X all Y (Y != X <-> m_NormQ(X) != m_NormQ(Y))) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	9 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	10 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	11 (all X all Y all Z m_Ack(X,Y) != m_Halt(Z)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	12 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	13 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	14 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	15 (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.08	16 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	17 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	18 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	19 (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.08	20 (all X all Y (leq(Y,X) | leq(X,Y))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	21 (all X all Q ((all Y (host(pidMsg(Y)) = host(pidMsg(X)) & pidElem(Y) & pidElem(X) & elem(Y,Q) -> leq(pidMsg(Y),pidMsg(X)))) & ordered(Q) <-> ordered(snoc(Q,X)))) # label(axiom_54) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	22 (all X X = pidMsg(m_Down(X))) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	23 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	24 (all Q (Q = cons(head(Q),tail(Q)) | q_nil = Q)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	25 (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.08	26 (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.08	27 (all X all Y (X = s(Y) | leq(X,Y) <-> leq(X,s(Y)))) # label(axiom_64) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	28 (all P all Q (s(host(P)) = host(Q) -> host(Q) != host(P))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	29 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	30 (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.81/1.08	31 (all X all Q Q = tail(cons(X,Q))) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	32 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	33 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	34 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	35 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	36 (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.81/1.08	37 (all Q (q_nil = Q | Q = snoc(init(Q),last(Q)))) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	38 (all Q all X all Y (host(X) = host(Y) & elem(m_Down(Y),Q) & ordered(cons(m_Halt(X),Q)) -> leq(X,Y))) # label(axiom_57) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	39 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	40 (all X all Q head(cons(X,Q)) = X) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	41 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	42 (all X all Y all Q (X = Y | elem(X,Q) <-> elem(X,snoc(Q,Y)))) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	43 (all X all Q (ordered(cons(X,Q)) <-> (all Y (elem(Y,Q) & pidElem(X) & pidElem(Y) & host(pidMsg(Y)) = host(pidMsg(X)) -> leq(pidMsg(X),pidMsg(Y)))) & ordered(Q))) # label(axiom_53) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	44 (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.08	45 (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.81/1.08	46 (all X all Y m_Down(X) != m_NormQ(Y)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	47 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	48 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.81/1.08	49 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
14.11/14.41	50 (all X X = pidMsg(m_Halt(X))) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
14.11/14.41	51 (all X all Y m_Halt(Y) != m_Down(X)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
14.11/14.41	52 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
14.11/14.41	53 (all Y all Q last(snoc(Q,Y)) = Y) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
14.11/14.41	54 (all X all Y all Z m_Ack(X,Y) != m_Down(Z)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
14.11/14.41	55 (all X (ordered(snoc(q_nil,X)) & ordered(cons(X,q_nil)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
14.11/14.41	56 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
14.11/14.41	57 (all X all Y (m_Halt(Y) != m_Halt(X) <-> X != Y)) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
14.11/14.41	58 -(all V all W all X all Y ((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(Pid0) != host(Z))) & (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 Pid30 all Pid20 all Pid0 (host(Z) != host(Pid20) & setIn(Pid20,alive) & host(Pid20) = host(Pid0) & host(Pid30) = host(Z) & setIn(Z,alive) -> -(elem(m_Down(Pid0),queue(host(Z))) & setIn(host(Pid30),index(down,host(Pid20)))))) & cons(m_Down(Y),V) = queue(host(X)) & (all Z all Pid30 all Pid20 all Pid0 (host(Z) != host(Pid20) & setIn(Z,alive) & setIn(Pid20,alive) & host(Z) = host(Pid30) & host(Pid0) = host(Pid20) -> -(elem(m_Down(Pid30),queue(host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & (all Z all Pid0 (host(Pid0) = host(Z) & Pid0 != Z -> -setIn(Pid0,alive) | -setIn(Z,alive))) & (all Z all Pid0 (-setIn(Z,alive) & host(Z) = host(Pid0) & leq(Pid0,Z) -> -setIn(Pid0,alive))) -> (setIn(X,alive) -> (-leq(host(X),host(Y)) -> (wait = index(status,host(X)) & host(Y) = host(index(elid,host(X))) | norm = index(status,host(X)) & index(ldr,host(X)) = host(Y) -> ((all Z (host(Z) = host(X) -> leq(Z,W))) & host(W) = host(X) & -setIn(W,pids) -> (host(W) != s(zero) -> (all Z (host(X) = host(Z) -> (all X0 all Y0 (host(W) != host(Y0) -> (host(Y0) != host(X) -> (all Z0 ((setIn(Z,alive) & Z != X | Z = W) & (W = Y0 | setIn(Y0,alive) & X != Y0) & host(Z) = host(X0) & host(Z0) = host(Y0) & host(Y0) != host(Z) -> -(setIn(host(X0),index(down,host(Y0))) & elem(m_Down(Z0),V)))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
14.11/14.41	
14.11/14.41	============================== end of process non-clausal formulas ===
14.11/14.41	
14.11/14.41	============================== PROCESS INITIAL CLAUSES ===============
14.11/14.41	
14.11/14.41	============================== PREDICATE ELIMINATION =================
14.11/14.41	
14.11/14.41	============================== end predicate elimination =============
14.11/14.41	
14.11/14.41	Auto_denials:  (non-Horn, no changes).
14.11/14.41	
14.11/14.41	Term ordering decisions:
14.11/14.41	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. f2=1. f3=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. f1=1.
14.11/14.41	
14.11/14.41	============================== end of process initial clauses ========
14.11/14.41	
14.11/14.41	============================== CLAUSES FOR SEARCH ====================
14.11/14.41	
14.11/14.41	============================== end of clauses for search =============
14.11/14.41	
14.11/14.41	============================== SEARCH ================================
14.11/14.41	
14.11/14.41	% Starting search at 0.03 seconds.
14.11/14.41	
14.11/14.41	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 116 (0.00 of 0.33 sec).
14.11/14.41	
14.11/14.41	Low Water (keep): wt=19.000, iters=4147
14.11/14.41	
14.11/14.41	Low Water (keep): wt=16.000, iters=3431
14.11/14.41	
14.11/14.41	Low Water (keep): wt=14.000, iters=3927
14.11/14.41	
14.11/14.41	============================== PROOF =================================
14.11/14.41	% SZS status Theorem
14.11/14.41	% SZS output start Refutation
14.11/14.41	
14.11/14.41	% Proof 1 at 12.81 (+ 0.53) seconds.
14.11/14.41	% Length of proof is 27.
14.11/14.41	% Level of proof is 9.
14.11/14.41	% Maximum clause weight is 34.000.
14.11/14.41	% Given clauses 4152.
14.11/14.41	
14.11/14.41	26 (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].
14.11/14.41	58 -(all V all W all X all Y ((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(Pid0) != host(Z))) & (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 Pid30 all Pid20 all Pid0 (host(Z) != host(Pid20) & setIn(Pid20,alive) & host(Pid20) = host(Pid0) & host(Pid30) = host(Z) & setIn(Z,alive) -> -(elem(m_Down(Pid0),queue(host(Z))) & setIn(host(Pid30),index(down,host(Pid20)))))) & cons(m_Down(Y),V) = queue(host(X)) & (all Z all Pid30 all Pid20 all Pid0 (host(Z) != host(Pid20) & setIn(Z,alive) & setIn(Pid20,alive) & host(Z) = host(Pid30) & host(Pid0) = host(Pid20) -> -(elem(m_Down(Pid30),queue(host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & (all Z all Pid0 (host(Pid0) = host(Z) & Pid0 != Z -> -setIn(Pid0,alive) | -setIn(Z,alive))) & (all Z all Pid0 (-setIn(Z,alive) & host(Z) = host(Pid0) & leq(Pid0,Z) -> -setIn(Pid0,alive))) -> (setIn(X,alive) -> (-leq(host(X),host(Y)) -> (wait = index(status,host(X)) & host(Y) = host(index(elid,host(X))) | norm = index(status,host(X)) & index(ldr,host(X)) = host(Y) -> ((all Z (host(Z) = host(X) -> leq(Z,W))) & host(W) = host(X) & -setIn(W,pids) -> (host(W) != s(zero) -> (all Z (host(X) = host(Z) -> (all X0 all Y0 (host(W) != host(Y0) -> (host(Y0) != host(X) -> (all Z0 ((setIn(Z,alive) & Z != X | Z = W) & (W = Y0 | setIn(Y0,alive) & X != Y0) & host(Z) = host(X0) & host(Z0) = host(Y0) & host(Y0) != host(Z) -> -(setIn(host(X0),index(down,host(Y0))) & elem(m_Down(Z0),V)))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
14.11/14.41	101 -elem(A,B) | elem(A,cons(C,B)) # label(axiom_46) # label(axiom).  [clausify(26)].
14.11/14.41	163 host(A) = host(B) | -setIn(A,alive) | host(A) != host(C) | host(D) != host(B) | -setIn(B,alive) | -elem(m_Down(C),queue(host(B))) | -setIn(host(D),index(down,host(A))) # label(conj) # label(negated_conjecture).  [clausify(58)].
14.11/14.41	164 queue(host(c3)) = cons(m_Down(c4),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
14.11/14.41	165 cons(m_Down(c4),c1) = queue(host(c3)).  [copy(164),flip(a)].
14.11/14.41	169 setIn(c3,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
14.11/14.41	177 host(c2) = host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
14.11/14.41	178 host(c3) = host(c2).  [copy(177),flip(a)].
14.11/14.41	181 host(c5) = host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
14.11/14.41	182 host(c5) = host(c2).  [copy(181),rewrite([178(4)])].
14.11/14.41	183 host(c7) != host(c2) # label(conj) # label(negated_conjecture).  [clausify(58)].
14.11/14.41	189 c7 = c2 | setIn(c7,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
14.11/14.41	191 host(c6) = host(c5) # label(conj) # label(negated_conjecture).  [clausify(58)].
14.11/14.41	192 host(c6) = host(c2).  [copy(191),rewrite([182(4)])].
14.11/14.41	193 host(c8) = host(c7) # label(conj) # label(negated_conjecture).  [clausify(58)].
14.11/14.41	195 setIn(host(c6),index(down,host(c7))) # label(conj) # label(negated_conjecture).  [clausify(58)].
14.11/14.41	196 setIn(host(c2),index(down,host(c7))).  [copy(195),rewrite([192(2)])].
14.11/14.41	197 elem(m_Down(c8),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
14.11/14.41	204 cons(m_Down(c4),c1) = queue(host(c2)).  [back_rewrite(165),rewrite([178(6)])].
14.11/14.41	290 host(c2) = host(A) | -setIn(A,alive) | host(A) != host(B) | host(c2) != host(C) | -elem(m_Down(B),queue(host(c2))) | -setIn(host(C),index(down,host(A))).  [resolve(169,a,163,e),rewrite([178(3),178(12),178(16)]),flip(a),flip(d)].
14.11/14.41	320 elem(m_Down(c8),cons(A,c1)).  [resolve(197,a,101,a)].
14.11/14.41	557 elem(m_Down(c8),queue(host(c2))).  [para(204(a,1),320(a,2))].
14.11/14.41	2203 -setIn(c7,alive) | host(c7) != host(A) | -elem(m_Down(A),queue(host(c2))).  [resolve(290,f,196,a),flip(a),xx(d),unit_del(a,183)].
14.11/14.41	2214 host(c7) != host(A) | -elem(m_Down(A),queue(host(c2))) | c7 = c2.  [resolve(2203,a,189,b)].
14.11/14.41	12331 c7 = c2.  [resolve(2214,b,557,a),rewrite([193(4)]),xx(a)].
14.11/14.41	12384 $F.  [back_rewrite(183),rewrite([12331(1)]),xx(a)].
14.11/14.41	
14.11/14.41	% SZS output end Refutation
14.11/14.41	============================== end of proof ==========================
14.11/14.41	
14.11/14.41	============================== STATISTICS ============================
14.11/14.41	
14.11/14.41	Given=4152. Generated=1038810. Kept=12309. proofs=1.
14.11/14.41	Usable=4002. Sos=7461. Demods=39. Limbo=53, Disabled=920. Hints=0.
14.11/14.41	Megabytes=16.59.
14.11/14.41	User_CPU=12.81, System_CPU=0.53, Wall_clock=13.
14.11/14.41	
14.11/14.41	============================== end of statistics =====================
14.11/14.41	
14.11/14.41	============================== end of search =========================
14.11/14.41	
14.11/14.41	THEOREM PROVED
14.11/14.41	% SZS status Theorem
14.11/14.41	
14.11/14.41	Exiting with 1 proof.
14.11/14.41	
14.11/14.41	Process 17472 exit (max_proofs) Thu Aug 29 10:42:26 2019
14.11/14.41	Prover9 interrupted
14.11/14.41	EOF