0.03/0.13	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.13	% Command  : tptp2X_and_run_prover9 %d %s
0.13/0.35	% Computer : n011.cluster.edu
0.13/0.35	% Model    : x86_64 x86_64
0.13/0.35	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.35	% Memory   : 8042.1875MB
0.13/0.35	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.35	% CPULimit : 960
0.13/0.35	% WCLimit  : 120
0.13/0.35	% DateTime : Tue Aug  9 03:14:06 EDT 2022
0.13/0.35	% CPUTime  : 
0.80/1.11	============================== Prover9 ===============================
0.80/1.11	Prover9 (32) version 2009-11A, November 2009.
0.80/1.11	Process 6710 was started by sandbox2 on n011.cluster.edu,
0.80/1.11	Tue Aug  9 03:14:07 2022
0.80/1.11	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_6557_n011.cluster.edu".
0.80/1.11	============================== end of head ===========================
0.80/1.11	
0.80/1.11	============================== INPUT =================================
0.80/1.11	
0.80/1.11	% Reading from file /tmp/Prover9_6557_n011.cluster.edu
0.80/1.11	
0.80/1.11	set(prolog_style_variables).
0.80/1.11	set(auto2).
0.80/1.11	    % set(auto2) -> set(auto).
0.80/1.11	    % set(auto) -> set(auto_inference).
0.80/1.11	    % set(auto) -> set(auto_setup).
0.80/1.11	    % set(auto_setup) -> set(predicate_elim).
0.80/1.11	    % set(auto_setup) -> assign(eq_defs, unfold).
0.80/1.11	    % set(auto) -> set(auto_limits).
0.80/1.11	    % set(auto_limits) -> assign(max_weight, "100.000").
0.80/1.11	    % set(auto_limits) -> assign(sos_limit, 20000).
0.80/1.11	    % set(auto) -> set(auto_denials).
0.80/1.11	    % set(auto) -> set(auto_process).
0.80/1.11	    % set(auto2) -> assign(new_constants, 1).
0.80/1.11	    % set(auto2) -> assign(fold_denial_max, 3).
0.80/1.12	    % set(auto2) -> assign(max_weight, "200.000").
0.80/1.12	    % set(auto2) -> assign(max_hours, 1).
0.80/1.12	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.80/1.12	    % set(auto2) -> assign(max_seconds, 0).
0.80/1.12	    % set(auto2) -> assign(max_minutes, 5).
0.80/1.12	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.80/1.12	    % set(auto2) -> set(sort_initial_sos).
0.80/1.12	    % set(auto2) -> assign(sos_limit, -1).
0.80/1.12	    % set(auto2) -> assign(lrs_ticks, 3000).
0.80/1.12	    % set(auto2) -> assign(max_megs, 400).
0.80/1.12	    % set(auto2) -> assign(stats, some).
0.80/1.12	    % set(auto2) -> clear(echo_input).
0.80/1.12	    % set(auto2) -> set(quiet).
0.80/1.12	    % set(auto2) -> clear(print_initial_clauses).
0.80/1.12	    % set(auto2) -> clear(print_given).
0.80/1.12	assign(lrs_ticks,-1).
0.80/1.12	assign(sos_limit,10000).
0.80/1.12	assign(order,kbo).
0.80/1.12	set(lex_order_vars).
0.80/1.12	clear(print_given).
0.80/1.12	
0.80/1.12	% formulas(sos).  % not echoed (92 formulas)
0.80/1.12	
0.80/1.12	============================== end of input ==========================
0.80/1.12	
0.80/1.12	% From the command line: assign(max_seconds, 960).
0.80/1.12	
0.80/1.12	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.80/1.12	
0.80/1.12	% Formulas that are not ordinary clauses:
0.80/1.12	1 (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(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(F,J,I) = a_select3(F,I,J))) & (all I all J (leq(n0,I) & leq(I,M) & leq(n0,J) & leq(J,M) -> a_select3(D,J,I) = a_select3(D,I,J))) -> (all I all J (leq(n0,I) & leq(n0,J) & leq(J,N) & leq(I,N) -> 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.80/1.12	2 (all A all N ((all I all J (leq(n0,I) & leq(I,N) & leq(J,N) & leq(n0,J) -> a_select3(A,I,J) = a_select3(A,J,I))) -> (all I all J all K all VAL (leq(n0,I) & leq(n0,J) & leq(K,N) & leq(n0,K) & leq(J,N) & 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.80/1.12	3 (all X all Y (gt(Y,X) -> leq(X,Y))) # label(leq_gt1) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	4 (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.80/1.12	5 (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.12	6 (all X minus(X,n1) = pred(X)) # label(pred_minus_1) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	7 (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.12	8 (all X all U all V all VAL VAL = a_select3(tptp_update3(X,U,V,VAL),U,V)) # label(sel3_update_1) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	9 (all X pred(succ(X)) = X) # label(pred_succ) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	10 (all X succ(succ(X)) = plus(X,n2)) # label(succ_plus_2_r) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	11 (all X all Y (leq(X,Y) <-> leq(succ(X),succ(Y)))) # label(leq_succ_succ) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	12 (all A all N ((all I all J (leq(I,N) & leq(J,N) & leq(n0,J) & 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(trans(A),I,J) = a_select3(trans(A),J,I))))) # label(matrix_symm_trans) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	13 (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(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.80/1.12	14 (all I all J all U all V all X all VAL all VAL2 (I != U & a_select3(X,U,V) = VAL & V = J -> VAL = a_select3(tptp_update3(X,I,J,VAL2),U,V))) # label(sel3_update_2) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	15 (all X leq(X,X)) # label(reflexivity_leq) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	16 (all Body n0 = sum(n0,tptp_minus_1,Body)) # label(sum_plus_base) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	17 (all X -gt(X,X)) # label(irreflexivity_gt) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	18 (all I all U all X all VAL (leq(I,U) & leq(n0,I) & (all I0 (leq(n0,I0) & leq(I0,U) -> VAL = a_select2(X,I0))) -> a_select2(tptp_update2(X,U,VAL),I) = VAL)) # label(sel2_update_3) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	19 (all X all Y (leq(succ(X),Y) -> gt(Y,X))) # label(leq_succ_gt) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	20 (all X all Y (gt(Y,X) | X = Y | gt(X,Y))) # label(totality) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	21 (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.12	22 (all X succ(X) = plus(n1,X)) # label(succ_plus_1_l) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	23 (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) -> Val = a_select3(tptp_const_array2(dim(L1,U1),dim(L2,U2),Val),I,J))) # label(const_array2_select) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	24 (all X gt(succ(X),X)) # label(gt_succ) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	25 (all X all Y (leq(X,Y) -> leq(X,succ(Y)))) # label(leq_succ) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	26 (all X succ(succ(succ(succ(succ(X))))) = plus(X,n5)) # label(succ_plus_5_r) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	27 (all X plus(n3,X) = succ(succ(succ(X)))) # label(succ_plus_3_l) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	28 (all A all B 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(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,I) & leq(n0,J) & leq(J,N) & leq(I,N) -> 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.12	29 (all X succ(succ(succ(succ(succ(X))))) = plus(n5,X)) # label(succ_plus_5_l) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	30 (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.12	31 (all X succ(succ(X)) = plus(n2,X)) # label(succ_plus_2_l) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	32 (all X all Y (leq(minus(X,Y),X) -> leq(n0,Y))) # label(leq_minus) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	33 (all X all Y (lt(X,Y) <-> gt(Y,X))) # label(lt_gt) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	34 (all I all U all X all VAL all VAL2 (I != U & VAL = a_select2(X,U) -> VAL = a_select2(tptp_update2(X,I,VAL2),U))) # label(sel2_update_2) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	35 (all X all Y (leq(X,Y) & Y != X -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	36 (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.12	37 (all X succ(succ(succ(succ(X)))) = plus(n4,X)) # label(succ_plus_4_l) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	38 (all A all B all N ((all I all J (leq(I,N) & leq(J,N) & leq(n0,J) & 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(tptp_mmul(A,tptp_mmul(B,trans(A))),J,I) = a_select3(tptp_mmul(A,tptp_mmul(B,trans(A))),I,J))))) # label(matrix_symm_aba1) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	39 (all X plus(X,n4) = succ(succ(succ(succ(X))))) # label(succ_plus_4_r) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	40 (all X all Y (geq(X,Y) <-> leq(Y,X))) # label(leq_geq) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	41 (all A all B all N ((all I all J (leq(n0,I) & leq(n0,J) & leq(J,N) & leq(I,N) -> 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,I,J) = a_select3(B,J,I))) -> (all I all J (leq(I,N) & leq(J,N) & leq(n0,J) & 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.80/1.12	42 (all X succ(X) = plus(X,n1)) # label(succ_plus_1_r) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	43 (all X succ(succ(succ(X))) = plus(X,n3)) # label(succ_plus_3_r) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	44 (all X all Y (leq(X,pred(Y)) <-> gt(Y,X))) # label(leq_gt_pred) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	45 (all A all B all N all M ((all I all J (leq(n0,I) & leq(J,M) & leq(n0,J) & leq(I,M) -> 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(tptp_mmul(A,tptp_mmul(B,trans(A))),J,I) = a_select3(tptp_mmul(A,tptp_mmul(B,trans(A))),I,J))))) # label(matrix_symm_aba2) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	46 (all X X = succ(pred(X))) # label(succ_pred) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	47 (all I all J all U all V all X all VAL (leq(n0,I) & leq(n0,J) & leq(J,V) & leq(I,U) & (all I0 all J0 (leq(n0,I0) & leq(I0,U) & leq(J0,V) & leq(n0,J0) -> VAL = a_select3(X,I0,J0))) -> VAL = a_select3(tptp_update3(X,U,V,VAL),I,J))) # label(sel3_update_3) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	48 (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.12	49 (all Body tptp_float_0_0 = sum(n0,tptp_minus_1,Body)) # label(sum_plus_base_float) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	50 (all X (leq(n0,X) & leq(X,n4) -> n0 = X | X = n1 | n4 = X | X = n3 | X = n2)) # label(finite_domain_4) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	51 (all X (leq(X,n5) & leq(n0,X) -> n2 = X | n3 = X | X = n5 | X = n4 | n1 = X | n0 = X)) # label(finite_domain_5) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	52 (all X (leq(n0,X) & leq(X,n0) -> n0 = X)) # label(finite_domain_0) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	53 (all X (leq(n0,X) & leq(X,n3) -> n0 = X | X = n3 | n2 = X | n1 = X)) # label(finite_domain_3) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	54 (all X (leq(X,n1) & leq(n0,X) -> n1 = X | n0 = X)) # label(finite_domain_1) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	55 (all X (leq(n0,X) & leq(X,n2) -> X = n1 | X = n2 | X = n0)) # label(finite_domain_2) # label(axiom) # label(non_clause).  [assumption].
0.80/1.12	56 -(use = a_select2(rho_defuse,n1) & use = a_select2(rho_defuse,n2) & use = a_select2(sigma_defuse,n1) & a_select2(sigma_defuse,n4) = use & a_select2(sigma_defuse,n5) = use & a_select3(u_defuse,n1,n0) = use & use = a_select2(xinit_defuse,n4) & a_select2(xinit_defuse,n5) = use & use = a_select2(xinit_mean_defuse,n1) & a_select2(xinit_mean_defuse,n2) = use & a_select2(xinit_mean_defuse,n4) = use & a_select2(xinit_noise_defuse,n0) = use & use = a_select2(xinit_noise_defuse,n1) & a_select2(xinit_noise_defuse,n2) = use & a_select2(xinit_noise_defuse,n5) = use & (all C all D (leq(C,n2) & leq(D,n998) & leq(n0,D) & leq(n0,C) -> a_select3(z_defuse,C,D) = use)) & (all A all B (leq(A,n2) & leq(B,n998) & leq(n0,B) & leq(n0,A) -> a_select3(u_defuse,A,B) = use)) & a_select2(xinit_noise_defuse,n4) = use & a_select2(xinit_noise_defuse,n3) = use & use = a_select2(xinit_mean_defuse,n5) & a_select2(xinit_mean_defuse,n3) = use & use = a_select2(xinit_mean_defuse,n0) & use = a_select2(xinit_defuse,n3) & use = a_select3(u_defuse,n2,n0) & a_select3(u_defuse,n0,n0) = use & a_select2(sigma_defuse,n3) = use & use = a_select2(sigma_defuse,n2) & a_select2(sigma_defuse,n0) = use & use = a_select2(rho_defuse,n0) -> (all E (leq(E,n5) & leq(n0,E) -> a_select2(xinit_mean_defuse,E) = use))) # label(quaternion_ds1_inuse_0019) # label(negated_conjecture) # label(non_clause).  [assumption].
13.08/13.39	
13.08/13.39	============================== end of process non-clausal formulas ===
13.08/13.39	
13.08/13.39	============================== PROCESS INITIAL CLAUSES ===============
13.08/13.39	
13.08/13.39	============================== PREDICATE ELIMINATION =================
13.08/13.39	57 lt(A,B) | -gt(B,A) # label(lt_gt) # label(axiom).  [clausify(33)].
13.08/13.39	58 -lt(A,B) | gt(B,A) # label(lt_gt) # label(axiom).  [clausify(33)].
13.08/13.39	59 geq(A,B) | -leq(B,A) # label(leq_geq) # label(axiom).  [clausify(40)].
13.08/13.39	60 -geq(A,B) | leq(B,A) # label(leq_geq) # label(axiom).  [clausify(40)].
13.08/13.39	
13.08/13.39	============================== end predicate elimination =============
13.08/13.39	
13.08/13.39	Auto_denials:  (non-Horn, no changes).
13.08/13.39	
13.08/13.39	Term ordering decisions:
13.08/13.39	Function symbol KB weights:  n0=1. use=1. n1=1. n2=1. n3=1. n4=1. n5=1. tptp_minus_1=1. n998=1. sigma_defuse=1. xinit_mean_defuse=1. xinit_noise_defuse=1. u_defuse=1. rho_defuse=1. xinit_defuse=1. tptp_float_0_0=1. z_defuse=1. def=1. c1=1. tptp_mmul=1. tptp_madd=1. tptp_msub=1. a_select2=1. plus=1. dim=1. minus=1. uniform_int_rnd=1. tptp_const_array1=1. f7=1. f8=1. f9=1. f10=1. f11=1. f12=1. trans=1. succ=1. inv=1. pred=1. a_select3=1. tptp_update2=1. sum=1. tptp_const_array2=1. f14=1. f15=1. f16=1. f17=1. f18=1. f19=1. f20=1. f21=1. f22=1. f23=1. tptp_update3=1. f13=1. f24=1. f25=1. f26=1. f27=1. f1=1. f2=1. f3=1. f4=1. f5=1. f6=1.
13.08/13.39	
13.08/13.39	============================== end of process initial clauses ========
13.08/13.39	
13.08/13.39	============================== CLAUSES FOR SEARCH ====================
13.08/13.39	
13.08/13.39	============================== end of clauses for search =============
13.08/13.39	
13.08/13.39	============================== SEARCH ================================
13.08/13.39	
13.08/13.39	% Starting search at 0.17 seconds.
13.08/13.39	
13.08/13.39	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 480 (0.00 of 0.78 sec).
13.08/13.39	
13.08/13.39	Low Water (keep): wt=176.000, iters=3503
13.08/13.39	
13.08/13.39	Low Water (keep): wt=146.000, iters=3443
13.08/13.39	
13.08/13.39	Low Water (keep): wt=119.000, iters=3538
13.08/13.39	
13.08/13.39	Low Water (keep): wt=116.000, iters=3488
13.08/13.39	
13.08/13.39	Low Water (keep): wt=86.000, iters=3370
13.08/13.39	
13.08/13.39	Low Water (keep): wt=53.000, iters=3356
13.08/13.39	
13.08/13.39	Low Water (keep): wt=49.000, iters=3339
13.08/13.39	
13.08/13.39	Low Water (keep): wt=40.000, iters=3340
13.08/13.39	
13.08/13.39	Low Water (keep): wt=37.000, iters=3375
13.08/13.39	
13.08/13.39	Low Water (keep): wt=34.000, iters=3490
13.08/13.39	
13.08/13.39	Low Water (displace): id=5806, wt=179.000
13.08/13.39	
13.08/13.39	Low Water (displace): id=10976, wt=31.000
13.08/13.39	
13.08/13.39	Low Water (displace): id=10977, wt=25.000
13.08/13.39	
13.08/13.39	Low Water (displace): id=10987, wt=15.000
13.08/13.39	
13.08/13.39	Low Water (displace): id=11356, wt=13.000
13.08/13.39	
13.08/13.39	Low Water (displace): id=11721, wt=12.000
13.08/13.39	
13.08/13.39	Low Water (displace): id=12123, wt=9.000
13.08/13.39	
13.08/13.39	Low Water (displace): id=12213, wt=8.000
13.08/13.39	
13.08/13.39	Low Water (displace): id=12363, wt=7.000
13.08/13.39	
13.08/13.39	Low Water (keep): wt=32.000, iters=3335
13.08/13.39	
13.08/13.39	Low Water (keep): wt=31.000, iters=3342
13.08/13.39	
13.08/13.39	Low Water (displace): id=16674, wt=6.000
13.08/13.39	
13.08/13.39	Low Water (keep): wt=30.000, iters=3358
13.08/13.39	
13.08/13.39	Low Water (keep): wt=29.000, iters=3383
13.08/13.39	
13.08/13.39	Low Water (keep): wt=28.000, iters=3369
13.08/13.39	
13.08/13.39	Low Water (keep): wt=27.000, iters=3335
13.08/13.39	
13.08/13.39	Low Water (keep): wt=26.000, iters=3376
13.08/13.39	
13.08/13.39	Low Water (keep): wt=25.000, iters=3343
13.08/13.39	
13.08/13.39	Low Water (keep): wt=24.000, iters=3387
13.08/13.39	
13.08/13.39	Low Water (keep): wt=23.000, iters=3336
13.08/13.39	
13.08/13.39	Low Water (keep): wt=22.000, iters=3354
13.08/13.39	
13.08/13.39	Low Water (keep): wt=21.000, iters=3343
13.08/13.39	
13.08/13.39	Low Water (keep): wt=20.000, iters=3383
13.08/13.39	
13.08/13.39	Low Water (keAlarm clock 
119.68/120.02	Prover9 interrupted
119.68/120.02	EOF