0.00/0.09 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.10 % Command : tptp2X_and_run_prover9 %d %s 0.08/0.30 % Computer : n023.cluster.edu 0.08/0.30 % Model : x86_64 x86_64 0.08/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.08/0.30 % Memory : 8042.1875MB 0.08/0.30 % OS : Linux 3.10.0-693.el7.x86_64 0.08/0.30 % CPULimit : 960 0.08/0.30 % DateTime : Thu Jul 2 07:49:13 EDT 2020 0.08/0.30 % CPUTime : 0.80/1.12 ============================== Prover9 =============================== 0.80/1.12 Prover9 (32) version 2009-11A, November 2009. 0.80/1.12 Process 27141 was started by sandbox2 on n023.cluster.edu, 0.80/1.12 Thu Jul 2 07:49:14 2020 0.80/1.12 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_26976_n023.cluster.edu". 0.80/1.12 ============================== end of head =========================== 0.80/1.12 0.80/1.12 ============================== INPUT ================================= 0.80/1.12 0.80/1.12 % Reading from file /tmp/Prover9_26976_n023.cluster.edu 0.80/1.12 0.80/1.12 set(prolog_style_variables). 0.80/1.12 set(auto2). 0.80/1.12 % set(auto2) -> set(auto). 0.80/1.12 % set(auto) -> set(auto_inference). 0.80/1.12 % set(auto) -> set(auto_setup). 0.80/1.12 % set(auto_setup) -> set(predicate_elim). 0.80/1.12 % set(auto_setup) -> assign(eq_defs, unfold). 0.80/1.12 % set(auto) -> set(auto_limits). 0.80/1.12 % set(auto_limits) -> assign(max_weight, "100.000"). 0.80/1.12 % set(auto_limits) -> assign(sos_limit, 20000). 0.80/1.12 % set(auto) -> set(auto_denials). 0.80/1.12 % set(auto) -> set(auto_process). 0.80/1.12 % set(auto2) -> assign(new_constants, 1). 0.80/1.12 % set(auto2) -> assign(fold_denial_max, 3). 0.80/1.12 % set(auto2) -> assign(max_weight, "200.000"). 0.80/1.12 % set(auto2) -> assign(max_hours, 1). 0.80/1.12 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.80/1.12 % set(auto2) -> assign(max_seconds, 0). 0.80/1.12 % set(auto2) -> assign(max_minutes, 5). 0.80/1.12 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.80/1.12 % set(auto2) -> set(sort_initial_sos). 0.80/1.12 % set(auto2) -> assign(sos_limit, -1). 0.80/1.12 % set(auto2) -> assign(lrs_ticks, 3000). 0.80/1.12 % set(auto2) -> assign(max_megs, 400). 0.80/1.12 % set(auto2) -> assign(stats, some). 0.80/1.12 % set(auto2) -> clear(echo_input). 0.80/1.12 % set(auto2) -> set(quiet). 0.80/1.12 % set(auto2) -> clear(print_initial_clauses). 0.80/1.12 % set(auto2) -> clear(print_given). 0.80/1.12 assign(lrs_ticks,-1). 0.80/1.12 assign(sos_limit,10000). 0.80/1.12 assign(order,kbo). 0.80/1.12 set(lex_order_vars). 0.80/1.12 clear(print_given). 0.80/1.12 0.80/1.12 % formulas(sos). % not echoed (92 formulas) 0.80/1.12 0.80/1.12 ============================== end of input ========================== 0.80/1.12 0.80/1.12 % From the command line: assign(max_seconds, 960). 0.80/1.12 0.80/1.12 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.80/1.12 0.80/1.12 % Formulas that are not ordinary clauses: 0.80/1.12 1 (all X all U all VAL VAL = a_select2(tptp_update2(X,U,VAL),U)) # label(sel2_update_1) # label(axiom) # label(non_clause). [assumption]. 0.80/1.12 2 (all I all L all U all Val (leq(I,U) & leq(L,I) -> Val = a_select2(tptp_const_array1(dim(L,U),Val),I))) # label(const_array1_select) # label(axiom) # label(non_clause). [assumption]. 0.80/1.12 3 (all X all Y (leq(X,Y) <-> gt(succ(Y),X))) # label(leq_succ_gt_equiv) # label(axiom) # label(non_clause). [assumption]. 0.80/1.12 4 (all X all Y (leq(X,Y) & X != Y -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause). [assumption]. 0.80/1.12 5 (all X succ(succ(succ(succ(succ(X))))) = plus(X,n5)) # label(succ_plus_5_r) # label(axiom) # label(non_clause). [assumption]. 0.80/1.12 6 (all X minus(X,n1) = pred(X)) # label(pred_minus_1) # label(axiom) # label(non_clause). [assumption]. 0.80/1.12 7 (all X succ(succ(succ(succ(X)))) = plus(X,n4)) # label(succ_plus_4_r) # label(axiom) # label(non_clause). [assumption]. 0.80/1.12 8 (all X all Y all Z (gt(Y,Z) & gt(X,Y) -> gt(X,Z))) # label(transitivity_gt) # label(axiom) # label(non_clause). [assumption]. 0.80/1.12 9 (all A all B all N all M ((all I all J (leq(n0,I) & leq(I,M) & leq(J,M) & leq(n0,J) -> a_select3(B,J,I) = a_select3(B,I,J))) -> (all I all J (leq(n0,I) & leq(J,N) & leq(I,N) & leq(n0,J) -> a_select3(tptp_mmul(A,tptp_mmul(B,trans(A))),I,J) = a_select3(tptp_mmul(A,tptp_mmul(B,trans(A))),J,I))))) # label(matrix_symm_aba2) # label(axiom) # label(non_clause). [assumption]. 0.80/1.12 10 (all X X = pred(succ(X))) # label(pred_succ) # label(axiom) # label(non_clause). [assumption]. 0.80/1.12 11 (all X succ(succ(succ(succ(X)))) = plus(n4,X)) # label(succ_plus_4_l) # label(axiom) # label(non_clause). [assumption]. 0.80/1.12 12 (all I all U all X all VAL (leq(I,U) & leq(n0,I) & (all I0 (leq(n0,I0) & leq(I0,U) -> VAL = a_select2(X,I0))) -> a_select2(tptp_update2(X,U,VAL),I) = VAL)) # label(sel2_update_3) # label(axiom) # label(non_clause). [assumption]. 0.80/1.12 13 (all A all N ((all I all J (leq(n0,J) & leq(J,N) & leq(I,N) & leq(n0,I) -> a_select3(A,J,I) = a_select3(A,I,J))) -> (all I all J (leq(n0,I) & leq(I,N) & leq(J,N) & leq(n0,J) -> a_select3(inv(A),J,I) = a_select3(inv(A),I,J))))) # label(matrix_symm_inv) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 14 (all X succ(succ(succ(X))) = plus(n3,X)) # label(succ_plus_3_l) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 15 (all X plus(X,n1) = succ(X)) # label(succ_plus_1_r) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 16 (all X succ(X) = plus(n1,X)) # label(succ_plus_1_l) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 17 (all I all U all X all VAL all VAL2 (VAL = a_select2(X,U) & U != I -> VAL = a_select2(tptp_update2(X,I,VAL2),U))) # label(sel2_update_2) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 18 (all A all N ((all I all J (leq(n0,J) & leq(n0,I) & leq(J,N) & leq(I,N) -> a_select3(A,J,I) = a_select3(A,I,J))) -> (all I all J all K all VAL (leq(n0,K) & leq(K,N) & leq(J,N) & leq(n0,J) & leq(I,N) & leq(n0,I) -> a_select3(tptp_update3(A,K,K,VAL),I,J) = a_select3(tptp_update3(A,K,K,VAL),J,I))))) # label(matrix_symm_update_diagonal) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 19 (all X -gt(X,X)) # label(irreflexivity_gt) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 20 (all X all Y all Z (leq(X,Y) & leq(Y,Z) -> leq(X,Z))) # label(transitivity_leq) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 21 (all A all B all C all D all E all F all N all M ((all I all J (leq(n0,I) & leq(n0,J) & leq(J,M) & leq(I,M) -> a_select3(D,J,I) = a_select3(D,I,J))) & (all I all J (leq(n0,I) & leq(J,N) & leq(n0,J) & leq(I,N) -> a_select3(A,J,I) = a_select3(A,I,J))) & (all I all J (leq(n0,I) & leq(J,N) & leq(n0,J) & leq(I,N) -> a_select3(F,I,J) = a_select3(F,J,I))) -> (all I all J (leq(n0,I) & leq(n0,J) & leq(J,N) & leq(I,N) -> a_select3(tptp_madd(A,tptp_mmul(B,tptp_mmul(tptp_madd(tptp_mmul(C,tptp_mmul(D,trans(C))),tptp_mmul(E,tptp_mmul(F,trans(E)))),trans(B)))),J,I) = a_select3(tptp_madd(A,tptp_mmul(B,tptp_mmul(tptp_madd(tptp_mmul(C,tptp_mmul(D,trans(C))),tptp_mmul(E,tptp_mmul(F,trans(E)))),trans(B)))),I,J))))) # label(matrix_symm_joseph_update) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 22 (all A all B all N ((all I all J (leq(n0,I) & leq(J,N) & leq(n0,J) & leq(I,N) -> a_select3(A,I,J) = a_select3(A,J,I))) & (all I all J (leq(n0,J) & leq(J,N) & leq(n0,I) & leq(I,N) -> a_select3(B,I,J) = a_select3(B,J,I))) -> (all I all J (leq(n0,I) & leq(I,N) & leq(J,N) & leq(n0,J) -> a_select3(tptp_msub(A,B),J,I) = a_select3(tptp_msub(A,B),I,J))))) # label(matrix_symm_sub) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 23 (all A all B all N ((all I all J (leq(n0,J) & leq(I,N) & leq(n0,I) & leq(J,N) -> a_select3(A,I,J) = a_select3(A,J,I))) & (all I all J (leq(n0,J) & leq(J,N) & leq(I,N) & leq(n0,I) -> a_select3(B,J,I) = a_select3(B,I,J))) -> (all I all J (leq(n0,I) & leq(J,N) & leq(n0,J) & leq(I,N) -> a_select3(tptp_madd(A,B),J,I) = a_select3(tptp_madd(A,B),I,J))))) # label(matrix_symm_add) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 24 (all A all N ((all I all J (leq(n0,J) & leq(n0,I) & leq(J,N) & leq(I,N) -> a_select3(A,I,J) = a_select3(A,J,I))) -> (all I all J (leq(J,N) & leq(n0,J) & leq(I,N) & leq(n0,I) -> a_select3(trans(A),I,J) = a_select3(trans(A),J,I))))) # label(matrix_symm_trans) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 25 (all A all B all N ((all I all J (leq(J,N) & leq(n0,I) & leq(I,N) & leq(n0,J) -> a_select3(B,J,I) = a_select3(B,I,J))) -> (all I all J (leq(n0,I) & leq(J,N) & leq(n0,J) & leq(I,N) -> a_select3(tptp_mmul(A,tptp_mmul(B,trans(A))),J,I) = a_select3(tptp_mmul(A,tptp_mmul(B,trans(A))),I,J))))) # label(matrix_symm_aba1) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 26 (all X plus(n5,X) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_l) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 27 (all X succ(succ(X)) = plus(n2,X)) # label(succ_plus_2_l) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 28 (all Body sum(n0,tptp_minus_1,Body) = tptp_float_0_0) # label(sum_plus_base_float) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 29 (all X succ(succ(succ(X))) = plus(X,n3)) # label(succ_plus_3_r) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 30 (all X all C (leq(n0,X) -> leq(uniform_int_rnd(C,X),X))) # label(uniform_int_rand_ranges_hi) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 31 (all X all U all V all VAL VAL = a_select3(tptp_update3(X,U,V,VAL),U,V)) # label(sel3_update_1) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 32 (all X all Y (leq(succ(X),Y) -> gt(Y,X))) # label(leq_succ_gt) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 33 (all X all Y (gt(Y,X) -> leq(X,Y))) # label(leq_gt1) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 34 (all Body n0 = sum(n0,tptp_minus_1,Body)) # label(sum_plus_base) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 35 (all X all Y (leq(X,Y) <-> leq(succ(X),succ(Y)))) # label(leq_succ_succ) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 36 (all I all J all U all V all X all VAL (leq(I,U) & (all I0 all J0 (leq(n0,I0) & leq(n0,J0) & leq(I0,U) & leq(J0,V) -> a_select3(X,I0,J0) = VAL)) & leq(J,V) & leq(n0,J) & leq(n0,I) -> a_select3(tptp_update3(X,U,V,VAL),I,J) = VAL)) # label(sel3_update_3) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 37 (all X all Y (geq(X,Y) <-> leq(Y,X))) # label(leq_geq) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 38 (all X all Y (gt(Y,X) <-> leq(X,pred(Y)))) # label(leq_gt_pred) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 39 (all X all Y (lt(X,Y) <-> gt(Y,X))) # label(lt_gt) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 40 (all X leq(X,X)) # label(reflexivity_leq) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 41 (all I all J all U all V all X all VAL all VAL2 (I != U & a_select3(X,U,V) = VAL & J = V -> VAL = a_select3(tptp_update3(X,I,J,VAL2),U,V))) # label(sel3_update_2) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 42 (all X gt(succ(X),X)) # label(gt_succ) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 43 (all X all Y (gt(X,Y) | X = Y | gt(Y,X))) # label(totality) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 44 (all I all L1 all U1 all J all L2 all U2 all Val (leq(L2,J) & leq(J,U2) & leq(I,U1) & leq(L1,I) -> a_select3(tptp_const_array2(dim(L1,U1),dim(L2,U2),Val),I,J) = Val)) # label(const_array2_select) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 45 (all X succ(pred(X)) = X) # label(succ_pred) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 46 (all X succ(succ(X)) = plus(X,n2)) # label(succ_plus_2_r) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 47 (all X all Y (leq(X,Y) -> leq(X,succ(Y)))) # label(leq_succ) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 48 (all X all Y (leq(minus(X,Y),X) -> leq(n0,Y))) # label(leq_minus) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 49 (all X all C (leq(n0,X) -> leq(n0,uniform_int_rnd(C,X)))) # label(uniform_int_rand_ranges_lo) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 50 (all X (leq(n0,X) & leq(X,n1) -> n0 = X | X = n1)) # label(finite_domain_1) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 51 (all X (leq(X,n3) & leq(n0,X) -> X = n1 | n3 = X | X = n2 | n0 = X)) # label(finite_domain_3) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 52 (all X (leq(X,n4) & leq(n0,X) -> X = n0 | X = n1 | X = n2 | n4 = X | X = n3)) # label(finite_domain_4) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 53 (all X (leq(X,n2) & leq(n0,X) -> n1 = X | X = n2 | X = n0)) # label(finite_domain_2) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 54 (all X (leq(X,n5) & leq(n0,X) -> X = n1 | n2 = X | n5 = X | X = n4 | X = n3 | n0 = X)) # label(finite_domain_5) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 55 (all X (leq(n0,X) & leq(X,n0) -> X = n0)) # label(finite_domain_0) # label(axiom) # label(non_clause). [assumption]. 0.80/1.13 56 -(a_select2(rho_defuse,n0) = use & use = a_select2(rho_defuse,n2) & use = a_select2(sigma_defuse,n1) & use = a_select2(sigma_defuse,n2) & use = a_select2(sigma_defuse,n4) & use = a_select2(sigma_defuse,n5) & a_select2(xinit_defuse,n4) = use & use = a_select2(xinit_noise_defuse,n2) & a_select2(xinit_noise_defuse,n3) = use & a_select2(xinit_noise_defuse,n5) = use & leq(n0,pv5) & leq(pv5,n998) & gt(pv5,n0) & (all A all B (leq(A,n2) & leq(B,pred(pv5)) & leq(n0,B) & leq(n0,A) -> a_select3(u_defuse,A,B) = use)) & (all C all D (leq(C,n2) & leq(D,pred(pv5)) & leq(n0,D) & leq(n0,C) -> use = a_select3(z_defuse,C,D))) & use = a_select2(xinit_noise_defuse,n4) & a_select2(xinit_noise_defuse,n1) = use & a_select2(xinit_noise_defuse,n0) = use & a_select2(xinit_mean_defuse,n5) = use & a_select2(xinit_mean_defuse,n4) = use & use = a_select2(xinit_mean_defuse,n3) & use = a_select2(xinit_mean_defuse,n2) & a_select2(xinit_mean_defuse,n1) = use & use = a_select2(xinit_mean_defuse,n0) & a_select2(xinit_defuse,n5) = use & a_select2(xinit_defuse,n3) = use & use = a_select3(u_defuse,n2,n0) & a_select3(u_defuse,n1,n0) = use & use = a_select3(u_defuse,n0,n0) & use = a_select2(sigma_defuse,n3) & use = a_select2(sigma_defuse,n0) & use = a_select2(rho_defuse,n1) -> (all E all F (leq(n0,E) & leq(E,n2) & leq(F,pv5) & leq(n0,F) -> (-(n2 = E & pv5 = F) & -(F = pv5 & n1 = E) & -(n0 = E & F = pv5) -> a_select3(z_defuse,E,F) = use)))) # label(quaternion_ds1_inuse_0014) # label(negated_conjecture) # label(non_clause). [assumption]. 10.15/10.51 10.15/10.51 ============================== end of process non-clausal formulas === 10.15/10.51 10.15/10.51 ============================== PROCESS INITIAL CLAUSES =============== 10.15/10.51 10.15/10.51 ============================== PREDICATE ELIMINATION ================= 10.15/10.51 57 geq(A,B) | -leq(B,A) # label(leq_geq) # label(axiom). [clausify(37)]. 10.15/10.51 58 -geq(A,B) | leq(B,A) # label(leq_geq) # label(axiom). [clausify(37)]. 10.15/10.51 59 lt(A,B) | -gt(B,A) # label(lt_gt) # label(axiom). [clausify(39)]. 10.15/10.51 60 -lt(A,B) | gt(B,A) # label(lt_gt) # label(axiom). [clausify(39)]. 10.15/10.51 10.15/10.51 ============================== end predicate elimination ============= 10.15/10.51 10.15/10.51 Auto_denials: (non-Horn, no changes). 10.15/10.51 10.15/10.51 Term ordering decisions: 10.15/10.51 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. f4=1. f5=1. f6=1. f7=1. f22=1. f23=1. trans=1. succ=1. inv=1. pred=1. a_select3=1. tptp_update2=1. sum=1. tptp_const_array2=1. f14=1. f15=1. f16=1. f17=1. f18=1. f19=1. f20=1. f21=1. f24=1. f25=1. tptp_update3=1. f1=1. f2=1. f3=1. f26=1. f27=1. f8=1. f9=1. f10=1. f11=1. f12=1. f13=1. 10.15/10.51 10.15/10.51 ============================== end of process initial clauses ======== 10.15/10.51 10.15/10.51 ============================== CLAUSES FOR SEARCH ==================== 10.15/10.51 10.15/10.51 ============================== end of clauses for search ============= 10.15/10.51 10.15/10.51 ============================== SEARCH ================================ 10.15/10.51 10.15/10.51 % Starting search at 0.26 seconds. 10.15/10.51 10.15/10.51 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 735 (0.00 of 1.65 sec). 10.15/10.51 10.15/10.51 Low Water (keep): wt=173.000, iters=3521 10.15/10.51 10.15/10.51 Low Water (keep): wt=143.000, iters=3426 10.15/10.51 10.15/10.51 Low Water (keep): wt=116.000, iters=3517 10.15/10.51 10.15/10.51 Low Water (keep): wt=89.000, iters=3667 10.15/10.51 10.15/10.51 Low Water (keep): wt=86.000, iters=3505 10.15/10.51 10.15/10.51 Low Water (keep): wt=64.000, iters=3372 10.15/10.51 10.15/10.51 Low Water (keep): wt=49.000, iters=3427 10.15/10.51 10.15/10.51 Low Water (keep): wt=47.000, iters=3410 10.15/10.51 10.15/10.51 Low Water (keep): wt=46.000, iters=3557 10.15/10.51 10.15/10.51 Low Water (keep): wt=40.000, iters=3378 10.15/10.51 10.15/10.51 Low Water (keep): wt=34.000, iters=3370 10.15/10.51 10.15/10.51 Low Water (displace): id=6595, wt=179.000 10.15/10.51 10.15/10.51 Low Water (displace): id=10971, wt=31.000 10.15/10.51 10.15/10.51 Low Water (displace): id=10976, wt=22.000 10.15/10.51 10.15/10.51 Low Water (displace): id=11025, wt=20.000 10.15/10.51 10.15/10.51 Low Water (displace): id=11026, wt=17.000 10.15/10.51 10.15/10.51 Low Water (displace): id=11400, wt=16.000 10.15/10.51 10.15/10.51 Low Water (keep): wt=32.000, iters=3378 10.15/10.51 10.15/10.51 Low Water (keep): wt=31.000, iters=3346 10.15/10.51 10.15/10.51 Low Water (keep): wt=30.000, iters=3368 10.15/10.51 10.15/10.51 Low Water (keep): wt=28.000, iters=3342 10.15/10.51 10.15/10.51 Low Water (displace): id=16669, wt=15.000 10.15/10.51 10.15/10.51 Low Water (keep): wt=27.000, iters=3379 10.15/10.51 10.15/10.51 Low Water (keep): wt=26.000, iters=3338 10.15/10.51 10.15/10.51 Low Water (keep): wt=25.000, iters=3376 10.15/10.51 10.15/10.51 Low Water (displace): id=19201, wt=14.000 10.15/10.51 10.15/10.51 Low Water (displace): id=19202, wt=13.000 10.15/10.51 10.15/10.51 Low Water (displace): id=19285, wt=7.000 10.15/10.51 10.15/10.51 Low Water (displace): id=19388, wt=6.000 10.15/10.51 10.15/10.51 Low Water (keep): wt=24.000, iters=3413 52.36/52.66 52.36/52.66 Low Water (keep): wt=23.000, iters=3360 52.36/52.66 52.36/52.66 Low Water (keep): wt=22.000, iters=3334 52.36/52.66 52.36/52.66 Low Water (keep): wt=21.000, iters=3416 52.36/52.66 52.36/52.66 Low Water (keep): wt=20.000, iters=3341 52.36/52.66 52.36/52.66 Low Water (keep): wt=19.000, iters=3356 52.36/52.66 52.36/52.66 Low Water (keep): wt=18.000, iters=3336 52.36/52.66 52.36/52.66 Low Water (keep): wt=17.000, iters=3341 52.36/52.66 52.36/52.66 Low Water (keep): wt=16.000, iters=3341 52.36/52.66 52.36/52.66 Low Water (keep): wt=15.000, iters=3338 52.36/52.66 52.36/52.66 Low Water (keep): wt=14.000, iters=3333 52.36/52.66 52.36/52.66 Low Water (keep): wt=13.000, iters=3333 52.36/52.66 52.36/52.66 Low Water (keep): wt=12.000, iters=3334 52.36/52.66 52.36/52.66 ============================== PROOF ================================= 52.36/52.66 % SZS status Theorem 52.36/52.66 % SZS output start Refutation 52.36/52.66 52.36/52.66 % Proof 1 at 50.33 (+ 1.22) seconds. 52.36/52.66 % Length of proof is 28. 52.36/52.66 % Level of proof is 6. 52.36/52.66 % Maximum clause weight is 19.000. 52.36/52.66 % Given clauses 3706. 52.36/52.66 52.36/52.66 4 (all X all Y (leq(X,Y) & X != Y -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause). [assumption]. 52.36/52.66 38 (all X all Y (gt(Y,X) <-> leq(X,pred(Y)))) # label(leq_gt_pred) # label(axiom) # label(non_clause). [assumption]. 52.36/52.66 53 (all X (leq(X,n2) & leq(n0,X) -> n1 = X | X = n2 | X = n0)) # label(finite_domain_2) # label(axiom) # label(non_clause). [assumption]. 52.36/52.66 56 -(a_select2(rho_defuse,n0) = use & use = a_select2(rho_defuse,n2) & use = a_select2(sigma_defuse,n1) & use = a_select2(sigma_defuse,n2) & use = a_select2(sigma_defuse,n4) & use = a_select2(sigma_defuse,n5) & a_select2(xinit_defuse,n4) = use & use = a_select2(xinit_noise_defuse,n2) & a_select2(xinit_noise_defuse,n3) = use & a_select2(xinit_noise_defuse,n5) = use & leq(n0,pv5) & leq(pv5,n998) & gt(pv5,n0) & (all A all B (leq(A,n2) & leq(B,pred(pv5)) & leq(n0,B) & leq(n0,A) -> a_select3(u_defuse,A,B) = use)) & (all C all D (leq(C,n2) & leq(D,pred(pv5)) & leq(n0,D) & leq(n0,C) -> use = a_select3(z_defuse,C,D))) & use = a_select2(xinit_noise_defuse,n4) & a_select2(xinit_noise_defuse,n1) = use & a_select2(xinit_noise_defuse,n0) = use & a_select2(xinit_mean_defuse,n5) = use & a_select2(xinit_mean_defuse,n4) = use & use = a_select2(xinit_mean_defuse,n3) & use = a_select2(xinit_mean_defuse,n2) & a_select2(xinit_mean_defuse,n1) = use & use = a_select2(xinit_mean_defuse,n0) & a_select2(xinit_defuse,n5) = use & a_select2(xinit_defuse,n3) = use & use = a_select3(u_defuse,n2,n0) & a_select3(u_defuse,n1,n0) = use & use = a_select3(u_defuse,n0,n0) & use = a_select2(sigma_defuse,n3) & use = a_select2(sigma_defuse,n0) & use = a_select2(rho_defuse,n1) -> (all E all F (leq(n0,E) & leq(E,n2) & leq(F,pv5) & leq(n0,F) -> (-(n2 = E & pv5 = F) & -(F = pv5 & n1 = E) & -(n0 = E & F = pv5) -> a_select3(z_defuse,E,F) = use)))) # label(quaternion_ds1_inuse_0014) # label(negated_conjecture) # label(non_clause). [assumption]. 52.36/52.66 65 -leq(A,B) | B = A | gt(B,A) # label(leq_gt2) # label(axiom). [clausify(4)]. 52.36/52.66 306 -gt(A,B) | leq(B,pred(A)) # label(leq_gt_pred) # label(axiom). [clausify(38)]. 52.36/52.66 342 -leq(A,n2) | -leq(n0,A) | n1 = A | n2 = A | n0 = A # label(finite_domain_2) # label(axiom). [clausify(53)]. 52.36/52.66 380 -leq(A,n2) | -leq(B,pred(pv5)) | -leq(n0,B) | -leq(n0,A) | a_select3(z_defuse,A,B) = use # label(quaternion_ds1_inuse_0014) # label(negated_conjecture). [clausify(56)]. 52.36/52.66 398 leq(n0,c1) # label(quaternion_ds1_inuse_0014) # label(negated_conjecture). [clausify(56)]. 52.36/52.66 399 leq(c1,n2) # label(quaternion_ds1_inuse_0014) # label(negated_conjecture). [clausify(56)]. 52.36/52.66 400 leq(c2,pv5) # label(quaternion_ds1_inuse_0014) # label(negated_conjecture). [clausify(56)]. 52.36/52.66 401 leq(n0,c2) # label(quaternion_ds1_inuse_0014) # label(negated_conjecture). [clausify(56)]. 52.36/52.66 402 n2 != c1 | pv5 != c2 # label(quaternion_ds1_inuse_0014) # label(negated_conjecture). [clausify(56)]. 52.36/52.66 403 c1 != n2 | c2 != pv5. [copy(402),flip(a),flip(b)]. 52.36/52.66 404 pv5 != c2 | c1 != n1 # label(quaternion_ds1_inuse_0014) # label(negated_conjecture). [clausify(56)]. 52.36/52.66 405 c2 != pv5 | c1 != n1. [copy(404),flip(a)]. 52.36/52.66 406 c1 != n0 | pv5 != c2 # label(quaternion_ds1_inuse_0014) # label(negated_conjecture). [clausify(56)]. 52.36/52.66 407 c1 != n0 | c2 != pv5. [copy(406),flip(b)]. 52.36/52.66 408 a_select3(z_defuse,c1,c2) != use # label(quaternion_ds1_inuse_0014) # label(negated_conjecture). [clausify(56)]. 52.36/52.66 2874 -leq(A,pred(pv5)) | -leq(n0,A) | a_select3(z_defuse,c1,A) = use. [resolve(398,a,380,d),unit_del(a,399)]. 52.36/52.66 2878 c1 = n1 | c1 = n2 | c1 = n0. [resolve(398,a,342,b),flip(b),flip(c),flip(d),unit_del(a,399)]. 52.36/52.66 4128 c2 = pv5 | gt(pv5,c2). [resolve(400,a,65,a),flip(a)]. 52.36/52.66 29488 c2 = pv5 | leq(c2,pred(pv5)). [resolve(4128,b,306,a)]. 52.36/52.66 46996 c2 = pv5. [resolve(29488,b,2874,a),unit_del(b,401),unit_del(c,408)]. 52.36/52.66 47307 c1 != n0. [back_rewrite(407),rewrite([46996(4)]),xx(b)]. 52.36/52.66 47308 c1 != n1. [back_rewrite(405),rewrite([46996(1)]),xx(a)]. 52.36/52.66 47309 c1 != n2. [back_rewrite(403),rewrite([46996(4)]),xx(b)]. 52.36/52.66 47314 $F. [back_unit_del(2878),unit_del(a,47308),unit_del(b,47309),unit_del(c,47307)]. 52.36/52.66 52.36/52.66 % SZS output end Refutation 52.36/52.66 ============================== end of proof ========================== 52.36/52.66 52.36/52.66 ============================== STATISTICS ============================ 52.36/52.66 52.36/52.66 Given=3706. Generated=1239459. Kept=47235. proofs=1. 52.36/52.66 Usable=3286. Sos=8813. Demods=1761. Limbo=7, Disabled=35463. Hints=0. 52.36/52.66 Megabytes=45.16. 52.36/52.66 User_CPU=50.33, System_CPU=1.22, Wall_clock=52. 52.36/52.66 52.36/52.66 ============================== end of statistics ===================== 52.36/52.66 52.36/52.66 ============================== end of search ========================= 52.36/52.66 52.36/52.66 THEOREM PROVED 52.36/52.66 % SZS status Theorem 52.36/52.66 52.36/52.66 Exiting with 1 proof. 52.36/52.66 52.36/52.66 Process 27141 exit (max_proofs) Thu Jul 2 07:50:06 2020 52.36/52.66 Prover9 interrupted 52.36/52.66 EOF