0.00/0.09	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.09	% Command  : tptp2X_and_run_prover9 %d %s
0.08/0.28	% Computer : n018.cluster.edu
0.08/0.28	% Model    : x86_64 x86_64
0.08/0.28	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.08/0.28	% Memory   : 8042.1875MB
0.08/0.28	% OS       : Linux 3.10.0-693.el7.x86_64
0.08/0.28	% CPULimit : 1440
0.08/0.28	% WCLimit  : 180
0.08/0.28	% DateTime : Mon Jul  3 04:03:45 EDT 2023
0.08/0.28	% CPUTime  : 
0.61/0.92	============================== Prover9 ===============================
0.61/0.92	Prover9 (32) version 2009-11A, November 2009.
0.61/0.92	Process 8121 was started by sandbox on n018.cluster.edu,
0.61/0.92	Mon Jul  3 04:03:46 2023
0.61/0.92	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_7966_n018.cluster.edu".
0.61/0.92	============================== end of head ===========================
0.61/0.92	
0.61/0.92	============================== INPUT =================================
0.61/0.92	
0.61/0.92	% Reading from file /tmp/Prover9_7966_n018.cluster.edu
0.61/0.92	
0.61/0.92	set(prolog_style_variables).
0.61/0.92	set(auto2).
0.61/0.92	    % set(auto2) -> set(auto).
0.61/0.92	    % set(auto) -> set(auto_inference).
0.61/0.92	    % set(auto) -> set(auto_setup).
0.61/0.92	    % set(auto_setup) -> set(predicate_elim).
0.61/0.92	    % set(auto_setup) -> assign(eq_defs, unfold).
0.61/0.92	    % set(auto) -> set(auto_limits).
0.61/0.92	    % set(auto_limits) -> assign(max_weight, "100.000").
0.61/0.92	    % set(auto_limits) -> assign(sos_limit, 20000).
0.61/0.92	    % set(auto) -> set(auto_denials).
0.61/0.92	    % set(auto) -> set(auto_process).
0.61/0.92	    % set(auto2) -> assign(new_constants, 1).
0.61/0.92	    % set(auto2) -> assign(fold_denial_max, 3).
0.61/0.92	    % set(auto2) -> assign(max_weight, "200.000").
0.61/0.92	    % set(auto2) -> assign(max_hours, 1).
0.61/0.92	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.61/0.92	    % set(auto2) -> assign(max_seconds, 0).
0.61/0.92	    % set(auto2) -> assign(max_minutes, 5).
0.61/0.92	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.61/0.92	    % set(auto2) -> set(sort_initial_sos).
0.61/0.92	    % set(auto2) -> assign(sos_limit, -1).
0.61/0.92	    % set(auto2) -> assign(lrs_ticks, 3000).
0.61/0.92	    % set(auto2) -> assign(max_megs, 400).
0.61/0.92	    % set(auto2) -> assign(stats, some).
0.61/0.92	    % set(auto2) -> clear(echo_input).
0.61/0.92	    % set(auto2) -> set(quiet).
0.61/0.92	    % set(auto2) -> clear(print_initial_clauses).
0.61/0.92	    % set(auto2) -> clear(print_given).
0.61/0.92	assign(lrs_ticks,-1).
0.61/0.92	assign(sos_limit,10000).
0.61/0.92	assign(order,kbo).
0.61/0.92	set(lex_order_vars).
0.61/0.92	clear(print_given).
0.61/0.92	
0.61/0.92	% formulas(sos).  % not echoed (94 formulas)
0.61/0.92	
0.61/0.92	============================== end of input ==========================
0.61/0.92	
0.61/0.92	% From the command line: assign(max_seconds, 1440).
0.61/0.92	
0.61/0.92	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.61/0.92	
0.61/0.92	% Formulas that are not ordinary clauses:
0.61/0.92	1 (all A all N ((all I all J (leq(n0,I) & leq(n0,J) & leq(J,N) & leq(I,N) -> a_select3(A,I,J) = a_select3(A,J,I))) -> (all I all J (leq(I,N) & leq(n0,J) & leq(J,N) & leq(n0,I) -> a_select3(inv(A),I,J) = a_select3(inv(A),J,I))))) # label(matrix_symm_inv) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	2 (all X plus(n5,X) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_l) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	3 (all X succ(succ(succ(X))) = plus(n3,X)) # label(succ_plus_3_l) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	4 (all I all J all U all V all X all VAL ((all I0 all J0 (leq(J0,V) & leq(I0,U) & leq(n0,J0) & leq(n0,I0) -> a_select3(X,I0,J0) = VAL)) & leq(n0,I) & leq(I,U) & leq(J,V) & leq(n0,J) -> a_select3(tptp_update3(X,U,V,VAL),I,J) = VAL)) # label(sel3_update_3) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	5 (all X all U all V all VAL a_select3(tptp_update3(X,U,V,VAL),U,V) = VAL) # label(sel3_update_1) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	6 (all X all Y (leq(minus(X,Y),X) -> leq(n0,Y))) # label(leq_minus) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	7 (all X succ(succ(succ(succ(X)))) = plus(X,n4)) # label(succ_plus_4_r) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	8 (all X all Y (gt(Y,X) <-> lt(X,Y))) # label(lt_gt) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	9 (all X pred(succ(X)) = X) # label(pred_succ) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	10 (all X all C (leq(n0,X) -> leq(n0,uniform_int_rnd(C,X)))) # label(uniform_int_rand_ranges_lo) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	11 (all X succ(succ(X)) = plus(n2,X)) # label(succ_plus_2_l) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	12 (all Body sum(n0,tptp_minus_1,Body) = n0) # label(sum_plus_base) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	13 (all I all J all U all V all X all VAL all VAL2 (U != I & a_select3(X,U,V) = VAL & J = V -> VAL = a_select3(tptp_update3(X,I,J,VAL2),U,V))) # label(sel3_update_2) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	14 (all A all B all N ((all I all J (leq(n0,J) & leq(J,N) & leq(I,N) & leq(n0,I) -> a_select3(B,I,J) = a_select3(B,J,I))) & (all I all J (leq(J,N) & leq(n0,J) & leq(I,N) & leq(n0,I) -> a_select3(A,I,J) = a_select3(A,J,I))) -> (all I all J (leq(I,N) & leq(n0,J) & leq(J,N) & leq(n0,I) -> a_select3(tptp_msub(A,B),J,I) = a_select3(tptp_msub(A,B),I,J))))) # label(matrix_symm_sub) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	15 (all A all B all N all M ((all I all J (leq(J,M) & leq(n0,J) & leq(I,M) & leq(n0,I) -> a_select3(B,I,J) = a_select3(B,J,I))) -> (all I all J (leq(n0,I) & leq(I,N) & leq(J,N) & leq(n0,J) -> a_select3(tptp_mmul(A,tptp_mmul(B,trans(A))),I,J) = a_select3(tptp_mmul(A,tptp_mmul(B,trans(A))),J,I))))) # label(matrix_symm_aba2) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	16 (all A all N ((all I all J (leq(n0,J) & leq(J,N) & leq(I,N) & leq(n0,I) -> a_select3(A,J,I) = a_select3(A,I,J))) -> (all I all J all K all VAL (leq(n0,I) & leq(n0,K) & leq(K,N) & leq(J,N) & leq(n0,J) & leq(I,N) -> a_select3(tptp_update3(A,K,K,VAL),I,J) = a_select3(tptp_update3(A,K,K,VAL),J,I))))) # label(matrix_symm_update_diagonal) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	17 (all I all L1 all U1 all J all L2 all U2 all Val (leq(L1,I) & leq(J,U2) & leq(L2,J) & leq(I,U1) -> a_select3(tptp_const_array2(dim(L1,U1),dim(L2,U2),Val),I,J) = Val)) # label(const_array2_select) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	18 (all X succ(X) = plus(X,n1)) # label(succ_plus_1_r) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	19 (all X leq(X,X)) # label(reflexivity_leq) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	20 (all I all L all U all Val (leq(L,I) & leq(I,U) -> a_select2(tptp_const_array1(dim(L,U),Val),I) = Val)) # label(const_array1_select) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	21 (all X all Y (gt(succ(Y),X) <-> leq(X,Y))) # label(leq_succ_gt_equiv) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	22 (all X all Y (geq(X,Y) <-> leq(Y,X))) # label(leq_geq) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	23 (all X all Y (gt(Y,X) <-> leq(X,pred(Y)))) # label(leq_gt_pred) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	24 (all X all Y (gt(Y,X) | Y = X | gt(X,Y))) # label(totality) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	25 (all A all B all N ((all I all J (leq(n0,I) & leq(J,N) & leq(n0,J) & leq(I,N) -> a_select3(B,I,J) = a_select3(B,J,I))) & (all I all J (leq(n0,I) & leq(I,N) & leq(J,N) & leq(n0,J) -> a_select3(A,J,I) = a_select3(A,I,J))) -> (all I all J (leq(J,N) & leq(n0,J) & leq(I,N) & leq(n0,I) -> a_select3(tptp_madd(A,B),I,J) = a_select3(tptp_madd(A,B),J,I))))) # label(matrix_symm_add) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	26 (all A all B all N ((all I all J (leq(n0,I) & leq(I,N) & leq(J,N) & leq(n0,J) -> a_select3(B,I,J) = a_select3(B,J,I))) -> (all I all J (leq(I,N) & leq(n0,J) & leq(J,N) & leq(n0,I) -> a_select3(tptp_mmul(A,tptp_mmul(B,trans(A))),I,J) = a_select3(tptp_mmul(A,tptp_mmul(B,trans(A))),J,I))))) # label(matrix_symm_aba1) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	27 (all X all Y (gt(Y,X) -> leq(X,Y))) # label(leq_gt1) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	28 (all I all U all X all VAL all VAL2 (I != U & VAL = a_select2(X,U) -> a_select2(tptp_update2(X,I,VAL2),U) = VAL)) # label(sel2_update_2) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	29 (all X pred(X) = minus(X,n1)) # label(pred_minus_1) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	30 (all X plus(n4,X) = succ(succ(succ(succ(X))))) # label(succ_plus_4_l) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	31 (all X all Y all Z (gt(Y,Z) & gt(X,Y) -> gt(X,Z))) # label(transitivity_gt) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	32 (all X all C (leq(n0,X) -> leq(uniform_int_rnd(C,X),X))) # label(uniform_int_rand_ranges_hi) # label(axiom) # label(non_clause).  [assumption].
0.61/0.92	33 (all X succ(succ(succ(X))) = plus(X,n3)) # label(succ_plus_3_r) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	34 (all X succ(X) = plus(n1,X)) # label(succ_plus_1_l) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	35 (all X all Y (leq(X,Y) -> leq(X,succ(Y)))) # label(leq_succ) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	36 (all X gt(succ(X),X)) # label(gt_succ) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	37 (all I all U all X all VAL (leq(n0,I) & leq(I,U) & (all I0 (leq(n0,I0) & leq(I0,U) -> a_select2(X,I0) = VAL)) -> a_select2(tptp_update2(X,U,VAL),I) = VAL)) # label(sel2_update_3) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	38 (all X X = succ(pred(X))) # label(succ_pred) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	39 (all X all Y (leq(succ(X),Y) -> gt(Y,X))) # label(leq_succ_gt) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	40 (all A all B all C all D all E all F all N all M ((all I all J (leq(n0,I) & leq(J,N) & leq(n0,J) & leq(I,N) -> a_select3(A,I,J) = a_select3(A,J,I))) & (all I all J (leq(n0,I) & leq(I,N) & leq(n0,J) & leq(J,N) -> a_select3(F,I,J) = a_select3(F,J,I))) & (all I all J (leq(I,M) & leq(n0,J) & leq(J,M) & leq(n0,I) -> a_select3(D,J,I) = a_select3(D,I,J))) -> (all I all J (leq(I,N) & leq(n0,J) & leq(J,N) & leq(n0,I) -> a_select3(tptp_madd(A,tptp_mmul(B,tptp_mmul(tptp_madd(tptp_mmul(C,tptp_mmul(D,trans(C))),tptp_mmul(E,tptp_mmul(F,trans(E)))),trans(B)))),J,I) = a_select3(tptp_madd(A,tptp_mmul(B,tptp_mmul(tptp_madd(tptp_mmul(C,tptp_mmul(D,trans(C))),tptp_mmul(E,tptp_mmul(F,trans(E)))),trans(B)))),I,J))))) # label(matrix_symm_joseph_update) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	41 (all X all U all VAL VAL = a_select2(tptp_update2(X,U,VAL),U)) # label(sel2_update_1) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	42 (all Body sum(n0,tptp_minus_1,Body) = tptp_float_0_0) # label(sum_plus_base_float) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	43 (all X all Y (leq(succ(X),succ(Y)) <-> leq(X,Y))) # label(leq_succ_succ) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	44 (all X all Y (X != Y & leq(X,Y) -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	45 (all X -gt(X,X)) # label(irreflexivity_gt) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	46 (all X all Y all Z (leq(X,Y) & leq(Y,Z) -> leq(X,Z))) # label(transitivity_leq) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	47 (all X plus(X,n2) = succ(succ(X))) # label(succ_plus_2_r) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	48 (all X plus(X,n5) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_r) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	49 (all A all N ((all I all J (leq(n0,I) & leq(J,N) & leq(n0,J) & leq(I,N) -> a_select3(A,I,J) = a_select3(A,J,I))) -> (all I all J (leq(I,N) & leq(J,N) & leq(n0,J) & leq(n0,I) -> a_select3(trans(A),J,I) = a_select3(trans(A),I,J))))) # label(matrix_symm_trans) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	50 (all X (leq(n0,X) & leq(X,n1) -> n1 = X | n0 = X)) # label(finite_domain_1) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	51 (all X (leq(n0,X) & leq(X,n5) -> X = n0 | n1 = X | X = n3 | X = n4 | n5 = X | n2 = X)) # label(finite_domain_5) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	52 (all X (leq(X,n4) & leq(n0,X) -> n1 = X | n4 = X | n3 = X | n2 = X | X = n0)) # label(finite_domain_4) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	53 (all X (leq(n0,X) & leq(X,n0) -> X = n0)) # label(finite_domain_0) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	54 (all X (leq(X,n6) & leq(n0,X) -> X = n1 | n6 = X | n5 = X | n4 = X | X = n3 | X = n2 | X = n0)) # label(finite_domain_6) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	55 (all X (leq(n0,X) & leq(X,n2) -> X = n1 | n2 = X | X = n0)) # label(finite_domain_2) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	56 (all X (leq(X,n3) & leq(n0,X) -> n0 = X | X = n1 | X = n3 | X = n2)) # label(finite_domain_3) # label(axiom) # label(non_clause).  [assumption].
0.61/0.93	57 -((all A all B (leq(n0,A) & leq(n0,B) & leq(B,minus(n6,n1)) & leq(A,minus(n6,n1)) -> a_select3(q_ds1_filter,B,A) = a_select3(q_ds1_filter,A,B))) & (all E all F (leq(n0,E) & leq(n0,F) & leq(E,minus(n6,n1)) & leq(F,minus(n6,n1)) -> a_select3(pminus_ds1_filter,F,E) = a_select3(pminus_ds1_filter,E,F))) & (all C all D (leq(C,minus(n3,n1)) & leq(D,minus(n3,n1)) & leq(n0,D) & leq(n0,C) -> a_select3(r_ds1_filter,D,C) = a_select3(r_ds1_filter,C,D))) -> (all K all L (leq(n0,L) & leq(K,minus(n6,n1)) & leq(L,minus(n6,n1)) & leq(n0,K) -> a_select3(pminus_ds1_filter,K,L) = a_select3(pminus_ds1_filter,L,K))) & (all I all J (leq(n0,I) & leq(n0,J) & leq(I,minus(n3,n1)) & leq(J,minus(n3,n1)) -> a_select3(r_ds1_filter,I,J) = a_select3(r_ds1_filter,J,I))) & (all G all H (leq(n0,G) & leq(n0,H) & leq(G,minus(n6,n1)) & leq(H,minus(n6,n1)) -> a_select3(q_ds1_filter,G,H) = a_select3(q_ds1_filter,H,G)))) # label(quaternion_ds1_symm_0015) # label(negated_conjecture) # label(non_clause).  [assumption].
9.50/9.84	
9.50/9.84	============================== end of process non-clausal formulas ===
9.50/9.84	
9.50/9.84	============================== PROCESS INITIAL CLAUSES ===============
9.50/9.84	
9.50/9.84	============================== PREDICATE ELIMINATION =================
9.50/9.84	58 gt(A,B) | -lt(B,A) # label(lt_gt) # label(axiom).  [clausify(8)].
9.50/9.84	59 -gt(A,B) | lt(B,A) # label(lt_gt) # label(axiom).  [clausify(8)].
9.50/9.84	60 geq(A,B) | -leq(B,A) # label(leq_geq) # label(axiom).  [clausify(22)].
9.50/9.84	61 -geq(A,B) | leq(B,A) # label(leq_geq) # label(axiom).  [clausify(22)].
9.50/9.84	
9.50/9.84	============================== end predicate elimination =============
9.50/9.84	
9.50/9.84	Auto_denials:  (non-Horn, no changes).
9.50/9.84	
9.50/9.84	Term ordering decisions:
9.50/9.84	Function symbol KB weights:  n0=1. n1=1. n6=1. n3=1. pminus_ds1_filter=1. q_ds1_filter=1. r_ds1_filter=1. n2=1. n4=1. n5=1. tptp_minus_1=1. tptp_float_0_0=1. def=1. use=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. tptp_mmul=1. tptp_madd=1. minus=1. tptp_msub=1. plus=1. a_select2=1. dim=1. uniform_int_rnd=1. tptp_const_array1=1. f1=1. f2=1. f11=1. f12=1. f26=1. f27=1. trans=1. succ=1. inv=1. pred=1. a_select3=1. tptp_update2=1. sum=1. tptp_const_array2=1. f5=1. f6=1. f7=1. f8=1. f13=1. f14=1. f15=1. f16=1. f17=1. f18=1. tptp_update3=1. f9=1. f10=1. f19=1. f3=1. f4=1. f20=1. f21=1. f22=1. f23=1. f24=1. f25=1.
9.50/9.84	
9.50/9.84	============================== end of process initial clauses ========
9.50/9.84	
9.50/9.84	============================== CLAUSES FOR SEARCH ====================
9.50/9.84	
9.50/9.84	============================== end of clauses for search =============
9.50/9.84	
9.50/9.84	============================== SEARCH ================================
9.50/9.84	
9.50/9.84	% Starting search at 0.22 seconds.
9.50/9.84	
9.50/9.84	Low Water (keep): wt=198.000, iters=3369
9.50/9.84	
9.50/9.84	Low Water (keep): wt=165.000, iters=3348
9.50/9.84	
9.50/9.84	Low Water (keep): wt=155.000, iters=3509
9.50/9.84	
9.50/9.84	Low Water (keep): wt=152.000, iters=3476
9.50/9.84	
9.50/9.84	Low Water (keep): wt=125.000, iters=3703
9.50/9.84	
9.50/9.84	Low Water (keep): wt=122.000, iters=3539
9.50/9.84	
9.50/9.84	Low Water (keep): wt=95.000, iters=3667
9.50/9.84	
9.50/9.84	Low Water (keep): wt=92.000, iters=3366
9.50/9.84	
9.50/9.84	Low Water (keep): wt=61.000, iters=3551
9.50/9.84	
9.50/9.84	Low Water (keep): wt=53.000, iters=3390
9.50/9.84	
9.50/9.84	Low Water (keep): wt=49.000, iters=3343
9.50/9.84	
9.50/9.84	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 99 (0.00 of 3.31 sec).
9.50/9.84	
9.50/9.84	Low Water (keep): wt=46.000, iters=3341
9.50/9.84	
9.50/9.84	Low Water (displace): id=5686, wt=198.000
9.50/9.84	
9.50/9.84	Low Water (displace): id=4338, wt=185.000
9.50/9.84	
9.50/9.84	Low Water (displace): id=4339, wt=182.000
9.50/9.84	
9.50/9.84	Low Water (displace): id=4781, wt=179.000
9.50/9.84	
9.50/9.84	Low Water (displace): id=5761, wt=166.000
9.50/9.84	
9.50/9.84	Low Water (displace): id=5786, wt=165.000
9.50/9.84	
9.50/9.84	Low Water (displace): id=4538, wt=155.000
9.50/9.84	
9.50/9.84	Low Water (displace): id=11320, wt=34.000
9.50/9.84	
9.50/9.84	Low Water (keep): wt=40.000, iters=3373
9.50/9.84	
9.50/9.84	Low Water (displace): id=11429, wt=31.000
9.50/9.84	
9.50/9.84	Low Water (keep): wt=37.000, iters=3360
9.50/9.84	
9.50/9.84	Low Water (displace): id=12560, wt=28.000
9.50/9.84	
9.50/9.84	Low Water (displace): id=12666, wt=25.000
9.50/9.84	
9.50/9.84	Low Water (displace): id=12795, wt=22.000
9.50/9.84	
9.50/9.84	Low Water (keep): wt=34.000, iters=3356
9.50/9.84	
9.50/9.84	Low Water (keep): wt=31.000, iters=3346
9.50/9.84	
9.50/9.84	Low Water (displace): id=14852, wt=19.000
9.50/9.84	
9.50/9.84	Low Water (displace): id=15374, wt=16.000
9.50/9.84	
9.50/9.84	Low Water (displace): id=15549, wt=15.000
9.50/9.84	
9.50/9.84	Low Water (displace): id=15550, wt=12.000
9.50/9.84	
9.50/9.84	Low Water (displace): id=15554, wt=9.000
9.50/9.84	
9.50/9.84	Low Water (displace): id=15564, wt=6.000
9.50/9.84	
9.50/9.84	Low Water (keep): wt=30.000, iters=3388
9.50/9.84	
9.50/9.84	Low Water (keep): wt=28.000, iters=3366
9.50/9.84	
9.50/9.84	Low Water (keep): wt=27.000, iters=3342
9.50/9.84	
9.50/9.84	Low Water (keep): wt=25.000, iters=3337
9.50/9.84	
9.50/9.84	Low Water (keep): wt=24.000, iterAlarm clock 
179.60/180.08	Prover9 interrupted
179.60/180.08	EOF