0.07/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.14	% Command    : tptp2X_and_run_prover9 %d %s
0.13/0.35	% Computer   : n005.cluster.edu
0.13/0.35	% Model      : x86_64 x86_64
0.13/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.35	% Memory     : 8042.1875MB
0.13/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.35	% CPULimit   : 180
0.13/0.35	% DateTime   : Thu Aug 29 09:10:49 EDT 2019
0.13/0.35	% CPUTime    : 
0.49/1.08	============================== Prover9 ===============================
0.49/1.08	Prover9 (32) version 2009-11A, November 2009.
0.49/1.08	Process 25774 was started by sandbox2 on n005.cluster.edu,
0.49/1.08	Thu Aug 29 09:10:49 2019
0.49/1.08	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 180 -f /tmp/Prover9_25620_n005.cluster.edu".
0.49/1.08	============================== end of head ===========================
0.49/1.08	
0.49/1.08	============================== INPUT =================================
0.49/1.08	
0.49/1.08	% Reading from file /tmp/Prover9_25620_n005.cluster.edu
0.49/1.08	
0.49/1.08	set(prolog_style_variables).
0.49/1.08	set(auto2).
0.49/1.08	    % set(auto2) -> set(auto).
0.49/1.08	    % set(auto) -> set(auto_inference).
0.49/1.08	    % set(auto) -> set(auto_setup).
0.49/1.08	    % set(auto_setup) -> set(predicate_elim).
0.49/1.08	    % set(auto_setup) -> assign(eq_defs, unfold).
0.49/1.08	    % set(auto) -> set(auto_limits).
0.49/1.08	    % set(auto_limits) -> assign(max_weight, "100.000").
0.49/1.08	    % set(auto_limits) -> assign(sos_limit, 20000).
0.49/1.08	    % set(auto) -> set(auto_denials).
0.49/1.08	    % set(auto) -> set(auto_process).
0.49/1.08	    % set(auto2) -> assign(new_constants, 1).
0.49/1.08	    % set(auto2) -> assign(fold_denial_max, 3).
0.49/1.08	    % set(auto2) -> assign(max_weight, "200.000").
0.49/1.08	    % set(auto2) -> assign(max_hours, 1).
0.49/1.08	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.49/1.08	    % set(auto2) -> assign(max_seconds, 0).
0.49/1.08	    % set(auto2) -> assign(max_minutes, 5).
0.49/1.08	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.49/1.08	    % set(auto2) -> set(sort_initial_sos).
0.49/1.08	    % set(auto2) -> assign(sos_limit, -1).
0.49/1.08	    % set(auto2) -> assign(lrs_ticks, 3000).
0.49/1.08	    % set(auto2) -> assign(max_megs, 400).
0.49/1.08	    % set(auto2) -> assign(stats, some).
0.49/1.08	    % set(auto2) -> clear(echo_input).
0.49/1.08	    % set(auto2) -> set(quiet).
0.49/1.08	    % set(auto2) -> clear(print_initial_clauses).
0.49/1.08	    % set(auto2) -> clear(print_given).
0.49/1.08	assign(lrs_ticks,-1).
0.49/1.08	assign(sos_limit,10000).
0.49/1.08	assign(order,kbo).
0.49/1.08	set(lex_order_vars).
0.49/1.08	clear(print_given).
0.49/1.08	
0.49/1.08	% formulas(sos).  % not echoed (33 formulas)
0.49/1.08	
0.49/1.08	============================== end of input ==========================
0.49/1.08	
0.49/1.08	% From the command line: assign(max_seconds, 180).
0.49/1.08	
0.49/1.08	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.49/1.08	
0.49/1.08	% Formulas that are not ordinary clauses:
0.49/1.08	1 (all Ax all C ((exists I2 model(I2,C)) & -(exists I1 model(I1,Ax)) <-> status(Ax,C,sca))) # label(sca) # label(axiom) # label(non_clause).  [assumption].
0.49/1.08	2 (all Ax all C ((all I1 (model(I1,C) & model(I1,Ax))) <-> status(Ax,C,tau))) # label(tau) # label(axiom) # label(non_clause).  [assumption].
0.49/1.08	3 (all Ax all C (status(Ax,C,wth) <-> (exists I1 model(I1,Ax)) & (exists I4 -model(I4,C)) & (exists I3 (model(I3,C) & -model(I3,Ax))) & (all I2 (model(I2,Ax) -> model(I2,C))))) # label(wth) # label(axiom) # label(non_clause).  [assumption].
0.49/1.08	4 (all Ax all C (status(Ax,C,wec) <-> (exists I1 model(I1,Ax)) & (all I2 (model(I2,Ax) -> model(I2,C))) & (exists I3 (model(I3,C) & -model(I3,Ax))))) # label(wec) # label(axiom) # label(non_clause).  [assumption].
0.49/1.08	5 (all Ax all C ((all I2 model(I2,not(C))) & (all I1 model(I1,Ax)) <-> status(Ax,C,uns))) # label(uns) # label(axiom) # label(non_clause).  [assumption].
0.49/1.08	6 (all Ax all C (status(Ax,C,tca) <-> -(exists I1 model(I1,Ax)) & (all I2 model(I2,C)))) # label(tca) # label(axiom) # label(non_clause).  [assumption].
0.49/1.08	7 (all Ax all C (status(Ax,C,wca) <-> (exists I3 -model(I3,C)) & (exists I2 model(I2,C)) & -(exists I1 model(I1,Ax)))) # label(wca) # label(axiom) # label(non_clause).  [assumption].
0.49/1.08	8 (all Ax all C ((all I2 model(I2,C)) & (exists I1 model(I1,Ax)) <-> status(Ax,C,tac))) # label(tac) # label(axiom) # label(non_clause).  [assumption].
0.49/1.08	9 (all Ax all C ((exists I2 -model(I2,Ax)) & (all I3 (model(I3,Ax) <-> model(I3,C))) & (exists I1 model(I1,Ax)) <-> status(Ax,C,eth))) # label(eth) # label(axiom) # label(non_clause).  [assumption].
0.49/1.08	10 (all Ax all C (status(Ax,C,wtc) <-> (exists I1 model(I1,Ax)) & (exists I2 -model(I2,Ax)) & (all I3 model(I3,C)))) # label(wtc) # label(axiom) # label(non_clause).  [assumption].
0.49/1.08	11 (all Ax all C ((-(exists I1 model(I1,Ax)) -> -(exists I2 model(I2,C))) <-> status(Ax,C,unp))) # label(unp) # label(axiom) # label(non_clause).  [assumption].
0.49/1.08	12 (all Ax all C ((all I1 (model(I1,Ax) -> model(I1,C))) <-> status(Ax,C,thm))) # label(thm) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	13 (all Ax all C (-(exists I1 model(I1,Ax)) <-> status(Ax,C,cax))) # label(cax) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	14 (all Ax all C (((exists I1 model(I1,Ax)) <-> (exists I2 model(I2,C))) <-> status(Ax,C,esa))) # label(esa) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	15 (all Ax all C (status(Ax,C,noc) <-> (exists I2 (model(I2,not(C)) & model(I2,Ax))) & (exists I1 (model(I1,C) & model(I1,Ax))))) # label(noc) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	16 (all Ax all C ((exists I1 (model(I1,not(C)) & model(I1,Ax))) <-> status(Ax,C,csa))) # label(csa) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	17 (all Ax all C ((exists I1 (model(I1,C) & model(I1,Ax))) <-> status(Ax,C,sat))) # label(sat) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	18 (all Ax all C (status(Ax,C,sap) <-> ((exists I1 model(I1,Ax)) -> (exists I2 model(I2,C))))) # label(sap) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	19 (all Ax all C (status(Ax,C,eqv) <-> (exists I1 model(I1,Ax)) & (all I2 (model(I2,Ax) <-> model(I2,C))))) # label(eqv) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	20 (exists Ax exists C ((exists I1 (model(I1,C) & model(I1,Ax))) & (exists I2 (-model(I2,Ax) | -model(I2,C))))) # label(sat_non_taut_pair) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	21 (all S1 all S2 (nevera(S1,S2) <-> (all Ax all C (status(Ax,C,S1) -> -status(Ax,C,S2))))) # label(nevera) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	22 (all S1 all S2 (xora(S1,S2) <-> (all Ax all C -(status(Ax,C,S1) <-> status(Ax,C,S2))))) # label(xora) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	23 (all I all F (model(I,F) <-> -model(I,not(F)))) # label(not) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	24 (exists F all I model(I,F)) # label(tautology) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	25 (exists I1 exists Ax exists C (model(I1,Ax) & (exists I2 model(I2,C)) & -model(I1,C))) # label(non_thm_spt) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	26 (exists F ((exists I2 -model(I2,F)) & (exists I1 model(I1,F)))) # label(satisfiable) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	27 (exists Ax exists C ((exists I4 -model(I4,C)) & (exists I3 (model(I3,C) & -model(I3,Ax))) & (all I2 (model(I2,Ax) -> model(I2,C))) & (exists I1 model(I1,Ax)))) # label(mixed_pair) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	28 (all S1 all S2 ((exists Ax exists C (status(Ax,C,S1) & status(Ax,C,S2))) <-> mighta(S1,S2))) # label(mighta) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	29 (all I all F -(model(I,F) <-> model(I,not(F)))) # label(completeness) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	30 (all S1 all S2 ((exists Ax exists C (-status(Ax,C,S2) & status(Ax,C,S1))) <-> nota(S1,S2))) # label(nota) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	31 (all S1 all S2 ((all Ax all C (status(Ax,C,S1) -> status(Ax,C,S2))) <-> isa(S1,S2))) # label(isa) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	32 (exists F all I -model(I,F)) # label(contradiction) # label(axiom) # label(non_clause).  [assumption].
0.83/1.09	
0.83/1.09	============================== end of process non-clausal formulas ===
0.83/1.09	
0.83/1.09	============================== PROCESS INITIAL CLAUSES ===============
0.83/1.09	
0.83/1.09	============================== PREDICATE ELIMINATION =================
0.83/1.09	33 nevera(A,B) | status(f42(A,B),f43(A,B),A) # label(nevera) # label(axiom).  [clausify(21)].
0.83/1.09	34 -nevera(A,B) | -status(C,D,A) | -status(C,D,B) # label(nevera) # label(axiom).  [clausify(21)].
0.83/1.09	Derived: status(f42(A,B),f43(A,B),A) | -status(C,D,A) | -status(C,D,B).  [resolve(33,a,34,a)].
0.83/1.09	35 nevera(A,B) | status(f42(A,B),f43(A,B),B) # label(nevera) # label(axiom).  [clausify(21)].
0.83/1.09	Derived: status(f42(A,B),f43(A,B),B) | -status(C,D,A) | -status(C,D,B).  [resolve(35,a,34,a)].
0.83/1.09	36 xora(A,B) | -status(f44(A,B),f45(A,B),A) | status(f44(A,B),f45(A,B),B) # label(xora) # label(axiom).  [clausify(22)].
0.83/1.09	37 -xora(A,B) | status(C,D,A) | status(C,D,B) # label(xora) # label(axiom).  [clausify(22)].
13.94/14.21	38 -xora(A,B) | -status(C,D,A) | -status(C,D,B) # label(xora) # label(axiom).  [clausify(22)].
13.94/14.21	Derived: -status(f44(A,B),f45(A,B),A) | status(f44(A,B),f45(A,B),B) | status(C,D,A) | status(C,D,B).  [resolve(36,a,37,a)].
13.94/14.21	Derived: -status(f44(A,B),f45(A,B),A) | status(f44(A,B),f45(A,B),B) | -status(C,D,A) | -status(C,D,B).  [resolve(36,a,38,a)].
13.94/14.21	39 xora(A,B) | status(f44(A,B),f45(A,B),A) | -status(f44(A,B),f45(A,B),B) # label(xora) # label(axiom).  [clausify(22)].
13.94/14.21	Derived: status(f44(A,B),f45(A,B),A) | -status(f44(A,B),f45(A,B),B) | status(C,D,A) | status(C,D,B).  [resolve(39,a,37,a)].
13.94/14.21	Derived: status(f44(A,B),f45(A,B),A) | -status(f44(A,B),f45(A,B),B) | -status(C,D,A) | -status(C,D,B).  [resolve(39,a,38,a)].
13.94/14.21	40 status(f46(A,B),f47(A,B),A) | -mighta(A,B) # label(mighta) # label(axiom).  [clausify(28)].
13.94/14.21	41 -status(A,B,C) | -status(A,B,D) | mighta(C,D) # label(mighta) # label(axiom).  [clausify(28)].
13.94/14.21	Derived: status(f46(A,B),f47(A,B),A) | -status(C,D,A) | -status(C,D,B).  [resolve(40,b,41,c)].
13.94/14.21	42 status(f46(A,B),f47(A,B),B) | -mighta(A,B) # label(mighta) # label(axiom).  [clausify(28)].
13.94/14.21	Derived: status(f46(A,B),f47(A,B),B) | -status(C,D,A) | -status(C,D,B).  [resolve(42,b,41,c)].
13.94/14.21	43 -status(f48(A,B),f49(A,B),B) | -nota(A,B) # label(nota) # label(axiom).  [clausify(30)].
13.94/14.21	44 status(A,B,C) | -status(A,B,D) | nota(D,C) # label(nota) # label(axiom).  [clausify(30)].
13.94/14.21	Derived: -status(f48(A,B),f49(A,B),B) | status(C,D,B) | -status(C,D,A).  [resolve(43,b,44,c)].
13.94/14.21	45 status(f48(A,B),f49(A,B),A) | -nota(A,B) # label(nota) # label(axiom).  [clausify(30)].
13.94/14.21	Derived: status(f48(A,B),f49(A,B),A) | status(C,D,B) | -status(C,D,A).  [resolve(45,b,44,c)].
13.94/14.21	46 -nota(uns,thm) # label(nota_uns_thm) # label(negated_conjecture).  [assumption].
13.94/14.21	Derived: status(A,B,thm) | -status(A,B,uns).  [resolve(46,a,44,c)].
13.94/14.21	47 -status(A,B,C) | status(A,B,D) | -isa(C,D) # label(isa) # label(axiom).  [clausify(31)].
13.94/14.21	48 status(f50(A,B),f51(A,B),A) | isa(A,B) # label(isa) # label(axiom).  [clausify(31)].
13.94/14.21	49 -status(f50(A,B),f51(A,B),B) | isa(A,B) # label(isa) # label(axiom).  [clausify(31)].
13.94/14.21	Derived: -status(A,B,C) | status(A,B,D) | status(f50(C,D),f51(C,D),C).  [resolve(47,c,48,b)].
13.94/14.21	Derived: -status(A,B,C) | status(A,B,D) | -status(f50(C,D),f51(C,D),D).  [resolve(47,c,49,b)].
13.94/14.21	
13.94/14.21	============================== end predicate elimination =============
13.94/14.21	
13.94/14.21	Auto_denials:  (non-Horn, no changes).
13.94/14.21	
13.94/14.21	Term ordering decisions:
13.94/14.21	
13.94/14.21	% Assigning unary symbol not kb_weight 0 and highest precedence (91).
13.94/14.21	Function symbol KB weights:  eqv=1. eth=1. noc=1. wec=1. wth=1. esa=1. thm=1. uns=1. csa=1. sap=1. sat=1. tac=1. tau=1. unp=1. wtc=1. sca=1. tca=1. wca=1. cax=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. c11=1. c12=1. c13=1. c14=1. c15=1. c16=1. c17=1. c18=1. f1=1. f2=1. f3=1. f4=1. f5=1. f6=1. f7=1. f8=1. f9=1. f10=1. f11=1. f12=1. f13=1. f14=1. f15=1. f16=1. f17=1. f18=1. f19=1. f20=1. f21=1. f22=1. f23=1. f24=1. f25=1. f26=1. f27=1. f28=1. f29=1. f30=1. f31=1. f32=1. f33=1. f34=1. f35=1. f36=1. f37=1. f38=1. f39=1. f40=1. f41=1. f42=1. f43=1. f44=1. f45=1. f46=1. f47=1. f48=1. f49=1. f50=1. f51=1. not=0.
13.94/14.21	
13.94/14.21	============================== end of process initial clauses ========
13.94/14.21	
13.94/14.21	============================== CLAUSES FOR SEARCH ====================
13.94/14.21	
13.94/14.21	============================== end of clauses for search =============
13.94/14.21	
13.94/14.21	============================== SEARCH ================================
13.94/14.21	
13.94/14.21	% Starting search at 0.04 seconds.
13.94/14.21	
13.94/14.21	Low Water (keep): wt=24.000, iters=3340
13.94/14.21	
13.94/14.21	Low Water (keep): wt=20.000, iters=3347
13.94/14.21	
13.94/14.21	Low Water (keep): wt=18.000, iters=3334
13.94/14.21	
13.94/14.21	Low Water (keep): wt=17.000, iters=3343
13.94/14.21	
13.94/14.21	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 50 (0.00 of 0.89 sec).
13.94/14.21	
13.94/14.21	Low Water (keep): wt=16.000, iters=3335
13.94/14.21	
13.94/14.21	Low Water (keep): wt=15.000, iters=3336
13.94/14.21	
13.94/14.21	Low Water (keep): wt=14.000, iters=3339
13.94/14.21	
13.94/14.21	Low Water (keep): wt=13.000, iters=3445
13.94/14.21	
13.94/14.21	Low Water (displace): id=11041, wt=10.000
13.94/14.21	
13.94/14.21	Low Water (displace): id=11063, wt=9.000
13.94/14.21	
13.94/14.21	Low Water (displace): id=12712, wt=8.000
13.94/14.21	
13.94/14.21	Low Water (keep): wt=12.000, iters=3333
13.94/14.21	
13.94/14.21	Low Water (keep): wt=10.000, iters=3866
13.94/14.21	
13.94/14.21	Low Water (keep): wt=9.000, iters=5087
20.04/20.34	
20.04/20.34	============================== PROOF =================================
20.04/20.34	% SZS status Theorem
20.04/20.34	% SZS output start Refutation
20.04/20.34	
20.04/20.34	% Proof 1 at 17.39 (+ 1.88) seconds.
20.04/20.34	% Length of proof is 25.
20.04/20.34	% Level of proof is 8.
20.04/20.34	% Maximum clause weight is 15.000.
20.04/20.34	% Given clauses 27779.
20.04/20.34	
20.04/20.34	2 (all Ax all C ((all I1 (model(I1,C) & model(I1,Ax))) <-> status(Ax,C,tau))) # label(tau) # label(axiom) # label(non_clause).  [assumption].
20.04/20.34	5 (all Ax all C ((all I2 model(I2,not(C))) & (all I1 model(I1,Ax)) <-> status(Ax,C,uns))) # label(uns) # label(axiom) # label(non_clause).  [assumption].
20.04/20.34	12 (all Ax all C ((all I1 (model(I1,Ax) -> model(I1,C))) <-> status(Ax,C,thm))) # label(thm) # label(axiom) # label(non_clause).  [assumption].
20.04/20.34	23 (all I all F (model(I,F) <-> -model(I,not(F)))) # label(not) # label(axiom) # label(non_clause).  [assumption].
20.04/20.34	24 (exists F all I model(I,F)) # label(tautology) # label(axiom) # label(non_clause).  [assumption].
20.04/20.34	30 (all S1 all S2 ((exists Ax exists C (-status(Ax,C,S2) & status(Ax,C,S1))) <-> nota(S1,S2))) # label(nota) # label(axiom) # label(non_clause).  [assumption].
20.04/20.34	32 (exists F all I -model(I,F)) # label(contradiction) # label(axiom) # label(non_clause).  [assumption].
20.04/20.34	44 status(A,B,C) | -status(A,B,D) | nota(D,C) # label(nota) # label(axiom).  [clausify(30)].
20.04/20.34	46 -nota(uns,thm) # label(nota_uns_thm) # label(negated_conjecture).  [assumption].
20.04/20.34	53 -model(f3(A,B),B) | -model(f3(A,B),A) | status(A,B,tau) # label(tau) # label(axiom).  [clausify(2)].
20.04/20.34	55 model(A,B) | -status(B,C,tau) # label(tau) # label(axiom).  [clausify(2)].
20.04/20.34	69 -model(f11(A,B),not(B)) | -model(f12(A,B),A) | status(A,B,uns) # label(uns) # label(axiom).  [clausify(5)].
20.04/20.34	97 -model(A,B) | model(A,C) | -status(B,C,thm) # label(thm) # label(axiom).  [clausify(12)].
20.04/20.34	127 model(A,B) | model(A,not(B)) # label(not) # label(axiom).  [clausify(23)].
20.04/20.34	128 model(A,c5) # label(tautology) # label(axiom).  [clausify(24)].
20.04/20.34	139 -model(A,c18) # label(contradiction) # label(axiom).  [clausify(32)].
20.04/20.34	150 status(A,B,thm) | -status(A,B,uns).  [resolve(46,a,44,c)].
20.04/20.34	153 -model(f3(A,A),A) | status(A,A,tau).  [factor(53,a,b)].
20.04/20.34	310 -model(f11(c5,A),not(A)) | status(c5,A,uns).  [resolve(128,a,69,b)].
20.04/20.34	585 status(not(A),not(A),tau) | model(f3(not(A),not(A)),A).  [resolve(153,a,127,b)].
20.04/20.34	14501 model(f3(not(A),not(A)),A) | model(B,not(A)).  [resolve(585,a,55,b)].
20.04/20.34	45201 model(A,not(c18)).  [resolve(14501,a,139,a)].
20.04/20.34	45269 status(c5,c18,uns).  [resolve(45201,a,310,a)].
20.04/20.34	45304 status(c5,c18,thm).  [resolve(45269,a,150,b)].
20.04/20.34	45305 $F.  [resolve(45304,a,97,c),unit_del(a,128),unit_del(b,139)].
20.04/20.34	
20.04/20.34	% SZS output end Refutation
20.04/20.34	============================== end of proof ==========================
20.04/20.34	
20.04/20.34	============================== STATISTICS ============================
20.04/20.34	
20.04/20.34	Given=27779. Generated=4058664. Kept=45255. proofs=1.
20.04/20.34	Usable=27779. Sos=8635. Demods=0. Limbo=0, Disabled=8963. Hints=0.
20.04/20.34	Megabytes=29.80.
20.04/20.34	User_CPU=17.39, System_CPU=1.88, Wall_clock=20.
20.04/20.34	
20.04/20.34	============================== end of statistics =====================
20.04/20.34	
20.04/20.34	============================== end of search =========================
20.04/20.34	
20.04/20.34	THEOREM PROVED
20.04/20.34	% SZS status Theorem
20.04/20.34	
20.04/20.34	Exiting with 1 proof.
20.04/20.34	
20.04/20.34	Process 25774 exit (max_proofs) Thu Aug 29 09:11:09 2019
20.04/20.34	Prover9 interrupted
20.04/20.34	EOF