0.00/0.11	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.12	% Command  : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer : n025.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 04:31:11 EDT 2022
0.12/0.33	% CPUTime  : 
0.84/1.14	============================== Prover9 ===============================
0.84/1.14	Prover9 (32) version 2009-11A, November 2009.
0.84/1.14	Process 29055 was started by sandbox2 on n025.cluster.edu,
0.84/1.14	Tue Aug  9 04:31:12 2022
0.84/1.14	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_28901_n025.cluster.edu".
0.84/1.14	============================== end of head ===========================
0.84/1.14	
0.84/1.14	============================== INPUT =================================
0.84/1.14	
0.84/1.14	% Reading from file /tmp/Prover9_28901_n025.cluster.edu
0.84/1.14	
0.84/1.14	set(prolog_style_variables).
0.84/1.14	set(auto2).
0.84/1.14	    % set(auto2) -> set(auto).
0.84/1.14	    % set(auto) -> set(auto_inference).
0.84/1.14	    % set(auto) -> set(auto_setup).
0.84/1.14	    % set(auto_setup) -> set(predicate_elim).
0.84/1.14	    % set(auto_setup) -> assign(eq_defs, unfold).
0.84/1.14	    % set(auto) -> set(auto_limits).
0.84/1.14	    % set(auto_limits) -> assign(max_weight, "100.000").
0.84/1.14	    % set(auto_limits) -> assign(sos_limit, 20000).
0.84/1.14	    % set(auto) -> set(auto_denials).
0.84/1.14	    % set(auto) -> set(auto_process).
0.84/1.14	    % set(auto2) -> assign(new_constants, 1).
0.84/1.14	    % set(auto2) -> assign(fold_denial_max, 3).
0.84/1.14	    % set(auto2) -> assign(max_weight, "200.000").
0.84/1.14	    % set(auto2) -> assign(max_hours, 1).
0.84/1.14	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.84/1.14	    % set(auto2) -> assign(max_seconds, 0).
0.84/1.14	    % set(auto2) -> assign(max_minutes, 5).
0.84/1.14	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.84/1.14	    % set(auto2) -> set(sort_initial_sos).
0.84/1.14	    % set(auto2) -> assign(sos_limit, -1).
0.84/1.14	    % set(auto2) -> assign(lrs_ticks, 3000).
0.84/1.14	    % set(auto2) -> assign(max_megs, 400).
0.84/1.14	    % set(auto2) -> assign(stats, some).
0.84/1.14	    % set(auto2) -> clear(echo_input).
0.84/1.14	    % set(auto2) -> set(quiet).
0.84/1.14	    % set(auto2) -> clear(print_initial_clauses).
0.84/1.14	    % set(auto2) -> clear(print_given).
0.84/1.14	assign(lrs_ticks,-1).
0.84/1.14	assign(sos_limit,10000).
0.84/1.14	assign(order,kbo).
0.84/1.14	set(lex_order_vars).
0.84/1.14	clear(print_given).
0.84/1.14	
0.84/1.14	% formulas(sos).  % not echoed (67 formulas)
0.84/1.14	
0.84/1.14	============================== end of input ==========================
0.84/1.14	
0.84/1.14	% From the command line: assign(max_seconds, 960).
0.84/1.14	
0.84/1.14	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.84/1.14	
0.84/1.14	% Formulas that are not ordinary clauses:
0.84/1.14	1 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	2 (all X X = pidMsg(m_Halt(X))) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	3 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	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.84/1.14	5 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	6 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	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.84/1.14	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.84/1.14	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.84/1.14	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.84/1.14	11 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	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.84/1.14	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.84/1.14	14 (all X all Y m_NotNorm(Y) != m_NormQ(X)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	15 (all X all Y all Z m_NotNorm(Z) != m_Ack(X,Y)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	16 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	17 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid2 != Pid)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	18 (all P all Q (host(Q) = s(host(P)) -> host(Q) != host(P))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	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.84/1.15	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.84/1.15	21 (all X all Y (leq(X,Y) <-> leq(s(X),s(Y)))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	22 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	23 (all X all Y (Y != X <-> m_Halt(X) != m_Halt(Y))) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	24 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	25 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	26 (all X all Y all Z m_Down(Z) != m_Ack(X,Y)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	27 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	28 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	29 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	30 (all X all Y all Z m_Ack(X,Y) != m_Halt(Z)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	31 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	32 (all X all Y m_Ldr(Y) != m_Down(X)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	33 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	34 (all X all Y m_NormQ(Y) != m_Down(X)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	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.84/1.15	36 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	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.84/1.15	38 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	39 (all X all Y (X != Y <-> m_NormQ(Y) != m_NormQ(X))) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	40 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	41 (all X all Y m_Halt(Y) != m_Ldr(X)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	42 (all Q (cons(head(Q),tail(Q)) = Q | Q = q_nil)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	43 (all X all Q X = head(cons(X,Q))) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	44 (all Q (Q = q_nil | snoc(init(Q),last(Q)) = Q)) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	45 (all Y all Q Y = last(snoc(Q,Y))) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	46 (all X all Y (m_NotNorm(Y) != m_NotNorm(X) <-> Y != X)) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	47 (all X (ordered(snoc(q_nil,X)) & ordered(cons(X,q_nil)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	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.84/1.15	49 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.84/1.15	50 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
59.98/60.24	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].
59.98/60.24	52 (all X all Y (X != Y <-> m_Down(Y) != m_Down(X))) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
59.98/60.24	53 (all X all Y m_Halt(Y) != m_Down(X)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
59.98/60.24	54 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
59.98/60.24	55 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
59.98/60.24	56 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
59.98/60.24	57 (all X all Y (m_Ldr(X) != m_Ldr(Y) <-> Y != X)) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
59.98/60.24	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))) -> host(Z) != host(Pid0))) & (all Z all Pid0 (elem(m_Halt(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (host(Z) = host(Pid0) & Z != Pid0 -> -setIn(Z,alive) | -setIn(Pid0,alive))) & cons(m_NotNorm(X),V) = queue(host(Y)) & (all Z all Pid30 all Pid20 all Pid0 (setIn(Z,alive) & setIn(Pid20,alive) & host(Pid20) = host(Pid0) & host(Pid30) = host(Z) & host(Z) != host(Pid20) -> -(elem(m_Down(Pid0),queue(host(Z))) & elem(m_Down(Pid30),queue(host(Pid20)))))) & (all Z all Pid0 (-setIn(Z,alive) & leq(Pid0,Z) & host(Z) = host(Pid0) -> -setIn(Pid0,alive))) & (all Z all Pid20 all Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid20))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> -setIn(Pid0,alive))) -> (setIn(Y,alive) -> (index(elid,host(Y)) = X & index(status,host(Y)) = norm & host(Y) = index(ldr,host(Y)) -> (host(Y) = host(W) & -setIn(W,pids) & (all Z (host(Y) = host(Z) -> leq(Z,W))) -> (s(zero) = host(W) -> (-leq(nbr_proc,host(W)) -> (all Z (host(Z) = s(host(W)) -> (host(Y) != host(Z) -> (all X0 all Y0 (s(host(W)) != host(Y0) -> (host(Y0) = host(Y) -> (all Z0 (host(Z) != host(Y0) & host(X0) = host(Z) & host(Y0) = host(Z0) & (Y != Y0 & setIn(Y0,alive) | Y0 = W) & (W = Z | setIn(Z,alive) & Y != Z) -> -(elem(m_Down(Z0),snoc(queue(host(Z)),m_Halt(W))) & elem(m_Down(X0),V))))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
59.98/60.24	
59.98/60.24	============================== end of process non-clausal formulas ===
59.98/60.24	
59.98/60.24	============================== PROCESS INITIAL CLAUSES ===============
59.98/60.24	
59.98/60.24	============================== PREDICATE ELIMINATION =================
59.98/60.24	
59.98/60.24	============================== end predicate elimination =============
59.98/60.24	
59.98/60.24	Auto_denials:  (non-Horn, no changes).
59.98/60.24	
59.98/60.24	Term ordering decisions:
59.98/60.24	Function symbol KB weights:  alive=1. q_nil=1. zero=1. nbr_proc=1. pids=1. elid=1. ldr=1. norm=1. status=1. elec_1=1. elec_2=1. nil=1. setEmpty=1. wait=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. snoc=1. cons=1. m_Ack=1. index=1. f2=1. f3=1. host=1. pidMsg=1. s=1. m_Down=1. m_Halt=1. queue=1. m_Ldr=1. m_NotNorm=1. m_NormQ=1. head=1. init=1. last=1. tail=1. f1=1.
59.98/60.24	
59.98/60.24	============================== end of process initial clauses ========
59.98/60.24	
59.98/60.24	============================== CLAUSES FOR SEARCH ====================
59.98/60.24	
59.98/60.24	============================== end of clauses for search =============
59.98/60.24	
59.98/60.24	============================== SEARCH ================================
59.98/60.24	
59.98/60.24	% Starting search at 0.03 seconds.
59.98/60.24	
59.98/60.24	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 44 (0.00 of 0.30 sec).
59.98/60.24	
59.98/60.24	Low Water (keep): wt=17.000, iters=4199
59.98/60.24	
59.98/60.24	Low Water (keep): wt=15.000, iters=3550
59.98/60.24	
59.98/60.24	Low Water (keep): wt=14.000, iters=3368
59.98/60.24	
59.98/60.24	Low Water (keep): wt=13.000, iters=3975
59.98/60.24	
59.98/60.24	============================== PROOF =================================
59.98/60.24	% SZS status Theorem
59.98/60.24	% SZS output start Refutation
59.98/60.24	
59.98/60.24	% Proof 1 at 56.26 (+ 2.85) seconds.
59.98/60.24	% Length of proof is 41.
59.98/60.24	% Level of proof is 9.
59.98/60.24	% Maximum clause weight is 33.000.
59.98/60.24	% Given clauses 8935.
59.98/60.24	
59.98/60.24	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].
59.98/60.24	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].
59.98/60.24	53 (all X all Y m_Halt(Y) != m_Down(X)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
59.98/60.24	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))) -> host(Z) != host(Pid0))) & (all Z all Pid0 (elem(m_Halt(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (host(Z) = host(Pid0) & Z != Pid0 -> -setIn(Z,alive) | -setIn(Pid0,alive))) & cons(m_NotNorm(X),V) = queue(host(Y)) & (all Z all Pid30 all Pid20 all Pid0 (setIn(Z,alive) & setIn(Pid20,alive) & host(Pid20) = host(Pid0) & host(Pid30) = host(Z) & host(Z) != host(Pid20) -> -(elem(m_Down(Pid0),queue(host(Z))) & elem(m_Down(Pid30),queue(host(Pid20)))))) & (all Z all Pid0 (-setIn(Z,alive) & leq(Pid0,Z) & host(Z) = host(Pid0) -> -setIn(Pid0,alive))) & (all Z all Pid20 all Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid20))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> -setIn(Pid0,alive))) -> (setIn(Y,alive) -> (index(elid,host(Y)) = X & index(status,host(Y)) = norm & host(Y) = index(ldr,host(Y)) -> (host(Y) = host(W) & -setIn(W,pids) & (all Z (host(Y) = host(Z) -> leq(Z,W))) -> (s(zero) = host(W) -> (-leq(nbr_proc,host(W)) -> (all Z (host(Z) = s(host(W)) -> (host(Y) != host(Z) -> (all X0 all Y0 (s(host(W)) != host(Y0) -> (host(Y0) = host(Y) -> (all Z0 (host(Z) != host(Y0) & host(X0) = host(Z) & host(Y0) = host(Z0) & (Y != Y0 & setIn(Y0,alive) | Y0 = W) & (W = Z | setIn(Z,alive) & Y != Z) -> -(elem(m_Down(Z0),snoc(queue(host(Z)),m_Halt(W))) & elem(m_Down(X0),V))))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
59.98/60.24	68 -elem(A,B) | elem(A,cons(C,B)) # label(axiom_46) # label(axiom).  [clausify(7)].
59.98/60.24	95 elem(A,B) | C = A | -elem(A,snoc(B,C)) # label(axiom_47) # label(axiom).  [clausify(19)].
59.98/60.24	152 m_Down(A) != m_Halt(B) # label(axiom_17) # label(axiom).  [clausify(53)].
59.98/60.24	162 queue(host(c4)) = cons(m_NotNorm(c3),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
59.98/60.24	163 cons(m_NotNorm(c3),c1) = queue(host(c4)).  [copy(162),flip(a)].
59.98/60.24	164 -setIn(A,alive) | -setIn(B,alive) | host(B) != host(C) | host(D) != host(A) | host(B) = host(A) | -elem(m_Down(C),queue(host(A))) | -elem(m_Down(D),queue(host(B))) # label(conj) # label(negated_conjecture).  [clausify(58)].
59.98/60.24	167 setIn(c4,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
59.98/60.24	172 host(c2) = host(c4) # label(conj) # label(negated_conjecture).  [clausify(58)].
59.98/60.24	173 host(c4) = host(c2).  [copy(172),flip(a)].
59.98/60.24	180 host(c5) = s(host(c2)) # label(conj) # label(negated_conjecture).  [clausify(58)].
59.98/60.24	181 s(host(c2)) = host(c5).  [copy(180),flip(a)].
59.98/60.24	182 host(c5) != host(c4) # label(conj) # label(negated_conjecture).  [clausify(58)].
59.98/60.24	183 host(c5) != host(c2).  [copy(182),rewrite([173(4)])].
59.98/60.24	184 host(c7) != s(host(c2)) # label(conj) # label(negated_conjecture).  [clausify(58)].
59.98/60.24	185 host(c7) != host(c5).  [copy(184),rewrite([181(5)])].
59.98/60.24	186 host(c7) = host(c4) # label(conj) # label(negated_conjecture).  [clausify(58)].
59.98/60.24	187 host(c7) = host(c2).  [copy(186),rewrite([173(4)])].
59.98/60.24	189 host(c6) = host(c5) # label(conj) # label(negated_conjecture).  [clausify(58)].
59.98/60.24	190 host(c8) = host(c7) # label(conj) # label(negated_conjecture).  [clausify(58)].
59.98/60.24	191 host(c8) = host(c2).  [copy(190),rewrite([187(4)])].
59.98/60.24	194 c2 = c5 | setIn(c5,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
59.98/60.24	195 c5 = c2 | setIn(c5,alive).  [copy(194),flip(a)].
59.98/60.24	198 elem(m_Down(c8),snoc(queue(host(c5)),m_Halt(c2))) # label(conj) # label(negated_conjecture).  [clausify(58)].
59.98/60.24	199 elem(m_Down(c6),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
59.98/60.24	206 cons(m_NotNorm(c3),c1) = queue(host(c2)).  [back_rewrite(163),rewrite([173(6)])].
59.98/60.24	208 host(c5) = c_0.  [new_symbol(183)].
59.98/60.24	209 host(c2) != c_0.  [back_rewrite(185),rewrite([187(2),208(4)])].
59.98/60.24	210 elem(m_Down(c8),snoc(queue(c_0),m_Halt(c2))).  [back_rewrite(198),rewrite([208(4)])].
59.98/60.24	211 host(c6) = c_0.  [back_rewrite(189),rewrite([208(4)])].
59.98/60.24	285 -setIn(A,alive) | host(c2) != host(B) | host(C) != host(A) | host(c2) = host(A) | -elem(m_Down(B),queue(host(A))) | -elem(m_Down(C),queue(host(c2))).  [resolve(167,a,164,b),rewrite([173(4),173(11),173(20)])].
59.98/60.24	319 elem(m_Down(c6),cons(A,c1)).  [resolve(199,a,68,a)].
59.98/60.24	342 elem(m_Down(c8),queue(c_0)).  [resolve(210,a,95,c),unit_del(b(flip),152)].
59.98/60.24	586 elem(m_Down(c6),queue(host(c2))).  [para(206(a,1),319(a,2))].
59.98/60.24	2221 host(c2) != host(A) | host(B) != c_0 | -elem(m_Down(A),queue(c_0)) | -elem(m_Down(B),queue(host(c2))) | c5 = c2.  [resolve(285,a,195,b),rewrite([208(7),208(11),208(14)]),unit_del(c,209)].
59.98/60.24	12026 host(A) != c_0 | -elem(m_Down(A),queue(host(c2))) | c5 = c2.  [resolve(2221,c,342,a),rewrite([191(4)]),xx(a)].
59.98/60.24	15785 c5 = c2.  [resolve(12026,b,586,a),rewrite([211(2)]),xx(a)].
59.98/60.24	15845 $F.  [back_rewrite(208),rewrite([15785(1)]),unit_del(a,209)].
59.98/60.24	
59.98/60.24	% SZS output end Refutation
59.98/60.24	============================== end of proof ==========================
59.98/60.24	
59.98/60.24	============================== STATISTICS ============================
59.98/60.24	
59.98/60.24	Given=8935. Generated=5613656. Kept=15769. proofs=1.
59.98/60.24	Usable=8512. Sos=5583. Demods=44. Limbo=60, Disabled=1741. Hints=0.
59.98/60.24	Megabytes=20.13.
59.98/60.24	User_CPU=56.27, System_CPU=2.85, Wall_clock=59.
59.98/60.24	
59.98/60.24	============================== end of statistics =====================
59.98/60.24	
59.98/60.24	============================== end of search =========================
59.98/60.24	
59.98/60.24	THEOREM PROVED
59.98/60.24	% SZS status Theorem
59.98/60.24	
59.98/60.24	Exiting with 1 proof.
59.98/60.24	
59.98/60.24	Process 29055 exit (max_proofs) Tue Aug  9 04:32:11 2022
59.98/60.25	Prover9 interrupted
59.98/60.25	EOF