0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s 0.12/0.33 % Computer : n022.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1200 0.12/0.33 % DateTime : Wed Jul 14 13:55:26 EDT 2021 0.12/0.33 % CPUTime : 1.40/1.72 ============================== Prover9 =============================== 1.40/1.72 Prover9 (32) version 2009-11A, November 2009. 1.40/1.72 Process 28354 was started by sandbox on n022.cluster.edu, 1.40/1.72 Wed Jul 14 13:55:27 2021 1.40/1.72 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_28201_n022.cluster.edu". 1.40/1.72 ============================== end of head =========================== 1.40/1.72 1.40/1.72 ============================== INPUT ================================= 1.40/1.72 1.40/1.72 % Reading from file /tmp/Prover9_28201_n022.cluster.edu 1.40/1.72 1.40/1.72 set(prolog_style_variables). 1.40/1.72 set(auto2). 1.40/1.72 % set(auto2) -> set(auto). 1.40/1.72 % set(auto) -> set(auto_inference). 1.40/1.72 % set(auto) -> set(auto_setup). 1.40/1.72 % set(auto_setup) -> set(predicate_elim). 1.40/1.72 % set(auto_setup) -> assign(eq_defs, unfold). 1.40/1.72 % set(auto) -> set(auto_limits). 1.40/1.72 % set(auto_limits) -> assign(max_weight, "100.000"). 1.40/1.72 % set(auto_limits) -> assign(sos_limit, 20000). 1.40/1.72 % set(auto) -> set(auto_denials). 1.40/1.72 % set(auto) -> set(auto_process). 1.40/1.72 % set(auto2) -> assign(new_constants, 1). 1.40/1.72 % set(auto2) -> assign(fold_denial_max, 3). 1.40/1.72 % set(auto2) -> assign(max_weight, "200.000"). 1.40/1.72 % set(auto2) -> assign(max_hours, 1). 1.40/1.72 % assign(max_hours, 1) -> assign(max_seconds, 3600). 1.40/1.72 % set(auto2) -> assign(max_seconds, 0). 1.40/1.72 % set(auto2) -> assign(max_minutes, 5). 1.40/1.72 % assign(max_minutes, 5) -> assign(max_seconds, 300). 1.40/1.72 % set(auto2) -> set(sort_initial_sos). 1.40/1.72 % set(auto2) -> assign(sos_limit, -1). 1.40/1.72 % set(auto2) -> assign(lrs_ticks, 3000). 1.40/1.72 % set(auto2) -> assign(max_megs, 400). 1.40/1.72 % set(auto2) -> assign(stats, some). 1.40/1.72 % set(auto2) -> clear(echo_input). 1.40/1.72 % set(auto2) -> set(quiet). 1.40/1.72 % set(auto2) -> clear(print_initial_clauses). 1.40/1.72 % set(auto2) -> clear(print_given). 1.40/1.72 assign(lrs_ticks,-1). 1.40/1.72 assign(sos_limit,10000). 1.40/1.72 assign(order,kbo). 1.40/1.72 set(lex_order_vars). 1.40/1.72 clear(print_given). 1.40/1.72 1.40/1.72 % formulas(sos). % not echoed (92 formulas) 1.40/1.72 1.40/1.72 ============================== end of input ========================== 1.40/1.72 1.40/1.72 % From the command line: assign(max_seconds, 1200). 1.40/1.72 1.40/1.72 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 1.40/1.72 1.40/1.72 % Formulas that are not ordinary clauses: 1.40/1.72 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]. 1.40/1.72 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]. 1.40/1.72 3 (all X X = pred(succ(X))) # label(pred_succ) # label(axiom) # label(non_clause). [assumption]. 1.40/1.72 4 (all X plus(X,n4) = succ(succ(succ(succ(X))))) # label(succ_plus_4_r) # label(axiom) # label(non_clause). [assumption]. 1.40/1.72 5 (all X all Y (gt(X,Y) | gt(Y,X) | X = Y)) # label(totality) # label(axiom) # label(non_clause). [assumption]. 1.40/1.72 6 (all X all Y (leq(minus(X,Y),X) -> leq(n0,Y))) # label(leq_minus) # label(axiom) # label(non_clause). [assumption]. 1.40/1.72 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]. 1.40/1.72 8 (all X all Y (leq(succ(X),succ(Y)) <-> leq(X,Y))) # label(leq_succ_succ) # label(axiom) # label(non_clause). [assumption]. 1.40/1.72 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]. 1.40/1.72 10 (all X succ(X) = plus(X,n1)) # label(succ_plus_1_r) # label(axiom) # label(non_clause). [assumption]. 1.40/1.72 11 (all X plus(n1,X) = succ(X)) # label(succ_plus_1_l) # label(axiom) # label(non_clause). [assumption]. 1.40/1.72 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]. 1.40/1.72 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]. 1.40/1.73 14 (all X X = succ(pred(X))) # label(succ_pred) # label(axiom) # label(non_clause). [assumption]. 1.40/1.73 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]. 1.40/1.73 16 (all X minus(X,n1) = pred(X)) # label(pred_minus_1) # label(axiom) # label(non_clause). [assumption]. 1.40/1.73 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]. 1.40/1.73 18 (all X gt(succ(X),X)) # label(gt_succ) # label(axiom) # label(non_clause). [assumption]. 1.40/1.73 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]. 1.40/1.73 20 (all X all Y (gt(Y,X) <-> leq(X,pred(Y)))) # label(leq_gt_pred) # label(axiom) # label(non_clause). [assumption]. 1.40/1.73 21 (all Body n0 = sum(n0,tptp_minus_1,Body)) # label(sum_plus_base) # label(axiom) # label(non_clause). [assumption]. 1.40/1.73 22 (all X plus(X,n3) = succ(succ(succ(X)))) # label(succ_plus_3_r) # label(axiom) # label(non_clause). [assumption]. 1.40/1.73 23 (all X all Y (leq(succ(X),Y) -> gt(Y,X))) # label(leq_succ_gt) # label(axiom) # label(non_clause). [assumption]. 1.40/1.73 24 (all X plus(X,n2) = succ(succ(X))) # label(succ_plus_2_r) # label(axiom) # label(non_clause). [assumption]. 1.40/1.73 25 (all Body sum(n0,tptp_minus_1,Body) = tptp_float_0_0) # label(sum_plus_base_float) # label(axiom) # label(non_clause). [assumption]. 1.40/1.73 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]. 1.40/1.73 27 (all X leq(X,X)) # label(reflexivity_leq) # label(axiom) # label(non_clause). [assumption]. 1.40/1.73 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]. 1.40/1.73 29 (all X all Y (geq(X,Y) <-> leq(Y,X))) # label(leq_geq) # label(axiom) # label(non_clause). [assumption]. 1.40/1.73 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]. 1.40/1.73 31 (all X all Y (gt(Y,X) <-> lt(X,Y))) # label(lt_gt) # label(axiom) # label(non_clause). [assumption]. 1.40/1.73 32 (all X succ(succ(succ(succ(X)))) = plus(n4,X)) # label(succ_plus_4_l) # label(axiom) # label(non_clause). [assumption]. 1.40/1.73 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]. 1.40/1.73 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]. 1.40/1.73 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]. 1.40/1.73 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]. 1.40/1.73 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]. 1.40/1.73 38 (all X all Y (Y != X & leq(X,Y) -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause). [assumption]. 1.40/1.73 39 (all X all Y (leq(X,Y) <-> gt(succ(Y),X))) # label(leq_succ_gt_equiv) # label(axiom) # label(non_clause). [assumption]. 1.40/1.73 40 (all X all Y (gt(Y,X) -> leq(X,Y))) # label(leq_gt1) # label(axiom) # label(non_clause). [assumption]. 1.40/1.73 41 (all X succ(succ(succ(X))) = plus(n3,X)) # label(succ_plus_3_l) # label(axiom) # label(non_clause). [assumption]. 1.40/1.73 42 (all X -gt(X,X)) # label(irreflexivity_gt) # label(axiom) # label(non_clause). [assumption]. 1.40/1.73 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]. 1.40/1.73 44 (all X succ(succ(succ(succ(succ(X))))) = plus(n5,X)) # label(succ_plus_5_l) # label(axiom) # label(non_clause). [assumption]. 1.40/1.73 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]. 1.40/1.73 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]. 1.40/1.73 47 (all X succ(succ(succ(succ(succ(X))))) = plus(X,n5)) # label(succ_plus_5_r) # label(axiom) # label(non_clause). [assumption]. 1.40/1.73 48 (all X succ(succ(X)) = plus(n2,X)) # label(succ_plus_2_l) # label(axiom) # label(non_clause). [assumption]. 1.40/1.73 49 (all X all Y (leq(X,Y) -> leq(X,succ(Y)))) # label(leq_succ) # label(axiom) # label(non_clause). [assumption]. 1.40/1.73 50 (all X (leq(X,n2) & leq(n0,X) -> X = n1 | X = n2 | n0 = X)) # label(finite_domain_2) # label(axiom) # label(non_clause). [assumption]. 1.40/1.73 51 (all X (leq(X,n1) & leq(n0,X) -> n1 = X | X = n0)) # label(finite_domain_1) # label(axiom) # label(non_clause). [assumption]. 1.40/1.73 52 (all X (leq(X,n4) & leq(n0,X) -> n0 = X | n3 = X | n4 = X | X = n2 | X = n1)) # label(finite_domain_4) # label(axiom) # label(non_clause). [assumption]. 1.40/1.73 53 (all X (leq(n0,X) & leq(X,n0) -> n0 = X)) # label(finite_domain_0) # label(axiom) # label(non_clause). [assumption]. 1.40/1.73 54 (all X (leq(n0,X) & leq(X,n5) -> X = n3 | X = n4 | X = n5 | X = n2 | n1 = X | n0 = X)) # label(finite_domain_5) # label(axiom) # label(non_clause). [assumption]. 1.40/1.73 55 (all X (leq(X,n3) & leq(n0,X) -> n0 = X | n1 = X | n2 = X | n3 = X)) # label(finite_domain_3) # label(axiom) # label(non_clause). [assumption]. 1.40/1.73 56 -(a_select2(rho_defuse,n0) = use & a_select2(rho_defuse,n1) = use & a_select2(sigma_defuse,n4) = use & use = a_select3(u_defuse,n0,n0) & a_select3(u_defuse,n1,n0) = use & use = a_select3(u_defuse,n2,n0) & a_select2(xinit_defuse,n4) = use & use = a_select2(xinit_defuse,n5) & use = a_select2(xinit_mean_defuse,n0) & a_select2(xinit_mean_defuse,n1) = use & a_select2(xinit_mean_defuse,n2) = use & a_select2(xinit_mean_defuse,n4) = use & a_select2(xinit_mean_defuse,n5) = use & use = a_select2(xinit_noise_defuse,n0) & use = a_select2(xinit_noise_defuse,n2) & use = a_select2(xinit_noise_defuse,n3) & a_select2(xinit_noise_defuse,n4) = use & (all A all B (leq(n0,B) & leq(B,n998) & leq(A,n2) & leq(n0,A) -> a_select3(u_defuse,A,B) = use)) & (all C all D (leq(D,n998) & leq(C,n2) & leq(n0,D) & leq(n0,C) -> use = a_select3(z_defuse,C,D))) & a_select2(xinit_noise_defuse,n5) = use & a_select2(xinit_noise_defuse,n1) = use & use = a_select2(xinit_mean_defuse,n3) & a_select2(xinit_defuse,n3) = use & a_select2(sigma_defuse,n5) = use & use = a_select2(sigma_defuse,n3) & use = a_select2(sigma_defuse,n2) & a_select2(sigma_defuse,n1) = use & use = a_select2(sigma_defuse,n0) & use = a_select2(rho_defuse,n2) -> (all E (leq(E,n2) & leq(n0,E) -> use = a_select2(rho_defuse,E)))) # label(quaternion_ds1_inuse_0015) # label(negated_conjecture) # label(non_clause). [assumption]. 5.25/5.54 5.25/5.54 ============================== end of process non-clausal formulas === 5.25/5.54 5.25/5.54 ============================== PROCESS INITIAL CLAUSES =============== 5.25/5.54 5.25/5.54 ============================== PREDICATE ELIMINATION ================= 5.25/5.54 57 geq(A,B) | -leq(B,A) # label(leq_geq) # label(axiom). [clausify(29)]. 5.25/5.54 58 -geq(A,B) | leq(B,A) # label(leq_geq) # label(axiom). [clausify(29)]. 5.25/5.54 59 gt(A,B) | -lt(B,A) # label(lt_gt) # label(axiom). [clausify(31)]. 5.25/5.54 60 -gt(A,B) | lt(B,A) # label(lt_gt) # label(axiom). [clausify(31)]. 5.25/5.54 5.25/5.54 ============================== end predicate elimination ============= 5.25/5.54 5.25/5.54 Auto_denials: (non-Horn, no changes). 5.25/5.54 5.25/5.54 Term ordering decisions: 5.25/5.54 Function symbol KB weights: n0=1. use=1. n2=1. n1=1. n3=1. n4=1. n5=1. tptp_minus_1=1. n998=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. 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. 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. 5.25/5.54 5.25/5.54 ============================== end of process initial clauses ======== 5.25/5.54 5.25/5.54 ============================== CLAUSES FOR SEARCH ==================== 5.25/5.54 5.25/5.54 ============================== end of clauses for search ============= 5.25/5.54 5.25/5.54 ============================== SEARCH ================================ 5.25/5.54 5.25/5.54 % Starting search at 0.25 seconds. 5.25/5.54 5.25/5.54 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 481 (0.00 of 0.74 sec). 5.25/5.54 5.25/5.54 Low Water (keep): wt=170.000, iters=3461 5.25/5.54 5.25/5.54 Low Water (keep): wt=143.000, iters=3355 5.25/5.54 5.25/5.54 Low Water (keep): wt=113.000, iters=3336 5.25/5.54 5.25/5.54 Low Water (keep): wt=89.000, iters=3590 5.25/5.54 5.25/5.54 Low Water (keep): wt=86.000, iters=3423 5.25/5.54 5.25/5.54 Low Water (keep): wt=83.000, iters=3334 5.25/5.54 5.25/5.54 Low Water (keep): wt=80.000, iters=3608 5.25/5.54 5.25/5.54 Low Water (keep): wt=58.000, iters=3377 5.25/5.54 5.25/5.54 Low Water (keep): wt=55.000, iters=3370 5.25/5.54 5.25/5.54 Low Water (keep): wt=53.000, iters=3363 5.25/5.54 5.25/5.54 Low Water (keep): wt=50.000, iters=3355 5.25/5.54 5.25/5.54 Low Water (keep): wt=49.000, iters=3348 5.25/5.54 5.25/5.54 Low Water (keep): wt=46.000, iters=3477 5.25/5.54 5.25/5.54 Low Water (keep): wt=44.000, iters=3436 5.25/5.54 5.25/5.54 Low Water (keep): wt=43.000, iters=3432 5.25/5.54 5.25/5.54 Low Water (keep): wt=40.000, iters=3600 5.25/5.54 5.25/5.54 Low Water (keep): wt=34.000, iters=3406 5.25/5.54 5.25/5.54 Low Water (displace): id=6287, wt=179.000 5.25/5.54 5.25/5.54 Low Water (displace): id=10953, wt=31.000 5.25/5.54 5.25/5.54 Low Water (displace): id=11050, wt=28.000 5.25/5.54 5.25/5.54 Low Water (displace): id=11071, wt=22.000 5.25/5.54 5.25/5.54 Low Water (keep): wt=32.000, iters=3358 5.25/5.54 5.25/5.54 Low Water (displace): id=11907, wt=19.000 5.25/5.54 5.25/5.54 Low Water (keep): wt=31.000, iters=3336 5.25/5.54 5.25/5.54 Low Water (keep): wt=30.000, iters=3383 5.25/5.54 5.25/5.54 Low Water (keep): wt=28.000, iters=3408 5.25/5.54 5.25/5.54 Low Water (displace): id=13972, wt=18.000 5.25/5.54 5.25/5.54 Low Water (displace): id=14115, wt=17.000 5.25/5.54 5.25/5.54 Low Water (displace): id=14432, wt=16.000 5.25/5.54 5.25/5.54 Low Water (keep): wt=27.000, iters=3338 5.25/5.54 5.25/5.54 Low Water (keep): wt=26.000, iters=3347 5.25/5.54 5.25/5.54 Low Water (keep): wt=25.000, iters=3349 5.25/5.54 5.25/5.54 Low Water (displace): id=16640, wt=12.000 5.25/5.54 5.25/5.54 Low Water (displace): id=16707, wt=7.000 15.53/15.89 15.53/15.89 Low Water (displace): id=16755, wt=6.000 15.53/15.89 15.53/15.89 Low Water (displace): id=19677, wt=5.000 15.53/15.89 15.53/15.89 Low Water (keep): wt=24.000, iters=3338 15.53/15.89 15.53/15.89 Low Water (keep): wt=23.000, iters=3336 15.53/15.89 15.53/15.89 Low Water (keep): wt=22.000, iters=3336 15.53/15.89 15.53/15.89 Low Water (keep): wt=21.000, iters=3350 15.53/15.89 15.53/15.89 Low Water (keep): wt=20.000, iters=3426 15.53/15.89 15.53/15.89 Low Water (keep): wt=19.000, iters=3373 15.53/15.89 15.53/15.89 Low Water (keep): wt=18.000, iters=3346 15.53/15.89 15.53/15.89 ============================== PROOF ================================= 15.53/15.89 % SZS status Theorem 15.53/15.89 % SZS output start Refutation 15.53/15.89 15.53/15.89 % Proof 1 at 13.85 (+ 0.32) seconds. 15.53/15.89 % Length of proof is 13. 15.53/15.89 % Level of proof is 5. 15.53/15.89 % Maximum clause weight is 15.000. 15.53/15.89 % Given clauses 2414. 15.53/15.89 15.53/15.89 50 (all X (leq(X,n2) & leq(n0,X) -> X = n1 | X = n2 | n0 = X)) # label(finite_domain_2) # label(axiom) # label(non_clause). [assumption]. 15.53/15.89 56 -(a_select2(rho_defuse,n0) = use & a_select2(rho_defuse,n1) = use & a_select2(sigma_defuse,n4) = use & use = a_select3(u_defuse,n0,n0) & a_select3(u_defuse,n1,n0) = use & use = a_select3(u_defuse,n2,n0) & a_select2(xinit_defuse,n4) = use & use = a_select2(xinit_defuse,n5) & use = a_select2(xinit_mean_defuse,n0) & a_select2(xinit_mean_defuse,n1) = use & a_select2(xinit_mean_defuse,n2) = use & a_select2(xinit_mean_defuse,n4) = use & a_select2(xinit_mean_defuse,n5) = use & use = a_select2(xinit_noise_defuse,n0) & use = a_select2(xinit_noise_defuse,n2) & use = a_select2(xinit_noise_defuse,n3) & a_select2(xinit_noise_defuse,n4) = use & (all A all B (leq(n0,B) & leq(B,n998) & leq(A,n2) & leq(n0,A) -> a_select3(u_defuse,A,B) = use)) & (all C all D (leq(D,n998) & leq(C,n2) & leq(n0,D) & leq(n0,C) -> use = a_select3(z_defuse,C,D))) & a_select2(xinit_noise_defuse,n5) = use & a_select2(xinit_noise_defuse,n1) = use & use = a_select2(xinit_mean_defuse,n3) & a_select2(xinit_defuse,n3) = use & a_select2(sigma_defuse,n5) = use & use = a_select2(sigma_defuse,n3) & use = a_select2(sigma_defuse,n2) & a_select2(sigma_defuse,n1) = use & use = a_select2(sigma_defuse,n0) & use = a_select2(rho_defuse,n2) -> (all E (leq(E,n2) & leq(n0,E) -> use = a_select2(rho_defuse,E)))) # label(quaternion_ds1_inuse_0015) # label(negated_conjecture) # label(non_clause). [assumption]. 15.53/15.89 322 -leq(A,n2) | -leq(n0,A) | n1 = A | n2 = A | n0 = A # label(finite_domain_2) # label(axiom). [clausify(50)]. 15.53/15.89 365 a_select2(rho_defuse,n0) = use # label(quaternion_ds1_inuse_0015) # label(negated_conjecture). [clausify(56)]. 15.53/15.89 366 a_select2(rho_defuse,n1) = use # label(quaternion_ds1_inuse_0015) # label(negated_conjecture). [clausify(56)]. 15.53/15.89 393 a_select2(rho_defuse,n2) = use # label(quaternion_ds1_inuse_0015) # label(negated_conjecture). [clausify(56)]. 15.53/15.89 394 leq(c1,n2) # label(quaternion_ds1_inuse_0015) # label(negated_conjecture). [clausify(56)]. 15.53/15.89 395 leq(n0,c1) # label(quaternion_ds1_inuse_0015) # label(negated_conjecture). [clausify(56)]. 15.53/15.89 396 a_select2(rho_defuse,c1) != use # label(quaternion_ds1_inuse_0015) # label(negated_conjecture). [clausify(56)]. 15.53/15.89 1845 c1 = n1 | c1 = n2 | c1 = n0. [resolve(394,a,322,a),flip(b),flip(c),flip(d),unit_del(a,395)]. 15.53/15.89 36461 c1 = n2 | c1 = n0. [para(1845(a,1),396(a,1,2)),rewrite([366(9)]),xx(c)]. 15.53/15.89 36792 c1 = n0. [para(36461(a,1),396(a,1,2)),rewrite([393(6)]),xx(b)]. 15.53/15.89 37036 $F. [back_rewrite(396),rewrite([36792(2),365(3)]),xx(a)]. 15.53/15.89 15.53/15.89 % SZS output end Refutation 15.53/15.89 ============================== end of proof ========================== 15.53/15.89 15.53/15.89 ============================== STATISTICS ============================ 15.53/15.89 15.53/15.89 Given=2414. Generated=581905. Kept=36961. proofs=1. 15.53/15.89 Usable=2056. Sos=7217. Demods=819. Limbo=244, Disabled=27770. Hints=0. 15.53/15.89 Megabytes=41.82. 15.53/15.89 User_CPU=13.85, System_CPU=0.32, Wall_clock=14. 15.53/15.89 15.53/15.89 ============================== end of statistics ===================== 15.53/15.89 15.53/15.89 ============================== end of search ========================= 15.53/15.89 15.53/15.89 THEOREM PROVED 15.53/15.89 % SZS status Theorem 15.53/15.89 15.53/15.89 Exiting with 1 proof. 15.53/15.89 15.53/15.89 Process 28354 exit (max_proofs) Wed Jul 14 13:55:41 2021 15.53/15.89 Prover9 interrupted 15.53/15.89 EOF