0.12/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer   : n013.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   : 180
0.13/0.34	% DateTime   : Thu Aug 29 13:25:31 EDT 2019
0.13/0.34	% CPUTime    : 
0.81/1.09	============================== Prover9 ===============================
0.81/1.09	Prover9 (32) version 2009-11A, November 2009.
0.81/1.09	Process 8931 was started by sandbox2 on n013.cluster.edu,
0.81/1.09	Thu Aug 29 13:25:32 2019
0.81/1.09	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 180 -f /tmp/Prover9_8778_n013.cluster.edu".
0.81/1.09	============================== end of head ===========================
0.81/1.09	
0.81/1.09	============================== INPUT =================================
0.81/1.09	
0.81/1.09	% Reading from file /tmp/Prover9_8778_n013.cluster.edu
0.81/1.09	
0.81/1.09	set(prolog_style_variables).
0.81/1.09	set(auto2).
0.81/1.09	    % set(auto2) -> set(auto).
0.81/1.09	    % set(auto) -> set(auto_inference).
0.81/1.09	    % set(auto) -> set(auto_setup).
0.81/1.09	    % set(auto_setup) -> set(predicate_elim).
0.81/1.09	    % set(auto_setup) -> assign(eq_defs, unfold).
0.81/1.09	    % set(auto) -> set(auto_limits).
0.81/1.09	    % set(auto_limits) -> assign(max_weight, "100.000").
0.81/1.09	    % set(auto_limits) -> assign(sos_limit, 20000).
0.81/1.09	    % set(auto) -> set(auto_denials).
0.81/1.09	    % set(auto) -> set(auto_process).
0.81/1.09	    % set(auto2) -> assign(new_constants, 1).
0.81/1.09	    % set(auto2) -> assign(fold_denial_max, 3).
0.81/1.09	    % set(auto2) -> assign(max_weight, "200.000").
0.81/1.09	    % set(auto2) -> assign(max_hours, 1).
0.81/1.09	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.81/1.09	    % set(auto2) -> assign(max_seconds, 0).
0.81/1.09	    % set(auto2) -> assign(max_minutes, 5).
0.81/1.09	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.81/1.09	    % set(auto2) -> set(sort_initial_sos).
0.81/1.09	    % set(auto2) -> assign(sos_limit, -1).
0.81/1.09	    % set(auto2) -> assign(lrs_ticks, 3000).
0.81/1.09	    % set(auto2) -> assign(max_megs, 400).
0.81/1.09	    % set(auto2) -> assign(stats, some).
0.81/1.09	    % set(auto2) -> clear(echo_input).
0.81/1.09	    % set(auto2) -> set(quiet).
0.81/1.09	    % set(auto2) -> clear(print_initial_clauses).
0.81/1.09	    % set(auto2) -> clear(print_given).
0.81/1.09	assign(lrs_ticks,-1).
0.81/1.09	assign(sos_limit,10000).
0.81/1.09	assign(order,kbo).
0.81/1.09	set(lex_order_vars).
0.81/1.09	clear(print_given).
0.81/1.09	
0.81/1.09	% formulas(sos).  % not echoed (85 formulas)
0.81/1.09	
0.81/1.09	============================== end of input ==========================
0.81/1.09	
0.81/1.09	% From the command line: assign(max_seconds, 180).
0.81/1.09	
0.81/1.09	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.81/1.09	
0.81/1.09	% Formulas that are not ordinary clauses:
0.81/1.09	1 (all X all Y (leq(minus(X,Y),X) -> leq(n0,Y))) # label(leq_minus) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	2 (all X all Y (gt(succ(Y),X) <-> leq(X,Y))) # label(leq_succ_gt_equiv) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	3 (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.81/1.09	4 (all I all U all X all VAL all VAL2 (VAL = a_select2(X,U) & I != U -> a_select2(tptp_update2(X,I,VAL2),U) = VAL)) # label(sel2_update_2) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	5 (all X succ(X) = plus(n1,X)) # label(succ_plus_1_l) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	6 (all X plus(n4,X) = succ(succ(succ(succ(X))))) # label(succ_plus_4_l) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	7 (all I all L all U all Val (leq(L,I) & leq(I,U) -> Val = a_select2(tptp_const_array1(dim(L,U),Val),I))) # label(const_array1_select) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	8 (all X succ(succ(X)) = plus(n2,X)) # label(succ_plus_2_l) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	9 (all A all N ((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 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),J,I) = a_select3(tptp_update3(A,K,K,VAL),I,J))))) # label(matrix_symm_update_diagonal) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	10 (all X -gt(X,X)) # label(irreflexivity_gt) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	11 (all A all B all C all D all E all F all N all M ((all I all J (leq(n0,I) & leq(I,N) & leq(J,N) & leq(n0,J) -> a_select3(F,J,I) = a_select3(F,I,J))) & (all I all J (leq(I,N) & leq(J,N) & leq(n0,J) & leq(n0,I) -> a_select3(A,J,I) = a_select3(A,I,J))) & (all I all J (leq(n0,I) & leq(n0,J) & leq(J,M) & leq(I,M) -> a_select3(D,I,J) = a_select3(D,J,I))) -> (all I all J (leq(J,N) & leq(n0,J) & leq(I,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)))),I,J) = 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))))) # label(matrix_symm_joseph_update) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	12 (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,J,I) = a_select3(B,I,J))) & (all I all J (leq(n0,I) & leq(I,N) & leq(n0,J) & leq(J,N) -> a_select3(A,I,J) = a_select3(A,J,I))) -> (all I all J (leq(n0,I) & leq(n0,J) & leq(J,N) & leq(I,N) -> 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.81/1.09	13 (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.81/1.09	14 (all Body sum(n0,tptp_minus_1,Body) = tptp_float_0_0) # label(sum_plus_base_float) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	15 (all A all N ((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(n0,I) & leq(n0,J) & leq(J,N) & leq(I,N) -> a_select3(inv(A),J,I) = a_select3(inv(A),I,J))))) # label(matrix_symm_inv) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	16 (all X all Y (leq(Y,X) <-> geq(X,Y))) # label(leq_geq) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	17 (all X all Y (leq(X,Y) -> leq(X,succ(Y)))) # label(leq_succ) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	18 (all X plus(X,n3) = succ(succ(succ(X)))) # label(succ_plus_3_r) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	19 (all A all B all N ((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(I,N) & leq(J,N) & leq(n0,J) & leq(n0,I) -> a_select3(B,J,I) = a_select3(B,I,J))) -> (all I all J (leq(I,N) & leq(J,N) & leq(n0,J) & leq(n0,I) -> a_select3(tptp_msub(A,B),I,J) = a_select3(tptp_msub(A,B),J,I))))) # label(matrix_symm_sub) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	20 (all X X = pred(succ(X))) # label(pred_succ) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	21 (all X all Y (gt(Y,X) <-> lt(X,Y))) # label(lt_gt) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	22 (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.81/1.09	23 (all X plus(X,n1) = succ(X)) # label(succ_plus_1_r) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	24 (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(n0,J) & leq(J,N) & leq(I,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.81/1.09	25 (all X plus(X,n5) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_r) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	26 (all X pred(X) = minus(X,n1)) # label(pred_minus_1) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	27 (all X plus(n5,X) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_l) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	28 (all Body sum(n0,tptp_minus_1,Body) = n0) # label(sum_plus_base) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	29 (all I all L1 all U1 all J all L2 all U2 all Val (leq(L1,I) & leq(I,U1) & leq(J,U2) & leq(L2,J) -> 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.81/1.09	30 (all I all U all X all VAL ((all I0 (leq(n0,I0) & leq(I0,U) -> a_select2(X,I0) = VAL)) & leq(I,U) & leq(n0,I) -> VAL = a_select2(tptp_update2(X,U,VAL),I))) # label(sel2_update_3) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	31 (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.81/1.09	32 (all X succ(succ(X)) = plus(X,n2)) # label(succ_plus_2_r) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	33 (all X succ(succ(succ(X))) = plus(n3,X)) # label(succ_plus_3_l) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	34 (all X all Y (gt(Y,X) -> leq(X,Y))) # label(leq_gt1) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	35 (all X leq(X,X)) # label(reflexivity_leq) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	36 (all I all J all U all V all X all VAL ((all I0 all J0 (leq(n0,I0) & leq(I0,U) & leq(J0,V) & leq(n0,J0) -> a_select3(X,I0,J0) = VAL)) & leq(n0,I) & leq(J,V) & leq(n0,J) & leq(I,U) -> a_select3(tptp_update3(X,U,V,VAL),I,J) = VAL)) # label(sel3_update_3) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	37 (all X all Y (leq(succ(X),succ(Y)) <-> leq(X,Y))) # label(leq_succ_succ) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	38 (all X all Y (leq(X,Y) & X != Y -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	39 (all X succ(pred(X)) = X) # label(succ_pred) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	40 (all X all Y (leq(X,pred(Y)) <-> gt(Y,X))) # label(leq_gt_pred) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	41 (all X all Y (leq(succ(X),Y) -> gt(Y,X))) # label(leq_succ_gt) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	42 (all X plus(X,n4) = succ(succ(succ(succ(X))))) # label(succ_plus_4_r) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	43 (all X all Y all Z (leq(Y,Z) & leq(X,Y) -> leq(X,Z))) # label(transitivity_leq) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	44 (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.81/1.09	45 (all X all Y (gt(X,Y) | X = Y | gt(Y,X))) # label(totality) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	46 (all X gt(succ(X),X)) # label(gt_succ) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	47 (all A all N ((all I all J (leq(I,N) & leq(n0,J) & leq(J,N) & leq(n0,I) -> a_select3(A,I,J) = a_select3(A,J,I))) -> (all I all J (leq(J,N) & leq(n0,J) & leq(I,N) & 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.81/1.09	48 (all I all J all U all V all X all VAL all VAL2 (VAL = a_select3(X,U,V) & V = J & U != I -> VAL = a_select3(tptp_update3(X,I,J,VAL2),U,V))) # label(sel3_update_2) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	49 (all A all B all N all M ((all I all J (leq(n0,I) & leq(I,M) & leq(n0,J) & leq(J,M) -> a_select3(B,I,J) = a_select3(B,J,I))) -> (all I all J (leq(n0,J) & leq(J,N) & leq(I,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_aba2) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	50 (all X (leq(n0,X) & leq(X,n3) -> X = n0 | n3 = X | n2 = X | n1 = X)) # label(finite_domain_3) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	51 (all X (leq(X,n1) & leq(n0,X) -> X = n1 | n0 = X)) # label(finite_domain_1) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	52 (all X (leq(X,n4) & leq(n0,X) -> n3 = X | n4 = X | X = n2 | X = n1 | n0 = X)) # label(finite_domain_4) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	53 (all X (leq(n0,X) & leq(X,n2) -> n0 = X | X = n1 | n2 = X)) # label(finite_domain_2) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	54 (all X (leq(X,n5) & leq(n0,X) -> n0 = X | X = n2 | n5 = X | n4 = X | X = n3 | n1 = X)) # label(finite_domain_5) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	55 (all X (leq(n0,X) & leq(X,n0) -> n0 = X)) # label(finite_domain_0) # label(axiom) # label(non_clause).  [assumption].
0.81/1.09	56 -(true -> a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n0,n0) = use & use = a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n1,n0) & use = a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n2,n0) & a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n3) = use & use = a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n5) & a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n4) = use) # label(quaternion_ds1_inuse_0001) # label(negated_conjecture) # label(non_clause).  [assumption].
15.45/15.81	
15.45/15.81	============================== end of process non-clausal formulas ===
15.45/15.81	
15.45/15.81	============================== PROCESS INITIAL CLAUSES ===============
15.45/15.81	
15.45/15.81	============================== PREDICATE ELIMINATION =================
15.45/15.81	57 leq(A,B) | -geq(B,A) # label(leq_geq) # label(axiom).  [clausify(16)].
15.45/15.81	58 -leq(A,B) | geq(B,A) # label(leq_geq) # label(axiom).  [clausify(16)].
15.45/15.81	59 gt(A,B) | -lt(B,A) # label(lt_gt) # label(axiom).  [clausify(21)].
15.45/15.81	60 -gt(A,B) | lt(B,A) # label(lt_gt) # label(axiom).  [clausify(21)].
15.45/15.81	
15.45/15.81	============================== end predicate elimination =============
15.45/15.81	
15.45/15.81	Auto_denials:  (non-Horn, no changes).
15.45/15.81	
15.45/15.81	Term ordering decisions:
15.45/15.81	Function symbol KB weights:  n0=1. n1=1. n2=1. n3=1. n4=1. n5=1. tptp_minus_1=1. tptp_float_0_0=1. def=1. u_defuse=1. use=1. xinit_defuse=1. tptp_mmul=1. tptp_madd=1. tptp_msub=1. plus=1. a_select2=1. dim=1. minus=1. uniform_int_rnd=1. tptp_const_array1=1. f1=1. f2=1. f13=1. f14=1. f24=1. f25=1. trans=1. succ=1. inv=1. pred=1. a_select3=1. tptp_update2=1. sum=1. tptp_const_array2=1. f9=1. f10=1. f11=1. f12=1. f15=1. f16=1. f17=1. f18=1. f19=1. f20=1. tptp_update3=1. f21=1. f26=1. f27=1. f22=1. f23=1. f3=1. f4=1. f5=1. f6=1. f7=1. f8=1.
15.45/15.81	
15.45/15.81	============================== end of process initial clauses ========
15.45/15.81	
15.45/15.81	============================== CLAUSES FOR SEARCH ====================
15.45/15.81	
15.45/15.81	============================== end of clauses for search =============
15.45/15.81	
15.45/15.81	============================== SEARCH ================================
15.45/15.81	
15.45/15.81	% Starting search at 0.24 seconds.
15.45/15.81	
15.45/15.81	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 269 (0.00 of 0.56 sec).
15.45/15.81	
15.45/15.81	Low Water (keep): wt=173.000, iters=3543
15.45/15.81	
15.45/15.81	Low Water (keep): wt=143.000, iters=3441
15.45/15.81	
15.45/15.81	Low Water (keep): wt=116.000, iters=3489
15.45/15.81	
15.45/15.81	Low Water (keep): wt=89.000, iters=3349
15.45/15.81	
15.45/15.81	Low Water (keep): wt=86.000, iters=3655
15.45/15.81	
15.45/15.81	Low Water (keep): wt=80.000, iters=3400
15.45/15.81	
15.45/15.81	Low Water (keep): wt=58.000, iters=3440
15.45/15.81	
15.45/15.81	Low Water (keep): wt=50.000, iters=3501
15.45/15.81	
15.45/15.81	Low Water (keep): wt=46.000, iters=3335
15.45/15.81	
15.45/15.81	Low Water (keep): wt=44.000, iters=3371
15.45/15.81	
15.45/15.81	Low Water (keep): wt=43.000, iters=3368
15.45/15.81	
15.45/15.81	Low Water (keep): wt=40.000, iters=3405
15.45/15.81	
15.45/15.81	Low Water (keep): wt=38.000, iters=3397
15.45/15.81	
15.45/15.81	Low Water (keep): wt=37.000, iters=3374
15.45/15.81	
15.45/15.81	Low Water (keep): wt=34.000, iters=3366
15.45/15.81	
15.45/15.81	Low Water (displace): id=6575, wt=179.000
15.45/15.81	
15.45/15.81	Low Water (displace): id=6576, wt=176.000
15.45/15.81	
15.45/15.81	Low Water (displace): id=10930, wt=31.000
15.45/15.81	
15.45/15.81	Low Water (displace): id=11004, wt=27.000
15.45/15.81	
15.45/15.81	Low Water (displace): id=11015, wt=24.000
15.45/15.81	
15.45/15.81	Low Water (displace): id=11016, wt=23.000
15.45/15.81	
15.45/15.81	Low Water (displace): id=11031, wt=19.000
15.45/15.81	
15.45/15.81	Low Water (displace): id=12157, wt=18.000
15.45/15.81	
15.45/15.81	Low Water (displace): id=12293, wt=17.000
15.45/15.81	
15.45/15.81	Low Water (keep): wt=33.000, iters=3335
15.45/15.81	
15.45/15.81	Low Water (keep): wt=31.000, iters=3401
15.45/15.81	
15.45/15.81	Low Water (keep): wt=30.000, iters=3380
15.45/15.81	
15.45/15.81	Low Water (keep): wt=29.000, iters=3333
15.45/15.81	
15.45/15.81	Low Water (keep): wt=28.000, iters=3363
15.45/15.81	
15.45/15.81	Low Water (displace): id=16159, wt=16.000
15.45/15.81	
15.45/15.81	Low Water (keep): wt=27.000, iters=3351
15.45/15.81	
15.45/15.81	Low Water (keep): wt=26.000, iters=3368
15.45/15.81	
15.45/15.81	Low Water (keep): wt=25.000, iters=3369
15.45/15.81	
15.45/15.81	Low Water (displace): id=18510, wt=8.000
15.45/15.81	
15.45/15.81	Low Water (displace): id=19218, wt=6.000
15.45/15.81	
15.45/15.81	Low Water (keep): wt=24.000, iters=3352
15.45/15.81	
15.45/15.81	Low Water (keep): wt=23.000, iters=3350
15.45/15.81	
15.45/15.81	Low Water (keep): wt=22.000, iters=3382
15.45/15.81	
15.45/15.81	Low Water (keep): wt=21.000, iters=3353
15.45/15.81	
15.45/15.81	Low Water (keep): wt=20.000, iters=3336
15.45/15.81	
15.45/15.81	Low Water (keep): wt=19.000, iters=3436
15.45/15.81	
15.45/15.81	Low Water (keep): wt=18.000, Cputime limit exceeded (core dumped)
180.02/180.32	EOF