0.02/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.02/0.10 % Command : tptp2X_and_run_prover9 %d %s 0.09/0.31 % Computer : n018.cluster.edu 0.09/0.31 % Model : x86_64 x86_64 0.09/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.09/0.31 % Memory : 8042.1875MB 0.09/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.09/0.31 % CPULimit : 960 0.09/0.31 % DateTime : Thu Jul 2 10:59:52 EDT 2020 0.09/0.31 % CPUTime : 0.80/1.13 ============================== Prover9 =============================== 0.80/1.13 Prover9 (32) version 2009-11A, November 2009. 0.80/1.13 Process 6744 was started by sandbox2 on n018.cluster.edu, 0.80/1.13 Thu Jul 2 10:59:53 2020 0.80/1.13 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_6578_n018.cluster.edu". 0.80/1.13 ============================== end of head =========================== 0.80/1.13 0.80/1.13 ============================== INPUT ================================= 0.80/1.13 0.80/1.13 % Reading from file /tmp/Prover9_6578_n018.cluster.edu 0.80/1.13 0.80/1.13 set(prolog_style_variables). 0.80/1.13 set(auto2). 0.80/1.13 % set(auto2) -> set(auto). 0.80/1.13 % set(auto) -> set(auto_inference). 0.80/1.13 % set(auto) -> set(auto_setup). 0.80/1.13 % set(auto_setup) -> set(predicate_elim). 0.80/1.13 % set(auto_setup) -> assign(eq_defs, unfold). 0.80/1.13 % set(auto) -> set(auto_limits). 0.80/1.13 % set(auto_limits) -> assign(max_weight, "100.000"). 0.80/1.13 % set(auto_limits) -> assign(sos_limit, 20000). 0.80/1.13 % set(auto) -> set(auto_denials). 0.80/1.13 % set(auto) -> set(auto_process). 0.80/1.13 % set(auto2) -> assign(new_constants, 1). 0.80/1.13 % set(auto2) -> assign(fold_denial_max, 3). 0.80/1.13 % set(auto2) -> assign(max_weight, "200.000"). 0.80/1.13 % set(auto2) -> assign(max_hours, 1). 0.80/1.13 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.80/1.13 % set(auto2) -> assign(max_seconds, 0). 0.80/1.13 % set(auto2) -> assign(max_minutes, 5). 0.80/1.13 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.80/1.13 % set(auto2) -> set(sort_initial_sos). 0.80/1.13 % set(auto2) -> assign(sos_limit, -1). 0.80/1.13 % set(auto2) -> assign(lrs_ticks, 3000). 0.80/1.13 % set(auto2) -> assign(max_megs, 400). 0.80/1.13 % set(auto2) -> assign(stats, some). 0.80/1.13 % set(auto2) -> clear(echo_input). 0.80/1.13 % set(auto2) -> set(quiet). 0.80/1.13 % set(auto2) -> clear(print_initial_clauses). 0.80/1.13 % set(auto2) -> clear(print_given). 0.80/1.13 assign(lrs_ticks,-1). 0.80/1.13 assign(sos_limit,10000). 0.80/1.13 assign(order,kbo). 0.80/1.13 set(lex_order_vars). 0.80/1.13 clear(print_given). 0.80/1.13 0.80/1.13 % formulas(sos). % not echoed (102 formulas) 0.80/1.13 0.80/1.13 ============================== end of input ========================== 0.80/1.13 0.80/1.13 % From the command line: assign(max_seconds, 960). 0.80/1.13 0.80/1.13 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.80/1.13 0.80/1.13 % Formulas that are not ordinary clauses: 0.80/1.13 1 (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.13 2 (all I all L all U all Val (leq(I,U) & leq(L,I) -> Val = a_select2(tptp_const_array1(dim(L,U),Val),I))) # label(const_array1_select) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 3 (all X all Y (leq(X,Y) <-> gt(succ(Y),X))) # label(leq_succ_gt_equiv) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 4 (all X all Y (leq(X,Y) & X != Y -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 5 (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.13 6 (all X minus(X,n1) = pred(X)) # label(pred_minus_1) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 7 (all X succ(succ(succ(succ(X)))) = plus(X,n4)) # label(succ_plus_4_r) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 8 (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.13 9 (all A all B all N all M ((all I all J (leq(n0,I) & leq(I,M) & leq(J,M) & leq(n0,J) -> a_select3(B,J,I) = a_select3(B,I,J))) -> (all I all J (leq(n0,I) & leq(J,N) & leq(I,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.80/1.13 10 (all X X = pred(succ(X))) # label(pred_succ) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 11 (all X succ(succ(succ(succ(X)))) = plus(n4,X)) # label(succ_plus_4_l) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 12 (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.13 13 (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 (leq(n0,I) & leq(I,N) & leq(J,N) & leq(n0,J) -> 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.14 14 (all X succ(succ(succ(X))) = plus(n3,X)) # label(succ_plus_3_l) # label(axiom) # label(non_clause). [assumption]. 0.80/1.14 15 (all X plus(X,n1) = succ(X)) # label(succ_plus_1_r) # label(axiom) # label(non_clause). [assumption]. 0.80/1.14 16 (all X succ(X) = plus(n1,X)) # label(succ_plus_1_l) # label(axiom) # label(non_clause). [assumption]. 0.80/1.14 17 (all I all U all X all VAL all VAL2 (VAL = a_select2(X,U) & U != I -> VAL = a_select2(tptp_update2(X,I,VAL2),U))) # label(sel2_update_2) # label(axiom) # label(non_clause). [assumption]. 0.80/1.14 18 (all A all N ((all I all J (leq(n0,J) & leq(n0,I) & leq(J,N) & leq(I,N) -> a_select3(A,J,I) = a_select3(A,I,J))) -> (all I all J all K all VAL (leq(n0,K) & leq(K,N) & leq(J,N) & leq(n0,J) & leq(I,N) & leq(n0,I) -> 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.14 19 (all X -gt(X,X)) # label(irreflexivity_gt) # label(axiom) # label(non_clause). [assumption]. 0.80/1.14 20 (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.80/1.14 21 (all A all B all C all D all E all F all N all M ((all I all J (leq(n0,I) & leq(n0,J) & leq(J,M) & leq(I,M) -> a_select3(D,J,I) = a_select3(D,I,J))) & (all I all J (leq(n0,I) & leq(J,N) & leq(n0,J) & leq(I,N) -> a_select3(A,J,I) = a_select3(A,I,J))) & (all I all J (leq(n0,I) & leq(J,N) & leq(n0,J) & leq(I,N) -> a_select3(F,I,J) = a_select3(F,J,I))) -> (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.14 22 (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(n0,I) & 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(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.80/1.14 23 (all A all B all N ((all I all J (leq(n0,J) & leq(I,N) & leq(n0,I) & leq(J,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,J,I) = a_select3(B,I,J))) -> (all I all J (leq(n0,I) & leq(J,N) & leq(n0,J) & leq(I,N) -> a_select3(tptp_madd(A,B),J,I) = a_select3(tptp_madd(A,B),I,J))))) # label(matrix_symm_add) # label(axiom) # label(non_clause). [assumption]. 0.80/1.14 24 (all A all N ((all I all J (leq(n0,J) & leq(n0,I) & leq(J,N) & leq(I,N) -> 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),I,J) = a_select3(trans(A),J,I))))) # label(matrix_symm_trans) # label(axiom) # label(non_clause). [assumption]. 0.80/1.14 25 (all A all B all N ((all I all J (leq(J,N) & leq(n0,I) & leq(I,N) & leq(n0,J) -> a_select3(B,J,I) = a_select3(B,I,J))) -> (all I all J (leq(n0,I) & leq(J,N) & leq(n0,J) & leq(I,N) -> 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.14 26 (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.14 27 (all X succ(succ(X)) = plus(n2,X)) # label(succ_plus_2_l) # label(axiom) # label(non_clause). [assumption]. 0.80/1.14 28 (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.14 29 (all X succ(succ(succ(X))) = plus(X,n3)) # label(succ_plus_3_r) # label(axiom) # label(non_clause). [assumption]. 0.80/1.14 30 (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.14 31 (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.14 32 (all X all Y (leq(succ(X),Y) -> gt(Y,X))) # label(leq_succ_gt) # label(axiom) # label(non_clause). [assumption]. 0.80/1.14 33 (all X all Y (gt(Y,X) -> leq(X,Y))) # label(leq_gt1) # label(axiom) # label(non_clause). [assumption]. 0.80/1.14 34 (all Body n0 = sum(n0,tptp_minus_1,Body)) # label(sum_plus_base) # label(axiom) # label(non_clause). [assumption]. 0.80/1.14 35 (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.14 36 (all I all J all U all V all X all VAL (leq(I,U) & (all I0 all J0 (leq(n0,I0) & leq(n0,J0) & leq(I0,U) & leq(J0,V) -> a_select3(X,I0,J0) = VAL)) & leq(J,V) & leq(n0,J) & leq(n0,I) -> a_select3(tptp_update3(X,U,V,VAL),I,J) = VAL)) # label(sel3_update_3) # label(axiom) # label(non_clause). [assumption]. 0.80/1.14 37 (all X all Y (geq(X,Y) <-> leq(Y,X))) # label(leq_geq) # label(axiom) # label(non_clause). [assumption]. 0.80/1.14 38 (all X all Y (gt(Y,X) <-> leq(X,pred(Y)))) # label(leq_gt_pred) # label(axiom) # label(non_clause). [assumption]. 0.80/1.14 39 (all X all Y (lt(X,Y) <-> gt(Y,X))) # label(lt_gt) # label(axiom) # label(non_clause). [assumption]. 0.80/1.14 40 (all X leq(X,X)) # label(reflexivity_leq) # label(axiom) # label(non_clause). [assumption]. 0.80/1.14 41 (all I all J all U all V all X all VAL all VAL2 (I != U & 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.80/1.14 42 (all X gt(succ(X),X)) # label(gt_succ) # label(axiom) # label(non_clause). [assumption]. 0.80/1.14 43 (all X all Y (gt(X,Y) | X = Y | gt(Y,X))) # label(totality) # label(axiom) # label(non_clause). [assumption]. 0.80/1.14 44 (all I all L1 all U1 all J all L2 all U2 all Val (leq(L2,J) & leq(J,U2) & leq(I,U1) & leq(L1,I) -> 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.14 45 (all X succ(pred(X)) = X) # label(succ_pred) # label(axiom) # label(non_clause). [assumption]. 0.80/1.14 46 (all X succ(succ(X)) = plus(X,n2)) # label(succ_plus_2_r) # label(axiom) # label(non_clause). [assumption]. 0.80/1.14 47 (all X all Y (leq(X,Y) -> leq(X,succ(Y)))) # label(leq_succ) # label(axiom) # label(non_clause). [assumption]. 0.80/1.14 48 (all X all Y (leq(minus(X,Y),X) -> leq(n0,Y))) # label(leq_minus) # label(axiom) # label(non_clause). [assumption]. 0.80/1.14 49 (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.14 50 (all X (leq(n0,X) & leq(X,n5) -> X = n0 | n1 = X | n2 = X | n3 = X | n4 = X | X = n5)) # label(finite_domain_5) # label(axiom) # label(non_clause). [assumption]. 0.80/1.14 51 (all X (leq(n0,X) & leq(X,n0) -> n0 = X)) # label(finite_domain_0) # label(axiom) # label(non_clause). [assumption]. 0.80/1.14 52 (all X (leq(X,n3) & leq(n0,X) -> n1 = X | X = n2 | X = n3 | n0 = X)) # label(finite_domain_3) # label(axiom) # label(non_clause). [assumption]. 0.80/1.14 53 (all X (leq(X,n6) & leq(n0,X) -> X = n0 | X = n2 | n3 = X | n6 = X | X = n5 | X = n4 | X = n1)) # label(finite_domain_6) # label(axiom) # label(non_clause). [assumption]. 0.80/1.14 54 (all X (leq(X,n4) & leq(n0,X) -> n0 = X | n3 = X | n4 = X | X = n2 | X = n1)) # label(finite_domain_4) # label(axiom) # label(non_clause). [assumption]. 0.80/1.14 55 (all X (leq(n0,X) & leq(X,n2) -> X = n0 | n2 = X | X = n1)) # label(finite_domain_2) # label(axiom) # label(non_clause). [assumption]. 0.80/1.14 56 (all X (leq(n0,X) & leq(X,n1) -> X = n0 | X = n1)) # label(finite_domain_1) # label(axiom) # label(non_clause). [assumption]. 0.80/1.14 57 -(leq(pv5,minus(n999,n1)) & (all C all D (leq(n0,C) & leq(C,minus(n3,n1)) & leq(D,minus(n3,n1)) & leq(n0,D) -> a_select3(r_ds1_filter,C,D) = a_select3(r_ds1_filter,D,C))) & (all I (leq(I,minus(n6,n1)) & leq(n0,I) -> (all J (leq(J,minus(n6,n1)) & leq(n0,J) -> a_select3(id_ds1_filter,J,I) = a_select3(id_ds1_filter,I,J))))) & (all G all H (leq(n0,G) & leq(H,minus(n6,n1)) & leq(G,minus(n6,n1)) & leq(n0,H) -> a_select3(pminus_ds1_filter,G,H) = a_select3(pminus_ds1_filter,H,G))) & (all E all F (leq(F,minus(n6,n1)) & leq(E,minus(n6,n1)) & leq(n0,F) & leq(n0,E) -> a_select3(pminus_ds1_filter,F,E) = a_select3(pminus_ds1_filter,E,F))) & (all A all B (leq(n0,A) & leq(n0,B) & leq(A,minus(n6,n1)) & leq(B,minus(n6,n1)) -> a_select3(q_ds1_filter,A,B) = a_select3(q_ds1_filter,B,A))) & leq(n0,pv5) -> (all M all N (leq(n0,M) & leq(N,minus(n3,n1)) & leq(M,minus(n3,n1)) & leq(n0,N) -> a_select3(r_ds1_filter,N,M) = a_select3(r_ds1_filter,M,N))) & (all O all P (leq(n0,O) & leq(n0,P) & leq(O,minus(n6,n1)) & leq(P,minus(n6,n1)) -> a_select3(pminus_ds1_filter,P,O) = a_select3(pminus_ds1_filter,O,P))) & (all K all L (leq(n0,L) & leq(L,minus(n6,n1)) & leq(K,minus(n6,n1)) & leq(n0,K) -> a_select3(q_ds1_filter,L,K) = a_select3(q_ds1_filter,K,L)))) # label(quaternion_ds1_symm_0009) # label(negated_conjecture) # label(non_clause). [assumption]. 6.29/6.65 6.29/6.65 ============================== end of process non-clausal formulas === 6.29/6.65 6.29/6.65 ============================== PROCESS INITIAL CLAUSES =============== 6.29/6.65 6.29/6.65 ============================== PREDICATE ELIMINATION ================= 6.29/6.65 58 geq(A,B) | -leq(B,A) # label(leq_geq) # label(axiom). [clausify(37)]. 6.29/6.65 59 -geq(A,B) | leq(B,A) # label(leq_geq) # label(axiom). [clausify(37)]. 6.29/6.65 60 lt(A,B) | -gt(B,A) # label(lt_gt) # label(axiom). [clausify(39)]. 6.29/6.65 61 -lt(A,B) | gt(B,A) # label(lt_gt) # label(axiom). [clausify(39)]. 6.29/6.65 6.29/6.65 ============================== end predicate elimination ============= 6.29/6.65 6.29/6.65 Auto_denials: (non-Horn, no changes). 6.29/6.65 6.29/6.65 Term ordering decisions: 6.29/6.65 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. n999=1. id_ds1_filter=1. pv5=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. f4=1. f5=1. f6=1. f7=1. f22=1. f23=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. f24=1. f25=1. tptp_update3=1. f1=1. f2=1. f3=1. f26=1. f27=1. f8=1. f9=1. f10=1. f11=1. f12=1. f13=1. 6.29/6.65 6.29/6.65 ============================== end of process initial clauses ======== 6.29/6.65 6.29/6.65 ============================== CLAUSES FOR SEARCH ==================== 6.29/6.65 6.29/6.65 ============================== end of clauses for search ============= 6.29/6.65 6.29/6.65 ============================== SEARCH ================================ 6.29/6.65 6.29/6.65 % Starting search at 0.31 seconds. 6.29/6.65 6.29/6.65 Low Water (keep): wt=198.000, iters=3371 6.29/6.65 6.29/6.65 Low Water (keep): wt=166.000, iters=3359 6.29/6.65 6.29/6.65 Low Water (keep): wt=165.000, iters=3353 6.29/6.65 6.29/6.65 Low Water (keep): wt=134.000, iters=3387 6.29/6.65 6.29/6.65 Low Water (keep): wt=133.000, iters=3379 6.29/6.65 6.29/6.65 Low Water (keep): wt=125.000, iters=3438 6.29/6.65 6.29/6.65 Low Water (keep): wt=102.000, iters=3420 6.29/6.65 6.29/6.65 Low Water (keep): wt=101.000, iters=3420 6.29/6.65 6.29/6.65 Low Water (keep): wt=100.000, iters=3365 6.29/6.65 6.29/6.65 Low Water (keep): wt=99.000, iters=3485 6.29/6.65 6.29/6.65 Low Water (keep): wt=92.000, iters=3823 6.29/6.65 6.29/6.65 Low Water (keep): wt=79.000, iters=3417 6.29/6.65 6.29/6.65 Low Water (keep): wt=62.000, iters=3350 6.29/6.65 6.29/6.65 Low Water (keep): wt=61.000, iters=3385 6.29/6.65 6.29/6.65 Low Water (keep): wt=55.000, iters=3398 6.29/6.65 6.29/6.65 Low Water (keep): wt=52.000, iters=3518 6.29/6.65 6.29/6.65 Low Water (keep): wt=46.000, iters=3407 6.29/6.65 6.29/6.65 Low Water (keep): wt=45.000, iters=3389 6.29/6.65 6.29/6.65 Low Water (keep): wt=43.000, iters=3364 6.29/6.65 6.29/6.65 Low Water (displace): id=4250, wt=198.000 6.29/6.65 6.29/6.65 Low Water (displace): id=2161, wt=189.000 6.29/6.65 6.29/6.65 Low Water (displace): id=5385, wt=185.000 6.29/6.65 6.29/6.65 Low Water (displace): id=5384, wt=182.000 6.29/6.65 6.29/6.65 Low Water (displace): id=5778, wt=179.000 6.29/6.65 6.29/6.65 Low Water (displace): id=10641, wt=34.000 6.29/6.65 6.29/6.65 Low Water (displace): id=10642, wt=31.000 6.29/6.65 6.29/6.65 Low Water (displace): id=10646, wt=25.000 6.29/6.65 6.29/6.65 Low Water (displace): id=10914, wt=24.000 6.29/6.65 6.29/6.65 Low Water (keep): wt=42.000, iters=3363 6.29/6.65 6.29/6.65 Low Water (keep): wt=40.000, iters=3405 6.29/6.65 6.29/6.65 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 123 (0.00 of 5.4Alarm clock 119.76/120.10 Prover9 interrupted 119.76/120.10 EOF