0.04/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.13/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer   : n005.cluster.edu
0.13/0.34	% Model      : x86_64 x86_64
0.13/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory     : 8042.1875MB
0.13/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 1200
0.13/0.34	% DateTime   : Tue Jul 13 16:56:48 EDT 2021
0.13/0.34	% CPUTime    : 
0.77/1.05	============================== Prover9 ===============================
0.77/1.05	Prover9 (32) version 2009-11A, November 2009.
0.77/1.05	Process 29370 was started by sandbox2 on n005.cluster.edu,
0.77/1.05	Tue Jul 13 16:56:49 2021
0.77/1.05	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_29034_n005.cluster.edu".
0.77/1.05	============================== end of head ===========================
0.77/1.05	
0.77/1.05	============================== INPUT =================================
0.77/1.05	
0.77/1.05	% Reading from file /tmp/Prover9_29034_n005.cluster.edu
0.77/1.05	
0.77/1.05	set(prolog_style_variables).
0.77/1.05	set(auto2).
0.77/1.05	    % set(auto2) -> set(auto).
0.77/1.05	    % set(auto) -> set(auto_inference).
0.77/1.05	    % set(auto) -> set(auto_setup).
0.77/1.05	    % set(auto_setup) -> set(predicate_elim).
0.77/1.05	    % set(auto_setup) -> assign(eq_defs, unfold).
0.77/1.05	    % set(auto) -> set(auto_limits).
0.77/1.05	    % set(auto_limits) -> assign(max_weight, "100.000").
0.77/1.05	    % set(auto_limits) -> assign(sos_limit, 20000).
0.77/1.05	    % set(auto) -> set(auto_denials).
0.77/1.05	    % set(auto) -> set(auto_process).
0.77/1.05	    % set(auto2) -> assign(new_constants, 1).
0.77/1.06	    % set(auto2) -> assign(fold_denial_max, 3).
0.77/1.06	    % set(auto2) -> assign(max_weight, "200.000").
0.77/1.06	    % set(auto2) -> assign(max_hours, 1).
0.77/1.06	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.77/1.06	    % set(auto2) -> assign(max_seconds, 0).
0.77/1.06	    % set(auto2) -> assign(max_minutes, 5).
0.77/1.06	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.77/1.06	    % set(auto2) -> set(sort_initial_sos).
0.77/1.06	    % set(auto2) -> assign(sos_limit, -1).
0.77/1.06	    % set(auto2) -> assign(lrs_ticks, 3000).
0.77/1.06	    % set(auto2) -> assign(max_megs, 400).
0.77/1.06	    % set(auto2) -> assign(stats, some).
0.77/1.06	    % set(auto2) -> clear(echo_input).
0.77/1.06	    % set(auto2) -> set(quiet).
0.77/1.06	    % set(auto2) -> clear(print_initial_clauses).
0.77/1.06	    % set(auto2) -> clear(print_given).
0.77/1.06	assign(lrs_ticks,-1).
0.77/1.06	assign(sos_limit,10000).
0.77/1.06	assign(order,kbo).
0.77/1.06	set(lex_order_vars).
0.77/1.06	clear(print_given).
0.77/1.06	
0.77/1.06	% formulas(sos).  % not echoed (28 formulas)
0.77/1.06	
0.77/1.06	============================== end of input ==========================
0.77/1.06	
0.77/1.06	% From the command line: assign(max_seconds, 1200).
0.77/1.06	
0.77/1.06	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.77/1.06	
0.77/1.06	% Formulas that are not ordinary clauses:
0.77/1.06	1 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (ilf_type(C,member_type(power_set(B))) <-> ilf_type(C,subset_type(B))))))) # label(p12) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	2 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (subset(B,C) <-> (all D (ilf_type(D,set_type) -> (member(D,B) -> member(D,C))))))))) # label(p6) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	3 (all B (ilf_type(B,binary_relation_type) -> (all C (ilf_type(C,binary_relation_type) -> (C = B -> C = B))))) # label(p14) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	4 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,relation_type(B,C)) -> (all E (ilf_type(E,set_type) -> ilf_type(restrict4(B,C,D,E),relation_type(B,C)))))))))) # label(p26) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	5 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> ilf_type(cross_product(B,C),set_type))))) # label(p7) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	6 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,subset_type(cross_product(B,C))) -> relation_like(D))))))) # label(p22) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	7 (all B (ilf_type(B,binary_relation_type) -> (all C (ilf_type(C,set_type) -> ilf_type(restrict(B,C),binary_relation_type))))) # label(p9) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	8 (all B (ilf_type(B,set_type) -> (relation_like(B) <-> (all C (ilf_type(C,set_type) -> (member(C,B) -> (exists D (ilf_type(D,set_type) & (exists E (C = ordered_pair(D,E) & ilf_type(E,set_type))))))))))) # label(p21) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	9 (all B (ilf_type(B,set_type) -> (exists C ilf_type(C,subset_type(B))))) # label(p13) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	10 (all B (empty(B) & ilf_type(B,set_type) -> relation_like(B))) # label(p24) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	11 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> ((all D (ilf_type(D,set_type) -> (member(D,B) -> member(D,C)))) <-> member(B,power_set(C))))))) # label(p17) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	12 (all B (ilf_type(B,set_type) -> ((all C (ilf_type(C,set_type) -> -member(C,B))) <-> empty(B)))) # label(p23) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	13 (all B (ilf_type(B,set_type) -> subset(B,B))) # label(p16) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	14 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> ilf_type(ordered_pair(B,C),set_type))))) # label(p8) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	15 (exists B ilf_type(B,binary_relation_type)) # label(p11) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	16 (all B (ilf_type(B,binary_relation_type) -> B = B)) # label(p15) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	17 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (exists D ilf_type(D,relation_type(C,B))))))) # label(p5) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	18 (all B (ilf_type(B,binary_relation_type) -> (all C (ilf_type(C,binary_relation_type) -> (B = C <-> (all D (ilf_type(D,set_type) -> (all E (ilf_type(E,set_type) -> (member(ordered_pair(D,E),B) <-> member(ordered_pair(D,E),C))))))))))) # label(p1) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	19 (all B (ilf_type(B,set_type) -> (ilf_type(B,binary_relation_type) <-> relation_like(B) & ilf_type(B,set_type)))) # label(p10) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	20 (all B (ilf_type(B,set_type) -> -empty(power_set(B)) & ilf_type(power_set(B),set_type))) # label(p18) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	21 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,subset_type(cross_product(B,C))) -> ilf_type(D,relation_type(B,C)))) & (all E (ilf_type(E,relation_type(B,C)) -> ilf_type(E,subset_type(cross_product(B,C))))))))) # label(p4) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	22 (all B (ilf_type(B,set_type) -> (all C (-empty(C) & ilf_type(C,set_type) -> (member(B,C) <-> ilf_type(B,member_type(C))))))) # label(p19) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	23 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,set_type) -> (all E (ilf_type(E,set_type) -> (all F (ilf_type(F,relation_type(B,C)) -> (member(ordered_pair(D,E),F) -> member(E,C) & member(D,B)))))))))))) # label(p3) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	24 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,relation_type(B,C)) -> (all E (ilf_type(E,set_type) -> restrict(D,E) = restrict4(B,C,D,E))))))))) # label(p25) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	25 (all B ilf_type(B,set_type)) # label(p27) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	26 (all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,set_type) -> (all E (ilf_type(E,binary_relation_type) -> (member(C,B) & member(ordered_pair(C,D),E) <-> member(ordered_pair(C,D),restrict(E,B))))))))))) # label(p2) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	27 (all B (ilf_type(B,set_type) & -empty(B) -> (exists C ilf_type(C,member_type(B))))) # label(p20) # label(axiom) # label(non_clause).  [assumption].
0.77/1.06	28 -(all B (ilf_type(B,set_type) -> (all C (ilf_type(C,set_type) -> (all D (ilf_type(D,set_type) -> (all E (ilf_type(E,relation_type(C,B)) -> (subset(C,D) -> E = restrict4(C,B,E,D)))))))))) # label(prove_relset_1_34) # label(negated_conjecture) # label(non_clause).  [assumption].
0.77/1.06	
0.77/1.06	============================== end of process non-clausal formulas ===
0.77/1.06	
0.77/1.06	============================== PROCESS INITIAL CLAUSES ===============
0.77/1.06	
0.77/1.06	============================== PREDICATE ELIMINATION =================
0.77/1.06	29 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -subset(A,B) | -ilf_type(C,set_type) | -member(C,A) | member(C,B) # label(p6) # label(axiom).  [clausify(2)].
0.77/1.06	30 subset(c3,c4) # label(prove_relset_1_34) # label(negated_conjecture).  [clausify(28)].
0.77/1.06	31 -ilf_type(A,set_type) | subset(A,A) # label(p16) # label(axiom).  [clausify(13)].
0.77/1.06	32 -ilf_type(A,set_type) | -ilf_type(B,set_type) | subset(A,B) | ilf_type(f1(A,B),set_type) # label(p6) # label(axiom).  [clausify(2)].
0.77/1.06	33 -ilf_type(A,set_type) | -ilf_type(B,set_type) | subset(A,B) | member(f1(A,B),A) # label(p6) # label(axiom).  [clausify(2)].
0.77/1.06	34 -ilf_type(A,set_type) | -ilf_type(B,set_type) | subset(A,B) | -member(f1(A,B),B) # label(p6) # label(axiom).  [clausify(2)].
0.77/1.06	Derived: -ilf_type(c3,set_type) | -ilf_type(c4,set_type) | -ilf_type(A,set_type) | -member(A,c3) | member(A,c4).  [resolve(29,c,30,a)].
0.77/1.06	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,set_type) | -member(C,A) | member(C,B) | -ilf_type(A,set_type) | -ilf_type(B,set_type) | ilf_type(f1(A,B),set_type).  [resolve(29,c,32,c)].
0.77/1.06	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,set_type) | -member(C,A) | member(C,B) | -ilf_type(A,set_type) | -ilf_type(B,set_type) | member(f1(A,B),A).  [resolve(29,c,33,c)].
0.77/1.06	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,set_type) | -member(C,A) | member(C,B) | -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(f1(A,B),B).  [resolve(29,c,34,c)].
0.77/1.06	35 -ilf_type(A,set_type) | ilf_type(A,binary_relation_type) | -relation_like(A) # label(p10) # label(axiom).  [clausify(19)].
0.77/1.06	36 -empty(A) | -ilf_type(A,set_type) | relation_like(A) # label(p24) # label(axiom).  [clausify(10)].
0.77/1.06	37 -ilf_type(A,set_type) | -ilf_type(A,binary_relation_type) | relation_like(A) # label(p10) # label(axiom).  [clausify(19)].
0.77/1.06	Derived: -ilf_type(A,set_type) | ilf_type(A,binary_relation_type) | -empty(A) | -ilf_type(A,set_type).  [resolve(35,c,36,c)].
0.77/1.06	38 -ilf_type(A,set_type) | relation_like(A) | ilf_type(f4(A),set_type) # label(p21) # label(axiom).  [clausify(8)].
0.77/1.06	Derived: -ilf_type(A,set_type) | ilf_type(f4(A),set_type) | -ilf_type(A,set_type) | ilf_type(A,binary_relation_type).  [resolve(38,b,35,c)].
0.77/1.06	39 -ilf_type(A,set_type) | relation_like(A) | member(f4(A),A) # label(p21) # label(axiom).  [clausify(8)].
0.77/1.06	Derived: -ilf_type(A,set_type) | member(f4(A),A) | -ilf_type(A,set_type) | ilf_type(A,binary_relation_type).  [resolve(39,b,35,c)].
0.77/1.06	40 -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,subset_type(cross_product(A,B))) | relation_like(C) # label(p22) # label(axiom).  [clausify(6)].
0.77/1.06	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -ilf_type(C,subset_type(cross_product(A,B))) | -ilf_type(C,set_type) | ilf_type(C,binary_relation_type).  [resolve(40,d,35,c)].
0.77/1.06	41 -ilf_type(A,set_type) | -relation_like(A) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f2(A,B),set_type) # label(p21) # label(axiom).  [clausify(8)].
0.77/1.06	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f2(A,B),set_type) | -empty(A) | -ilf_type(A,set_type).  [resolve(41,b,36,c)].
0.77/1.06	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f2(A,B),set_type) | -ilf_type(A,set_type) | -ilf_type(A,binary_relation_type).  [resolve(41,b,37,c)].
0.77/1.06	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f2(A,B),set_type) | -ilf_type(A,set_type) | ilf_type(f4(A),set_type).  [resolve(41,b,38,b)].
0.77/1.06	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f2(A,B),set_type) | -ilf_type(A,set_type) | member(f4(A),A).  [resolve(41,b,39,b)].
0.77/1.06	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f2(A,B),set_type) | -ilf_type(C,set_type) | -ilf_type(D,set_type) | -ilf_type(A,subset_type(cross_product(C,D))).  [resolve(41,b,40,d)].
0.77/1.06	42 -ilf_type(A,set_type) | -relation_like(A) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f3(A,B),set_type) # label(p21) # label(axiom).  [clausify(8)].
0.77/1.06	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f3(A,B),set_type) | -empty(A) | -ilf_type(A,set_type).  [resolve(42,b,36,c)].
0.77/1.06	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f3(A,B),set_type) | -ilf_type(A,set_type) | -ilf_type(A,binary_relation_type).  [resolve(42,b,37,c)].
0.77/1.06	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f3(A,B),set_type) | -ilf_type(A,set_type) | ilf_type(f4(A),set_type).  [resolve(42,b,38,b)].
1.40/1.75	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f3(A,B),set_type) | -ilf_type(A,set_type) | member(f4(A),A).  [resolve(42,b,39,b)].
1.40/1.75	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ilf_type(f3(A,B),set_type) | -ilf_type(C,set_type) | -ilf_type(D,set_type) | -ilf_type(A,subset_type(cross_product(C,D))).  [resolve(42,b,40,d)].
1.40/1.75	43 -ilf_type(A,set_type) | relation_like(A) | -ilf_type(B,set_type) | ordered_pair(B,C) != f4(A) | -ilf_type(C,set_type) # label(p21) # label(axiom).  [clausify(8)].
1.40/1.75	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | ordered_pair(B,C) != f4(A) | -ilf_type(C,set_type) | -ilf_type(A,set_type) | ilf_type(A,binary_relation_type).  [resolve(43,b,35,c)].
1.40/1.75	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | ordered_pair(B,C) != f4(A) | -ilf_type(C,set_type) | -ilf_type(A,set_type) | -ilf_type(D,set_type) | -member(D,A) | ilf_type(f2(A,D),set_type).  [resolve(43,b,41,b)].
1.40/1.75	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | ordered_pair(B,C) != f4(A) | -ilf_type(C,set_type) | -ilf_type(A,set_type) | -ilf_type(D,set_type) | -member(D,A) | ilf_type(f3(A,D),set_type).  [resolve(43,b,42,b)].
1.40/1.75	44 -ilf_type(A,set_type) | -relation_like(A) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f2(A,B),f3(A,B)) = B # label(p21) # label(axiom).  [clausify(8)].
1.40/1.75	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f2(A,B),f3(A,B)) = B | -empty(A) | -ilf_type(A,set_type).  [resolve(44,b,36,c)].
1.40/1.75	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f2(A,B),f3(A,B)) = B | -ilf_type(A,set_type) | -ilf_type(A,binary_relation_type).  [resolve(44,b,37,c)].
1.40/1.75	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f2(A,B),f3(A,B)) = B | -ilf_type(A,set_type) | ilf_type(f4(A),set_type).  [resolve(44,b,38,b)].
1.40/1.75	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f2(A,B),f3(A,B)) = B | -ilf_type(A,set_type) | member(f4(A),A).  [resolve(44,b,39,b)].
1.40/1.75	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f2(A,B),f3(A,B)) = B | -ilf_type(C,set_type) | -ilf_type(D,set_type) | -ilf_type(A,subset_type(cross_product(C,D))).  [resolve(44,b,40,d)].
1.40/1.75	Derived: -ilf_type(A,set_type) | -ilf_type(B,set_type) | -member(B,A) | ordered_pair(f2(A,B),f3(A,B)) = B | -ilf_type(A,set_type) | -ilf_type(C,set_type) | ordered_pair(C,D) != f4(A) | -ilf_type(D,set_type).  [resolve(44,b,43,b)].
1.40/1.75	
1.40/1.75	============================== end predicate elimination =============
1.40/1.75	
1.40/1.75	Auto_denials:  (non-Horn, no changes).
1.40/1.75	
1.40/1.75	Term ordering decisions:
1.40/1.75	Function symbol KB weights:  set_type=1. binary_relation_type=1. c1=1. c2=1. c3=1. c4=1. c5=1. ordered_pair=1. relation_type=1. cross_product=1. restrict=1. f1=1. f2=1. f3=1. f6=1. f8=1. f9=1. f10=1. subset_type=1. power_set=1. member_type=1. f4=1. f5=1. f7=1. f11=1. restrict4=1.
1.40/1.75	
1.40/1.75	============================== end of process initial clauses ========
1.40/1.75	
1.40/1.75	============================== CLAUSES FOR SEARCH ====================
1.40/1.75	
1.40/1.75	============================== end of clauses for search =============
1.40/1.75	
1.40/1.75	============================== SEARCH ================================
1.40/1.75	
1.40/1.75	% Starting search at 0.03 seconds.
1.40/1.75	
1.40/1.75	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 99 (0.00 of 0.53 sec).
1.40/1.75	
1.40/1.75	Low Water (keep): wt=87.000, iters=3373
1.40/1.75	
1.40/1.75	Low Water (keep): wt=81.000, iters=3360
1.40/1.75	
1.40/1.75	Low Water (keep): wt=75.000, iters=3350
1.40/1.75	
1.40/1.75	Low Water (keep): wt=69.000, iters=3361
1.40/1.75	
1.40/1.75	Low Water (keep): wt=57.000, iters=3351
1.40/1.75	
1.40/1.75	Low Water (keep): wt=50.000, iters=3335
1.40/1.75	
1.40/1.75	Low Water (keep): wt=49.000, iters=3353
1.40/1.75	
1.40/1.75	Low Water (keep): wt=43.000, iters=3429
1.40/1.75	
1.40/1.75	Low Water (keep): wt=40.000, iters=3369
1.40/1.75	
1.40/1.75	Low Water (keep): wt=37.000, iters=3401
1.40/1.75	
1.40/1.75	Low Water (keep): wt=35.000, iters=3353
1.40/1.75	
1.40/1.75	Low Water (keep): wt=34.000, iters=3341
1.40/1.75	
1.40/1.75	Low Water (keep): wt=33.000, iters=3335
1.40/1.75	
1.40/1.75	Low Water (keep): wt=31.000, iters=3401
1.40/1.75	
1.40/1.75	Low Water (keep):Alarm clock 
119.61/120.11	Prover9 interrupted
119.61/120.11	EOF