0.10/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.10/0.13 % Command : tptp2X_and_run_prover9 %d %s 0.11/0.34 % Computer : n014.cluster.edu 0.11/0.34 % Model : x86_64 x86_64 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.34 % Memory : 8042.1875MB 0.11/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.34 % CPULimit : 960 0.11/0.34 % DateTime : Thu Jul 2 06:58:25 EDT 2020 0.11/0.34 % CPUTime : 0.79/1.24 ============================== Prover9 =============================== 0.79/1.24 Prover9 (32) version 2009-11A, November 2009. 0.79/1.24 Process 18063 was started by sandbox on n014.cluster.edu, 0.79/1.24 Thu Jul 2 06:58:26 2020 0.79/1.24 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_17699_n014.cluster.edu". 0.79/1.24 ============================== end of head =========================== 0.79/1.24 0.79/1.24 ============================== INPUT ================================= 0.79/1.24 0.79/1.24 % Reading from file /tmp/Prover9_17699_n014.cluster.edu 0.79/1.24 0.79/1.24 set(prolog_style_variables). 0.79/1.24 set(auto2). 0.79/1.24 % set(auto2) -> set(auto). 0.79/1.24 % set(auto) -> set(auto_inference). 0.79/1.24 % set(auto) -> set(auto_setup). 0.79/1.24 % set(auto_setup) -> set(predicate_elim). 0.79/1.24 % set(auto_setup) -> assign(eq_defs, unfold). 0.79/1.24 % set(auto) -> set(auto_limits). 0.79/1.24 % set(auto_limits) -> assign(max_weight, "100.000"). 0.79/1.24 % set(auto_limits) -> assign(sos_limit, 20000). 0.79/1.24 % set(auto) -> set(auto_denials). 0.79/1.24 % set(auto) -> set(auto_process). 0.79/1.24 % set(auto2) -> assign(new_constants, 1). 0.79/1.24 % set(auto2) -> assign(fold_denial_max, 3). 0.79/1.24 % set(auto2) -> assign(max_weight, "200.000"). 0.79/1.24 % set(auto2) -> assign(max_hours, 1). 0.79/1.24 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.79/1.24 % set(auto2) -> assign(max_seconds, 0). 0.79/1.24 % set(auto2) -> assign(max_minutes, 5). 0.79/1.24 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.79/1.24 % set(auto2) -> set(sort_initial_sos). 0.79/1.24 % set(auto2) -> assign(sos_limit, -1). 0.79/1.24 % set(auto2) -> assign(lrs_ticks, 3000). 0.79/1.24 % set(auto2) -> assign(max_megs, 400). 0.79/1.24 % set(auto2) -> assign(stats, some). 0.79/1.24 % set(auto2) -> clear(echo_input). 0.79/1.24 % set(auto2) -> set(quiet). 0.79/1.24 % set(auto2) -> clear(print_initial_clauses). 0.79/1.24 % set(auto2) -> clear(print_given). 0.79/1.24 assign(lrs_ticks,-1). 0.79/1.24 assign(sos_limit,10000). 0.79/1.24 assign(order,kbo). 0.79/1.24 set(lex_order_vars). 0.79/1.24 clear(print_given). 0.79/1.24 0.79/1.24 % formulas(sos). % not echoed (92 formulas) 0.79/1.24 0.79/1.24 ============================== end of input ========================== 0.79/1.24 0.79/1.24 % From the command line: assign(max_seconds, 960). 0.79/1.24 0.79/1.24 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.79/1.24 0.79/1.24 % Formulas that are not ordinary clauses: 0.79/1.24 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.79/1.24 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.79/1.24 3 (all X all Y (leq(X,Y) <-> gt(succ(Y),X))) # label(leq_succ_gt_equiv) # label(axiom) # label(non_clause). [assumption]. 0.79/1.24 4 (all X all Y (leq(X,Y) & X != Y -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause). [assumption]. 0.79/1.24 5 (all X succ(succ(succ(succ(succ(X))))) = plus(X,n5)) # label(succ_plus_5_r) # label(axiom) # label(non_clause). [assumption]. 0.79/1.24 6 (all X minus(X,n1) = pred(X)) # label(pred_minus_1) # label(axiom) # label(non_clause). [assumption]. 0.79/1.24 7 (all X succ(succ(succ(succ(X)))) = plus(X,n4)) # label(succ_plus_4_r) # label(axiom) # label(non_clause). [assumption]. 0.79/1.24 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.79/1.24 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.79/1.24 10 (all X X = pred(succ(X))) # label(pred_succ) # label(axiom) # label(non_clause). [assumption]. 0.79/1.24 11 (all X succ(succ(succ(succ(X)))) = plus(n4,X)) # label(succ_plus_4_l) # label(axiom) # label(non_clause). [assumption]. 0.79/1.24 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.79/1.24 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.79/1.25 14 (all X succ(succ(succ(X))) = plus(n3,X)) # label(succ_plus_3_l) # label(axiom) # label(non_clause). [assumption]. 0.79/1.25 15 (all X plus(X,n1) = succ(X)) # label(succ_plus_1_r) # label(axiom) # label(non_clause). [assumption]. 0.79/1.25 16 (all X succ(X) = plus(n1,X)) # label(succ_plus_1_l) # label(axiom) # label(non_clause). [assumption]. 0.79/1.25 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.79/1.25 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.79/1.25 19 (all X -gt(X,X)) # label(irreflexivity_gt) # label(axiom) # label(non_clause). [assumption]. 0.79/1.25 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.79/1.25 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.79/1.25 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.79/1.25 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.79/1.25 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.79/1.25 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.79/1.25 26 (all X plus(n5,X) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_l) # label(axiom) # label(non_clause). [assumption]. 0.79/1.25 27 (all X succ(succ(X)) = plus(n2,X)) # label(succ_plus_2_l) # label(axiom) # label(non_clause). [assumption]. 0.79/1.25 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.79/1.25 29 (all X succ(succ(succ(X))) = plus(X,n3)) # label(succ_plus_3_r) # label(axiom) # label(non_clause). [assumption]. 0.79/1.25 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.79/1.25 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.79/1.25 32 (all X all Y (leq(succ(X),Y) -> gt(Y,X))) # label(leq_succ_gt) # label(axiom) # label(non_clause). [assumption]. 0.79/1.25 33 (all X all Y (gt(Y,X) -> leq(X,Y))) # label(leq_gt1) # label(axiom) # label(non_clause). [assumption]. 0.79/1.25 34 (all Body n0 = sum(n0,tptp_minus_1,Body)) # label(sum_plus_base) # label(axiom) # label(non_clause). [assumption]. 0.79/1.25 35 (all X all Y (leq(X,Y) <-> leq(succ(X),succ(Y)))) # label(leq_succ_succ) # label(axiom) # label(non_clause). [assumption]. 0.79/1.25 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.79/1.25 37 (all X all Y (geq(X,Y) <-> leq(Y,X))) # label(leq_geq) # label(axiom) # label(non_clause). [assumption]. 0.79/1.25 38 (all X all Y (gt(Y,X) <-> leq(X,pred(Y)))) # label(leq_gt_pred) # label(axiom) # label(non_clause). [assumption]. 0.79/1.25 39 (all X all Y (lt(X,Y) <-> gt(Y,X))) # label(lt_gt) # label(axiom) # label(non_clause). [assumption]. 0.79/1.25 40 (all X leq(X,X)) # label(reflexivity_leq) # label(axiom) # label(non_clause). [assumption]. 0.79/1.25 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.79/1.25 42 (all X gt(succ(X),X)) # label(gt_succ) # label(axiom) # label(non_clause). [assumption]. 0.79/1.25 43 (all X all Y (gt(X,Y) | X = Y | gt(Y,X))) # label(totality) # label(axiom) # label(non_clause). [assumption]. 0.79/1.25 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.79/1.25 45 (all X succ(pred(X)) = X) # label(succ_pred) # label(axiom) # label(non_clause). [assumption]. 0.79/1.25 46 (all X succ(succ(X)) = plus(X,n2)) # label(succ_plus_2_r) # label(axiom) # label(non_clause). [assumption]. 0.79/1.25 47 (all X all Y (leq(X,Y) -> leq(X,succ(Y)))) # label(leq_succ) # label(axiom) # label(non_clause). [assumption]. 0.79/1.25 48 (all X all Y (leq(minus(X,Y),X) -> leq(n0,Y))) # label(leq_minus) # label(axiom) # label(non_clause). [assumption]. 0.79/1.25 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.79/1.25 50 (all X (leq(n0,X) & leq(X,n4) -> n1 = X | X = n2 | n4 = X | n3 = X | X = n0)) # label(finite_domain_4) # label(axiom) # label(non_clause). [assumption]. 0.79/1.25 51 (all X (leq(X,n0) & leq(n0,X) -> X = n0)) # label(finite_domain_0) # label(axiom) # label(non_clause). [assumption]. 0.79/1.25 52 (all X (leq(n0,X) & leq(X,n2) -> n0 = X | X = n1 | X = n2)) # label(finite_domain_2) # label(axiom) # label(non_clause). [assumption]. 0.79/1.25 53 (all X (leq(n0,X) & leq(X,n3) -> n2 = X | X = n3 | X = n1 | n0 = X)) # label(finite_domain_3) # label(axiom) # label(non_clause). [assumption]. 0.79/1.25 54 (all X (leq(n0,X) & leq(X,n1) -> X = n0 | X = n1)) # label(finite_domain_1) # label(axiom) # label(non_clause). [assumption]. 0.79/1.25 55 (all X (leq(X,n5) & leq(n0,X) -> X = n0 | n2 = X | X = n3 | n5 = X | X = n4 | n1 = X)) # label(finite_domain_5) # label(axiom) # label(non_clause). [assumption]. 0.79/1.25 56 -(leq(pv10,n135299) & (all A (leq(A,pred(pv10)) & leq(n0,A) -> (all B (leq(n0,B) & leq(B,n4) -> init = a_select3(q_init,A,B))))) & (all C (leq(C,n4) & leq(n0,C) -> a_select3(center_init,C,n0) = init)) & leq(n0,pv10) -> (all D all E (leq(n0,D) & leq(n0,E) & leq(E,n4) & leq(D,n135299) -> (gt(pv10,D) -> a_select3(q_init,D,E) = init)))) # label(cl5_nebula_init_0046) # label(negated_conjecture) # label(non_clause). [assumption]. 20.07/20.56 20.07/20.56 ============================== end of process non-clausal formulas === 20.07/20.56 20.07/20.56 ============================== PROCESS INITIAL CLAUSES =============== 20.07/20.56 20.07/20.56 ============================== PREDICATE ELIMINATION ================= 20.07/20.56 57 geq(A,B) | -leq(B,A) # label(leq_geq) # label(axiom). [clausify(37)]. 20.07/20.56 58 -geq(A,B) | leq(B,A) # label(leq_geq) # label(axiom). [clausify(37)]. 20.07/20.56 59 lt(A,B) | -gt(B,A) # label(lt_gt) # label(axiom). [clausify(39)]. 20.07/20.56 60 -lt(A,B) | gt(B,A) # label(lt_gt) # label(axiom). [clausify(39)]. 20.07/20.56 20.07/20.56 ============================== end predicate elimination ============= 20.07/20.56 20.07/20.56 Auto_denials: (non-Horn, no changes). 20.07/20.56 20.07/20.56 Term ordering decisions: 20.07/20.56 Function symbol KB weights: n0=1. n1=1. n4=1. n2=1. n3=1. n5=1. tptp_minus_1=1. n135299=1. pv10=1. init=1. center_init=1. q_init=1. tptp_float_0_0=1. def=1. use=1. c1=1. c2=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. 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. 20.07/20.56 20.07/20.56 ============================== end of process initial clauses ======== 20.07/20.56 20.07/20.56 ============================== CLAUSES FOR SEARCH ==================== 20.07/20.56 20.07/20.56 ============================== end of clauses for search ============= 20.07/20.56 20.07/20.56 ============================== SEARCH ================================ 20.07/20.56 20.07/20.56 % Starting search at 0.25 seconds. 20.07/20.56 20.07/20.56 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 728 (0.00 of 1.19 sec). 20.07/20.56 20.07/20.56 Low Water (keep): wt=173.000, iters=3678 20.07/20.56 20.07/20.56 Low Water (keep): wt=143.000, iters=3576 20.07/20.56 20.07/20.56 Low Water (keep): wt=119.000, iters=3690 20.07/20.56 20.07/20.56 Low Water (keep): wt=116.000, iters=3768 20.07/20.56 20.07/20.56 Low Water (keep): wt=113.000, iters=4026 20.07/20.56 20.07/20.56 Low Water (keep): wt=110.000, iters=3906 20.07/20.56 20.07/20.56 Low Water (keep): wt=86.000, iters=3386 20.07/20.56 20.07/20.56 Low Water (keep): wt=83.000, iters=3616 20.07/20.56 20.07/20.56 Low Water (keep): wt=80.000, iters=3416 20.07/20.56 20.07/20.56 Low Water (keep): wt=58.000, iters=3408 20.07/20.56 20.07/20.56 Low Water (keep): wt=50.000, iters=3479 20.07/20.56 20.07/20.56 Low Water (keep): wt=46.000, iters=3440 20.07/20.56 20.07/20.56 Low Water (keep): wt=43.000, iters=3360 20.07/20.56 20.07/20.56 Low Water (keep): wt=37.000, iters=3400 20.07/20.56 20.07/20.56 Low Water (displace): id=6804, wt=179.000 20.07/20.56 20.07/20.56 Low Water (displace): id=10926, wt=34.000 20.07/20.56 20.07/20.56 Low Water (displace): id=10927, wt=31.000 20.07/20.56 20.07/20.56 Low Water (displace): id=10988, wt=25.000 20.07/20.56 20.07/20.56 Low Water (displace): id=10989, wt=22.000 20.07/20.56 20.07/20.56 Low Water (displace): id=10996, wt=20.000 20.07/20.56 20.07/20.56 Low Water (keep): wt=34.000, iters=3445 20.07/20.56 20.07/20.56 Low Water (displace): id=11180, wt=19.000 20.07/20.56 20.07/20.56 Low Water (keep): wt=32.000, iters=3358 20.07/20.56 20.07/20.56 Low Water (displace): id=12621, wt=17.000 20.07/20.56 20.07/20.56 Low Water (displace): id=12650, wt=16.000 20.07/20.56 20.07/20.56 Low Water (keep): wt=31.000, iters=3368 20.07/20.56 20.07/20.56 Low Water (keep): wt=30.000, iters=3380 20.07/20.56 20.07/20.56 Low Water (keep): wt=28.000, iters=3360 20.07/20.56 20.07/20.56 Low Water (keep): wt=27.000, iters=3343 20.07/20.56 20.07/20.56 Low Water (keep): wt=26.000, iters=3348 20.07/20.56 20.07/20.56 Low Water (keep): wt=25.000, iters=3369 20.07/20.56 20.07/20.56 Low Water (displace): id=19125, wt=8.000 20.07/20.56 20.07/20.56 Low Water (displace): id=19163, wt=7.000 20.07/20.56 20.07/20.56 Low Water (displace): id=19170, wt=6.000 20.07/20.56 20.07/20.56 Low Water (keep): wt=24.000, iters=3350 20.07/20.56 20.07/20.56 Low Water (keep): wt=23.000, iters=3352 20.07/20.56 20.07/20.56 Low Water (keep): wt=22.000, iters=3355 20.07/20.56 20.07/20.56 Low Water (keep): wt=21.000, iters=3338 20.07/20.56 20.07/20.56 Low Water (keep): wt=20.000, iters=3355 20.07/20.56 20.07/20.56 Low Water (keep): wt=19.000, iters=3373 20.07/20.56 20.07/20.56 Low Water (keep): wt=18.000, iters=3333 20.07/20.56 20.07/20.56 Low Water (keep): wt=17.000, iters=3343 20.07/20.56 20.07/20.56 Low Water (keep): wt=16.000, iters=3340 20.07/20.56 20.07/20.56 Low Water (keep): wt=15.000, iters=3333 20.07/20.56 20.07/20.56 ============================== PROOF ================================= 20.07/20.56 % SZS status Theorem 20.07/20.56 % SZS output start Refutation 20.07/20.56 20.07/20.56 % Proof 1 at 18.90 (+ 0.43) seconds. 20.07/20.56 % Length of proof is 12. 20.07/20.56 % Level of proof is 3. 20.07/20.56 % Maximum clause weight is 19.000. 20.07/20.56 % Given clauses 2828. 20.07/20.56 20.07/20.56 38 (all X all Y (gt(Y,X) <-> leq(X,pred(Y)))) # label(leq_gt_pred) # label(axiom) # label(non_clause). [assumption]. 20.07/20.56 56 -(leq(pv10,n135299) & (all A (leq(A,pred(pv10)) & leq(n0,A) -> (all B (leq(n0,B) & leq(B,n4) -> init = a_select3(q_init,A,B))))) & (all C (leq(C,n4) & leq(n0,C) -> a_select3(center_init,C,n0) = init)) & leq(n0,pv10) -> (all D all E (leq(n0,D) & leq(n0,E) & leq(E,n4) & leq(D,n135299) -> (gt(pv10,D) -> a_select3(q_init,D,E) = init)))) # label(cl5_nebula_init_0046) # label(negated_conjecture) # label(non_clause). [assumption]. 20.07/20.56 306 -gt(A,B) | leq(B,pred(A)) # label(leq_gt_pred) # label(axiom). [clausify(38)]. 20.07/20.56 368 -leq(A,pred(pv10)) | -leq(n0,A) | -leq(n0,B) | -leq(B,n4) | a_select3(q_init,A,B) = init # label(cl5_nebula_init_0046) # label(negated_conjecture). [clausify(56)]. 20.07/20.56 371 leq(n0,c1) # label(cl5_nebula_init_0046) # label(negated_conjecture). [clausify(56)]. 20.07/20.56 372 leq(n0,c2) # label(cl5_nebula_init_0046) # label(negated_conjecture). [clausify(56)]. 20.07/20.56 373 leq(c2,n4) # label(cl5_nebula_init_0046) # label(negated_conjecture). [clausify(56)]. 20.07/20.56 375 gt(pv10,c1) # label(cl5_nebula_init_0046) # label(negated_conjecture). [clausify(56)]. 20.07/20.56 376 a_select3(q_init,c1,c2) != init # label(cl5_nebula_init_0046) # label(negated_conjecture). [clausify(56)]. 20.07/20.56 3534 -leq(A,pred(pv10)) | -leq(n0,A) | a_select3(q_init,A,c2) = init. [resolve(372,a,368,c),unit_del(c,373)]. 20.07/20.56 4839 leq(c1,pred(pv10)). [resolve(375,a,306,a)]. 20.07/20.56 42818 $F. [resolve(3534,a,4839,a),unit_del(a,371),unit_del(b,376)]. 20.07/20.56 20.07/20.56 % SZS output end Refutation 20.07/20.56 ============================== end of proof ========================== 20.07/20.56 20.07/20.56 ============================== STATISTICS ============================ 20.07/20.56 20.07/20.56 Given=2828. Generated=854981. Kept=42741. proofs=1. 20.07/20.56 Usable=2807. Sos=9999. Demods=1270. Limbo=7, Disabled=30232. Hints=0. 20.07/20.56 Megabytes=43.26. 20.07/20.56 User_CPU=18.90, System_CPU=0.43, Wall_clock=19. 20.07/20.56 20.07/20.56 ============================== end of statistics ===================== 20.07/20.56 20.07/20.56 ============================== end of search ========================= 20.07/20.56 20.07/20.56 THEOREM PROVED 20.07/20.56 % SZS status Theorem 20.07/20.56 20.07/20.56 Exiting with 1 proof. 20.07/20.56 20.07/20.56 Process 18063 exit (max_proofs) Thu Jul 2 06:58:45 2020 20.07/20.56 Prover9 interrupted 20.07/20.56 EOF