0.04/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.13	% Command  : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer : n017.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit : 960
0.13/0.34	% WCLimit  : 120
0.13/0.34	% DateTime : Tue Aug  9 03:41:30 EDT 2022
0.13/0.34	% CPUTime  : 
0.75/1.04	============================== Prover9 ===============================
0.75/1.04	Prover9 (32) version 2009-11A, November 2009.
0.75/1.04	Process 20476 was started by sandbox on n017.cluster.edu,
0.75/1.04	Tue Aug  9 03:41:30 2022
0.75/1.04	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_20239_n017.cluster.edu".
0.75/1.04	============================== end of head ===========================
0.75/1.04	
0.75/1.04	============================== INPUT =================================
0.75/1.04	
0.75/1.04	% Reading from file /tmp/Prover9_20239_n017.cluster.edu
0.75/1.04	
0.75/1.04	set(prolog_style_variables).
0.75/1.04	set(auto2).
0.75/1.04	    % set(auto2) -> set(auto).
0.75/1.04	    % set(auto) -> set(auto_inference).
0.75/1.04	    % set(auto) -> set(auto_setup).
0.75/1.04	    % set(auto_setup) -> set(predicate_elim).
0.75/1.04	    % set(auto_setup) -> assign(eq_defs, unfold).
0.75/1.04	    % set(auto) -> set(auto_limits).
0.75/1.04	    % set(auto_limits) -> assign(max_weight, "100.000").
0.75/1.04	    % set(auto_limits) -> assign(sos_limit, 20000).
0.75/1.04	    % set(auto) -> set(auto_denials).
0.75/1.04	    % set(auto) -> set(auto_process).
0.75/1.04	    % set(auto2) -> assign(new_constants, 1).
0.75/1.04	    % set(auto2) -> assign(fold_denial_max, 3).
0.75/1.04	    % set(auto2) -> assign(max_weight, "200.000").
0.75/1.04	    % set(auto2) -> assign(max_hours, 1).
0.75/1.04	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.75/1.04	    % set(auto2) -> assign(max_seconds, 0).
0.75/1.04	    % set(auto2) -> assign(max_minutes, 5).
0.75/1.04	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.75/1.04	    % set(auto2) -> set(sort_initial_sos).
0.75/1.04	    % set(auto2) -> assign(sos_limit, -1).
0.75/1.04	    % set(auto2) -> assign(lrs_ticks, 3000).
0.75/1.04	    % set(auto2) -> assign(max_megs, 400).
0.75/1.04	    % set(auto2) -> assign(stats, some).
0.75/1.04	    % set(auto2) -> clear(echo_input).
0.75/1.04	    % set(auto2) -> set(quiet).
0.75/1.04	    % set(auto2) -> clear(print_initial_clauses).
0.75/1.04	    % set(auto2) -> clear(print_given).
0.75/1.04	assign(lrs_ticks,-1).
0.75/1.04	assign(sos_limit,10000).
0.75/1.04	assign(order,kbo).
0.75/1.04	set(lex_order_vars).
0.75/1.04	clear(print_given).
0.75/1.04	
0.75/1.04	% formulas(sos).  % not echoed (67 formulas)
0.75/1.04	
0.75/1.04	============================== end of input ==========================
0.75/1.04	
0.75/1.04	% From the command line: assign(max_seconds, 960).
0.75/1.04	
0.75/1.04	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.75/1.04	
0.75/1.04	% Formulas that are not ordinary clauses:
0.75/1.04	1 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.75/1.04	2 (all X X = pidMsg(m_Halt(X))) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.75/1.04	3 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.75/1.04	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.75/1.04	5 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.75/1.04	6 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.75/1.04	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.75/1.04	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.75/1.04	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.75/1.04	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.75/1.04	11 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.75/1.04	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.75/1.04	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.75/1.04	14 (all X all Y m_NotNorm(Y) != m_NormQ(X)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.75/1.04	15 (all X all Y all Z m_NotNorm(Z) != m_Ack(X,Y)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.75/1.04	16 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.75/1.04	17 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid2 != Pid)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	18 (all P all Q (host(Q) = s(host(P)) -> host(Q) != host(P))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	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.75/1.05	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.75/1.05	21 (all X all Y (leq(X,Y) <-> leq(s(X),s(Y)))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	22 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	23 (all X all Y (Y != X <-> m_Halt(X) != m_Halt(Y))) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	24 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	25 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	26 (all X all Y all Z m_Down(Z) != m_Ack(X,Y)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	27 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	28 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	29 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	30 (all X all Y all Z m_Ack(X,Y) != m_Halt(Z)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	31 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	32 (all X all Y m_Ldr(Y) != m_Down(X)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	33 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	34 (all X all Y m_NormQ(Y) != m_Down(X)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	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.75/1.05	36 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	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.75/1.05	38 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	39 (all X all Y (X != Y <-> m_NormQ(Y) != m_NormQ(X))) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	40 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	41 (all X all Y m_Halt(Y) != m_Ldr(X)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	42 (all Q (cons(head(Q),tail(Q)) = Q | Q = q_nil)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	43 (all X all Q X = head(cons(X,Q))) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	44 (all Q (Q = q_nil | snoc(init(Q),last(Q)) = Q)) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	45 (all Y all Q Y = last(snoc(Q,Y))) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	46 (all X all Y (m_NotNorm(Y) != m_NotNorm(X) <-> Y != X)) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	47 (all X (ordered(snoc(q_nil,X)) & ordered(cons(X,q_nil)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	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.75/1.05	49 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.75/1.05	50 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
1.05/1.36	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].
1.05/1.36	52 (all X all Y (X != Y <-> m_Down(Y) != m_Down(X))) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
1.05/1.36	53 (all X all Y m_Halt(Y) != m_Down(X)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
1.05/1.36	54 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
1.05/1.36	55 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
1.05/1.36	56 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
1.05/1.36	57 (all X all Y (m_Ldr(X) != m_Ldr(Y) <-> Y != X)) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
1.05/1.36	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(Z) != host(Pid0))) & (all Z all Pid0 (Z != Pid0 & host(Pid0) = host(Z) -> -setIn(Pid0,alive) | -setIn(Z,alive))) & queue(host(X)) = cons(m_Ack(W,Y),V) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) != host(Z) & host(Z) = host(Pid30) & host(Pid20) = host(Pid0) & setIn(Pid20,alive) & setIn(Z,alive) -> -(elem(m_Down(Pid30),queue(host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & (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_Halt(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (setIn(Pid0,alive) -> -elem(m_Down(Pid0),queue(host(Z))))) -> (setIn(X,alive) -> (index(elid,host(X)) = W & host(Y) = index(pendack,host(X)) & index(status,host(X)) = elec_2 -> (leq(nbr_proc,index(pendack,host(X))) -> (all Z (host(Y) = host(Z) | setIn(host(Z),index(acks,host(X))) -> (all V0 (host(V0) = host(Z) -> (host(X) = host(V0) -> (all W0 all X0 (host(Z) != host(X0) -> (host(X0) != host(X) -> (all Y0 (setIn(V0,alive) & setIn(X0,alive) & host(Y0) = host(X0) & host(V0) = host(W0) & host(X0) != host(V0) -> -(elem(m_Down(W0),queue(host(X0))) & elem(m_Down(Y0),snoc(V,m_Ldr(X))))))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
1.05/1.36	
1.05/1.36	============================== end of process non-clausal formulas ===
1.05/1.36	
1.05/1.36	============================== PROCESS INITIAL CLAUSES ===============
1.05/1.36	
1.05/1.36	============================== PREDICATE ELIMINATION =================
1.05/1.36	
1.05/1.36	============================== end predicate elimination =============
1.05/1.36	
1.05/1.36	Auto_denials:  (non-Horn, no changes).
1.05/1.36	
1.05/1.36	Term ordering decisions:
1.05/1.36	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.05/1.36	
1.05/1.36	============================== end of process initial clauses ========
1.05/1.36	
1.05/1.36	============================== CLAUSES FOR SEARCH ====================
1.05/1.36	
1.05/1.36	============================== end of clauses for search =============
1.05/1.36	
1.05/1.36	============================== SEARCH ================================
1.05/1.36	
1.05/1.36	% Starting search at 0.03 seconds.
1.05/1.36	
1.05/1.36	============================== PROOF =================================
1.05/1.36	% SZS status Theorem
1.05/1.36	% SZS output start Refutation
1.05/1.36	
1.05/1.36	% Proof 1 at 0.32 (+ 0.01) seconds.
1.05/1.36	% Length of proof is 33.
1.05/1.36	% Level of proof is 8.
1.05/1.36	% Maximum clause weight is 33.000.
1.05/1.36	% Given clauses 482.
1.05/1.36	
1.05/1.36	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].
1.05/1.36	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].
1.05/1.36	32 (all X all Y m_Ldr(Y) != m_Down(X)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
1.05/1.36	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(Z) != host(Pid0))) & (all Z all Pid0 (Z != Pid0 & host(Pid0) = host(Z) -> -setIn(Pid0,alive) | -setIn(Z,alive))) & queue(host(X)) = cons(m_Ack(W,Y),V) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) != host(Z) & host(Z) = host(Pid30) & host(Pid20) = host(Pid0) & setIn(Pid20,alive) & setIn(Z,alive) -> -(elem(m_Down(Pid30),queue(host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & (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_Halt(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (setIn(Pid0,alive) -> -elem(m_Down(Pid0),queue(host(Z))))) -> (setIn(X,alive) -> (index(elid,host(X)) = W & host(Y) = index(pendack,host(X)) & index(status,host(X)) = elec_2 -> (leq(nbr_proc,index(pendack,host(X))) -> (all Z (host(Y) = host(Z) | setIn(host(Z),index(acks,host(X))) -> (all V0 (host(V0) = host(Z) -> (host(X) = host(V0) -> (all W0 all X0 (host(Z) != host(X0) -> (host(X0) != host(X) -> (all Y0 (setIn(V0,alive) & setIn(X0,alive) & host(Y0) = host(X0) & host(V0) = host(W0) & host(X0) != host(V0) -> -(elem(m_Down(W0),queue(host(X0))) & elem(m_Down(Y0),snoc(V,m_Ldr(X))))))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
1.05/1.36	67 -elem(A,B) | elem(A,cons(C,B)) # label(axiom_46) # label(axiom).  [clausify(7)].
1.05/1.36	94 elem(A,B) | C = A | -elem(A,snoc(B,C)) # label(axiom_47) # label(axiom).  [clausify(19)].
1.05/1.36	109 m_Ldr(A) != m_Down(B) # label(axiom_18) # label(axiom).  [clausify(32)].
1.05/1.36	160 queue(host(c3)) = cons(m_Ack(c2,c4),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.05/1.36	161 cons(m_Ack(c2,c4),c1) = queue(host(c3)).  [copy(160),flip(a)].
1.05/1.36	162 host(A) = host(B) | host(C) != host(B) | host(A) != host(D) | -setIn(A,alive) | -setIn(B,alive) | -elem(m_Down(C),queue(host(A))) | -elem(m_Down(D),queue(host(B))) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.05/1.36	166 setIn(c3,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.05/1.36	174 host(c6) = host(c5) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.05/1.36	175 host(c6) = host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.05/1.36	176 host(c5) = host(c3).  [copy(175),rewrite([174(2)])].
1.05/1.36	177 host(c8) != host(c5) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.05/1.36	178 host(c8) != host(c3).  [copy(177),rewrite([176(4)])].
1.05/1.36	180 setIn(c8,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.05/1.36	181 host(c9) = host(c8) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.05/1.36	182 host(c7) = host(c6) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.05/1.36	183 host(c7) = host(c3).  [copy(182),rewrite([174(4),176(4)])].
1.05/1.36	185 elem(m_Down(c7),queue(host(c8))) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.05/1.36	186 elem(m_Down(c9),snoc(c1,m_Ldr(c3))) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.10/1.36	192 host(c8) = c_0.  [new_symbol(178)].
1.10/1.36	193 elem(m_Down(c7),queue(c_0)).  [back_rewrite(185),rewrite([192(4)])].
1.10/1.36	194 host(c9) = c_0.  [back_rewrite(181),rewrite([192(4)])].
1.10/1.36	195 host(c3) != c_0.  [back_rewrite(178),rewrite([192(2)]),flip(a)].
1.10/1.36	283 host(c3) = host(A) | host(c3) != host(B) | host(A) != host(C) | -setIn(A,alive) | -elem(m_Down(B),queue(host(A))) | -elem(m_Down(C),queue(host(c3))).  [resolve(166,a,162,e),flip(a),flip(b)].
1.10/1.36	308 elem(m_Down(c9),c1).  [resolve(186,a,94,c),unit_del(b,109)].
1.10/1.36	362 elem(m_Down(c9),cons(A,c1)).  [resolve(308,a,67,a)].
1.10/1.36	498 elem(m_Down(c9),queue(host(c3))).  [para(161(a,1),362(a,2))].
1.10/1.36	2259 host(c3) != host(A) | host(B) != c_0 | -elem(m_Down(A),queue(c_0)) | -elem(m_Down(B),queue(host(c3))).  [resolve(283,d,180,a),rewrite([192(4),192(10),192(14)]),flip(c),unit_del(a,195)].
1.10/1.36	2260 host(A) != c_0 | -elem(m_Down(A),queue(host(c3))).  [resolve(2259,c,193,a),rewrite([183(4)]),xx(a)].
1.10/1.36	2262 $F.  [resolve(2260,b,498,a),rewrite([194(2)]),xx(a)].
1.10/1.36	
1.10/1.36	% SZS output end Refutation
1.10/1.36	============================== end of proof ==========================
1.10/1.36	
1.10/1.36	============================== STATISTICS ============================
1.10/1.36	
1.10/1.36	Given=482. Generated=9714. Kept=2193. proofs=1.
1.10/1.36	Usable=476. Sos=1689. Demods=32. Limbo=0, Disabled=150. Hints=0.
1.10/1.36	Megabytes=4.29.
1.10/1.36	User_CPU=0.33, System_CPU=0.01, Wall_clock=1.
1.10/1.36	
1.10/1.36	============================== end of statistics =====================
1.10/1.36	
1.10/1.36	============================== end of search =========================
1.10/1.36	
1.10/1.36	THEOREM PROVED
1.10/1.36	% SZS status Theorem
1.10/1.36	
1.10/1.36	Exiting with 1 proof.
1.10/1.36	
1.10/1.36	Process 20476 exit (max_proofs) Tue Aug  9 03:41:31 2022
1.10/1.36	Prover9 interrupted
1.10/1.37	EOF