0.11/0.12	% 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.32	% Computer   : n003.cluster.edu
0.12/0.32	% Model      : x86_64 x86_64
0.12/0.32	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.32	% Memory     : 8042.1875MB
0.12/0.32	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.32	% CPULimit   : 1200
0.12/0.32	% DateTime   : Wed Jul 14 14:53:25 EDT 2021
0.12/0.32	% CPUTime    : 
0.72/1.03	============================== Prover9 ===============================
0.72/1.03	Prover9 (32) version 2009-11A, November 2009.
0.72/1.03	Process 30236 was started by sandbox on n003.cluster.edu,
0.72/1.03	Wed Jul 14 14:53:25 2021
0.72/1.03	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_30082_n003.cluster.edu".
0.72/1.03	============================== end of head ===========================
0.72/1.03	
0.72/1.03	============================== INPUT =================================
0.72/1.03	
0.72/1.03	% Reading from file /tmp/Prover9_30082_n003.cluster.edu
0.72/1.03	
0.72/1.03	set(prolog_style_variables).
0.72/1.03	set(auto2).
0.72/1.03	    % set(auto2) -> set(auto).
0.72/1.03	    % set(auto) -> set(auto_inference).
0.72/1.03	    % set(auto) -> set(auto_setup).
0.72/1.03	    % set(auto_setup) -> set(predicate_elim).
0.72/1.03	    % set(auto_setup) -> assign(eq_defs, unfold).
0.72/1.03	    % set(auto) -> set(auto_limits).
0.72/1.03	    % set(auto_limits) -> assign(max_weight, "100.000").
0.72/1.03	    % set(auto_limits) -> assign(sos_limit, 20000).
0.72/1.03	    % set(auto) -> set(auto_denials).
0.72/1.03	    % set(auto) -> set(auto_process).
0.72/1.03	    % set(auto2) -> assign(new_constants, 1).
0.72/1.03	    % set(auto2) -> assign(fold_denial_max, 3).
0.72/1.03	    % set(auto2) -> assign(max_weight, "200.000").
0.72/1.03	    % set(auto2) -> assign(max_hours, 1).
0.72/1.03	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.72/1.03	    % set(auto2) -> assign(max_seconds, 0).
0.72/1.03	    % set(auto2) -> assign(max_minutes, 5).
0.72/1.03	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.72/1.03	    % set(auto2) -> set(sort_initial_sos).
0.72/1.03	    % set(auto2) -> assign(sos_limit, -1).
0.72/1.03	    % set(auto2) -> assign(lrs_ticks, 3000).
0.72/1.03	    % set(auto2) -> assign(max_megs, 400).
0.72/1.03	    % set(auto2) -> assign(stats, some).
0.72/1.03	    % set(auto2) -> clear(echo_input).
0.72/1.03	    % set(auto2) -> set(quiet).
0.72/1.03	    % set(auto2) -> clear(print_initial_clauses).
0.72/1.03	    % set(auto2) -> clear(print_given).
0.72/1.03	assign(lrs_ticks,-1).
0.72/1.03	assign(sos_limit,10000).
0.72/1.03	assign(order,kbo).
0.72/1.03	set(lex_order_vars).
0.72/1.03	clear(print_given).
0.72/1.03	
0.72/1.03	% formulas(sos).  % not echoed (67 formulas)
0.72/1.03	
0.72/1.03	============================== end of input ==========================
0.72/1.03	
0.72/1.03	% From the command line: assign(max_seconds, 1200).
0.72/1.03	
0.72/1.03	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.72/1.03	
0.72/1.03	% Formulas that are not ordinary clauses:
0.72/1.03	1 (all X (ordered(cons(X,q_nil)) & ordered(snoc(q_nil,X)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	2 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	3 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	4 (all X all Y all Z m_Down(Z) != m_Ack(X,Y)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	5 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	6 (all X all Q X = head(cons(X,Q))) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	7 (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.72/1.03	8 (all Q (cons(head(Q),tail(Q)) = Q | q_nil = Q)) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	9 (all X all Y (X != Y <-> m_Halt(X) != m_Halt(Y))) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	10 (all Pid all Pid2 (host(Pid2) != host(Pid) -> Pid != Pid2)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	11 (all X all Y m_Down(X) != m_NotNorm(Y)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	12 (all X all Y (leq(Y,X) | leq(X,Y))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	13 (all P all Q (s(host(P)) = host(Q) -> host(P) != host(Q))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	14 (all X all Y (m_NormQ(Y) != m_NormQ(X) <-> X != Y)) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	15 (all X all Y all Z m_Halt(Z) != m_Ack(X,Y)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	16 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	17 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	18 (all X1 all X2 all Y1 all Y2 (Y2 != Y1 -> m_Ack(X1,Y1) != m_Ack(X2,Y2))) # label(axiom_32) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	19 (all X (pidElem(X) <-> (exists Y (X = m_Down(Y) | m_Halt(Y) = X)))) # label(axiom_48) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	20 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	21 (all X all Y (X = s(Y) | leq(X,Y) <-> leq(X,s(Y)))) # label(axiom_64) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	22 (all X pidMsg(m_Halt(X)) = X) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	23 (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.72/1.03	24 (all X all Y (m_NotNorm(X) != m_NotNorm(Y) <-> X != Y)) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	25 (all Y all Q last(snoc(Q,Y)) = Y) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	26 (all X all Y (X != Y <-> m_Ldr(Y) != m_Ldr(X))) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	27 (all X all Y all Q (elem(X,Q) | Y = X <-> elem(X,snoc(Q,Y)))) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	28 (all X all Y m_Ldr(X) != m_Halt(Y)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	29 (all Q (Q = snoc(init(Q),last(Q)) | q_nil = Q)) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	30 (all X cons(X,q_nil) = snoc(q_nil,X)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	31 (all X all Y (X = Y <-> leq(X,Y) & leq(Y,X))) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	32 (all X all Y m_NormQ(X) != m_Halt(Y)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	33 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	34 (all X all Y all Z m_Ack(X,Y) != m_NotNorm(Z)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	35 (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.72/1.03	36 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	37 (all X pidMsg(m_Down(X)) = X) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	38 (all X all Y m_NotNorm(X) != m_Halt(Y)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	39 (all X all Y all Q (elem(X,cons(Y,Q)) <-> X = Y | elem(X,Q))) # label(axiom_46) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	40 (all X all Y m_NormQ(Y) != m_Down(X)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	41 (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.72/1.03	42 (all X all Y all Z m_NormQ(Z) != m_Ack(X,Y)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	43 (all X all Y (m_Down(Y) != m_Down(X) <-> Y != X)) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	44 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	45 (all Y all Q Q = init(snoc(Q,Y))) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	46 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	47 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	48 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	49 (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.72/1.03	50 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	51 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.72/1.03	52 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
1.02/1.33	53 (all X all Q (ordered(cons(X,Q)) <-> (all Y (elem(Y,Q) & pidElem(Y) & host(pidMsg(Y)) = host(pidMsg(X)) & pidElem(X) -> leq(pidMsg(X),pidMsg(Y)))) & ordered(Q))) # label(axiom_53) # label(axiom) # label(non_clause).  [assumption].
1.02/1.33	54 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
1.02/1.33	55 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
1.02/1.33	56 (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].
1.02/1.33	57 (all X all Q ((all Y (elem(Y,Q) & pidElem(X) & host(pidMsg(Y)) = host(pidMsg(X)) & pidElem(Y) -> leq(pidMsg(Y),pidMsg(X)))) & ordered(Q) <-> ordered(snoc(Q,X)))) # label(axiom_54) # label(axiom) # label(non_clause).  [assumption].
1.02/1.33	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 Pid20 all Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid20))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (-setIn(Z,alive) & leq(Pid0,Z) & host(Z) = host(Pid0) -> -setIn(Pid0,alive))) & (all Z all Pid0 (Pid0 != Z & host(Pid0) = host(Z) -> -setIn(Pid0,alive) | -setIn(Z,alive))) & cons(m_Down(Y),V) = queue(host(X)) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) = host(Pid0) & host(Pid30) = host(Z) & setIn(Pid20,alive) & setIn(Z,alive) & host(Pid20) != host(Z) -> -(elem(m_Down(Pid0),queue(host(Z))) & elem(m_Down(Pid30),queue(host(Pid20)))))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Pid0) != host(Z))) & (all Z all Pid0 (setIn(Pid0,alive) -> -elem(m_Down(Pid0),queue(host(Z))))) -> (setIn(X,alive) -> (-leq(host(X),host(Y)) -> (-(index(status,host(X)) = norm & host(Y) = index(ldr,host(X)) | index(status,host(X)) = wait & host(index(elid,host(X))) = host(Y)) -> (elec_1 = index(status,host(X)) & (all Z (-leq(host(X),Z) & leq(s(zero),Z) -> Z = host(Y) | setIn(Z,index(down,host(X))))) -> (-leq(nbr_proc,host(X)) -> (all Z (host(Z) != s(host(X)) -> (host(Z) = host(X) -> (all W0 all X0 (s(host(X)) != host(X0) -> (host(X) != host(X0) -> (all Y0 (host(Z) != host(X0) & setIn(X0,alive) & host(Y0) = host(X0) & host(W0) = host(Z) & setIn(Z,alive) -> -(elem(m_Down(Y0),V) & elem(m_Down(W0),queue(host(X0))))))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
1.02/1.33	
1.02/1.33	============================== end of process non-clausal formulas ===
1.02/1.33	
1.02/1.33	============================== PROCESS INITIAL CLAUSES ===============
1.02/1.33	
1.02/1.33	============================== PREDICATE ELIMINATION =================
1.02/1.33	
1.02/1.33	============================== end predicate elimination =============
1.02/1.33	
1.02/1.33	Auto_denials:  (non-Horn, no changes).
1.02/1.33	
1.02/1.33	Term ordering decisions:
1.02/1.33	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. 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.
1.02/1.33	
1.02/1.33	============================== end of process initial clauses ========
1.02/1.33	
1.02/1.33	============================== CLAUSES FOR SEARCH ====================
1.02/1.33	
1.02/1.33	============================== end of clauses for search =============
1.02/1.33	
1.02/1.33	============================== SEARCH ================================
1.02/1.33	
1.02/1.33	% Starting search at 0.03 seconds.
1.02/1.33	
1.02/1.33	============================== PROOF =================================
1.02/1.33	% SZS status Theorem
1.02/1.33	% SZS output start Refutation
1.02/1.33	
1.02/1.33	% Proof 1 at 0.30 (+ 0.01) seconds.
1.02/1.33	% Length of proof is 21.
1.02/1.33	% Level of proof is 5.
1.02/1.33	% Maximum clause weight is 33.000.
1.02/1.33	% Given clauses 434.
1.02/1.33	
1.02/1.33	39 (all X all Y all Q (elem(X,cons(Y,Q)) <-> X = Y | elem(X,Q))) # label(axiom_46) # label(axiom) # label(non_clause).  [assumption].
1.02/1.33	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 Pid20 all Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid20))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (-setIn(Z,alive) & leq(Pid0,Z) & host(Z) = host(Pid0) -> -setIn(Pid0,alive))) & (all Z all Pid0 (Pid0 != Z & host(Pid0) = host(Z) -> -setIn(Pid0,alive) | -setIn(Z,alive))) & cons(m_Down(Y),V) = queue(host(X)) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) = host(Pid0) & host(Pid30) = host(Z) & setIn(Pid20,alive) & setIn(Z,alive) & host(Pid20) != host(Z) -> -(elem(m_Down(Pid0),queue(host(Z))) & elem(m_Down(Pid30),queue(host(Pid20)))))) & (all Z all Pid0 (elem(m_Down(Pid0),queue(host(Z))) -> host(Pid0) != host(Z))) & (all Z all Pid0 (setIn(Pid0,alive) -> -elem(m_Down(Pid0),queue(host(Z))))) -> (setIn(X,alive) -> (-leq(host(X),host(Y)) -> (-(index(status,host(X)) = norm & host(Y) = index(ldr,host(X)) | index(status,host(X)) = wait & host(index(elid,host(X))) = host(Y)) -> (elec_1 = index(status,host(X)) & (all Z (-leq(host(X),Z) & leq(s(zero),Z) -> Z = host(Y) | setIn(Z,index(down,host(X))))) -> (-leq(nbr_proc,host(X)) -> (all Z (host(Z) != s(host(X)) -> (host(Z) = host(X) -> (all W0 all X0 (s(host(X)) != host(X0) -> (host(X) != host(X0) -> (all Y0 (host(Z) != host(X0) & setIn(X0,alive) & host(Y0) = host(X0) & host(W0) = host(Z) & setIn(Z,alive) -> -(elem(m_Down(Y0),V) & elem(m_Down(W0),queue(host(X0))))))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
1.02/1.33	123 elem(A,cons(B,C)) | -elem(A,C) # label(axiom_46) # label(axiom).  [clausify(39)].
1.02/1.33	164 queue(host(c3)) = cons(m_Down(c4),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.02/1.33	165 cons(m_Down(c4),c1) = queue(host(c3)).  [copy(164),flip(a)].
1.02/1.33	166 host(A) != host(B) | host(C) != host(D) | -setIn(A,alive) | -setIn(D,alive) | host(A) = host(D) | -elem(m_Down(B),queue(host(D))) | -elem(m_Down(C),queue(host(A))) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.02/1.33	168 setIn(c3,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.02/1.33	178 host(c5) = host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.02/1.33	181 host(c7) != host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.02/1.33	183 setIn(c7,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.02/1.33	184 host(c8) = host(c7) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.02/1.33	185 host(c6) = host(c5) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.02/1.33	186 host(c6) = host(c3).  [copy(185),rewrite([178(4)])].
1.02/1.33	188 elem(m_Down(c8),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.02/1.33	189 elem(m_Down(c6),queue(host(c7))) # label(conj) # label(negated_conjecture).  [clausify(58)].
1.02/1.33	283 host(A) != host(B) | host(c3) != host(C) | -setIn(A,alive) | host(c3) = host(A) | -elem(m_Down(B),queue(host(c3))) | -elem(m_Down(C),queue(host(A))).  [resolve(168,a,166,d),flip(b),flip(d)].
1.02/1.33	314 elem(m_Down(c8),cons(A,c1)).  [resolve(188,a,123,b)].
1.02/1.33	558 elem(m_Down(c8),queue(host(c3))).  [para(165(a,1),314(a,2))].
1.02/1.33	1999 host(c7) != host(A) | host(c3) != host(B) | -elem(m_Down(A),queue(host(c3))) | -elem(m_Down(B),queue(host(c7))).  [resolve(283,c,183,a),flip(c),unit_del(c,181)].
1.02/1.33	2000 host(c3) != host(A) | -elem(m_Down(A),queue(host(c7))).  [resolve(1999,c,558,a),rewrite([184(4)]),xx(a)].
1.02/1.33	2002 $F.  [resolve(2000,b,189,a),rewrite([186(4)]),xx(a)].
1.02/1.33	
1.02/1.33	% SZS output end Refutation
1.02/1.33	============================== end of proof ==========================
1.02/1.33	
1.02/1.33	============================== STATISTICS ============================
1.02/1.33	
1.02/1.33	Given=434. Generated=7284. Kept=1933. proofs=1.
1.02/1.33	Usable=430. Sos=1468. Demods=30. Limbo=0, Disabled=158. Hints=0.
1.02/1.33	Megabytes=3.74.
1.02/1.33	User_CPU=0.30, System_CPU=0.01, Wall_clock=1.
1.02/1.33	
1.02/1.33	============================== end of statistics =====================
1.02/1.33	
1.02/1.33	============================== end of search =========================
1.02/1.33	
1.02/1.33	THEOREM PROVED
1.02/1.33	% SZS status Theorem
1.02/1.33	
1.02/1.33	Exiting with 1 proof.
1.02/1.33	
1.02/1.33	Process 30236 exit (max_proofs) Wed Jul 14 14:53:26 2021
1.02/1.33	Prover9 interrupted
1.02/1.33	EOF