0.06/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.12	% Command  : tptp2X_and_run_prover9 %d %s
0.11/0.33	% Computer : n008.cluster.edu
0.11/0.33	% Model    : x86_64 x86_64
0.11/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.33	% Memory   : 8042.1875MB
0.11/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.11/0.33	% CPULimit : 1440
0.11/0.33	% WCLimit  : 180
0.11/0.33	% DateTime : Mon Jul  3 04:48:49 EDT 2023
0.11/0.33	% CPUTime  : 
0.64/0.94	============================== Prover9 ===============================
0.64/0.94	Prover9 (32) version 2009-11A, November 2009.
0.64/0.94	Process 9818 was started by sandbox on n008.cluster.edu,
0.64/0.94	Mon Jul  3 04:48:50 2023
0.64/0.94	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_9665_n008.cluster.edu".
0.64/0.94	============================== end of head ===========================
0.64/0.94	
0.64/0.94	============================== INPUT =================================
0.64/0.94	
0.64/0.94	% Reading from file /tmp/Prover9_9665_n008.cluster.edu
0.64/0.94	
0.64/0.94	set(prolog_style_variables).
0.64/0.94	set(auto2).
0.64/0.94	    % set(auto2) -> set(auto).
0.64/0.94	    % set(auto) -> set(auto_inference).
0.64/0.94	    % set(auto) -> set(auto_setup).
0.64/0.94	    % set(auto_setup) -> set(predicate_elim).
0.64/0.94	    % set(auto_setup) -> assign(eq_defs, unfold).
0.64/0.94	    % set(auto) -> set(auto_limits).
0.64/0.94	    % set(auto_limits) -> assign(max_weight, "100.000").
0.64/0.94	    % set(auto_limits) -> assign(sos_limit, 20000).
0.64/0.94	    % set(auto) -> set(auto_denials).
0.64/0.94	    % set(auto) -> set(auto_process).
0.64/0.94	    % set(auto2) -> assign(new_constants, 1).
0.64/0.94	    % set(auto2) -> assign(fold_denial_max, 3).
0.64/0.94	    % set(auto2) -> assign(max_weight, "200.000").
0.64/0.94	    % set(auto2) -> assign(max_hours, 1).
0.64/0.94	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.64/0.94	    % set(auto2) -> assign(max_seconds, 0).
0.64/0.94	    % set(auto2) -> assign(max_minutes, 5).
0.64/0.94	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.64/0.94	    % set(auto2) -> set(sort_initial_sos).
0.64/0.94	    % set(auto2) -> assign(sos_limit, -1).
0.64/0.94	    % set(auto2) -> assign(lrs_ticks, 3000).
0.64/0.94	    % set(auto2) -> assign(max_megs, 400).
0.64/0.94	    % set(auto2) -> assign(stats, some).
0.64/0.94	    % set(auto2) -> clear(echo_input).
0.64/0.94	    % set(auto2) -> set(quiet).
0.64/0.94	    % set(auto2) -> clear(print_initial_clauses).
0.64/0.94	    % set(auto2) -> clear(print_given).
0.64/0.94	assign(lrs_ticks,-1).
0.64/0.94	assign(sos_limit,10000).
0.64/0.94	assign(order,kbo).
0.64/0.94	set(lex_order_vars).
0.64/0.94	clear(print_given).
0.64/0.94	
0.64/0.94	% formulas(sos).  % not echoed (67 formulas)
0.64/0.94	
0.64/0.94	============================== end of input ==========================
0.64/0.94	
0.64/0.94	% From the command line: assign(max_seconds, 1440).
0.64/0.94	
0.64/0.94	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.64/0.94	
0.64/0.94	% Formulas that are not ordinary clauses:
0.64/0.94	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.64/0.94	2 (all X all Y (m_Ldr(X) != m_Ldr(Y) <-> X != Y)) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	3 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	4 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	5 (all X (ordered(cons(X,q_nil)) & ordered(snoc(q_nil,X)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	6 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	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.64/0.94	8 (all X all Y (X != Y <-> m_NormQ(X) != m_NormQ(Y))) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	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.64/0.94	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.64/0.94	11 (all X all Y all Z m_Halt(Z) != m_Ack(X,Y)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	12 (all X all Y all Z m_NotNorm(Z) != m_Ack(X,Y)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	13 (all X all Y all Z m_Ack(X,Y) != m_Down(Z)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	14 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	15 (all X all Y (Y = X <-> leq(Y,X) & leq(X,Y))) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	16 (all X all Q X = head(cons(X,Q))) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	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.64/0.94	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.64/0.94	19 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	20 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	21 (all X all Y m_NormQ(Y) != m_Ldr(X)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	22 (all X X = pidMsg(m_Halt(X))) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	23 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	24 (all Q (cons(head(Q),tail(Q)) = Q | Q = q_nil)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	25 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	26 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	27 (all P all Q (host(Q) = s(host(P)) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	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.64/0.94	29 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	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.64/0.94	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.64/0.94	32 (all X all Y (m_Halt(Y) != m_Halt(X) <-> Y != X)) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	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.64/0.94	34 (all Y all Q Q = init(snoc(Q,Y))) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	35 (all Q (Q = q_nil | snoc(init(Q),last(Q)) = Q)) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	36 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	37 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	38 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	39 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	40 (all X all Y (m_Down(X) != m_Down(Y) <-> X != Y)) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	41 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	42 (all Y all Q Y = last(snoc(Q,Y))) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	43 (all X all Y m_Ldr(X) != m_NotNorm(Y)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	44 (all X all Y (Y != X <-> m_NotNorm(X) != m_NotNorm(Y))) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	45 (all X all Y m_NotNorm(Y) != m_NormQ(X)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	46 (all X all Y m_Ldr(Y) != m_Down(X)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	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.64/0.94	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.64/0.94	49 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.64/0.94	50 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.87/1.15	51 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.87/1.15	52 (all X all Y all Z m_Ldr(Z) != m_Ack(X,Y)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.87/1.15	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].
0.87/1.15	54 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.87/1.15	55 (all X all Y m_NormQ(Y) != m_Down(X)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.87/1.15	56 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.87/1.15	57 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.87/1.15	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_Halt(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (leq(Pid0,Z) & host(Z) = host(Pid0) & -setIn(Z,alive) -> -setIn(Pid0,alive))) & queue(host(X)) = cons(m_Down(Y),V) & (all Z all Pid30 all Pid20 all Pid0 (host(Z) != host(Pid20) & setIn(Z,alive) & host(Pid30) = host(Z) & host(Pid0) = host(Pid20) & setIn(Pid20,alive) -> -(elem(m_Down(Pid30),queue(host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & (all Z all Pid0 (Pid0 != Z & host(Z) = host(Pid0) -> -setIn(Z,alive) | -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))) -> host(Z) != host(Pid0))) & (all Z all Pid0 (setIn(Pid0,alive) -> -elem(m_Down(Pid0),queue(host(Z))))) -> (setIn(X,alive) -> (-leq(host(X),host(Y)) -> (-(host(index(elid,host(X))) = host(Y) & index(status,host(X)) = wait | norm = index(status,host(X)) & host(Y) = index(ldr,host(X))) -> (index(status,host(X)) = elec_1 & (all Z (-leq(host(X),Z) & leq(s(zero),Z) -> setIn(Z,index(down,host(X))) | host(Y) = Z)) -> (-leq(nbr_proc,host(X)) -> (all Z (host(Z) != s(host(X)) -> (host(X) = host(Z) -> (all W0 all X0 (host(X0) != s(host(X)) -> (host(X0) != host(X) -> (all Y0 (host(X0) != host(Z) & setIn(Z,alive) & setIn(X0,alive) & host(X0) = host(Y0) & host(W0) = host(Z) -> -(elem(m_Down(W0),queue(host(X0))) & elem(m_Down(Y0),V))))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.87/1.15	
0.87/1.15	============================== end of process non-clausal formulas ===
0.87/1.15	
0.87/1.15	============================== PROCESS INITIAL CLAUSES ===============
0.87/1.15	
0.87/1.15	============================== PREDICATE ELIMINATION =================
0.87/1.15	
0.87/1.15	============================== end predicate elimination =============
0.87/1.15	
0.87/1.15	Auto_denials:  (non-Horn, no changes).
0.87/1.15	
0.87/1.15	Term ordering decisions:
0.87/1.15	Function symbol KB weights:  alive=1. q_nil=1. zero=1. nbr_proc=1. pids=1. down=1. elec_1=1. status=1. elec_2=1. elid=1. ldr=1. nil=1. norm=1. setEmpty=1. wait=1. c1=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. cons=1. snoc=1. m_Ack=1. index=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.
0.87/1.15	
0.87/1.15	============================== end of process initial clauses ========
0.87/1.15	
0.87/1.15	============================== CLAUSES FOR SEARCH ====================
0.87/1.15	
0.87/1.15	============================== end of clauses for search =============
0.87/1.15	
0.87/1.15	============================== SEARCH ================================
0.87/1.15	
0.87/1.15	% Starting search at 0.02 seconds.
0.87/1.15	
0.87/1.15	============================== PROOF =================================
0.87/1.15	% SZS status Theorem
0.87/1.15	% SZS output start Refutation
0.87/1.15	
0.87/1.15	% Proof 1 at 0.22 (+ 0.01) seconds.
0.87/1.15	% Length of proof is 21.
0.87/1.15	% Level of proof is 5.
0.87/1.15	% Maximum clause weight is 33.000.
0.87/1.15	% Given clauses 414.
0.87/1.15	
0.87/1.15	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.87/1.15	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_Halt(Pid0),queue(host(Z))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (leq(Pid0,Z) & host(Z) = host(Pid0) & -setIn(Z,alive) -> -setIn(Pid0,alive))) & queue(host(X)) = cons(m_Down(Y),V) & (all Z all Pid30 all Pid20 all Pid0 (host(Z) != host(Pid20) & setIn(Z,alive) & host(Pid30) = host(Z) & host(Pid0) = host(Pid20) & setIn(Pid20,alive) -> -(elem(m_Down(Pid30),queue(host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & (all Z all Pid0 (Pid0 != Z & host(Z) = host(Pid0) -> -setIn(Z,alive) | -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))) -> host(Z) != host(Pid0))) & (all Z all Pid0 (setIn(Pid0,alive) -> -elem(m_Down(Pid0),queue(host(Z))))) -> (setIn(X,alive) -> (-leq(host(X),host(Y)) -> (-(host(index(elid,host(X))) = host(Y) & index(status,host(X)) = wait | norm = index(status,host(X)) & host(Y) = index(ldr,host(X))) -> (index(status,host(X)) = elec_1 & (all Z (-leq(host(X),Z) & leq(s(zero),Z) -> setIn(Z,index(down,host(X))) | host(Y) = Z)) -> (-leq(nbr_proc,host(X)) -> (all Z (host(Z) != s(host(X)) -> (host(X) = host(Z) -> (all W0 all X0 (host(X0) != s(host(X)) -> (host(X0) != host(X) -> (all Y0 (host(X0) != host(Z) & setIn(Z,alive) & setIn(X0,alive) & host(X0) = host(Y0) & host(W0) = host(Z) -> -(elem(m_Down(W0),queue(host(X0))) & elem(m_Down(Y0),V))))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.87/1.15	112 -elem(A,B) | elem(A,cons(C,B)) # label(axiom_46) # label(axiom).  [clausify(30)].
0.87/1.15	161 queue(host(c3)) = cons(m_Down(c4),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.87/1.15	162 cons(m_Down(c4),c1) = queue(host(c3)).  [copy(161),flip(a)].
0.87/1.15	163 host(A) = host(B) | -setIn(B,alive) | host(C) != host(B) | host(A) != host(D) | -setIn(A,alive) | -elem(m_Down(C),queue(host(A))) | -elem(m_Down(D),queue(host(B))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.87/1.15	167 setIn(c3,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.87/1.15	176 host(c5) = host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.87/1.15	178 host(c7) != host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.87/1.15	181 setIn(c7,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.87/1.15	182 host(c8) = host(c7) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.87/1.15	183 host(c6) = host(c5) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.87/1.15	184 host(c6) = host(c3).  [copy(183),rewrite([176(4)])].
0.87/1.15	185 elem(m_Down(c6),queue(host(c7))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.87/1.15	186 elem(m_Down(c8),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.87/1.15	279 host(c3) = host(A) | -setIn(A,alive) | host(B) != host(A) | host(c3) != host(C) | -elem(m_Down(B),queue(host(c3))) | -elem(m_Down(C),queue(host(A))).  [resolve(167,a,163,e)].
0.87/1.15	311 elem(m_Down(c8),cons(A,c1)).  [resolve(186,a,112,a)].
0.87/1.15	428 elem(m_Down(c8),queue(host(c3))).  [para(162(a,1),311(a,2))].
0.87/1.15	1937 host(c7) != host(A) | host(c3) != host(B) | -elem(m_Down(A),queue(host(c3))) | -elem(m_Down(B),queue(host(c7))).  [resolve(279,b,181,a),flip(a),flip(b),unit_del(a,178)].
0.87/1.15	1938 host(c3) != host(A) | -elem(m_Down(A),queue(host(c7))).  [resolve(1937,c,428,a),rewrite([182(4)]),xx(a)].
0.87/1.15	1940 $F.  [resolve(1938,b,185,a),rewrite([184(4)]),xx(a)].
0.87/1.15	
0.87/1.15	% SZS output end Refutation
0.87/1.15	============================== end of proof ==========================
0.87/1.15	
0.87/1.15	============================== STATISTICS ============================
0.87/1.15	
0.87/1.15	Given=414. Generated=6983. Kept=1872. proofs=1.
0.87/1.15	Usable=404. Sos=1421. Demods=29. Limbo=0, Disabled=170. Hints=0.
0.87/1.15	Megabytes=3.35.
0.87/1.15	User_CPU=0.22, System_CPU=0.01, Wall_clock=0.
0.87/1.15	
0.87/1.15	============================== end of statistics =====================
0.87/1.15	
0.87/1.15	============================== end of search =========================
0.87/1.15	
0.87/1.15	THEOREM PROVED
0.87/1.15	% SZS status Theorem
0.87/1.15	
0.87/1.15	Exiting with 1 proof.
0.87/1.15	
0.87/1.15	Process 9818 exit (max_proofs) Mon Jul  3 04:48:50 2023
0.87/1.15	Prover9 interrupted
0.87/1.16	EOF