0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.34	% Computer   : n008.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 12:37:23 EDT 2019
0.12/0.34	% CPUTime    : 
0.80/1.10	============================== Prover9 ===============================
0.80/1.10	Prover9 (32) version 2009-11A, November 2009.
0.80/1.10	Process 19063 was started by sandbox2 on n008.cluster.edu,
0.80/1.10	Thu Aug 29 12:37:24 2019
0.80/1.10	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 180 -f /tmp/Prover9_18909_n008.cluster.edu".
0.80/1.10	============================== end of head ===========================
0.80/1.10	
0.80/1.10	============================== INPUT =================================
0.80/1.10	
0.80/1.10	% Reading from file /tmp/Prover9_18909_n008.cluster.edu
0.80/1.10	
0.80/1.10	set(prolog_style_variables).
0.80/1.10	set(auto2).
0.80/1.10	    % set(auto2) -> set(auto).
0.80/1.10	    % set(auto) -> set(auto_inference).
0.80/1.10	    % set(auto) -> set(auto_setup).
0.80/1.10	    % set(auto_setup) -> set(predicate_elim).
0.80/1.10	    % set(auto_setup) -> assign(eq_defs, unfold).
0.80/1.10	    % set(auto) -> set(auto_limits).
0.80/1.10	    % set(auto_limits) -> assign(max_weight, "100.000").
0.80/1.10	    % set(auto_limits) -> assign(sos_limit, 20000).
0.80/1.10	    % set(auto) -> set(auto_denials).
0.80/1.10	    % set(auto) -> set(auto_process).
0.80/1.10	    % set(auto2) -> assign(new_constants, 1).
0.80/1.10	    % set(auto2) -> assign(fold_denial_max, 3).
0.80/1.10	    % set(auto2) -> assign(max_weight, "200.000").
0.80/1.10	    % set(auto2) -> assign(max_hours, 1).
0.80/1.10	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.80/1.10	    % set(auto2) -> assign(max_seconds, 0).
0.80/1.10	    % set(auto2) -> assign(max_minutes, 5).
0.80/1.10	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.80/1.10	    % set(auto2) -> set(sort_initial_sos).
0.80/1.10	    % set(auto2) -> assign(sos_limit, -1).
0.80/1.10	    % set(auto2) -> assign(lrs_ticks, 3000).
0.80/1.10	    % set(auto2) -> assign(max_megs, 400).
0.80/1.10	    % set(auto2) -> assign(stats, some).
0.80/1.10	    % set(auto2) -> clear(echo_input).
0.80/1.10	    % set(auto2) -> set(quiet).
0.80/1.10	    % set(auto2) -> clear(print_initial_clauses).
0.80/1.10	    % set(auto2) -> clear(print_given).
0.80/1.10	assign(lrs_ticks,-1).
0.80/1.10	assign(sos_limit,10000).
0.80/1.10	assign(order,kbo).
0.80/1.10	set(lex_order_vars).
0.80/1.10	clear(print_given).
0.80/1.10	
0.80/1.10	% formulas(sos).  % not echoed (102 formulas)
0.80/1.10	
0.80/1.10	============================== end of input ==========================
0.80/1.10	
0.80/1.10	% From the command line: assign(max_seconds, 180).
0.80/1.10	
0.80/1.10	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.80/1.10	
0.80/1.10	% Formulas that are not ordinary clauses:
0.80/1.10	1 (all X all Y (leq(minus(X,Y),X) -> leq(n0,Y))) # label(leq_minus) # label(axiom) # label(non_clause).  [assumption].
0.80/1.10	2 (all X all Y (gt(succ(Y),X) <-> leq(X,Y))) # label(leq_succ_gt_equiv) # label(axiom) # label(non_clause).  [assumption].
0.80/1.10	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.80/1.10	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.80/1.10	5 (all X succ(X) = plus(n1,X)) # label(succ_plus_1_l) # label(axiom) # label(non_clause).  [assumption].
0.80/1.10	6 (all X plus(n4,X) = succ(succ(succ(succ(X))))) # label(succ_plus_4_l) # label(axiom) # label(non_clause).  [assumption].
0.80/1.10	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.80/1.10	8 (all X succ(succ(X)) = plus(n2,X)) # label(succ_plus_2_l) # label(axiom) # label(non_clause).  [assumption].
0.80/1.10	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.80/1.10	10 (all X -gt(X,X)) # label(irreflexivity_gt) # label(axiom) # label(non_clause).  [assumption].
0.80/1.10	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.80/1.10	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.80/1.10	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.80/1.10	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.80/1.10	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.80/1.10	16 (all X all Y (leq(Y,X) <-> geq(X,Y))) # label(leq_geq) # label(axiom) # label(non_clause).  [assumption].
0.80/1.10	17 (all X all Y (leq(X,Y) -> leq(X,succ(Y)))) # label(leq_succ) # label(axiom) # label(non_clause).  [assumption].
0.80/1.10	18 (all X plus(X,n3) = succ(succ(succ(X)))) # label(succ_plus_3_r) # label(axiom) # label(non_clause).  [assumption].
0.80/1.10	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.80/1.10	20 (all X X = pred(succ(X))) # label(pred_succ) # label(axiom) # label(non_clause).  [assumption].
0.80/1.10	21 (all X all Y (gt(Y,X) <-> lt(X,Y))) # label(lt_gt) # label(axiom) # label(non_clause).  [assumption].
0.80/1.10	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.80/1.10	23 (all X plus(X,n1) = succ(X)) # label(succ_plus_1_r) # label(axiom) # label(non_clause).  [assumption].
0.80/1.10	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.80/1.10	25 (all X plus(X,n5) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_r) # label(axiom) # label(non_clause).  [assumption].
0.80/1.10	26 (all X pred(X) = minus(X,n1)) # label(pred_minus_1) # label(axiom) # label(non_clause).  [assumption].
0.80/1.10	27 (all X plus(n5,X) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_l) # label(axiom) # label(non_clause).  [assumption].
0.80/1.10	28 (all Body sum(n0,tptp_minus_1,Body) = n0) # label(sum_plus_base) # label(axiom) # label(non_clause).  [assumption].
0.80/1.10	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.80/1.10	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.80/1.10	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.80/1.19	32 (all X succ(succ(X)) = plus(X,n2)) # label(succ_plus_2_r) # label(axiom) # label(non_clause).  [assumption].
0.80/1.19	33 (all X succ(succ(succ(X))) = plus(n3,X)) # label(succ_plus_3_l) # label(axiom) # label(non_clause).  [assumption].
0.80/1.19	34 (all X all Y (gt(Y,X) -> leq(X,Y))) # label(leq_gt1) # label(axiom) # label(non_clause).  [assumption].
0.80/1.19	35 (all X leq(X,X)) # label(reflexivity_leq) # label(axiom) # label(non_clause).  [assumption].
0.80/1.19	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.80/1.19	37 (all X all Y (leq(succ(X),succ(Y)) <-> leq(X,Y))) # label(leq_succ_succ) # label(axiom) # label(non_clause).  [assumption].
0.80/1.19	38 (all X all Y (leq(X,Y) & X != Y -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause).  [assumption].
0.80/1.19	39 (all X succ(pred(X)) = X) # label(succ_pred) # label(axiom) # label(non_clause).  [assumption].
0.80/1.19	40 (all X all Y (leq(X,pred(Y)) <-> gt(Y,X))) # label(leq_gt_pred) # label(axiom) # label(non_clause).  [assumption].
0.80/1.19	41 (all X all Y (leq(succ(X),Y) -> gt(Y,X))) # label(leq_succ_gt) # label(axiom) # label(non_clause).  [assumption].
0.80/1.19	42 (all X plus(X,n4) = succ(succ(succ(succ(X))))) # label(succ_plus_4_r) # label(axiom) # label(non_clause).  [assumption].
0.80/1.19	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.80/1.19	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.80/1.19	45 (all X all Y (gt(X,Y) | X = Y | gt(Y,X))) # label(totality) # label(axiom) # label(non_clause).  [assumption].
0.80/1.19	46 (all X gt(succ(X),X)) # label(gt_succ) # label(axiom) # label(non_clause).  [assumption].
0.80/1.19	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.80/1.19	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.80/1.19	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.80/1.19	50 (all X (leq(X,n5) & leq(n0,X) -> n1 = X | n2 = X | n3 = X | X = n5 | n4 = X | X = n0)) # label(finite_domain_5) # label(axiom) # label(non_clause).  [assumption].
0.80/1.19	51 (all X (leq(n0,X) & leq(X,n1) -> X = n1 | n0 = X)) # label(finite_domain_1) # label(axiom) # label(non_clause).  [assumption].
0.80/1.19	52 (all X (leq(n0,X) & leq(X,n2) -> n2 = X | n1 = X | n0 = X)) # label(finite_domain_2) # label(axiom) # label(non_clause).  [assumption].
0.80/1.19	53 (all X (leq(n0,X) & leq(X,n4) -> X = n2 | X = n3 | n4 = X | X = n1 | X = n0)) # label(finite_domain_4) # label(axiom) # label(non_clause).  [assumption].
0.80/1.19	54 (all X (leq(n0,X) & leq(X,n3) -> X = n0 | X = n2 | n3 = X | n1 = X)) # label(finite_domain_3) # label(axiom) # label(non_clause).  [assumption].
0.80/1.19	55 (all X (leq(n0,X) & leq(X,n0) -> n0 = X)) # label(finite_domain_0) # label(axiom) # label(non_clause).  [assumption].
0.80/1.19	56 (all X (leq(n0,X) & leq(X,n6) -> X = n4 | n6 = X | n5 = X | n3 = X | n2 = X | n1 = X | n0 = X)) # label(finite_domain_6) # label(axiom) # label(non_clause).  [assumption].
0.80/1.19	57 -((all A all B (leq(n0,B) & leq(B,minus(n6,n1)) & leq(A,minus(n6,n1)) & leq(n0,A) -> a_select3(q_ds1_filter,A,B) = a_select3(q_ds1_filter,B,A))) & (all E all F (leq(n0,E) & leq(F,minus(n6,n1)) & leq(E,minus(n6,n1)) & leq(n0,F) -> a_select3(pminus_ds1_filter,E,F) = a_select3(pminus_ds1_filter,F,E))) & (all C all D (leq(n0,C) & leq(n0,D) & leq(D,minus(n3,n1)) & leq(C,minus(n3,n1)) -> a_select3(r_ds1_filter,D,C) = a_select3(r_ds1_filter,C,D))) & leq(pv5,minus(n999,n1)) & leq(n0,pv5) -> (all G all H (leq(n0,G) & leq(G,minus(n6,n1)) & leq(H,minus(n6,n1)) & leq(n0,H) -> a_select3(q_ds1_filter,H,G) = a_select3(q_ds1_filter,G,H))) & (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,L,K) = a_select3(pminus_ds1_filter,K,L))) & (all M (leq(M,minus(n0,n1)) & leq(n0,M) -> (all N (leq(n0,N) & leq(N,minus(n6,n1)) -> a_select3(id_ds1_filter,M,N) = a_select3(id_ds1_filter,N,M))))) & (all I all J (leq(n0,J) & leq(J,minus(n3,n1)) & leq(I,minus(n3,n1)) & leq(n0,I) -> a_select3(r_ds1_filter,J,I) = a_select3(r_ds1_filter,I,J))) & leq(pv5,minus(n999,n1)) & leq(n0,pv5)) # label(quaternion_ds1_symm_0007) # label(negated_conjecture) # label(non_clause).  [assumption].
6.04/6.39	
6.04/6.39	============================== end of process non-clausal formulas ===
6.04/6.39	
6.04/6.39	============================== PROCESS INITIAL CLAUSES ===============
6.04/6.39	
6.04/6.39	============================== PREDICATE ELIMINATION =================
6.04/6.39	58 leq(A,B) | -geq(B,A) # label(leq_geq) # label(axiom).  [clausify(16)].
6.04/6.39	59 -leq(A,B) | geq(B,A) # label(leq_geq) # label(axiom).  [clausify(16)].
6.04/6.39	60 gt(A,B) | -lt(B,A) # label(lt_gt) # label(axiom).  [clausify(21)].
6.04/6.39	61 -gt(A,B) | lt(B,A) # label(lt_gt) # label(axiom).  [clausify(21)].
6.04/6.39	
6.04/6.39	============================== end predicate elimination =============
6.04/6.39	
6.04/6.39	Auto_denials:  (non-Horn, no changes).
6.04/6.39	
6.04/6.39	Term ordering decisions:
6.04/6.39	Function symbol KB weights:  n0=1. n1=1. pv5=1. n6=1. n999=1. n3=1. pminus_ds1_filter=1. q_ds1_filter=1. r_ds1_filter=1. id_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. c7=1. c8=1. minus=1. tptp_mmul=1. tptp_madd=1. tptp_msub=1. plus=1. a_select2=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.
6.04/6.39	
6.04/6.39	============================== end of process initial clauses ========
6.04/6.39	
6.04/6.39	============================== CLAUSES FOR SEARCH ====================
6.04/6.39	
6.04/6.39	============================== end of clauses for search =============
6.04/6.39	
6.04/6.39	============================== SEARCH ================================
6.04/6.39	
6.04/6.39	% Starting search at 0.50 seconds.
6.04/6.39	
6.04/6.39	Low Water (keep): wt=182.000, iters=3423
6.04/6.39	
6.04/6.39	Low Water (keep): wt=152.000, iters=3358
6.04/6.39	
6.04/6.39	Low Water (keep): wt=128.000, iters=3612
6.04/6.39	
6.04/6.39	Low Water (keep): wt=125.000, iters=3480
6.04/6.39	
6.04/6.39	Low Water (keep): wt=98.000, iters=3347
6.04/6.39	
6.04/6.39	Low Water (keep): wt=95.000, iters=3412
6.04/6.39	
6.04/6.39	Low Water (keep): wt=73.000, iters=3358
6.04/6.39	
6.04/6.39	Low Water (keep): wt=70.000, iters=3346
6.04/6.39	
6.04/6.39	Low Water (keep): wt=62.000, iters=3554
6.04/6.39	
6.04/6.39	Low Water (keep): wt=59.000, iters=3546
6.04/6.39	
6.04/6.39	Low Water (keep): wt=58.000, iters=3539
6.04/6.39	
6.04/6.39	Low Water (keep): wt=55.000, iters=3404
6.04/6.39	
6.04/6.39	Low Water (keep): wt=46.000, iters=3418
6.04/6.39	
6.04/6.39	Low Water (keep): wt=44.000, iters=3445
6.04/6.39	
6.04/6.39	Low Water (keep): wt=43.000, iters=3411
6.04/6.39	
6.04/6.39	Low Water (displace): id=3953, wt=189.000
6.04/6.39	
6.04/6.39	Low Water (displace): id=7341, wt=188.000
6.04/6.39	
6.04/6.39	Low Water (displace): id=7342, wt=185.000
6.04/6.39	
6.04/6.39	Low Water (displace): id=6963, wt=182.000
6.04/6.39	
6.04/6.39	Low Water (displace): id=4320, wt=179.000
6.04/6.39	
6.04/6.39	Low Water (displace): id=12022, wt=37.000
6.04/6.39	
6.04/6.39	Low Water (displace): id=12027, wt=28.000
6.04/6.39	
6.04/6.39	Low Water (keep): wt=40.000, iters=3343
6.04/6.39	
6.04/6.39	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 148 (0.00 of 3.29 sec).
6.04/6.39	
6.04/6.39	Low Water (displace): id=12592, wt=25.000
6.04/6.39	
6.04/6.39	Low Water (displace): id=13081, wt=19.000
6.04/6.39	
6.04/6.39	Low Water (keep): wt=37.000, iters=3461
6.04/6.39	
6.04/6.39	Low Water (displace): id=15374, wt=18.000
6.04/6.39	
6.04/6.39	Low Water (displace): id=15836, wt=17.000
6.04/6.39	
6.04/6.39	Low Water (displace): id=15939, wt=16.000
6.04/6.39	
6.04/6.39	Low Water (keep): wt=34.000, iters=3430
6.04/6.39	
6.04/6.39	Low Water (displace): id=19618, wt=15.000
6.04/6.39	
6.04/6.39	Low Water (displace): id=20207, wt=13.000
6.04/6.39	
6.04/6.39	Low Cputime limit exceeded (core dumped)
180.07/180.34	EOF