0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.34	% Computer   : n012.cluster.edu
0.12/0.34	% Model      : x86_64 x86_64
0.12/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory     : 8042.1875MB
0.12/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 180
0.12/0.34	% DateTime   : Thu Aug 29 10:13:11 EDT 2019
0.12/0.34	% CPUTime    : 
0.86/1.15	============================== Prover9 ===============================
0.86/1.15	Prover9 (32) version 2009-11A, November 2009.
0.86/1.15	Process 20378 was started by sandbox on n012.cluster.edu,
0.86/1.15	Thu Aug 29 10:13:12 2019
0.86/1.15	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 180 -f /tmp/Prover9_20225_n012.cluster.edu".
0.86/1.15	============================== end of head ===========================
0.86/1.15	
0.86/1.15	============================== INPUT =================================
0.86/1.15	
0.86/1.15	% Reading from file /tmp/Prover9_20225_n012.cluster.edu
0.86/1.15	
0.86/1.15	set(prolog_style_variables).
0.86/1.15	set(auto2).
0.86/1.15	    % set(auto2) -> set(auto).
0.86/1.15	    % set(auto) -> set(auto_inference).
0.86/1.15	    % set(auto) -> set(auto_setup).
0.86/1.15	    % set(auto_setup) -> set(predicate_elim).
0.86/1.15	    % set(auto_setup) -> assign(eq_defs, unfold).
0.86/1.15	    % set(auto) -> set(auto_limits).
0.86/1.15	    % set(auto_limits) -> assign(max_weight, "100.000").
0.86/1.15	    % set(auto_limits) -> assign(sos_limit, 20000).
0.86/1.15	    % set(auto) -> set(auto_denials).
0.86/1.15	    % set(auto) -> set(auto_process).
0.86/1.15	    % set(auto2) -> assign(new_constants, 1).
0.86/1.15	    % set(auto2) -> assign(fold_denial_max, 3).
0.86/1.15	    % set(auto2) -> assign(max_weight, "200.000").
0.86/1.15	    % set(auto2) -> assign(max_hours, 1).
0.86/1.15	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.86/1.15	    % set(auto2) -> assign(max_seconds, 0).
0.86/1.15	    % set(auto2) -> assign(max_minutes, 5).
0.86/1.15	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.86/1.15	    % set(auto2) -> set(sort_initial_sos).
0.86/1.15	    % set(auto2) -> assign(sos_limit, -1).
0.86/1.15	    % set(auto2) -> assign(lrs_ticks, 3000).
0.86/1.15	    % set(auto2) -> assign(max_megs, 400).
0.86/1.15	    % set(auto2) -> assign(stats, some).
0.86/1.15	    % set(auto2) -> clear(echo_input).
0.86/1.15	    % set(auto2) -> set(quiet).
0.86/1.15	    % set(auto2) -> clear(print_initial_clauses).
0.86/1.15	    % set(auto2) -> clear(print_given).
0.86/1.15	assign(lrs_ticks,-1).
0.86/1.15	assign(sos_limit,10000).
0.86/1.15	assign(order,kbo).
0.86/1.15	set(lex_order_vars).
0.86/1.15	clear(print_given).
0.86/1.15	
0.86/1.15	% formulas(sos).  % not echoed (100 formulas)
0.86/1.15	
0.86/1.15	============================== end of input ==========================
0.86/1.15	
0.86/1.15	% From the command line: assign(max_seconds, 180).
0.86/1.15	
0.86/1.15	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.86/1.15	
0.86/1.15	% Formulas that are not ordinary clauses:
0.86/1.15	1 (all X all Y (leq(minus(X,Y),X) -> leq(n0,Y))) # label(leq_minus) # label(axiom) # label(non_clause).  [assumption].
0.86/1.15	2 (all X all Y (gt(succ(Y),X) <-> leq(X,Y))) # label(leq_succ_gt_equiv) # label(axiom) # label(non_clause).  [assumption].
0.86/1.15	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.86/1.15	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.86/1.15	5 (all X succ(X) = plus(n1,X)) # label(succ_plus_1_l) # label(axiom) # label(non_clause).  [assumption].
0.86/1.15	6 (all X plus(n4,X) = succ(succ(succ(succ(X))))) # label(succ_plus_4_l) # label(axiom) # label(non_clause).  [assumption].
0.86/1.15	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.86/1.15	8 (all X succ(succ(X)) = plus(n2,X)) # label(succ_plus_2_l) # label(axiom) # label(non_clause).  [assumption].
0.86/1.15	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.86/1.15	10 (all X -gt(X,X)) # label(irreflexivity_gt) # label(axiom) # label(non_clause).  [assumption].
0.86/1.15	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.86/1.15	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.86/1.15	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.86/1.15	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.86/1.15	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.86/1.15	16 (all X all Y (leq(Y,X) <-> geq(X,Y))) # label(leq_geq) # label(axiom) # label(non_clause).  [assumption].
0.86/1.15	17 (all X all Y (leq(X,Y) -> leq(X,succ(Y)))) # label(leq_succ) # label(axiom) # label(non_clause).  [assumption].
0.86/1.15	18 (all X plus(X,n3) = succ(succ(succ(X)))) # label(succ_plus_3_r) # label(axiom) # label(non_clause).  [assumption].
0.86/1.15	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.86/1.15	20 (all X X = pred(succ(X))) # label(pred_succ) # label(axiom) # label(non_clause).  [assumption].
0.86/1.15	21 (all X all Y (gt(Y,X) <-> lt(X,Y))) # label(lt_gt) # label(axiom) # label(non_clause).  [assumption].
0.86/1.15	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.86/1.15	23 (all X plus(X,n1) = succ(X)) # label(succ_plus_1_r) # label(axiom) # label(non_clause).  [assumption].
0.86/1.15	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.86/1.15	25 (all X plus(X,n5) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_r) # label(axiom) # label(non_clause).  [assumption].
0.86/1.15	26 (all X pred(X) = minus(X,n1)) # label(pred_minus_1) # label(axiom) # label(non_clause).  [assumption].
0.86/1.15	27 (all X plus(n5,X) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_l) # label(axiom) # label(non_clause).  [assumption].
0.86/1.15	28 (all Body sum(n0,tptp_minus_1,Body) = n0) # label(sum_plus_base) # label(axiom) # label(non_clause).  [assumption].
0.86/1.15	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.86/1.15	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.86/1.15	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.86/1.26	32 (all X succ(succ(X)) = plus(X,n2)) # label(succ_plus_2_r) # label(axiom) # label(non_clause).  [assumption].
0.86/1.26	33 (all X succ(succ(succ(X))) = plus(n3,X)) # label(succ_plus_3_l) # label(axiom) # label(non_clause).  [assumption].
0.86/1.26	34 (all X all Y (gt(Y,X) -> leq(X,Y))) # label(leq_gt1) # label(axiom) # label(non_clause).  [assumption].
0.86/1.26	35 (all X leq(X,X)) # label(reflexivity_leq) # label(axiom) # label(non_clause).  [assumption].
0.86/1.26	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.86/1.26	37 (all X all Y (leq(succ(X),succ(Y)) <-> leq(X,Y))) # label(leq_succ_succ) # label(axiom) # label(non_clause).  [assumption].
0.86/1.26	38 (all X all Y (leq(X,Y) & X != Y -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause).  [assumption].
0.86/1.26	39 (all X succ(pred(X)) = X) # label(succ_pred) # label(axiom) # label(non_clause).  [assumption].
0.86/1.26	40 (all X all Y (leq(X,pred(Y)) <-> gt(Y,X))) # label(leq_gt_pred) # label(axiom) # label(non_clause).  [assumption].
0.86/1.26	41 (all X all Y (leq(succ(X),Y) -> gt(Y,X))) # label(leq_succ_gt) # label(axiom) # label(non_clause).  [assumption].
0.86/1.26	42 (all X plus(X,n4) = succ(succ(succ(succ(X))))) # label(succ_plus_4_r) # label(axiom) # label(non_clause).  [assumption].
0.86/1.26	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.86/1.26	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.86/1.26	45 (all X all Y (gt(X,Y) | X = Y | gt(Y,X))) # label(totality) # label(axiom) # label(non_clause).  [assumption].
0.86/1.26	46 (all X gt(succ(X),X)) # label(gt_succ) # label(axiom) # label(non_clause).  [assumption].
0.86/1.26	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.86/1.26	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.86/1.26	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.86/1.26	50 (all X (leq(n0,X) & leq(X,n3) -> X = n0 | X = n1 | n3 = X | n2 = X)) # label(finite_domain_3) # label(axiom) # label(non_clause).  [assumption].
0.86/1.26	51 (all X (leq(n0,X) & leq(X,n0) -> n0 = X)) # label(finite_domain_0) # label(axiom) # label(non_clause).  [assumption].
0.86/1.26	52 (all X (leq(X,n5) & leq(n0,X) -> n2 = X | n4 = X | X = n5 | X = n3 | n1 = X | n0 = X)) # label(finite_domain_5) # label(axiom) # label(non_clause).  [assumption].
0.86/1.26	53 (all X (leq(n0,X) & leq(X,n1) -> n0 = X | n1 = X)) # label(finite_domain_1) # label(axiom) # label(non_clause).  [assumption].
0.86/1.26	54 (all X (leq(n0,X) & leq(X,n2) -> X = n1 | n2 = X | n0 = X)) # label(finite_domain_2) # label(axiom) # label(non_clause).  [assumption].
0.86/1.26	55 (all X (leq(X,n4) & leq(n0,X) -> X = n0 | n2 = X | n3 = X | X = n4 | n1 = X)) # label(finite_domain_4) # label(axiom) # label(non_clause).  [assumption].
0.86/1.26	56 -(init = s_best7_init & s_worst7_init = init & leq(n0,s_best7) & leq(n0,s_sworst7) & leq(n0,pv7) & leq(n0,pv19) & leq(n0,pv20) & leq(s_worst7,n3) & leq(pv19,minus(n410,n1)) & (all E (leq(E,minus(n3,n1)) & leq(n0,E) -> a_select2(s_try7_init,E) = init)) & (gt(loopcounter,n1) -> init = pvar1400_init & pvar1401_init = init & init = pvar1402_init) & (all D (leq(n0,D) & leq(D,n2) -> a_select2(s_center7_init,D) = init)) & (all C (leq(C,n3) & leq(n0,C) -> init = a_select2(s_values7_init,C))) & (all A (leq(A,n2) & leq(n0,A) -> (all B (leq(n0,B) & leq(B,n3) -> a_select3(simplex7_init,B,A) = init)))) & leq(pv20,minus(n330,n1)) & leq(pv7,minus(n410,n1)) & leq(s_sworst7,n3) & leq(s_best7,n3) & leq(n0,s_worst7) & s_sworst7_init = init & init = init -> init = init & leq(n0,s_worst7) & leq(n0,pv19) & leq(s_sworst7,n3) & leq(s_worst7,n3) & (all I (leq(n0,I) & leq(I,n2) -> a_select2(s_center7_init,I) = init)) & (gt(loopcounter,n1) -> init = pvar1400_init & init = pvar1401_init & init = pvar1402_init) & (all J (leq(J,minus(n3,n1)) & leq(n0,J) -> a_select2(s_try7_init,J) = init)) & (all H (leq(n0,H) & leq(H,n3) -> init = a_select2(s_values7_init,H))) & (all F (leq(F,n2) & leq(n0,F) -> (all G (leq(n0,G) & leq(G,n3) -> a_select3(simplex7_init,G,F) = init)))) & leq(pv20,minus(n330,n1)) & leq(pv19,minus(n410,n1)) & leq(s_best7,n3) & leq(n0,pv20) & leq(n0,s_sworst7) & leq(n0,s_best7) & s_worst7_init = init & s_sworst7_init = init & init = s_best7_init) # label(gauss_init_0013) # label(negated_conjecture) # label(non_clause).  [assumption].
4.51/4.79	
4.51/4.79	============================== end of process non-clausal formulas ===
4.51/4.79	
4.51/4.79	============================== PROCESS INITIAL CLAUSES ===============
4.51/4.79	
4.51/4.79	============================== PREDICATE ELIMINATION =================
4.51/4.79	57 leq(A,B) | -geq(B,A) # label(leq_geq) # label(axiom).  [clausify(16)].
4.51/4.79	58 -leq(A,B) | geq(B,A) # label(leq_geq) # label(axiom).  [clausify(16)].
4.51/4.79	59 gt(A,B) | -lt(B,A) # label(lt_gt) # label(axiom).  [clausify(21)].
4.51/4.79	60 -gt(A,B) | lt(B,A) # label(lt_gt) # label(axiom).  [clausify(21)].
4.51/4.79	
4.51/4.79	============================== end predicate elimination =============
4.51/4.79	
4.51/4.79	Auto_denials:  (non-Horn, no changes).
4.51/4.79	
4.51/4.79	Term ordering decisions:
4.51/4.79	Function symbol KB weights:  n0=1. init=1. n3=1. n1=1. pv19=1. pv20=1. s_best7=1. s_sworst7=1. s_worst7=1. n410=1. n330=1. s_best7_init=1. s_sworst7_init=1. s_worst7_init=1. n2=1. loopcounter=1. pvar1400_init=1. pvar1401_init=1. pvar1402_init=1. s_center7_init=1. s_try7_init=1. s_values7_init=1. simplex7_init=1. n4=1. n5=1. tptp_minus_1=1. pv7=1. tptp_float_0_0=1. def=1. use=1. c1=1. c2=1. c3=1. c4=1. c5=1. tptp_mmul=1. minus=1. tptp_madd=1. a_select2=1. tptp_msub=1. plus=1. dim=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.
4.51/4.79	
4.51/4.79	============================== end of process initial clauses ========
4.51/4.79	
4.51/4.79	============================== CLAUSES FOR SEARCH ====================
4.51/4.79	
4.51/4.79	============================== end of clauses for search =============
4.51/4.79	
4.51/4.79	============================== SEARCH ================================
4.51/4.79	
4.51/4.79	% Starting search at 0.52 seconds.
4.51/4.79	
4.51/4.79	Low Water (keep): wt=176.000, iters=3382
4.51/4.79	
4.51/4.79	Low Water (keep): wt=156.000, iters=3547
4.51/4.79	
4.51/4.79	Low Water (keep): wt=123.000, iters=3385
4.51/4.79	
4.51/4.79	Low Water (keep): wt=116.000, iters=3536
4.51/4.79	
4.51/4.79	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 792 (0.00 of 2.06 sec).
4.51/4.79	
4.51/4.79	Low Water (keep): wt=113.000, iters=4028
4.51/4.79	
4.51/4.79	Low Water (keep): wt=110.000, iters=3867
4.51/4.79	
4.51/4.79	Low Water (keep): wt=80.000, iters=3361
4.51/4.79	
4.51/4.79	Low Water (keep): wt=58.000, iters=3367
4.51/4.79	
4.51/4.79	Low Water (keep): wt=50.000, iters=3352
4.51/4.79	
4.51/4.79	Low Water (keep): wt=46.000, iters=3338
4.51/4.79	
4.51/4.79	Low Water (keep): wt=40.000, iters=3412
4.51/4.79	
4.51/4.79	Low Water (keep): wt=37.000, iters=3381
4.51/4.79	
4.51/4.79	Low Water (keep): wt=35.000, iters=3366
4.51/4.79	
4.51/4.79	Low Water (displace): id=5616, wt=179.000
4.51/4.79	
4.51/4.79	Low Water (displace): id=11477, wt=31.000
4.51/4.79	
4.51/4.79	Low Water (displace): id=11478, wt=28.000
4.51/4.79	
4.51/4.79	Low Water (displace): id=11498, wt=25.000
4.51/4.79	
4.51/4.79	Low Water (displace): id=11499, wt=22.000
4.51/4.79	
4.51/4.79	Low Water (keep): wt=34.000, iters=3502
4.51/4.79	
4.51/4.79	Low Water (displace): id=11651, wt=19.000
4.51/4.79	
4.51/4.79	Low Water (displace): id=11805, wt=16.000
4.51/4.79	
4.51/4.79	Low Water (keep): wt=32.000, iters=3350
4.51/4.79	
4.51/4.79	Low Water (keep): wt=31.000, iters=3335
4.51/4.79	
4.51/4.79	Low Water (displace): id=13770, wt=15.000
4.51/4.79	
4.51/4.79	Low Water (keep): wt=29.000, iters=3496
4.51/4.79	
180.05/180.35	Cputime limit exceeded (core dumped)
180.05/180.35	EOF