0.08/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.08/0.13 % Command : tptp2X_and_run_prover9 %d %s 0.12/0.34 % Computer : n021.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 : 1200 0.12/0.34 % DateTime : Wed Jul 14 14:00:56 EDT 2021 0.12/0.34 % CPUTime : 0.79/1.07 ============================== Prover9 =============================== 0.79/1.07 Prover9 (32) version 2009-11A, November 2009. 0.79/1.07 Process 21605 was started by sandbox on n021.cluster.edu, 0.79/1.07 Wed Jul 14 14:00:57 2021 0.79/1.07 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_21452_n021.cluster.edu". 0.79/1.07 ============================== end of head =========================== 0.79/1.07 0.79/1.07 ============================== INPUT ================================= 0.79/1.07 0.79/1.07 % Reading from file /tmp/Prover9_21452_n021.cluster.edu 0.79/1.07 0.79/1.07 set(prolog_style_variables). 0.79/1.07 set(auto2). 0.79/1.07 % set(auto2) -> set(auto). 0.79/1.07 % set(auto) -> set(auto_inference). 0.79/1.07 % set(auto) -> set(auto_setup). 0.79/1.07 % set(auto_setup) -> set(predicate_elim). 0.79/1.07 % set(auto_setup) -> assign(eq_defs, unfold). 0.79/1.07 % set(auto) -> set(auto_limits). 0.79/1.07 % set(auto_limits) -> assign(max_weight, "100.000"). 0.79/1.07 % set(auto_limits) -> assign(sos_limit, 20000). 0.79/1.07 % set(auto) -> set(auto_denials). 0.79/1.07 % set(auto) -> set(auto_process). 0.79/1.07 % set(auto2) -> assign(new_constants, 1). 0.79/1.07 % set(auto2) -> assign(fold_denial_max, 3). 0.79/1.07 % set(auto2) -> assign(max_weight, "200.000"). 0.79/1.07 % set(auto2) -> assign(max_hours, 1). 0.79/1.07 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.79/1.07 % set(auto2) -> assign(max_seconds, 0). 0.79/1.07 % set(auto2) -> assign(max_minutes, 5). 0.79/1.07 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.79/1.07 % set(auto2) -> set(sort_initial_sos). 0.79/1.07 % set(auto2) -> assign(sos_limit, -1). 0.79/1.07 % set(auto2) -> assign(lrs_ticks, 3000). 0.79/1.07 % set(auto2) -> assign(max_megs, 400). 0.79/1.07 % set(auto2) -> assign(stats, some). 0.79/1.07 % set(auto2) -> clear(echo_input). 0.79/1.07 % set(auto2) -> set(quiet). 0.79/1.07 % set(auto2) -> clear(print_initial_clauses). 0.79/1.07 % set(auto2) -> clear(print_given). 0.79/1.07 assign(lrs_ticks,-1). 0.79/1.07 assign(sos_limit,10000). 0.79/1.07 assign(order,kbo). 0.79/1.07 set(lex_order_vars). 0.79/1.07 clear(print_given). 0.79/1.07 0.79/1.07 % formulas(sos). % not echoed (92 formulas) 0.79/1.07 0.79/1.07 ============================== end of input ========================== 0.79/1.07 0.79/1.07 % From the command line: assign(max_seconds, 1200). 0.79/1.07 0.79/1.07 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.79/1.07 0.79/1.07 % Formulas that are not ordinary clauses: 0.79/1.07 1 (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.79/1.07 2 (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.07 3 (all X X = pred(succ(X))) # label(pred_succ) # label(axiom) # label(non_clause). [assumption]. 0.79/1.07 4 (all X plus(X,n4) = succ(succ(succ(succ(X))))) # label(succ_plus_4_r) # label(axiom) # label(non_clause). [assumption]. 0.79/1.07 5 (all X all Y (gt(X,Y) | gt(Y,X) | X = Y)) # label(totality) # label(axiom) # label(non_clause). [assumption]. 0.79/1.07 6 (all X all Y (leq(minus(X,Y),X) -> leq(n0,Y))) # label(leq_minus) # label(axiom) # label(non_clause). [assumption]. 0.79/1.07 7 (all A all B all N ((all I all J (leq(I,N) & leq(n0,J) & leq(J,N) & leq(n0,I) -> a_select3(B,J,I) = a_select3(B,I,J))) & (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(n0,J) & leq(J,N) & leq(I,N) & leq(n0,I) -> 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.07 8 (all X all Y (leq(succ(X),succ(Y)) <-> leq(X,Y))) # label(leq_succ_succ) # label(axiom) # label(non_clause). [assumption]. 0.79/1.07 9 (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.79/1.07 10 (all X succ(X) = plus(X,n1)) # label(succ_plus_1_r) # label(axiom) # label(non_clause). [assumption]. 0.79/1.07 11 (all X plus(n1,X) = succ(X)) # label(succ_plus_1_l) # label(axiom) # label(non_clause). [assumption]. 0.79/1.07 12 (all I all U all X all VAL ((all I0 (leq(I0,U) & leq(n0,I0) -> 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.79/1.07 13 (all I all J all U all V all X all VAL all VAL2 (V = J & a_select3(X,U,V) = VAL & I != U -> a_select3(tptp_update3(X,I,J,VAL2),U,V) = VAL)) # label(sel3_update_2) # label(axiom) # label(non_clause). [assumption]. 0.79/1.07 14 (all X X = succ(pred(X))) # label(succ_pred) # label(axiom) # label(non_clause). [assumption]. 0.79/1.07 15 (all A all B all N ((all I all J (leq(n0,I) & leq(n0,J) & leq(J,N) & leq(I,N) -> 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))),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.79/1.07 16 (all X minus(X,n1) = pred(X)) # label(pred_minus_1) # label(axiom) # label(non_clause). [assumption]. 0.79/1.07 17 (all A 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(n0,I) & leq(I,N) & leq(n0,J) & leq(J,N) -> 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.07 18 (all X gt(succ(X),X)) # label(gt_succ) # label(axiom) # label(non_clause). [assumption]. 0.79/1.07 19 (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.07 20 (all X all Y (gt(Y,X) <-> leq(X,pred(Y)))) # label(leq_gt_pred) # label(axiom) # label(non_clause). [assumption]. 0.79/1.07 21 (all Body n0 = sum(n0,tptp_minus_1,Body)) # label(sum_plus_base) # label(axiom) # label(non_clause). [assumption]. 0.79/1.07 22 (all X plus(X,n3) = succ(succ(succ(X)))) # label(succ_plus_3_r) # label(axiom) # label(non_clause). [assumption]. 0.79/1.07 23 (all X all Y (leq(succ(X),Y) -> gt(Y,X))) # label(leq_succ_gt) # label(axiom) # label(non_clause). [assumption]. 0.79/1.07 24 (all X plus(X,n2) = succ(succ(X))) # label(succ_plus_2_r) # label(axiom) # label(non_clause). [assumption]. 0.79/1.07 25 (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.07 26 (all X all Y all Z (gt(X,Y) & gt(Y,Z) -> gt(X,Z))) # label(transitivity_gt) # label(axiom) # label(non_clause). [assumption]. 0.79/1.07 27 (all X leq(X,X)) # label(reflexivity_leq) # label(axiom) # label(non_clause). [assumption]. 0.79/1.07 28 (all A all N ((all I all J (leq(n0,J) & leq(J,N) & leq(I,N) & leq(n0,I) -> a_select3(A,I,J) = a_select3(A,J,I))) -> (all I all J (leq(n0,I) & leq(I,N) & leq(J,N) & leq(n0,J) -> a_select3(inv(A),I,J) = a_select3(inv(A),J,I))))) # label(matrix_symm_inv) # label(axiom) # label(non_clause). [assumption]. 0.79/1.07 29 (all X all Y (geq(X,Y) <-> leq(Y,X))) # label(leq_geq) # label(axiom) # label(non_clause). [assumption]. 0.79/1.07 30 (all I all U all X all VAL all VAL2 (I != U & VAL = a_select2(X,U) -> a_select2(tptp_update2(X,I,VAL2),U) = VAL)) # label(sel2_update_2) # label(axiom) # label(non_clause). [assumption]. 0.79/1.07 31 (all X all Y (gt(Y,X) <-> lt(X,Y))) # label(lt_gt) # label(axiom) # label(non_clause). [assumption]. 0.79/1.07 32 (all X succ(succ(succ(succ(X)))) = plus(n4,X)) # label(succ_plus_4_l) # label(axiom) # label(non_clause). [assumption]. 0.79/1.07 33 (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,J,I) = a_select3(B,I,J))) & (all I all J (leq(n0,I) & leq(n0,J) & leq(J,N) & leq(I,N) -> a_select3(A,I,J) = a_select3(A,J,I))) -> (all I all J (leq(n0,I) & leq(J,N) & leq(n0,J) & 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.79/1.07 34 (all A all B all C all D all E all F all N all M ((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(J,N) & leq(n0,J) & leq(I,N) & leq(n0,I) -> a_select3(F,I,J) = a_select3(F,J,I))) & (all I all J (leq(I,M) & leq(J,M) & leq(n0,J) & leq(n0,I) -> a_select3(D,J,I) = a_select3(D,I,J))) -> (all I all J (leq(n0,J) & leq(J,N) & 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)))),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.08 35 (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) -> a_select3(X,I0,J0) = VAL)) -> VAL = a_select3(tptp_update3(X,U,V,VAL),I,J))) # label(sel3_update_3) # label(axiom) # label(non_clause). [assumption]. 0.79/1.08 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.79/1.08 37 (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.79/1.08 38 (all X all Y (Y != X & leq(X,Y) -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause). [assumption]. 0.79/1.08 39 (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.08 40 (all X all Y (gt(Y,X) -> leq(X,Y))) # label(leq_gt1) # label(axiom) # label(non_clause). [assumption]. 0.79/1.08 41 (all X succ(succ(succ(X))) = plus(n3,X)) # label(succ_plus_3_l) # label(axiom) # label(non_clause). [assumption]. 0.79/1.08 42 (all X -gt(X,X)) # label(irreflexivity_gt) # label(axiom) # label(non_clause). [assumption]. 0.79/1.08 43 (all A 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 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),J,I) = a_select3(tptp_update3(A,K,K,VAL),I,J))))) # label(matrix_symm_update_diagonal) # label(axiom) # label(non_clause). [assumption]. 0.79/1.08 44 (all X succ(succ(succ(succ(succ(X))))) = plus(n5,X)) # label(succ_plus_5_l) # label(axiom) # label(non_clause). [assumption]. 0.79/1.08 45 (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.79/1.08 46 (all A all B all N all M ((all I all J (leq(I,M) & leq(n0,J) & leq(J,M) & 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_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.08 47 (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.08 48 (all X succ(succ(X)) = plus(n2,X)) # label(succ_plus_2_l) # label(axiom) # label(non_clause). [assumption]. 0.79/1.08 49 (all X all Y (leq(X,Y) -> leq(X,succ(Y)))) # label(leq_succ) # label(axiom) # label(non_clause). [assumption]. 0.79/1.08 50 (all X (leq(n0,X) & leq(X,n1) -> n0 = X | n1 = X)) # label(finite_domain_1) # label(axiom) # label(non_clause). [assumption]. 0.79/1.08 51 (all X (leq(n0,X) & leq(X,n3) -> X = n2 | n3 = X | n1 = X | X = n0)) # label(finite_domain_3) # label(axiom) # label(non_clause). [assumption]. 0.79/1.08 52 (all X (leq(n0,X) & leq(X,n0) -> X = n0)) # label(finite_domain_0) # label(axiom) # label(non_clause). [assumption]. 0.79/1.08 53 (all X (leq(n0,X) & leq(X,n2) -> n2 = X | X = n1 | n0 = X)) # label(finite_domain_2) # label(axiom) # label(non_clause). [assumption]. 0.79/1.08 54 (all X (leq(X,n4) & leq(n0,X) -> X = n3 | n4 = X | n2 = X | X = n1 | X = n0)) # label(finite_domain_4) # label(axiom) # label(non_clause). [assumption]. 0.79/1.08 55 (all X (leq(X,n5) & leq(n0,X) -> n1 = X | X = n2 | n3 = X | n5 = X | X = n4 | n0 = X)) # label(finite_domain_5) # label(axiom) # label(non_clause). [assumption]. 0.79/1.08 56 -(leq(pv10,n135299) & (all A (leq(n0,A) & leq(A,pred(pv10)) -> (all B (leq(n0,B) & leq(B,n4) -> a_select3(q_init,A,B) = init)))) & (all C (leq(C,n4) & leq(n0,C) -> init = a_select3(center_init,C,n0))) & leq(n0,pv10) -> (all D all E (leq(n0,D) & leq(E,n4) & leq(D,n135299) & leq(n0,E) -> (gt(pv10,D) -> a_select3(q_init,D,E) = init)))) # label(cl5_nebula_init_0046) # label(negated_conjecture) # label(non_clause). [assumption]. 20.76/21.06 20.76/21.06 ============================== end of process non-clausal formulas === 20.76/21.06 20.76/21.06 ============================== PROCESS INITIAL CLAUSES =============== 20.76/21.06 20.76/21.06 ============================== PREDICATE ELIMINATION ================= 20.76/21.06 57 geq(A,B) | -leq(B,A) # label(leq_geq) # label(axiom). [clausify(29)]. 20.76/21.06 58 -geq(A,B) | leq(B,A) # label(leq_geq) # label(axiom). [clausify(29)]. 20.76/21.06 59 gt(A,B) | -lt(B,A) # label(lt_gt) # label(axiom). [clausify(31)]. 20.76/21.06 60 -gt(A,B) | lt(B,A) # label(lt_gt) # label(axiom). [clausify(31)]. 20.76/21.06 20.76/21.06 ============================== end predicate elimination ============= 20.76/21.06 20.76/21.06 Auto_denials: (non-Horn, no changes). 20.76/21.06 20.76/21.06 Term ordering decisions: 20.76/21.06 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. f8=1. f9=1. f10=1. f11=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. f1=1. f2=1. f3=1. f4=1. f6=1. f7=1. f12=1. f13=1. f14=1. f15=1. tptp_update3=1. f5=1. f26=1. f27=1. f22=1. f23=1. f16=1. f17=1. f18=1. f19=1. f20=1. f21=1. 20.76/21.06 20.76/21.06 ============================== end of process initial clauses ======== 20.76/21.06 20.76/21.06 ============================== CLAUSES FOR SEARCH ==================== 20.76/21.06 20.76/21.06 ============================== end of clauses for search ============= 20.76/21.06 20.76/21.06 ============================== SEARCH ================================ 20.76/21.06 20.76/21.06 % Starting search at 0.26 seconds. 20.76/21.06 20.76/21.06 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 846 (0.00 of 1.17 sec). 20.76/21.06 20.76/21.06 Low Water (keep): wt=179.000, iters=3441 20.76/21.06 20.76/21.06 Low Water (keep): wt=149.000, iters=3428 20.76/21.06 20.76/21.06 Low Water (keep): wt=146.000, iters=3571 20.76/21.06 20.76/21.06 Low Water (keep): wt=140.000, iters=3675 20.76/21.06 20.76/21.06 Low Water (keep): wt=119.000, iters=3652 20.76/21.06 20.76/21.06 Low Water (keep): wt=116.000, iters=3442 20.76/21.06 20.76/21.06 Low Water (keep): wt=110.000, iters=3589 20.76/21.06 20.76/21.06 Low Water (keep): wt=89.000, iters=3469 20.76/21.06 20.76/21.06 Low Water (keep): wt=86.000, iters=3697 20.76/21.06 20.76/21.06 Low Water (keep): wt=80.000, iters=3411 20.76/21.06 20.76/21.06 Low Water (keep): wt=58.000, iters=3371 20.76/21.06 20.76/21.06 Low Water (keep): wt=53.000, iters=3441 20.76/21.06 20.76/21.06 Low Water (keep): wt=49.000, iters=3425 20.76/21.06 20.76/21.06 Low Water (keep): wt=47.000, iters=3385 20.76/21.06 20.76/21.06 Low Water (keep): wt=43.000, iters=3372 20.76/21.06 20.76/21.06 Low Water (keep): wt=40.000, iters=3356 20.76/21.06 20.76/21.06 Low Water (displace): id=4160, wt=179.000 20.76/21.06 20.76/21.06 Low Water (displace): id=10921, wt=31.000 20.76/21.06 20.76/21.06 Low Water (keep): wt=34.000, iters=3372 20.76/21.06 20.76/21.06 Low Water (displace): id=10987, wt=28.000 20.76/21.06 20.76/21.06 Low Water (displace): id=11022, wt=22.000 20.76/21.06 20.76/21.06 Low Water (displace): id=11700, wt=19.000 20.76/21.06 20.76/21.06 Low Water (keep): wt=31.000, iters=3388 20.76/21.06 20.76/21.06 Low Water (displace): id=14233, wt=18.000 20.76/21.06 20.76/21.06 Low Water (displace): id=14376, wt=16.000 20.76/21.06 20.76/21.06 Low Water (keep): wt=30.000, iters=3353 20.76/21.06 20.76/21.06 Low Water (keep): wt=28.000, iters=3335 20.76/21.06 20.76/21.06 Low Water (keep): wt=27.000, iters=3377 20.76/21.06 20.76/21.06 Low Water (keep): wt=26.000, iters=3346 20.76/21.06 20.76/21.06 Low Water (keep): wt=25.000, iters=3350 20.76/21.06 20.76/21.06 Low Water (displace): id=17039, wt=14.000 20.76/21.06 20.76/21.06 Low Water (displace): id=17044, wt=11.000 20.76/21.06 20.76/21.06 Low Water (displace): id=17045, wt=10.000 20.76/21.06 20.76/21.06 Low Water (displace): id=17107, wt=7.000 20.76/21.06 20.76/21.06 Low Water (displace): id=18337, wt=6.000 20.76/21.06 20.76/21.06 Low Water (displace): id=18471, wt=5.000 20.76/21.06 20.76/21.06 Low Water (keep): wt=24.000, iters=3333 20.76/21.06 20.76/21.06 Low Water (keep): wt=23.000, iters=3340 20.76/21.06 20.76/21.06 Low Water (keep): wt=22.000, iters=3373 20.76/21.06 20.76/21.06 Low Water (keep): wt=21.000, iters=3360 20.76/21.06 20.76/21.06 Low Water (keep): wt=20.000, iters=3346 20.76/21.06 20.76/21.06 Low Water (keep): wt=19.000, iters=3420 20.76/21.06 20.76/21.06 Low Water (keep): wt=18.000, iters=3334 20.76/21.06 20.76/21.06 Low Water (keep): wt=17.000, iters=3333 20.76/21.06 20.76/21.06 Low Water (keep): wt=16.000, iters=3344 20.76/21.06 20.76/21.06 Low Water (keep): wt=15.000, iters=3335 20.76/21.06 20.76/21.06 ============================== PROOF ================================= 20.76/21.06 % SZS status Theorem 20.76/21.06 % SZS output start Refutation 20.76/21.06 20.76/21.06 % Proof 1 at 19.55 (+ 0.46) seconds. 20.76/21.06 % Length of proof is 12. 20.76/21.06 % Level of proof is 3. 20.76/21.06 % Maximum clause weight is 19.000. 20.76/21.06 % Given clauses 2943. 20.76/21.06 20.76/21.06 20 (all X all Y (gt(Y,X) <-> leq(X,pred(Y)))) # label(leq_gt_pred) # label(axiom) # label(non_clause). [assumption]. 20.76/21.06 56 -(leq(pv10,n135299) & (all A (leq(n0,A) & leq(A,pred(pv10)) -> (all B (leq(n0,B) & leq(B,n4) -> a_select3(q_init,A,B) = init)))) & (all C (leq(C,n4) & leq(n0,C) -> init = a_select3(center_init,C,n0))) & leq(n0,pv10) -> (all D all E (leq(n0,D) & leq(E,n4) & leq(D,n135299) & leq(n0,E) -> (gt(pv10,D) -> a_select3(q_init,D,E) = init)))) # label(cl5_nebula_init_0046) # label(negated_conjecture) # label(non_clause). [assumption]. 20.76/21.06 118 -gt(A,B) | leq(B,pred(A)) # label(leq_gt_pred) # label(axiom). [clausify(20)]. 20.76/21.06 368 -leq(n0,A) | -leq(A,pred(pv10)) | -leq(n0,B) | -leq(B,n4) | a_select3(q_init,A,B) = init # label(cl5_nebula_init_0046) # label(negated_conjecture). [clausify(56)]. 20.76/21.06 371 leq(n0,c1) # label(cl5_nebula_init_0046) # label(negated_conjecture). [clausify(56)]. 20.76/21.06 372 leq(c2,n4) # label(cl5_nebula_init_0046) # label(negated_conjecture). [clausify(56)]. 20.76/21.06 374 leq(n0,c2) # label(cl5_nebula_init_0046) # label(negated_conjecture). [clausify(56)]. 20.76/21.06 375 gt(pv10,c1) # label(cl5_nebula_init_0046) # label(negated_conjecture). [clausify(56)]. 20.76/21.06 376 a_select3(q_init,c1,c2) != init # label(cl5_nebula_init_0046) # label(negated_conjecture). [clausify(56)]. 20.76/21.06 3542 -leq(n0,A) | -leq(A,pred(pv10)) | a_select3(q_init,A,c2) = init. [resolve(372,a,368,d),unit_del(c,374)]. 20.76/21.06 4849 leq(c1,pred(pv10)). [resolve(375,a,118,a)]. 20.76/21.06 43892 $F. [resolve(3542,b,4849,a),unit_del(a,371),unit_del(b,376)]. 20.76/21.06 20.76/21.06 % SZS output end Refutation 20.76/21.06 ============================== end of proof ========================== 20.76/21.06 20.76/21.06 ============================== STATISTICS ============================ 20.76/21.06 20.76/21.06 Given=2943. Generated=901465. Kept=43815. proofs=1. 20.76/21.06 Usable=2937. Sos=9999. Demods=1395. Limbo=7, Disabled=31176. Hints=0. 20.76/21.06 Megabytes=42.79. 20.76/21.06 User_CPU=19.55, System_CPU=0.46, Wall_clock=20. 20.76/21.06 20.76/21.06 ============================== end of statistics ===================== 20.76/21.06 20.76/21.06 ============================== end of search ========================= 20.76/21.06 20.76/21.06 THEOREM PROVED 20.76/21.06 % SZS status Theorem 20.76/21.06 20.76/21.06 Exiting with 1 proof. 20.76/21.06 20.76/21.06 Process 21605 exit (max_proofs) Wed Jul 14 14:01:17 2021 20.76/21.06 Prover9 interrupted 20.76/21.06 EOF