0.00/0.03	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.04	% Command    : tptp2X_and_run_prover9 %d %s
0.02/0.22	% Computer   : n180.star.cs.uiowa.edu
0.02/0.22	% Model      : x86_64 x86_64
0.02/0.22	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.02/0.22	% Memory     : 32218.625MB
0.02/0.22	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.02/0.22	% CPULimit   : 300
0.02/0.22	% DateTime   : Sat Jul 14 05:36:10 CDT 2018
0.02/0.22	% CPUTime    : 
0.06/0.47	============================== Prover9 ===============================
0.06/0.47	Prover9 (32) version 2009-11A, November 2009.
0.06/0.47	Process 38152 was started by sandbox2 on n180.star.cs.uiowa.edu,
0.06/0.47	Sat Jul 14 05:36:10 2018
0.06/0.47	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_38118_n180.star.cs.uiowa.edu".
0.06/0.47	============================== end of head ===========================
0.06/0.47	
0.06/0.47	============================== INPUT =================================
0.06/0.47	
0.06/0.47	% Reading from file /tmp/Prover9_38118_n180.star.cs.uiowa.edu
0.06/0.47	
0.06/0.47	set(prolog_style_variables).
0.06/0.47	set(auto2).
0.06/0.47	    % set(auto2) -> set(auto).
0.06/0.47	    % set(auto) -> set(auto_inference).
0.06/0.47	    % set(auto) -> set(auto_setup).
0.06/0.47	    % set(auto_setup) -> set(predicate_elim).
0.06/0.47	    % set(auto_setup) -> assign(eq_defs, unfold).
0.06/0.47	    % set(auto) -> set(auto_limits).
0.06/0.47	    % set(auto_limits) -> assign(max_weight, "100.000").
0.06/0.47	    % set(auto_limits) -> assign(sos_limit, 20000).
0.06/0.47	    % set(auto) -> set(auto_denials).
0.06/0.47	    % set(auto) -> set(auto_process).
0.06/0.47	    % set(auto2) -> assign(new_constants, 1).
0.06/0.47	    % set(auto2) -> assign(fold_denial_max, 3).
0.06/0.47	    % set(auto2) -> assign(max_weight, "200.000").
0.06/0.47	    % set(auto2) -> assign(max_hours, 1).
0.06/0.47	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.06/0.47	    % set(auto2) -> assign(max_seconds, 0).
0.06/0.47	    % set(auto2) -> assign(max_minutes, 5).
0.06/0.47	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.06/0.47	    % set(auto2) -> set(sort_initial_sos).
0.06/0.47	    % set(auto2) -> assign(sos_limit, -1).
0.06/0.47	    % set(auto2) -> assign(lrs_ticks, 3000).
0.06/0.47	    % set(auto2) -> assign(max_megs, 400).
0.06/0.47	    % set(auto2) -> assign(stats, some).
0.06/0.47	    % set(auto2) -> clear(echo_input).
0.06/0.47	    % set(auto2) -> set(quiet).
0.06/0.47	    % set(auto2) -> clear(print_initial_clauses).
0.06/0.47	    % set(auto2) -> clear(print_given).
0.06/0.47	assign(lrs_ticks,-1).
0.06/0.47	assign(sos_limit,10000).
0.06/0.47	assign(order,kbo).
0.06/0.47	set(lex_order_vars).
0.06/0.47	clear(print_given).
0.06/0.47	
0.06/0.47	% formulas(sos).  % not echoed (67 formulas)
0.06/0.47	
0.06/0.47	============================== end of input ==========================
0.06/0.47	
0.06/0.47	% From the command line: assign(max_seconds, 300).
0.06/0.47	
0.06/0.47	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.06/0.47	
0.06/0.47	% Formulas that are not ordinary clauses:
0.06/0.47	1 (all X all Y (s(Y) = X | leq(X,Y) <-> leq(X,s(Y)))) # label(axiom_64) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	2 (all X pidMsg(m_Halt(X)) = X) # label(axiom_49) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	3 (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.06/0.47	4 (all X all Y all Z m_Ack(X,Y) != m_NormQ(Z)) # label(axiom_15) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	5 (all X all Y all Z m_Ack(X,Y) != m_Ldr(Z)) # label(axiom_14) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	6 (all Q all X all Y (host(X) = host(Y) & elem(m_Down(Y),Q) & ordered(cons(m_Halt(X),Q)) -> leq(X,Y))) # label(axiom_57) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	7 (all X all Y all Q (elem(X,snoc(Q,Y)) <-> elem(X,Q) | Y = X)) # label(axiom_47) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	8 (all X ((exists Y (m_Down(Y) = X | X = m_Halt(Y))) <-> pidElem(X))) # label(axiom_48) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	9 (all X all Y m_Down(X) != m_NotNorm(Y)) # label(axiom_19) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	10 (all X all Y m_NormQ(X) != m_Halt(Y)) # label(axiom_21) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	11 (all X all Y m_Halt(Y) != m_Ldr(X)) # label(axiom_22) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	12 (all X all Q q_nil != cons(X,Q)) # label(axiom_41) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	13 (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.06/0.47	14 (all X all Y all Z m_Ack(X,Y) != m_Halt(Z)) # label(axiom_11) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	15 (all X -leq(s(X),X)) # label(axiom_58) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	16 (all X all Y m_Halt(Y) != m_NotNorm(X)) # label(axiom_16) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	17 (all X all Q (ordered(snoc(Q,X)) <-> (all Y (elem(Y,Q) & host(pidMsg(Y)) = host(pidMsg(X)) & pidElem(Y) & pidElem(X) -> leq(pidMsg(Y),pidMsg(X)))) & ordered(Q))) # label(axiom_54) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	18 (all X all Y (X != Y <-> m_NormQ(X) != m_NormQ(Y))) # label(axiom_27) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	19 (all X all Y all Z m_Ack(X,Y) != m_NotNorm(Z)) # label(axiom_13) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	20 (all X all Y m_Down(X) != m_Halt(Y)) # label(axiom_17) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	21 (all X all Y m_NormQ(X) != m_NotNorm(Y)) # label(axiom_25) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	22 (all X1 all X2 all Y1 all Y2 (X1 != X2 -> m_Ack(X1,Y1) != m_Ack(X2,Y2))) # label(axiom_31) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	23 (all X (ordered(snoc(q_nil,X)) & ordered(cons(X,q_nil)))) # label(axiom_52) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	24 (all X all Q tail(cons(X,Q)) = Q) # label(axiom_36) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	25 (all X all Y (leq(X,Y) | leq(Y,X))) # label(axiom_60) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	26 (all P leq(s(zero),host(P))) # label(axiom_02) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	27 (all X1 all X2 all Y1 all Y2 (Y1 != Y2 -> m_Ack(X2,Y2) != m_Ack(X1,Y1))) # label(axiom_32) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	28 (all Y all Q Y = last(snoc(Q,Y))) # label(axiom_37) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	29 (all X -setIn(X,setEmpty)) # label(axiom_65) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	30 (all X all Q X = head(cons(X,Q))) # label(axiom_35) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	31 (all X all Y m_Down(X) != m_Ldr(Y)) # label(axiom_18) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	32 (all X all Y (leq(Y,X) & leq(X,Y) <-> Y = X)) # label(axiom_61) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	33 (all Q (q_nil = Q | Q = cons(head(Q),tail(Q)))) # label(axiom_39) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	34 (all Q (snoc(init(Q),last(Q)) = Q | q_nil = Q)) # label(axiom_40) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	35 (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.06/0.47	36 (all X all Y (Y != X <-> m_Ldr(Y) != m_Ldr(X))) # label(axiom_29) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	37 (all Q all X (ordered(Q) -> ordered(snoc(Q,m_Ldr(X))))) # label(axiom_56) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	38 (all X leq(X,X)) # label(axiom_59) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	39 (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].
0.06/0.47	40 (all X all Y all Z m_Ack(X,Y) != m_Down(Z)) # label(axiom_12) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	41 (all P leq(host(P),nbr_proc)) # label(axiom_04) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	42 (all P all Q (host(Q) = s(host(P)) -> host(Q) != host(P))) # label(axiom_01) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	43 (all Y all Q init(snoc(Q,Y)) = Q) # label(axiom_38) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	44 (all X all Y (X != Y <-> m_Down(X) != m_Down(Y))) # label(axiom_30) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	45 (all X all Y all Q (elem(X,cons(Y,Q)) <-> elem(X,Q) | X = Y)) # label(axiom_46) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	46 (all X all Y (m_Halt(X) != m_Halt(Y) <-> X != Y)) # label(axiom_26) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	47 (all X -elem(X,q_nil)) # label(axiom_45) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	48 (all Pid all Pid2 (host(Pid2) != host(Pid) -> Pid2 != Pid)) # label(axiom_33) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	49 (all X X = pidMsg(m_Down(X))) # label(axiom_50) # label(axiom) # label(non_clause).  [assumption].
0.06/0.47	50 (all X all Y m_NotNorm(Y) != m_Ldr(X)) # label(axiom_24) # label(axiom) # label(non_clause).  [assumption].
0.42/0.68	51 (all X all Y (m_NotNorm(Y) != m_NotNorm(X) <-> Y != X)) # label(axiom_28) # label(axiom) # label(non_clause).  [assumption].
0.42/0.68	52 (all X all Y m_Ldr(X) != m_NormQ(Y)) # label(axiom_23) # label(axiom) # label(non_clause).  [assumption].
0.42/0.68	53 (all X snoc(q_nil,X) = cons(X,q_nil)) # label(axiom_43) # label(axiom) # label(non_clause).  [assumption].
0.42/0.68	54 (all X all Y m_NormQ(Y) != m_Down(X)) # label(axiom_20) # label(axiom) # label(non_clause).  [assumption].
0.42/0.68	55 (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.42/0.68	56 (all X all Y (leq(s(X),s(Y)) <-> leq(X,Y))) # label(axiom_63) # label(axiom) # label(non_clause).  [assumption].
0.42/0.68	57 (all Y all Q q_nil != snoc(Q,Y)) # label(axiom_42) # label(axiom) # label(non_clause).  [assumption].
0.42/0.68	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 Pid20 all Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid20))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (-setIn(Z,alive) & host(Pid0) = host(Z) & leq(Pid0,Z) -> -setIn(Pid0,alive))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) != host(Z) & setIn(Z,alive) & setIn(Pid20,alive) & host(Pid0) = host(Pid20) & host(Z) = host(Pid30) -> -(elem(m_Down(Pid30),queue(host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & cons(m_Down(Y),V) = queue(host(X)) & (all Z all Pid0 (host(Z) = host(Pid0) & Z != Pid0 -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (all Z all Pid0 (elem(m_Halt(Pid0),queue(host(Z))) -> -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)) -> (-(index(ldr,host(X)) = host(Y) & norm = index(status,host(X)) | host(index(elid,host(X))) = host(Y) & index(status,host(X)) = wait) -> (-((all Z (-leq(host(X),Z) & leq(s(zero),Z) -> Z = host(Y) | setIn(Z,index(down,host(X))))) & elec_1 = index(status,host(X))) -> (all Z (host(X) != host(Z) -> (all W0 all X0 (host(X) = host(X0) -> (all Y0 (host(X0) != host(Z) & setIn(Z,alive) & host(Z) = host(W0) & host(X0) = host(Y0) & setIn(X0,alive) -> -(elem(m_Down(W0),V) & elem(m_Down(Y0),queue(host(Z)))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.42/0.68	
0.42/0.68	============================== end of process non-clausal formulas ===
0.42/0.68	
0.42/0.68	============================== PROCESS INITIAL CLAUSES ===============
0.42/0.68	
0.42/0.68	============================== PREDICATE ELIMINATION =================
0.42/0.68	
0.42/0.68	============================== end predicate elimination =============
0.42/0.68	
0.42/0.68	Auto_denials:  (non-Horn, no changes).
0.42/0.68	
0.42/0.68	Term ordering decisions:
0.42/0.68	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.42/0.68	
0.42/0.68	============================== end of process initial clauses ========
0.42/0.68	
0.42/0.68	============================== CLAUSES FOR SEARCH ====================
0.42/0.68	
0.42/0.68	============================== end of clauses for search =============
0.42/0.68	
0.42/0.68	============================== SEARCH ================================
0.42/0.68	
0.42/0.68	% Starting search at 0.01 seconds.
0.42/0.68	
0.42/0.68	============================== PROOF =================================
0.42/0.68	% SZS status Theorem
0.42/0.68	% SZS output start Refutation
0.42/0.68	
0.42/0.68	% Proof 1 at 0.21 (+ 0.01) seconds.
0.42/0.68	% Length of proof is 21.
0.42/0.68	% Level of proof is 5.
0.42/0.68	% Maximum clause weight is 33.000.
0.42/0.68	% Given clauses 416.
0.42/0.68	
0.42/0.68	45 (all X all Y all Q (elem(X,cons(Y,Q)) <-> elem(X,Q) | X = Y)) # label(axiom_46) # label(axiom) # label(non_clause).  [assumption].
0.42/0.68	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 Pid20 all Pid0 (elem(m_Ack(Pid0,Z),queue(host(Pid20))) -> -leq(host(Z),host(Pid0)))) & (all Z all Pid0 (-setIn(Z,alive) & host(Pid0) = host(Z) & leq(Pid0,Z) -> -setIn(Pid0,alive))) & (all Z all Pid30 all Pid20 all Pid0 (host(Pid20) != host(Z) & setIn(Z,alive) & setIn(Pid20,alive) & host(Pid0) = host(Pid20) & host(Z) = host(Pid30) -> -(elem(m_Down(Pid30),queue(host(Pid20))) & elem(m_Down(Pid0),queue(host(Z)))))) & cons(m_Down(Y),V) = queue(host(X)) & (all Z all Pid0 (host(Z) = host(Pid0) & Z != Pid0 -> -setIn(Z,alive) | -setIn(Pid0,alive))) & (all Z all Pid0 (elem(m_Halt(Pid0),queue(host(Z))) -> -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)) -> (-(index(ldr,host(X)) = host(Y) & norm = index(status,host(X)) | host(index(elid,host(X))) = host(Y) & index(status,host(X)) = wait) -> (-((all Z (-leq(host(X),Z) & leq(s(zero),Z) -> Z = host(Y) | setIn(Z,index(down,host(X))))) & elec_1 = index(status,host(X))) -> (all Z (host(X) != host(Z) -> (all W0 all X0 (host(X) = host(X0) -> (all Y0 (host(X0) != host(Z) & setIn(Z,alive) & host(Z) = host(W0) & host(X0) = host(Y0) & setIn(X0,alive) -> -(elem(m_Down(W0),V) & elem(m_Down(Y0),queue(host(Z)))))))))))))))) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
0.42/0.69	139 elem(A,cons(B,C)) | -elem(A,C) # label(axiom_46) # label(axiom).  [clausify(45)].
0.42/0.69	163 host(A) = host(B) | -setIn(B,alive) | -setIn(A,alive) | host(A) != host(C) | host(D) != host(B) | -elem(m_Down(D),queue(host(A))) | -elem(m_Down(C),queue(host(B))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.42/0.69	164 queue(host(c3)) = cons(m_Down(c4),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.42/0.69	165 cons(m_Down(c4),c1) = queue(host(c3)).  [copy(164),flip(a)].
0.42/0.69	169 setIn(c3,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.42/0.69	177 host(c6) != host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.42/0.69	178 host(c8) = host(c3) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.42/0.69	180 setIn(c6,alive) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.42/0.69	181 host(c7) = host(c6) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.42/0.69	182 host(c9) = host(c8) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.42/0.69	183 host(c9) = host(c3).  [copy(182),rewrite([178(4)])].
0.42/0.69	185 elem(m_Down(c7),c1) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.42/0.69	186 elem(m_Down(c9),queue(host(c6))) # label(conj) # label(negated_conjecture).  [clausify(58)].
0.42/0.69	275 host(c3) = host(A) | -setIn(A,alive) | host(c3) != host(B) | host(C) != host(A) | -elem(m_Down(C),queue(host(c3))) | -elem(m_Down(B),queue(host(A))).  [resolve(169,a,163,c)].
0.42/0.69	299 elem(m_Down(c7),cons(A,c1)).  [resolve(185,a,139,b)].
0.42/0.69	406 elem(m_Down(c7),queue(host(c3))).  [para(165(a,1),299(a,2))].
0.42/0.69	1924 host(c3) != host(A) | host(c6) != host(B) | -elem(m_Down(B),queue(host(c3))) | -elem(m_Down(A),queue(host(c6))).  [resolve(275,b,180,a),flip(a),flip(c),unit_del(a,177)].
0.42/0.69	1925 host(c3) != host(A) | -elem(m_Down(A),queue(host(c6))).  [resolve(1924,c,406,a),rewrite([181(8)]),xx(b)].
0.42/0.69	1927 $F.  [resolve(1925,b,186,a),rewrite([183(4)]),xx(a)].
0.42/0.69	
0.42/0.69	% SZS output end Refutation
0.42/0.69	============================== end of proof ==========================
0.42/0.69	
0.42/0.69	============================== STATISTICS ============================
0.42/0.69	
0.42/0.69	Given=416. Generated=6872. Kept=1860. proofs=1.
0.42/0.69	Usable=405. Sos=1397. Demods=28. Limbo=0, Disabled=180. Hints=0.
0.42/0.69	Megabytes=3.60.
0.42/0.69	User_CPU=0.21, System_CPU=0.01, Wall_clock=0.
0.42/0.69	
0.42/0.69	============================== end of statistics =====================
0.42/0.69	
0.42/0.69	============================== end of search =========================
0.42/0.69	
0.42/0.69	THEOREM PROVED
0.42/0.69	% SZS status Theorem
0.42/0.69	
0.42/0.69	Exiting with 1 proof.
0.42/0.69	
0.42/0.69	Process 38152 exit (max_proofs) Sat Jul 14 05:36:10 2018
0.42/0.69	Prover9 interrupted
0.42/0.69	EOF