0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s 0.14/0.34 % Computer : n001.cluster.edu 0.14/0.34 % Model : x86_64 x86_64 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.34 % Memory : 8042.1875MB 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.34 % CPULimit : 1440 0.14/0.34 % WCLimit : 180 0.14/0.34 % DateTime : Mon Jul 3 05:39:59 EDT 2023 0.14/0.34 % CPUTime : 0.44/1.05 ============================== Prover9 =============================== 0.44/1.05 Prover9 (32) version 2009-11A, November 2009. 0.44/1.05 Process 28154 was started by sandbox on n001.cluster.edu, 0.44/1.05 Mon Jul 3 05:40:00 2023 0.44/1.05 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_28001_n001.cluster.edu". 0.44/1.05 ============================== end of head =========================== 0.44/1.05 0.44/1.05 ============================== INPUT ================================= 0.44/1.05 0.44/1.05 % Reading from file /tmp/Prover9_28001_n001.cluster.edu 0.44/1.05 0.44/1.05 set(prolog_style_variables). 0.44/1.05 set(auto2). 0.44/1.05 % set(auto2) -> set(auto). 0.44/1.05 % set(auto) -> set(auto_inference). 0.44/1.05 % set(auto) -> set(auto_setup). 0.44/1.05 % set(auto_setup) -> set(predicate_elim). 0.44/1.05 % set(auto_setup) -> assign(eq_defs, unfold). 0.44/1.05 % set(auto) -> set(auto_limits). 0.44/1.05 % set(auto_limits) -> assign(max_weight, "100.000"). 0.44/1.05 % set(auto_limits) -> assign(sos_limit, 20000). 0.44/1.05 % set(auto) -> set(auto_denials). 0.44/1.05 % set(auto) -> set(auto_process). 0.44/1.05 % set(auto2) -> assign(new_constants, 1). 0.44/1.05 % set(auto2) -> assign(fold_denial_max, 3). 0.44/1.05 % set(auto2) -> assign(max_weight, "200.000"). 0.44/1.05 % set(auto2) -> assign(max_hours, 1). 0.44/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.44/1.05 % set(auto2) -> assign(max_seconds, 0). 0.44/1.05 % set(auto2) -> assign(max_minutes, 5). 0.44/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.44/1.05 % set(auto2) -> set(sort_initial_sos). 0.44/1.05 % set(auto2) -> assign(sos_limit, -1). 0.44/1.05 % set(auto2) -> assign(lrs_ticks, 3000). 0.44/1.05 % set(auto2) -> assign(max_megs, 400). 0.44/1.05 % set(auto2) -> assign(stats, some). 0.44/1.05 % set(auto2) -> clear(echo_input). 0.44/1.05 % set(auto2) -> set(quiet). 0.44/1.05 % set(auto2) -> clear(print_initial_clauses). 0.44/1.05 % set(auto2) -> clear(print_given). 0.44/1.05 assign(lrs_ticks,-1). 0.44/1.05 assign(sos_limit,10000). 0.44/1.05 assign(order,kbo). 0.44/1.05 set(lex_order_vars). 0.44/1.05 clear(print_given). 0.44/1.05 0.44/1.05 % formulas(sos). % not echoed (92 formulas) 0.44/1.05 0.44/1.05 ============================== end of input ========================== 0.44/1.05 0.44/1.05 % From the command line: assign(max_seconds, 1440). 0.44/1.05 0.44/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.44/1.05 0.44/1.05 % Formulas that are not ordinary clauses: 0.44/1.05 1 (all A all N ((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(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.44/1.05 2 (all X plus(n5,X) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_l) # label(axiom) # label(non_clause). [assumption]. 0.44/1.05 3 (all X succ(succ(succ(X))) = plus(n3,X)) # label(succ_plus_3_l) # label(axiom) # label(non_clause). [assumption]. 0.44/1.05 4 (all I all J all U all V all X all VAL ((all I0 all J0 (leq(J0,V) & leq(I0,U) & leq(n0,J0) & leq(n0,I0) -> a_select3(X,I0,J0) = VAL)) & leq(n0,I) & leq(I,U) & leq(J,V) & leq(n0,J) -> a_select3(tptp_update3(X,U,V,VAL),I,J) = VAL)) # label(sel3_update_3) # label(axiom) # label(non_clause). [assumption]. 0.44/1.05 5 (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.44/1.05 6 (all X all Y (leq(minus(X,Y),X) -> leq(n0,Y))) # label(leq_minus) # label(axiom) # label(non_clause). [assumption]. 0.44/1.05 7 (all X succ(succ(succ(succ(X)))) = plus(X,n4)) # label(succ_plus_4_r) # label(axiom) # label(non_clause). [assumption]. 0.44/1.05 8 (all X all Y (gt(Y,X) <-> lt(X,Y))) # label(lt_gt) # label(axiom) # label(non_clause). [assumption]. 0.44/1.05 9 (all X pred(succ(X)) = X) # label(pred_succ) # label(axiom) # label(non_clause). [assumption]. 0.44/1.05 10 (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.44/1.05 11 (all X succ(succ(X)) = plus(n2,X)) # label(succ_plus_2_l) # label(axiom) # label(non_clause). [assumption]. 0.44/1.05 12 (all Body sum(n0,tptp_minus_1,Body) = n0) # label(sum_plus_base) # label(axiom) # label(non_clause). [assumption]. 0.44/1.05 13 (all I all J all U all V all X all VAL all VAL2 (U != I & 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.44/1.05 14 (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,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(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(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.44/1.05 15 (all A all B all N all M ((all I all J (leq(J,M) & leq(n0,J) & leq(I,M) & leq(n0,I) -> 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_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.44/1.05 16 (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 all K all VAL (leq(n0,I) & leq(n0,K) & leq(K,N) & leq(J,N) & leq(n0,J) & 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.44/1.05 17 (all I all L1 all U1 all J all L2 all U2 all Val (leq(L1,I) & leq(J,U2) & leq(L2,J) & leq(I,U1) -> 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.44/1.05 18 (all X succ(X) = plus(X,n1)) # label(succ_plus_1_r) # label(axiom) # label(non_clause). [assumption]. 0.44/1.05 19 (all X leq(X,X)) # label(reflexivity_leq) # label(axiom) # label(non_clause). [assumption]. 0.44/1.05 20 (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.44/1.05 21 (all X all Y (gt(succ(Y),X) <-> leq(X,Y))) # label(leq_succ_gt_equiv) # label(axiom) # label(non_clause). [assumption]. 0.44/1.05 22 (all X all Y (geq(X,Y) <-> leq(Y,X))) # label(leq_geq) # label(axiom) # label(non_clause). [assumption]. 0.44/1.05 23 (all X all Y (gt(Y,X) <-> leq(X,pred(Y)))) # label(leq_gt_pred) # label(axiom) # label(non_clause). [assumption]. 0.44/1.05 24 (all X all Y (gt(Y,X) | Y = X | gt(X,Y))) # label(totality) # label(axiom) # label(non_clause). [assumption]. 0.44/1.05 25 (all A all B all N ((all I all J (leq(n0,I) & leq(J,N) & leq(n0,J) & 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(A,J,I) = a_select3(A,I,J))) -> (all I all J (leq(J,N) & leq(n0,J) & leq(I,N) & 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.44/1.05 26 (all A all B all N ((all I all J (leq(n0,I) & leq(I,N) & leq(J,N) & leq(n0,J) -> a_select3(B,I,J) = a_select3(B,J,I))) -> (all I all J (leq(I,N) & leq(n0,J) & leq(J,N) & 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_aba1) # label(axiom) # label(non_clause). [assumption]. 0.44/1.05 27 (all X all Y (gt(Y,X) -> leq(X,Y))) # label(leq_gt1) # label(axiom) # label(non_clause). [assumption]. 0.44/1.05 28 (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.44/1.05 29 (all X pred(X) = minus(X,n1)) # label(pred_minus_1) # label(axiom) # label(non_clause). [assumption]. 0.44/1.05 30 (all X plus(n4,X) = succ(succ(succ(succ(X))))) # label(succ_plus_4_l) # label(axiom) # label(non_clause). [assumption]. 0.44/1.05 31 (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.44/1.05 32 (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.44/1.05 33 (all X succ(succ(succ(X))) = plus(X,n3)) # label(succ_plus_3_r) # label(axiom) # label(non_clause). [assumption]. 0.44/1.06 34 (all X succ(X) = plus(n1,X)) # label(succ_plus_1_l) # label(axiom) # label(non_clause). [assumption]. 0.44/1.06 35 (all X all Y (leq(X,Y) -> leq(X,succ(Y)))) # label(leq_succ) # label(axiom) # label(non_clause). [assumption]. 0.44/1.06 36 (all X gt(succ(X),X)) # label(gt_succ) # label(axiom) # label(non_clause). [assumption]. 0.44/1.06 37 (all I all U all X all VAL (leq(n0,I) & leq(I,U) & (all I0 (leq(n0,I0) & leq(I0,U) -> a_select2(X,I0) = VAL)) -> a_select2(tptp_update2(X,U,VAL),I) = VAL)) # label(sel2_update_3) # label(axiom) # label(non_clause). [assumption]. 0.44/1.06 38 (all X X = succ(pred(X))) # label(succ_pred) # label(axiom) # label(non_clause). [assumption]. 0.44/1.06 39 (all X all Y (leq(succ(X),Y) -> gt(Y,X))) # label(leq_succ_gt) # label(axiom) # label(non_clause). [assumption]. 0.44/1.06 40 (all A all B all C all D all E all F all N all M ((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,I) & leq(I,N) & leq(n0,J) & leq(J,N) -> a_select3(F,I,J) = a_select3(F,J,I))) & (all I all J (leq(I,M) & leq(n0,J) & leq(J,M) & leq(n0,I) -> a_select3(D,J,I) = a_select3(D,I,J))) -> (all I all J (leq(I,N) & leq(n0,J) & leq(J,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.44/1.06 41 (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.44/1.06 42 (all Body sum(n0,tptp_minus_1,Body) = tptp_float_0_0) # label(sum_plus_base_float) # label(axiom) # label(non_clause). [assumption]. 0.44/1.06 43 (all X all Y (leq(succ(X),succ(Y)) <-> leq(X,Y))) # label(leq_succ_succ) # label(axiom) # label(non_clause). [assumption]. 0.44/1.06 44 (all X all Y (X != Y & leq(X,Y) -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause). [assumption]. 0.44/1.06 45 (all X -gt(X,X)) # label(irreflexivity_gt) # label(axiom) # label(non_clause). [assumption]. 0.44/1.06 46 (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.44/1.06 47 (all X plus(X,n2) = succ(succ(X))) # label(succ_plus_2_r) # label(axiom) # label(non_clause). [assumption]. 0.44/1.06 48 (all X plus(X,n5) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_r) # label(axiom) # label(non_clause). [assumption]. 0.44/1.06 49 (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 (leq(I,N) & leq(J,N) & leq(n0,J) & leq(n0,I) -> a_select3(trans(A),J,I) = a_select3(trans(A),I,J))))) # label(matrix_symm_trans) # label(axiom) # label(non_clause). [assumption]. 0.44/1.06 50 (all X (leq(n0,X) & leq(X,n1) -> X = n0 | X = n1)) # label(finite_domain_1) # label(axiom) # label(non_clause). [assumption]. 0.44/1.06 51 (all X (leq(X,n0) & leq(n0,X) -> n0 = X)) # label(finite_domain_0) # label(axiom) # label(non_clause). [assumption]. 0.44/1.06 52 (all X (leq(X,n4) & leq(n0,X) -> X = n1 | X = n4 | n3 = X | X = n2 | X = n0)) # label(finite_domain_4) # label(axiom) # label(non_clause). [assumption]. 0.44/1.06 53 (all X (leq(X,n3) & leq(n0,X) -> X = n0 | n1 = X | n3 = X | X = n2)) # label(finite_domain_3) # label(axiom) # label(non_clause). [assumption]. 0.44/1.06 54 (all X (leq(n0,X) & leq(X,n5) -> n1 = X | X = n2 | X = n5 | n4 = X | n3 = X | n0 = X)) # label(finite_domain_5) # label(axiom) # label(non_clause). [assumption]. 0.44/1.06 55 (all X (leq(n0,X) & leq(X,n2) -> n1 = X | X = n2 | X = n0)) # label(finite_domain_2) # label(axiom) # label(non_clause). [assumption]. 0.44/1.06 56 -(a_select2(rho_defuse,n1) = use & a_select2(rho_defuse,n2) = use & use = a_select2(sigma_defuse,n0) & a_select2(sigma_defuse,n4) = use & use = a_select2(xinit_defuse,n3) & a_select2(xinit_defuse,n5) = use & a_select2(xinit_mean_defuse,n1) = use & a_select2(xinit_mean_defuse,n2) = use & (all C all D (leq(n0,D) & leq(D,pred(pv5)) & leq(C,n2) & leq(n0,C) -> use = a_select3(z_defuse,C,D))) & (all A all B (leq(n0,B) & leq(B,pred(pv5)) & leq(A,n2) & leq(n0,A) -> a_select3(u_defuse,A,B) = use)) & gt(pv5,n0) & leq(pv5,n998) & leq(n0,pv5) & a_select2(xinit_noise_defuse,n5) = use & a_select2(xinit_noise_defuse,n4) = use & a_select2(xinit_noise_defuse,n3) = use & use = a_select2(xinit_noise_defuse,n2) & a_select2(xinit_noise_defuse,n1) = use & a_select2(xinit_noise_defuse,n0) = use & use = a_select2(xinit_mean_defuse,n5) & use = a_select2(xinit_mean_defuse,n4) & a_select2(xinit_mean_defuse,n3) = use & a_select2(xinit_mean_defuse,n0) = use & a_select2(xinit_defuse,n4) = use & a_select3(u_defuse,n2,n0) = use & use = a_select3(u_defuse,n1,n0) & a_select3(u_defuse,n0,n0) = use & use = a_select2(sigma_defuse,n5) & a_select2(sigma_defuse,n3) = use & use = a_select2(sigma_defuse,n2) & a_select2(sigma_defuse,n1) = use & use = a_select2(rho_defuse,n0) -> (all E all F (leq(n0,E) & leq(n0,F) & leq(E,n2) & leq(F,pv5) -> (-(F = pv5 & E = n0) & -(n2 = E & pv5 = F) & -(n1 = E & pv5 = F) -> a_select3(z_defuse,E,F) = use)))) # label(quaternion_ds1_inuse_0014) # label(negated_conjecture) # label(non_clause). [assumption]. 4.18/4.47 4.18/4.47 ============================== end of process non-clausal formulas === 4.18/4.47 4.18/4.47 ============================== PROCESS INITIAL CLAUSES =============== 4.18/4.47 4.18/4.47 ============================== PREDICATE ELIMINATION ================= 4.18/4.47 57 gt(A,B) | -lt(B,A) # label(lt_gt) # label(axiom). [clausify(8)]. 4.18/4.47 58 -gt(A,B) | lt(B,A) # label(lt_gt) # label(axiom). [clausify(8)]. 4.18/4.47 59 geq(A,B) | -leq(B,A) # label(leq_geq) # label(axiom). [clausify(22)]. 4.18/4.47 60 -geq(A,B) | leq(B,A) # label(leq_geq) # label(axiom). [clausify(22)]. 4.18/4.47 4.18/4.47 ============================== end predicate elimination ============= 4.18/4.47 4.18/4.47 Auto_denials: (non-Horn, no changes). 4.18/4.47 4.18/4.47 Term ordering decisions: 4.18/4.47 Function symbol KB weights: n0=1. use=1. n2=1. n1=1. n3=1. n4=1. n5=1. tptp_minus_1=1. n998=1. pv5=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. c2=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. f1=1. f2=1. f11=1. f12=1. f26=1. f27=1. trans=1. succ=1. inv=1. pred=1. a_select3=1. tptp_update2=1. sum=1. tptp_const_array2=1. f5=1. f6=1. f7=1. f8=1. f13=1. f14=1. f15=1. f16=1. f17=1. f18=1. tptp_update3=1. f9=1. f10=1. f19=1. f3=1. f4=1. f20=1. f21=1. f22=1. f23=1. f24=1. f25=1. 4.18/4.47 4.18/4.47 ============================== end of process initial clauses ======== 4.18/4.47 4.18/4.47 ============================== CLAUSES FOR SEARCH ==================== 4.18/4.47 4.18/4.47 ============================== end of clauses for search ============= 4.18/4.47 4.18/4.47 ============================== SEARCH ================================ 4.18/4.47 4.18/4.47 % Starting search at 0.16 seconds. 4.18/4.47 4.18/4.47 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 883 (0.00 of 1.14 sec). 4.18/4.47 4.18/4.47 Low Water (keep): wt=176.000, iters=3471 4.18/4.47 4.18/4.47 Low Water (keep): wt=146.000, iters=3418 4.18/4.47 4.18/4.47 Low Water (keep): wt=143.000, iters=3543 4.18/4.47 4.18/4.47 Low Water (keep): wt=119.000, iters=3498 4.18/4.47 4.18/4.47 Low Water (keep): wt=113.000, iters=3638 4.18/4.47 4.18/4.47 Low Water (keep): wt=110.000, iters=3518 4.18/4.47 4.18/4.47 Low Water (keep): wt=89.000, iters=3428 4.18/4.47 4.18/4.47 Low Water (keep): wt=86.000, iters=3501 4.18/4.47 4.18/4.47 Low Water (keep): wt=83.000, iters=3615 4.18/4.47 4.18/4.47 Low Water (keep): wt=80.000, iters=3375 4.18/4.47 4.18/4.47 Low Water (keep): wt=58.000, iters=3356 4.18/4.47 4.18/4.47 Low Water (keep): wt=55.000, iters=3451 4.18/4.47 4.18/4.47 Low Water (keep): wt=49.000, iters=3428 4.18/4.47 4.18/4.47 Low Water (keep): wt=46.000, iters=3566 4.18/4.47 4.18/4.47 Low Water (keep): wt=43.000, iters=3516 4.18/4.47 4.18/4.47 Low Water (keep): wt=40.000, iters=3500 4.18/4.47 4.18/4.47 Low Water (keep): wt=34.000, iters=3420 4.18/4.47 4.18/4.47 Low Water (displace): id=3649, wt=179.000 4.18/4.47 4.18/4.47 Low Water (displace): id=6273, wt=176.000 4.18/4.47 4.18/4.47 Low Water (displace): id=4090, wt=173.000 4.18/4.47 4.18/4.47 Low Water (displace): id=5803, wt=170.000 4.18/4.47 4.18/4.47 Low Water (displace): id=3849, wt=149.000 4.18/4.47 4.18/4.47 Low Water (displace): id=11002, wt=31.000 4.18/4.47 4.18/4.47 Low Water (displace): id=11040, wt=25.000 4.18/4.47 4.18/4.47 Low Water (displace): id=11077, wt=22.000 4.18/4.47 4.18/4.47 Low Water (displace): id=11790, wt=19.000 4.18/4.47 4.18/4.47 Low Water (keep): wt=31.000, iters=3335 4.18/4.47 4.18/4.47 Low Water (keep): wt=28.000, iters=3385 4.18/4.47 4.18/4.47 Low Water (displace): id=14229, wt=16.000 4.18/4.47 4.18/4.47 Low Water (keep): wt=26.000, iters=3343 28.85/29.16 28.85/29.16 Low Water (keep): wt=25.000, iters=3378 28.85/29.16 28.85/29.16 Low Water (displace): id=16542, wt=15.000 28.85/29.16 28.85/29.16 Low Water (displace): id=16544, wt=12.000 28.85/29.16 28.85/29.16 Low Water (displace): id=16626, wt=7.000 28.85/29.16 28.85/29.16 Low Water (displace): id=16628, wt=6.000 28.85/29.16 28.85/29.16 Low Water (displace): id=16739, wt=5.000 28.85/29.16 28.85/29.16 Low Water (keep): wt=24.000, iters=3337 28.85/29.16 28.85/29.16 Low Water (keep): wt=23.000, iters=3360 28.85/29.16 28.85/29.16 Low Water (keep): wt=22.000, iters=3340 28.85/29.16 28.85/29.16 Low Water (keep): wt=21.000, iters=3333 28.85/29.16 28.85/29.16 Low Water (keep): wt=20.000, iters=3346 28.85/29.16 28.85/29.16 Low Water (keep): wt=19.000, iters=3338 28.85/29.16 28.85/29.16 Low Water (keep): wt=18.000, iters=3342 28.85/29.16 28.85/29.16 Low Water (keep): wt=17.000, iters=3393 28.85/29.16 28.85/29.16 Low Water (keep): wt=16.000, iters=3337 28.85/29.16 28.85/29.16 Low Water (keep): wt=15.000, iters=3335 28.85/29.16 28.85/29.16 Low Water (keep): wt=14.000, iters=3336 28.85/29.16 28.85/29.16 Low Water (keep): wt=13.000, iters=3401 28.85/29.16 28.85/29.16 Low Water (keep): wt=12.000, iters=3340 28.85/29.16 28.85/29.16 ============================== PROOF ================================= 28.85/29.16 % SZS status Theorem 28.85/29.16 % SZS output start Refutation 28.85/29.16 28.85/29.16 % Proof 1 at 27.45 (+ 0.66) seconds. 28.85/29.16 % Length of proof is 29. 28.85/29.16 % Level of proof is 6. 28.85/29.16 % Maximum clause weight is 19.000. 28.85/29.16 % Given clauses 3664. 28.85/29.16 28.85/29.16 23 (all X all Y (gt(Y,X) <-> leq(X,pred(Y)))) # label(leq_gt_pred) # label(axiom) # label(non_clause). [assumption]. 28.85/29.16 44 (all X all Y (X != Y & leq(X,Y) -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause). [assumption]. 28.85/29.16 55 (all X (leq(n0,X) & leq(X,n2) -> n1 = X | X = n2 | X = n0)) # label(finite_domain_2) # label(axiom) # label(non_clause). [assumption]. 28.85/29.16 56 -(a_select2(rho_defuse,n1) = use & a_select2(rho_defuse,n2) = use & use = a_select2(sigma_defuse,n0) & a_select2(sigma_defuse,n4) = use & use = a_select2(xinit_defuse,n3) & a_select2(xinit_defuse,n5) = use & a_select2(xinit_mean_defuse,n1) = use & a_select2(xinit_mean_defuse,n2) = use & (all C all D (leq(n0,D) & leq(D,pred(pv5)) & leq(C,n2) & leq(n0,C) -> use = a_select3(z_defuse,C,D))) & (all A all B (leq(n0,B) & leq(B,pred(pv5)) & leq(A,n2) & leq(n0,A) -> a_select3(u_defuse,A,B) = use)) & gt(pv5,n0) & leq(pv5,n998) & leq(n0,pv5) & a_select2(xinit_noise_defuse,n5) = use & a_select2(xinit_noise_defuse,n4) = use & a_select2(xinit_noise_defuse,n3) = use & use = a_select2(xinit_noise_defuse,n2) & a_select2(xinit_noise_defuse,n1) = use & a_select2(xinit_noise_defuse,n0) = use & use = a_select2(xinit_mean_defuse,n5) & use = a_select2(xinit_mean_defuse,n4) & a_select2(xinit_mean_defuse,n3) = use & a_select2(xinit_mean_defuse,n0) = use & a_select2(xinit_defuse,n4) = use & a_select3(u_defuse,n2,n0) = use & use = a_select3(u_defuse,n1,n0) & a_select3(u_defuse,n0,n0) = use & use = a_select2(sigma_defuse,n5) & a_select2(sigma_defuse,n3) = use & use = a_select2(sigma_defuse,n2) & a_select2(sigma_defuse,n1) = use & use = a_select2(rho_defuse,n0) -> (all E all F (leq(n0,E) & leq(n0,F) & leq(E,n2) & leq(F,pv5) -> (-(F = pv5 & E = n0) & -(n2 = E & pv5 = F) & -(n1 = E & pv5 = F) -> a_select3(z_defuse,E,F) = use)))) # label(quaternion_ds1_inuse_0014) # label(negated_conjecture) # label(non_clause). [assumption]. 28.85/29.16 128 -gt(A,B) | leq(B,pred(A)) # label(leq_gt_pred) # label(axiom). [clausify(23)]. 28.85/29.16 309 A = B | -leq(B,A) | gt(A,B) # label(leq_gt2) # label(axiom). [clausify(44)]. 28.85/29.16 357 -leq(n0,A) | -leq(A,n2) | n1 = A | n2 = A | A = n0 # label(finite_domain_2) # label(axiom). [clausify(55)]. 28.85/29.16 358 -leq(n0,A) | -leq(A,n2) | n1 = A | n2 = A | n0 = A. [copy(357),flip(e)]. 28.85/29.16 380 -leq(n0,A) | -leq(A,pred(pv5)) | -leq(B,n2) | -leq(n0,B) | a_select3(z_defuse,B,A) = use # label(quaternion_ds1_inuse_0014) # label(negated_conjecture). [clausify(56)]. 28.85/29.16 404 leq(n0,c1) # label(quaternion_ds1_inuse_0014) # label(negated_conjecture). [clausify(56)]. 28.85/29.16 405 leq(n0,c2) # label(quaternion_ds1_inuse_0014) # label(negated_conjecture). [clausify(56)]. 28.85/29.16 406 leq(c1,n2) # label(quaternion_ds1_inuse_0014) # label(negated_conjecture). [clausify(56)]. 28.85/29.16 407 leq(c2,pv5) # label(quaternion_ds1_inuse_0014) # label(negated_conjecture). [clausify(56)]. 28.85/29.16 408 pv5 != c2 | c1 != n0 # label(quaternion_ds1_inuse_0014) # label(negated_conjecture). [clausify(56)]. 28.85/29.16 409 c2 != pv5 | c1 != n0. [copy(408),flip(a)]. 28.85/29.16 410 c1 != n2 | pv5 != c2 # label(quaternion_ds1_inuse_0014) # label(negated_conjecture). [clausify(56)]. 28.85/29.16 411 c1 != n2 | c2 != pv5. [copy(410),flip(b)]. 28.85/29.16 412 c1 != n1 | pv5 != c2 # label(quaternion_ds1_inuse_0014) # label(negated_conjecture). [clausify(56)]. 28.85/29.16 413 c1 != n1 | c2 != pv5. [copy(412),flip(b)]. 28.85/29.16 414 a_select3(z_defuse,c1,c2) != use # label(quaternion_ds1_inuse_0014) # label(negated_conjecture). [clausify(56)]. 28.85/29.16 2877 -leq(n0,A) | -leq(A,pred(pv5)) | a_select3(z_defuse,c1,A) = use. [resolve(404,a,380,d),unit_del(c,406)]. 28.85/29.16 2878 c1 = n1 | c1 = n2 | c1 = n0. [resolve(404,a,358,a),flip(b),flip(c),flip(d),unit_del(a,406)]. 28.85/29.16 4664 c2 = pv5 | gt(pv5,c2). [resolve(407,a,309,b),flip(a)]. 28.85/29.16 29176 c2 = pv5 | leq(c2,pred(pv5)). [resolve(4664,b,128,a)]. 28.85/29.16 43350 c2 = pv5. [resolve(29176,b,2877,b),unit_del(b,405),unit_del(c,414)]. 28.85/29.16 43599 c1 != n1. [back_rewrite(413),rewrite([43350(4)]),xx(b)]. 28.85/29.16 43600 c1 != n2. [back_rewrite(411),rewrite([43350(4)]),xx(b)]. 28.85/29.16 43601 c1 != n0. [back_rewrite(409),rewrite([43350(1)]),xx(a)]. 28.85/29.16 43603 $F. [back_unit_del(2878),unit_del(a,43599),unit_del(b,43600),unit_del(c,43601)]. 28.85/29.16 28.85/29.16 % SZS output end Refutation 28.85/29.16 ============================== end of proof ========================== 28.85/29.16 28.85/29.16 ============================== STATISTICS ============================ 28.85/29.16 28.85/29.16 Given=3664. Generated=1275428. Kept=43518. proofs=1. 28.85/29.16 Usable=3189. Sos=8778. Demods=1927. Limbo=4, Disabled=31881. Hints=0. 28.85/29.16 Megabytes=44.53. 28.85/29.16 User_CPU=27.45, System_CPU=0.66, Wall_clock=28. 28.85/29.16 28.85/29.16 ============================== end of statistics ===================== 28.85/29.16 28.85/29.16 ============================== end of search ========================= 28.85/29.16 28.85/29.16 THEOREM PROVED 28.85/29.16 % SZS status Theorem 28.85/29.16 28.85/29.16 Exiting with 1 proof. 28.85/29.16 28.85/29.16 Process 28154 exit (max_proofs) Mon Jul 3 05:40:28 2023 28.85/29.16 Prover9 interrupted 28.85/29.16 EOF