0.07/0.09	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.10	% Command  : tptp2X_and_run_prover9 %d %s
0.08/0.30	% Computer : n027.cluster.edu
0.08/0.30	% Model    : x86_64 x86_64
0.08/0.30	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.08/0.30	% Memory   : 8042.1875MB
0.08/0.30	% OS       : Linux 3.10.0-693.el7.x86_64
0.08/0.30	% CPULimit : 960
0.08/0.30	% WCLimit  : 120
0.08/0.30	% DateTime : Tue Aug  9 02:55:21 EDT 2022
0.08/0.30	% CPUTime  : 
0.57/0.85	============================== Prover9 ===============================
0.57/0.85	Prover9 (32) version 2009-11A, November 2009.
0.57/0.85	Process 21645 was started by sandbox on n027.cluster.edu,
0.57/0.85	Tue Aug  9 02:55:21 2022
0.57/0.85	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_21492_n027.cluster.edu".
0.57/0.85	============================== end of head ===========================
0.57/0.85	
0.57/0.85	============================== INPUT =================================
0.57/0.85	
0.57/0.85	% Reading from file /tmp/Prover9_21492_n027.cluster.edu
0.57/0.85	
0.57/0.85	set(prolog_style_variables).
0.57/0.85	set(auto2).
0.57/0.85	    % set(auto2) -> set(auto).
0.57/0.85	    % set(auto) -> set(auto_inference).
0.57/0.85	    % set(auto) -> set(auto_setup).
0.57/0.85	    % set(auto_setup) -> set(predicate_elim).
0.57/0.85	    % set(auto_setup) -> assign(eq_defs, unfold).
0.57/0.85	    % set(auto) -> set(auto_limits).
0.57/0.85	    % set(auto_limits) -> assign(max_weight, "100.000").
0.57/0.85	    % set(auto_limits) -> assign(sos_limit, 20000).
0.57/0.85	    % set(auto) -> set(auto_denials).
0.57/0.85	    % set(auto) -> set(auto_process).
0.57/0.85	    % set(auto2) -> assign(new_constants, 1).
0.57/0.85	    % set(auto2) -> assign(fold_denial_max, 3).
0.57/0.85	    % set(auto2) -> assign(max_weight, "200.000").
0.57/0.85	    % set(auto2) -> assign(max_hours, 1).
0.57/0.85	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.57/0.85	    % set(auto2) -> assign(max_seconds, 0).
0.57/0.85	    % set(auto2) -> assign(max_minutes, 5).
0.57/0.85	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.57/0.85	    % set(auto2) -> set(sort_initial_sos).
0.57/0.85	    % set(auto2) -> assign(sos_limit, -1).
0.57/0.85	    % set(auto2) -> assign(lrs_ticks, 3000).
0.57/0.85	    % set(auto2) -> assign(max_megs, 400).
0.57/0.85	    % set(auto2) -> assign(stats, some).
0.57/0.85	    % set(auto2) -> clear(echo_input).
0.57/0.85	    % set(auto2) -> set(quiet).
0.57/0.85	    % set(auto2) -> clear(print_initial_clauses).
0.57/0.85	    % set(auto2) -> clear(print_given).
0.57/0.85	assign(lrs_ticks,-1).
0.57/0.85	assign(sos_limit,10000).
0.57/0.85	assign(order,kbo).
0.57/0.85	set(lex_order_vars).
0.57/0.85	clear(print_given).
0.57/0.85	
0.57/0.85	% formulas(sos).  % not echoed (67 formulas)
0.57/0.85	
0.57/0.85	============================== end of input ==========================
0.57/0.85	
0.57/0.85	% From the command line: assign(max_seconds, 960).
0.57/0.85	
0.57/0.85	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.57/0.85	
0.57/0.85	% Formulas that are not ordinary clauses:
0.57/0.85	1 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	2 (all X X = pidMsg(m_Halt(X))) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	3 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	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.57/0.85	5 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	6 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	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.57/0.85	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.57/0.85	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.57/0.85	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.57/0.85	11 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	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.57/0.85	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.57/0.85	14 (all X all Y m_NotNorm(Y) != m_NormQ(X)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	15 (all X all Y all Z m_NotNorm(Z) != m_Ack(X,Y)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	16 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	17 (all Pid all Pid2 (host(Pid) != host(Pid2) -> Pid2 != Pid)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	18 (all P all Q (host(Q) = s(host(P)) -> host(Q) != host(P))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	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.57/0.85	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.57/0.85	21 (all X all Y (leq(X,Y) <-> leq(s(X),s(Y)))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	22 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	23 (all X all Y (Y != X <-> m_Halt(X) != m_Halt(Y))) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	24 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	25 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	26 (all X all Y all Z m_Down(Z) != m_Ack(X,Y)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	27 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	28 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	29 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	30 (all X all Y all Z m_Ack(X,Y) != m_Halt(Z)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	31 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	32 (all X all Y m_Ldr(Y) != m_Down(X)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	33 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	34 (all X all Y m_NormQ(Y) != m_Down(X)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	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.57/0.85	36 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	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.57/0.85	38 (all X all Y m_Halt(Y) != m_NormQ(X)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	39 (all X all Y (X != Y <-> m_NormQ(Y) != m_NormQ(X))) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	40 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	41 (all X all Y m_Halt(Y) != m_Ldr(X)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	42 (all Q (cons(head(Q),tail(Q)) = Q | Q = q_nil)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	43 (all X all Q X = head(cons(X,Q))) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	44 (all Q (Q = q_nil | snoc(init(Q),last(Q)) = Q)) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	45 (all Y all Q Y = last(snoc(Q,Y))) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	46 (all X all Y (m_NotNorm(Y) != m_NotNorm(X) <-> Y != X)) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	47 (all X (ordered(snoc(q_nil,X)) & ordered(cons(X,q_nil)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	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.57/0.85	49 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.57/0.85	50 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	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].
0.84/1.14	52 (all X all Y (X != Y <-> m_Down(Y) != m_Down(X))) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	53 (all X all Y m_Halt(Y) != m_Down(X)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	54 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	55 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	56 (all X all Y m_NotNorm(Y) != m_Down(X)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	57 (all X all Y (m_Ldr(X) != m_Ldr(Y) <-> Y != X)) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.84/1.14	58 -(all V all W all X all Y ((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)))) & queue(host(X)) = cons(m_Down(Y),V) & (all Z all Pid30 all Pid20 all Pid0 (host(Z) != host(Pid20) & setIn(Pid20,alive) & host(Z) = host(Pid30) & host(Pid20) = host(Pid0) & setIn(Z,alive) -> -(elem(m_Down(Pid0),queue(host(Z))) & elem(m_Down(Pid30),queue(host(Pid20)))))) & (all Z all Pid0 (host(Pid0) = host(Z) & Pid0 != Z -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (all Z all Pid0 (-setIn(Z,alive) & leq(Pid0,Z) & host(Pid0) = 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_Down(Pid0),queue(host(Z))) -> -setIn(Pid0,alive))) & (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) & wait = index(status,host(X)) | host(Y) = index(ldr,host(X)) & norm = index(status,host(X))) -> (-(elec_1 = index(status,host(X)) & (all Z (leq(s(zero),Z) & -leq(host(X),Z) -> setIn(Z,index(down,host(X))) | host(Y) = Z))) -> (all Z (host(X) != host(Z) -> (all W0 all X0 (host(X) = host(X0) -> (all Y0 (host(X0) != host(Z) & setIn(X0,alive) & host(X0) = host(Y0) & host(W0) = host(Z) & setIn(Z,alive) -> -(elem(m_Down(W0),V) & elem(m_Down(Y0),queue(host(Z)))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.84/1.14	
0.84/1.14	============================== end of process non-clausal formulas ===
0.84/1.14	
0.84/1.14	============================== PROCESS INITIAL CLAUSES ===============
0.84/1.14	
0.84/1.14	============================== PREDICATE ELIMINATION =================
0.84/1.14	
0.84/1.14	============================== end predicate elimination =============
0.84/1.14	
0.84/1.14	Auto_denials:  (non-Horn, no changes).
0.84/1.14	
0.84/1.14	Term ordering decisions:
0.84/1.14	Function symbol KB weights:  alive=1. q_nil=1. zero=1. nbr_proc=1. pids=1. elec_1=1. status=1. down=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. c9=1. cons=1. snoc=1. m_Ack=1. index=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.
0.84/1.14	
0.84/1.14	============================== end of process initial clauses ========
0.84/1.14	
0.84/1.14	============================== CLAUSES FOR SEARCH ====================
0.84/1.14	
0.84/1.14	============================== end of clauses for search =============
0.84/1.14	
0.84/1.14	============================== SEARCH ================================
0.84/1.14	
0.84/1.14	% Starting search at 0.03 seconds.
0.84/1.14	
0.84/1.14	============================== PROOF =================================
0.84/1.14	% SZS status Theorem
0.84/1.14	% SZS output start Refutation
0.84/1.14	
0.84/1.14	% Proof 1 at 0.30 (+ 0.01) seconds.
0.84/1.14	% Length of proof is 21.
0.84/1.14	% Level of proof is 5.
0.84/1.14	% Maximum clause weight is 33.000.
0.84/1.14	% Given clauses 459.
0.84/1.14	
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	58 -(all V all W all X all Y ((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)))) & queue(host(X)) = cons(m_Down(Y),V) & (all Z all Pid30 all Pid20 all Pid0 (host(Z) != host(Pid20) & setIn(Pid20,alive) & host(Z) = host(Pid30) & host(Pid20) = host(Pid0) & setIn(Z,alive) -> -(elem(m_Down(Pid0),queue(host(Z))) & elem(m_Down(Pid30),queue(host(Pid20)))))) & (all Z all Pid0 (host(Pid0) = host(Z) & Pid0 != Z -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (all Z all Pid0 (-setIn(Z,alive) & leq(Pid0,Z) & host(Pid0) = 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_Down(Pid0),queue(host(Z))) -> -setIn(Pid0,alive))) & (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) & wait = index(status,host(X)) | host(Y) = index(ldr,host(X)) & norm = index(status,host(X))) -> (-(elec_1 = index(status,host(X)) & (all Z (leq(s(zero),Z) & -leq(host(X),Z) -> setIn(Z,index(down,host(X))) | host(Y) = Z))) -> (all Z (host(X) != host(Z) -> (all W0 all X0 (host(X) = host(X0) -> (all Y0 (host(X0) != host(Z) & setIn(X0,alive) & host(X0) = host(Y0) & host(W0) = host(Z) & setIn(Z,alive) -> -(elem(m_Down(W0),V) & elem(m_Down(Y0),queue(host(Z)))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.84/1.14	68 -elem(A,B) | elem(A,cons(C,B)) # label(axiom_46) # label(axiom).  [clausify(7)].
0.84/1.14	162 queue(host(c3)) = cons(m_Down(c4),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.84/1.14	163 cons(m_Down(c4),c1) = queue(host(c3)).  [copy(162),flip(a)].
0.84/1.14	164 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)].
0.84/1.14	169 setIn(c3,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.84/1.14	177 host(c6) != host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.84/1.14	178 host(c8) = host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.84/1.14	181 host(c9) = host(c8) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.84/1.14	182 host(c9) = host(c3).  [copy(181),rewrite([178(4)])].
0.84/1.14	183 host(c7) = host(c6) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.84/1.14	184 setIn(c6,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.84/1.14	185 elem(m_Down(c7),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.84/1.14	186 elem(m_Down(c9),queue(host(c6))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.84/1.14	277 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,164,e),flip(a),flip(c)].
0.84/1.14	305 elem(m_Down(c7),cons(A,c1)).  [resolve(185,a,68,a)].
0.84/1.14	411 elem(m_Down(c7),queue(host(c3))).  [para(163(a,1),305(a,2))].
0.84/1.14	2412 host(c3) != host(A) | host(c6) != host(B) | -elem(m_Down(B),queue(host(c3))) | -elem(m_Down(A),queue(host(c6))).  [resolve(277,b,184,a),flip(a),unit_del(a,177)].
0.84/1.14	2413 host(c3) != host(A) | -elem(m_Down(A),queue(host(c6))).  [resolve(2412,c,411,a),rewrite([183(8)]),xx(b)].
0.84/1.14	2415 $F.  [resolve(2413,b,186,a),rewrite([182(4)]),xx(a)].
0.84/1.14	
0.84/1.14	% SZS output end Refutation
0.84/1.14	============================== end of proof ==========================
0.84/1.14	
0.84/1.14	============================== STATISTICS ============================
0.84/1.14	
0.84/1.14	Given=459. Generated=10734. Kept=2347. proofs=1.
0.84/1.14	Usable=448. Sos=1844. Demods=28. Limbo=0, Disabled=177. Hints=0.
0.84/1.14	Megabytes=4.58.
0.84/1.14	User_CPU=0.30, System_CPU=0.01, Wall_clock=1.
0.84/1.14	
0.84/1.14	============================== end of statistics =====================
0.84/1.14	
0.84/1.14	============================== end of search =========================
0.84/1.14	
0.84/1.14	THEOREM PROVED
0.84/1.14	% SZS status Theorem
0.84/1.14	
0.84/1.14	Exiting with 1 proof.
0.84/1.14	
0.84/1.14	Process 21645 exit (max_proofs) Tue Aug  9 02:55:22 2022
0.84/1.14	Prover9 interrupted
0.84/1.14	EOF