0.08/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s 0.14/0.35 % Computer : n019.cluster.edu 0.14/0.35 % Model : x86_64 x86_64 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.35 % Memory : 8042.1875MB 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.35 % CPULimit : 960 0.14/0.36 % WCLimit : 120 0.14/0.36 % DateTime : Tue Aug 9 02:25:51 EDT 2022 0.14/0.36 % CPUTime : 0.81/1.12 ============================== Prover9 =============================== 0.81/1.12 Prover9 (32) version 2009-11A, November 2009. 0.81/1.12 Process 19581 was started by sandbox2 on n019.cluster.edu, 0.81/1.12 Tue Aug 9 02:25:51 2022 0.81/1.12 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_19427_n019.cluster.edu". 0.81/1.12 ============================== end of head =========================== 0.81/1.12 0.81/1.12 ============================== INPUT ================================= 0.81/1.12 0.81/1.12 % Reading from file /tmp/Prover9_19427_n019.cluster.edu 0.81/1.12 0.81/1.12 set(prolog_style_variables). 0.81/1.12 set(auto2). 0.81/1.12 % set(auto2) -> set(auto). 0.81/1.12 % set(auto) -> set(auto_inference). 0.81/1.12 % set(auto) -> set(auto_setup). 0.81/1.12 % set(auto_setup) -> set(predicate_elim). 0.81/1.12 % set(auto_setup) -> assign(eq_defs, unfold). 0.81/1.12 % set(auto) -> set(auto_limits). 0.81/1.12 % set(auto_limits) -> assign(max_weight, "100.000"). 0.81/1.12 % set(auto_limits) -> assign(sos_limit, 20000). 0.81/1.12 % set(auto) -> set(auto_denials). 0.81/1.12 % set(auto) -> set(auto_process). 0.81/1.12 % set(auto2) -> assign(new_constants, 1). 0.81/1.12 % set(auto2) -> assign(fold_denial_max, 3). 0.81/1.12 % set(auto2) -> assign(max_weight, "200.000"). 0.81/1.12 % set(auto2) -> assign(max_hours, 1). 0.81/1.12 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.81/1.12 % set(auto2) -> assign(max_seconds, 0). 0.81/1.12 % set(auto2) -> assign(max_minutes, 5). 0.81/1.12 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.81/1.12 % set(auto2) -> set(sort_initial_sos). 0.81/1.12 % set(auto2) -> assign(sos_limit, -1). 0.81/1.12 % set(auto2) -> assign(lrs_ticks, 3000). 0.81/1.12 % set(auto2) -> assign(max_megs, 400). 0.81/1.12 % set(auto2) -> assign(stats, some). 0.81/1.12 % set(auto2) -> clear(echo_input). 0.81/1.12 % set(auto2) -> set(quiet). 0.81/1.12 % set(auto2) -> clear(print_initial_clauses). 0.81/1.12 % set(auto2) -> clear(print_given). 0.81/1.12 assign(lrs_ticks,-1). 0.81/1.12 assign(sos_limit,10000). 0.81/1.12 assign(order,kbo). 0.81/1.12 set(lex_order_vars). 0.81/1.12 clear(print_given). 0.81/1.12 0.81/1.12 % formulas(sos). % not echoed (92 formulas) 0.81/1.12 0.81/1.12 ============================== end of input ========================== 0.81/1.12 0.81/1.12 % From the command line: assign(max_seconds, 960). 0.81/1.12 0.81/1.12 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.81/1.12 0.81/1.12 % Formulas that are not ordinary clauses: 0.81/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.81/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.81/1.12 3 (all X all Y (gt(Y,X) -> leq(X,Y))) # label(leq_gt1) # label(axiom) # label(non_clause). [assumption]. 0.81/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.81/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.81/1.12 6 (all X minus(X,n1) = pred(X)) # label(pred_minus_1) # label(axiom) # label(non_clause). [assumption]. 0.81/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.81/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.81/1.12 9 (all X pred(succ(X)) = X) # label(pred_succ) # label(axiom) # label(non_clause). [assumption]. 0.81/1.12 10 (all X succ(succ(X)) = plus(X,n2)) # label(succ_plus_2_r) # label(axiom) # label(non_clause). [assumption]. 0.81/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.81/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.81/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.81/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.81/1.12 15 (all X leq(X,X)) # label(reflexivity_leq) # label(axiom) # label(non_clause). [assumption]. 0.81/1.12 16 (all Body n0 = sum(n0,tptp_minus_1,Body)) # label(sum_plus_base) # label(axiom) # label(non_clause). [assumption]. 0.81/1.12 17 (all X -gt(X,X)) # label(irreflexivity_gt) # label(axiom) # label(non_clause). [assumption]. 0.81/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.81/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.81/1.12 20 (all X all Y (gt(Y,X) | X = Y | gt(X,Y))) # label(totality) # label(axiom) # label(non_clause). [assumption]. 0.81/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.81/1.12 22 (all X succ(X) = plus(n1,X)) # label(succ_plus_1_l) # label(axiom) # label(non_clause). [assumption]. 0.81/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.81/1.12 24 (all X gt(succ(X),X)) # label(gt_succ) # label(axiom) # label(non_clause). [assumption]. 0.81/1.12 25 (all X all Y (leq(X,Y) -> leq(X,succ(Y)))) # label(leq_succ) # label(axiom) # label(non_clause). [assumption]. 0.81/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.81/1.12 27 (all X plus(n3,X) = succ(succ(succ(X)))) # label(succ_plus_3_l) # label(axiom) # label(non_clause). [assumption]. 0.81/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.81/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.81/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.81/1.12 31 (all X succ(succ(X)) = plus(n2,X)) # label(succ_plus_2_l) # label(axiom) # label(non_clause). [assumption]. 0.81/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.81/1.12 33 (all X all Y (lt(X,Y) <-> gt(Y,X))) # label(lt_gt) # label(axiom) # label(non_clause). [assumption]. 0.81/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.81/1.13 35 (all X all Y (leq(X,Y) & Y != X -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause). [assumption]. 0.81/1.13 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.81/1.13 37 (all X succ(succ(succ(succ(X)))) = plus(n4,X)) # label(succ_plus_4_l) # label(axiom) # label(non_clause). [assumption]. 0.81/1.13 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.81/1.13 39 (all X plus(X,n4) = succ(succ(succ(succ(X))))) # label(succ_plus_4_r) # label(axiom) # label(non_clause). [assumption]. 0.81/1.13 40 (all X all Y (geq(X,Y) <-> leq(Y,X))) # label(leq_geq) # label(axiom) # label(non_clause). [assumption]. 0.81/1.13 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.81/1.13 42 (all X succ(X) = plus(X,n1)) # label(succ_plus_1_r) # label(axiom) # label(non_clause). [assumption]. 0.81/1.13 43 (all X succ(succ(succ(X))) = plus(X,n3)) # label(succ_plus_3_r) # label(axiom) # label(non_clause). [assumption]. 0.81/1.13 44 (all X all Y (leq(X,pred(Y)) <-> gt(Y,X))) # label(leq_gt_pred) # label(axiom) # label(non_clause). [assumption]. 0.81/1.13 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.81/1.13 46 (all X X = succ(pred(X))) # label(succ_pred) # label(axiom) # label(non_clause). [assumption]. 0.81/1.13 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.81/1.13 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.81/1.13 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.81/1.13 50 (all X (leq(n0,X) & leq(X,n1) -> n1 = X | n0 = X)) # label(finite_domain_1) # label(axiom) # label(non_clause). [assumption]. 0.81/1.13 51 (all X (leq(X,n0) & leq(n0,X) -> n0 = X)) # label(finite_domain_0) # label(axiom) # label(non_clause). [assumption]. 0.81/1.13 52 (all X (leq(n0,X) & leq(X,n5) -> n1 = X | n2 = X | X = n3 | X = n4 | X = n5 | X = n0)) # label(finite_domain_5) # label(axiom) # label(non_clause). [assumption]. 0.81/1.13 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.81/1.13 54 (all X (leq(n0,X) & leq(X,n4) -> n2 = X | X = n4 | n3 = X | X = n1 | X = n0)) # label(finite_domain_4) # label(axiom) # label(non_clause). [assumption]. 0.81/1.13 55 (all X (leq(n0,X) & leq(X,n2) -> n0 = X | X = n2 | X = n1)) # label(finite_domain_2) # label(axiom) # label(non_clause). [assumption]. 0.81/1.13 56 -(a_select2(sigma_init,pv40) = init & (all E (leq(n0,E) & leq(E,pred(pv40)) -> a_select2(sigma_init,E) = init)) & (gt(loopcounter,n1) -> (all G (leq(G,n4) & leq(n0,G) -> init = a_select2(muold_init,G)))) & (gt(loopcounter,n1) -> (all H (leq(H,n4) & leq(n0,H) -> init = a_select2(rhoold_init,H)))) & (gt(loopcounter,n1) -> (all I (leq(I,n4) & leq(n0,I) -> a_select2(sigmaold_init,I) = init))) & (all F (leq(n0,F) & leq(F,n4) -> init = a_select3(center_init,F,n0))) & (all D (leq(n0,D) & leq(D,pred(pv40)) -> a_select2(mu_init,D) = init)) & (all C (leq(n0,C) & leq(C,n4) -> init = a_select2(rho_init,C))) & (all A (leq(A,n135299) & leq(n0,A) -> (all B (leq(n0,B) & leq(B,n4) -> init = a_select3(q_init,A,B))))) & leq(pv40,n4) & leq(n0,pv40) & init = a_select2(mu_init,pv40) -> (all J (leq(J,pv40) & leq(n0,J) -> init = a_select2(mu_init,J)))) # label(cl5_nebula_init_0011) # label(negated_conjecture) # label(non_clause). [assumption]. 22.69/23.01 22.69/23.01 ============================== end of process non-clausal formulas === 22.69/23.01 22.69/23.01 ============================== PROCESS INITIAL CLAUSES =============== 22.69/23.01 22.69/23.01 ============================== PREDICATE ELIMINATION ================= 22.69/23.01 57 lt(A,B) | -gt(B,A) # label(lt_gt) # label(axiom). [clausify(33)]. 22.69/23.01 58 -lt(A,B) | gt(B,A) # label(lt_gt) # label(axiom). [clausify(33)]. 22.69/23.01 59 geq(A,B) | -leq(B,A) # label(leq_geq) # label(axiom). [clausify(40)]. 22.69/23.01 60 -geq(A,B) | leq(B,A) # label(leq_geq) # label(axiom). [clausify(40)]. 22.69/23.01 22.69/23.01 ============================== end predicate elimination ============= 22.69/23.01 22.69/23.01 Auto_denials: (non-Horn, no changes). 22.69/23.01 22.69/23.01 Term ordering decisions: 22.69/23.01 Function symbol KB weights: n0=1. n1=1. n4=1. n2=1. n3=1. n5=1. init=1. tptp_minus_1=1. n135299=1. pv40=1. loopcounter=1. mu_init=1. sigma_init=1. center_init=1. muold_init=1. q_init=1. rho_init=1. rhoold_init=1. sigmaold_init=1. tptp_float_0_0=1. def=1. use=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. 22.69/23.01 22.69/23.01 ============================== end of process initial clauses ======== 22.69/23.01 22.69/23.01 ============================== CLAUSES FOR SEARCH ==================== 22.69/23.01 22.69/23.01 ============================== end of clauses for search ============= 22.69/23.01 22.69/23.01 ============================== SEARCH ================================ 22.69/23.01 22.69/23.01 % Starting search at 0.27 seconds. 22.69/23.01 22.69/23.01 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 657 (0.00 of 1.21 sec). 22.69/23.01 22.69/23.01 Low Water (keep): wt=176.000, iters=3435 22.69/23.01 22.69/23.01 Low Water (keep): wt=146.000, iters=3381 22.69/23.01 22.69/23.01 Low Water (keep): wt=119.000, iters=3461 22.69/23.01 22.69/23.01 Low Water (keep): wt=116.000, iters=3596 22.69/23.01 22.69/23.01 Low Water (keep): wt=113.000, iters=3642 22.69/23.01 22.69/23.01 Low Water (keep): wt=110.000, iters=3552 22.69/23.01 22.69/23.01 Low Water (keep): wt=89.000, iters=3462 22.69/23.01 22.69/23.01 Low Water (keep): wt=86.000, iters=3581 22.69/23.01 22.69/23.01 Low Water (keep): wt=83.000, iters=3340 22.69/23.01 22.69/23.01 Low Water (keep): wt=64.000, iters=3334 22.69/23.01 22.69/23.01 Low Water (keep): wt=53.000, iters=3453 22.69/23.01 22.69/23.01 Low Water (keep): wt=49.000, iters=3437 22.69/23.01 22.69/23.01 Low Water (keep): wt=46.000, iters=3405 22.69/23.01 22.69/23.01 Low Water (keep): wt=40.000, iters=3338 22.69/23.01 22.69/23.01 Low Water (keep): wt=37.000, iters=3348 22.69/23.01 22.69/23.01 Low Water (keep): wt=34.000, iters=3400 22.69/23.01 22.69/23.01 Low Water (displace): id=5567, wt=179.000 22.69/23.01 22.69/23.01 Low Water (displace): id=10974, wt=25.000 22.69/23.01 22.69/23.01 Low Water (displace): id=10975, wt=22.000 22.69/23.01 22.69/23.01 Low Water (displace): id=10992, wt=19.000 22.69/23.01 22.69/23.01 Low Water (displace): id=11108, wt=16.000 22.69/23.01 22.69/23.01 Low Water (displace): id=11196, wt=12.000 22.69/23.01 22.69/23.01 Low Water (displace): id=11198, wt=9.000 22.69/23.01 22.69/23.01 Low Water (keep): wt=33.000, iters=3361 22.69/23.01 22.69/23.01 Low Water (keep): wt=32.000, iters=3371 22.69/23.01 22.69/23.01 Low Water (keep): wt=31.000, iters=3336 22.69/23.01 22.69/23.01 Low Water (displace): id=14962, wt=8.000 22.69/23.01 22.69/23.01 Low Water (displace): id=15114, wt=7.000 22.69/23.01 22.69/23.01 Low Water (displace): id=15817, wt=6.000 22.69/23.01 22.69/23.01 Low Water (keep): wt=29.000, iters=3353 22.69/23.01 22.69/23.01 Low Water (keep): wt=28.000, iters=3354 22.69/23.01 22.69/23.01 Low Water (keep): wt=27.000, iters=3358 22.69/23.01 22.69/23.01 Low Water (keep): wt=26.000, iters=3341 22.69/23.01 22.69/23.01 Low Water (keep): wt=25.000, iters=3335 22.69/23.01 22.69/23.01 Low Water (keep): wt=24.000, iters=3341 22.69/23.01 22.69/23.01 Low Water (keep): wt=23.000, iters=3376 22.69/23.01 22.69/23.01 Low Water (keep): wt=22.000, iters=3355 22.69/23.01 22.69/23.01 Low Water (displace): id=39525, wt=5.000 22.69/23.01 22.69/23.01 Low Water (keep): wt=21.000, iters=3365 22.69/23.01 22.69/23.01 Low Water (keep): wt=20.000, iters=3337 22.69/23.01 22.69/23.01 Low Water (keep): wt=19.000, iters=3335 22.69/23.01 22.69/23.01 Low Water (keep): wt=18.000, iters=3339 22.69/23.01 22.69/23.01 Low Water (keep): wt=17.000, iters=3385 22.69/23.01 22.69/23.01 Low Water (keep): wt=16.000, iters=3345 24.37/24.66 24.37/24.66 ============================== PROOF ================================= 24.37/24.66 % SZS status Theorem 24.37/24.66 % SZS output start Refutation 24.37/24.66 24.37/24.66 % Proof 1 at 23.04 (+ 0.52) seconds. 24.37/24.66 % Length of proof is 22. 24.37/24.66 % Level of proof is 8. 24.37/24.66 % Maximum clause weight is 14.000. 24.37/24.66 % Given clauses 2970. 24.37/24.66 24.37/24.66 35 (all X all Y (leq(X,Y) & Y != X -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause). [assumption]. 24.37/24.66 44 (all X all Y (leq(X,pred(Y)) <-> gt(Y,X))) # label(leq_gt_pred) # label(axiom) # label(non_clause). [assumption]. 24.37/24.66 56 -(a_select2(sigma_init,pv40) = init & (all E (leq(n0,E) & leq(E,pred(pv40)) -> a_select2(sigma_init,E) = init)) & (gt(loopcounter,n1) -> (all G (leq(G,n4) & leq(n0,G) -> init = a_select2(muold_init,G)))) & (gt(loopcounter,n1) -> (all H (leq(H,n4) & leq(n0,H) -> init = a_select2(rhoold_init,H)))) & (gt(loopcounter,n1) -> (all I (leq(I,n4) & leq(n0,I) -> a_select2(sigmaold_init,I) = init))) & (all F (leq(n0,F) & leq(F,n4) -> init = a_select3(center_init,F,n0))) & (all D (leq(n0,D) & leq(D,pred(pv40)) -> a_select2(mu_init,D) = init)) & (all C (leq(n0,C) & leq(C,n4) -> init = a_select2(rho_init,C))) & (all A (leq(A,n135299) & leq(n0,A) -> (all B (leq(n0,B) & leq(B,n4) -> init = a_select3(q_init,A,B))))) & leq(pv40,n4) & leq(n0,pv40) & init = a_select2(mu_init,pv40) -> (all J (leq(J,pv40) & leq(n0,J) -> init = a_select2(mu_init,J)))) # label(cl5_nebula_init_0011) # label(negated_conjecture) # label(non_clause). [assumption]. 24.37/24.66 267 -leq(A,B) | B = A | gt(B,A) # label(leq_gt2) # label(axiom). [clausify(35)]. 24.37/24.66 307 leq(A,pred(B)) | -gt(B,A) # label(leq_gt_pred) # label(axiom). [clausify(44)]. 24.37/24.66 372 a_select2(sigma_init,pv40) = init # label(cl5_nebula_init_0011) # label(negated_conjecture). [clausify(56)]. 24.37/24.66 373 init = a_select2(sigma_init,pv40). [copy(372),flip(a)]. 24.37/24.66 384 -leq(n0,A) | -leq(A,pred(pv40)) | a_select2(mu_init,A) = init # label(cl5_nebula_init_0011) # label(negated_conjecture). [clausify(56)]. 24.37/24.66 385 -leq(n0,A) | -leq(A,pred(pv40)) | a_select2(mu_init,A) = a_select2(sigma_init,pv40). [copy(384),rewrite([373(8)])]. 24.37/24.66 392 a_select2(mu_init,pv40) = init # label(cl5_nebula_init_0011) # label(negated_conjecture). [clausify(56)]. 24.37/24.66 393 a_select2(sigma_init,pv40) = a_select2(mu_init,pv40). [copy(392),rewrite([373(4)]),flip(a)]. 24.37/24.66 394 leq(c1,pv40) # label(cl5_nebula_init_0011) # label(negated_conjecture). [clausify(56)]. 24.37/24.66 395 leq(n0,c1) # label(cl5_nebula_init_0011) # label(negated_conjecture). [clausify(56)]. 24.37/24.66 396 a_select2(mu_init,c1) != init # label(cl5_nebula_init_0011) # label(negated_conjecture). [clausify(56)]. 24.37/24.66 397 a_select2(mu_init,c1) != a_select2(mu_init,pv40). [copy(396),rewrite([373(4),393(6)])]. 24.37/24.66 870 -leq(n0,A) | -leq(A,pred(pv40)) | a_select2(mu_init,pv40) = a_select2(mu_init,A). [back_rewrite(385),rewrite([393(10)]),flip(c)]. 24.37/24.66 877 a_select2(mu_init,c1) = c_0. [new_symbol(397)]. 24.37/24.66 915 a_select2(mu_init,pv40) != c_0. [back_rewrite(397),rewrite([877(3)]),flip(a)]. 24.37/24.66 2846 c1 = pv40 | gt(pv40,c1). [resolve(394,a,267,a),flip(a)]. 24.37/24.66 38560 c1 = pv40 | leq(c1,pred(pv40)). [resolve(2846,b,307,b)]. 24.37/24.66 56484 c1 = pv40. [resolve(38560,b,870,b),rewrite([877(12)]),unit_del(b,395),unit_del(c,915)]. 24.37/24.66 57043 $F. [back_rewrite(877),rewrite([56484(2)]),unit_del(a,915)]. 24.37/24.66 24.37/24.66 % SZS output end Refutation 24.37/24.66 ============================== end of proof ========================== 24.37/24.66 24.37/24.66 ============================== STATISTICS ============================ 24.37/24.66 24.37/24.66 Given=2970. Generated=912757. Kept=56950. proofs=1. 24.37/24.66 Usable=2541. Sos=7704. Demods=1462. Limbo=559, Disabled=46455. Hints=0. 24.37/24.66 Megabytes=51.66. 24.37/24.66 User_CPU=23.04, System_CPU=0.52, Wall_clock=24. 24.37/24.66 24.37/24.66 ============================== end of statistics ===================== 24.37/24.66 24.37/24.66 ============================== end of search ========================= 24.37/24.66 24.37/24.66 THEOREM PROVED 24.37/24.66 % SZS status Theorem 24.37/24.66 24.37/24.66 Exiting with 1 proof. 24.37/24.66 24.37/24.66 Process 19581 exit (max_proofs) Tue Aug 9 02:26:15 2022 24.37/24.66 Prover9 interrupted 24.37/24.66 EOF