0.03/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.11 % Command : tptp2X_and_run_prover9 %d %s 0.11/0.31 % Computer : n006.cluster.edu 0.11/0.31 % Model : x86_64 x86_64 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.31 % Memory : 8042.1875MB 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.31 % CPULimit : 960 0.11/0.31 % DateTime : Thu Jul 2 07:44:15 EDT 2020 0.11/0.31 % CPUTime : 0.67/1.01 ============================== Prover9 =============================== 0.67/1.01 Prover9 (32) version 2009-11A, November 2009. 0.67/1.01 Process 7774 was started by sandbox2 on n006.cluster.edu, 0.67/1.01 Thu Jul 2 07:44:16 2020 0.67/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_7612_n006.cluster.edu". 0.67/1.01 ============================== end of head =========================== 0.67/1.01 0.67/1.01 ============================== INPUT ================================= 0.67/1.01 0.67/1.01 % Reading from file /tmp/Prover9_7612_n006.cluster.edu 0.67/1.01 0.67/1.01 set(prolog_style_variables). 0.67/1.01 set(auto2). 0.67/1.01 % set(auto2) -> set(auto). 0.67/1.01 % set(auto) -> set(auto_inference). 0.67/1.01 % set(auto) -> set(auto_setup). 0.67/1.01 % set(auto_setup) -> set(predicate_elim). 0.67/1.01 % set(auto_setup) -> assign(eq_defs, unfold). 0.67/1.01 % set(auto) -> set(auto_limits). 0.67/1.01 % set(auto_limits) -> assign(max_weight, "100.000"). 0.67/1.01 % set(auto_limits) -> assign(sos_limit, 20000). 0.67/1.01 % set(auto) -> set(auto_denials). 0.67/1.01 % set(auto) -> set(auto_process). 0.67/1.01 % set(auto2) -> assign(new_constants, 1). 0.67/1.01 % set(auto2) -> assign(fold_denial_max, 3). 0.67/1.01 % set(auto2) -> assign(max_weight, "200.000"). 0.67/1.01 % set(auto2) -> assign(max_hours, 1). 0.67/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.67/1.01 % set(auto2) -> assign(max_seconds, 0). 0.67/1.01 % set(auto2) -> assign(max_minutes, 5). 0.67/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.67/1.01 % set(auto2) -> set(sort_initial_sos). 0.67/1.01 % set(auto2) -> assign(sos_limit, -1). 0.67/1.01 % set(auto2) -> assign(lrs_ticks, 3000). 0.67/1.01 % set(auto2) -> assign(max_megs, 400). 0.67/1.01 % set(auto2) -> assign(stats, some). 0.67/1.01 % set(auto2) -> clear(echo_input). 0.67/1.01 % set(auto2) -> set(quiet). 0.67/1.01 % set(auto2) -> clear(print_initial_clauses). 0.67/1.01 % set(auto2) -> clear(print_given). 0.67/1.01 assign(lrs_ticks,-1). 0.67/1.01 assign(sos_limit,10000). 0.67/1.01 assign(order,kbo). 0.67/1.01 set(lex_order_vars). 0.67/1.01 clear(print_given). 0.67/1.01 0.67/1.01 % formulas(sos). % not echoed (92 formulas) 0.67/1.01 0.67/1.01 ============================== end of input ========================== 0.67/1.01 0.67/1.01 % From the command line: assign(max_seconds, 960). 0.67/1.01 0.67/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.67/1.01 0.67/1.01 % Formulas that are not ordinary clauses: 0.67/1.01 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.67/1.01 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.67/1.01 3 (all X all Y (leq(X,Y) <-> gt(succ(Y),X))) # label(leq_succ_gt_equiv) # label(axiom) # label(non_clause). [assumption]. 0.67/1.01 4 (all X all Y (leq(X,Y) & X != Y -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause). [assumption]. 0.67/1.01 5 (all X succ(succ(succ(succ(succ(X))))) = plus(X,n5)) # label(succ_plus_5_r) # label(axiom) # label(non_clause). [assumption]. 0.67/1.01 6 (all X minus(X,n1) = pred(X)) # label(pred_minus_1) # label(axiom) # label(non_clause). [assumption]. 0.67/1.01 7 (all X succ(succ(succ(succ(X)))) = plus(X,n4)) # label(succ_plus_4_r) # label(axiom) # label(non_clause). [assumption]. 0.67/1.01 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.67/1.01 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.67/1.01 10 (all X X = pred(succ(X))) # label(pred_succ) # label(axiom) # label(non_clause). [assumption]. 0.67/1.01 11 (all X succ(succ(succ(succ(X)))) = plus(n4,X)) # label(succ_plus_4_l) # label(axiom) # label(non_clause). [assumption]. 0.67/1.01 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.67/1.01 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.72/1.02 14 (all X succ(succ(succ(X))) = plus(n3,X)) # label(succ_plus_3_l) # label(axiom) # label(non_clause). [assumption]. 0.72/1.02 15 (all X plus(X,n1) = succ(X)) # label(succ_plus_1_r) # label(axiom) # label(non_clause). [assumption]. 0.72/1.02 16 (all X succ(X) = plus(n1,X)) # label(succ_plus_1_l) # label(axiom) # label(non_clause). [assumption]. 0.72/1.02 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.72/1.02 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.72/1.02 19 (all X -gt(X,X)) # label(irreflexivity_gt) # label(axiom) # label(non_clause). [assumption]. 0.72/1.02 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.72/1.02 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.72/1.02 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.72/1.02 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.72/1.02 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.72/1.02 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.72/1.02 26 (all X plus(n5,X) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_l) # label(axiom) # label(non_clause). [assumption]. 0.72/1.02 27 (all X succ(succ(X)) = plus(n2,X)) # label(succ_plus_2_l) # label(axiom) # label(non_clause). [assumption]. 0.72/1.02 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.72/1.02 29 (all X succ(succ(succ(X))) = plus(X,n3)) # label(succ_plus_3_r) # label(axiom) # label(non_clause). [assumption]. 0.72/1.03 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.72/1.03 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.72/1.03 32 (all X all Y (leq(succ(X),Y) -> gt(Y,X))) # label(leq_succ_gt) # label(axiom) # label(non_clause). [assumption]. 0.72/1.03 33 (all X all Y (gt(Y,X) -> leq(X,Y))) # label(leq_gt1) # label(axiom) # label(non_clause). [assumption]. 0.72/1.03 34 (all Body n0 = sum(n0,tptp_minus_1,Body)) # label(sum_plus_base) # label(axiom) # label(non_clause). [assumption]. 0.72/1.03 35 (all X all Y (leq(X,Y) <-> leq(succ(X),succ(Y)))) # label(leq_succ_succ) # label(axiom) # label(non_clause). [assumption]. 0.72/1.03 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.72/1.03 37 (all X all Y (geq(X,Y) <-> leq(Y,X))) # label(leq_geq) # label(axiom) # label(non_clause). [assumption]. 0.72/1.03 38 (all X all Y (gt(Y,X) <-> leq(X,pred(Y)))) # label(leq_gt_pred) # label(axiom) # label(non_clause). [assumption]. 0.72/1.03 39 (all X all Y (lt(X,Y) <-> gt(Y,X))) # label(lt_gt) # label(axiom) # label(non_clause). [assumption]. 0.72/1.03 40 (all X leq(X,X)) # label(reflexivity_leq) # label(axiom) # label(non_clause). [assumption]. 0.72/1.03 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.72/1.03 42 (all X gt(succ(X),X)) # label(gt_succ) # label(axiom) # label(non_clause). [assumption]. 0.72/1.03 43 (all X all Y (gt(X,Y) | X = Y | gt(Y,X))) # label(totality) # label(axiom) # label(non_clause). [assumption]. 0.72/1.03 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.72/1.03 45 (all X succ(pred(X)) = X) # label(succ_pred) # label(axiom) # label(non_clause). [assumption]. 0.72/1.03 46 (all X succ(succ(X)) = plus(X,n2)) # label(succ_plus_2_r) # label(axiom) # label(non_clause). [assumption]. 0.72/1.03 47 (all X all Y (leq(X,Y) -> leq(X,succ(Y)))) # label(leq_succ) # label(axiom) # label(non_clause). [assumption]. 0.72/1.03 48 (all X all Y (leq(minus(X,Y),X) -> leq(n0,Y))) # label(leq_minus) # label(axiom) # label(non_clause). [assumption]. 0.72/1.03 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.72/1.03 50 (all X (leq(X,n5) & leq(n0,X) -> n2 = X | X = n3 | X = n5 | n4 = X | n1 = X | n0 = X)) # label(finite_domain_5) # label(axiom) # label(non_clause). [assumption]. 0.72/1.03 51 (all X (leq(n0,X) & leq(X,n4) -> n4 = X | n3 = X | X = n2 | n1 = X | n0 = X)) # label(finite_domain_4) # label(axiom) # label(non_clause). [assumption]. 0.72/1.03 52 (all X (leq(n0,X) & leq(X,n1) -> X = n1 | n0 = X)) # label(finite_domain_1) # label(axiom) # label(non_clause). [assumption]. 0.72/1.03 53 (all X (leq(n0,X) & leq(X,n3) -> X = n2 | X = n3 | X = n1 | n0 = X)) # label(finite_domain_3) # label(axiom) # label(non_clause). [assumption]. 0.72/1.03 54 (all X (leq(n0,X) & leq(X,n2) -> n1 = X | X = n2 | n0 = X)) # label(finite_domain_2) # label(axiom) # label(non_clause). [assumption]. 0.72/1.03 55 (all X (leq(n0,X) & leq(X,n0) -> X = n0)) # label(finite_domain_0) # label(axiom) # label(non_clause). [assumption]. 0.72/1.03 56 -(use = a_select2(rho_defuse,n1) & a_select2(rho_defuse,n2) = use & use = a_select2(sigma_defuse,n1) & a_select2(sigma_defuse,n2) = use & use = a_select2(sigma_defuse,n4) & a_select3(u_defuse,n1,n0) = use & use = a_select2(xinit_defuse,n3) & a_select2(xinit_defuse,n5) = use & a_select2(xinit_mean_defuse,n4) = use & a_select2(xinit_noise_defuse,n0) = use & use = a_select2(xinit_noise_defuse,n1) & use = a_select2(xinit_noise_defuse,n3) & a_select2(xinit_noise_defuse,n4) = use & use = a_select2(xinit_noise_defuse,n5) & gt(pv5,n0) & (all C all D (leq(n0,C) & leq(n0,D) & leq(C,n2) & leq(D,pred(pv5)) -> use = a_select3(z_defuse,C,D))) & (all A all B (leq(n0,A) & leq(n0,B) & leq(B,pred(pv5)) & leq(A,n2) -> a_select3(u_defuse,A,B) = use)) & leq(pv5,n998) & leq(n0,pv5) & use = a_select2(xinit_noise_defuse,n2) & use = a_select2(xinit_mean_defuse,n5) & 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,n4) = use & use = a_select3(u_defuse,n2,n0) & a_select3(u_defuse,n0,n0) = use & use = a_select2(sigma_defuse,n5) & use = a_select2(sigma_defuse,n3) & use = a_select2(sigma_defuse,n0) & use = a_select2(rho_defuse,n0) -> (all E all F (leq(n0,E) & leq(n0,F) & leq(E,n2) & leq(F,pv5) -> (-(F = pv5 & n2 = E) & -(pv5 = F & n1 = E) & -(E = n0 & F = pv5) -> a_select3(u_defuse,E,F) = use)))) # label(quaternion_ds1_inuse_0013) # label(negated_conjecture) # label(non_clause). [assumption]. 6.49/6.81 6.49/6.81 ============================== end of process non-clausal formulas === 6.49/6.81 6.49/6.81 ============================== PROCESS INITIAL CLAUSES =============== 6.49/6.81 6.49/6.81 ============================== PREDICATE ELIMINATION ================= 6.49/6.81 57 geq(A,B) | -leq(B,A) # label(leq_geq) # label(axiom). [clausify(37)]. 6.49/6.81 58 -geq(A,B) | leq(B,A) # label(leq_geq) # label(axiom). [clausify(37)]. 6.49/6.81 59 lt(A,B) | -gt(B,A) # label(lt_gt) # label(axiom). [clausify(39)]. 6.49/6.81 60 -lt(A,B) | gt(B,A) # label(lt_gt) # label(axiom). [clausify(39)]. 6.49/6.81 6.49/6.81 ============================== end predicate elimination ============= 6.49/6.81 6.49/6.81 Auto_denials: (non-Horn, no changes). 6.49/6.81 6.49/6.81 Term ordering decisions: 6.49/6.81 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. 6.49/6.81 6.49/6.81 ============================== end of process initial clauses ======== 6.49/6.81 6.49/6.81 ============================== CLAUSES FOR SEARCH ==================== 6.49/6.81 6.49/6.81 ============================== end of clauses for search ============= 6.49/6.81 6.49/6.81 ============================== SEARCH ================================ 6.49/6.81 6.49/6.81 % Starting search at 0.23 seconds. 6.49/6.81 6.49/6.81 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 855 (0.00 of 1.52 sec). 6.49/6.81 6.49/6.81 Low Water (keep): wt=176.000, iters=3473 6.49/6.81 6.49/6.81 Low Water (keep): wt=146.000, iters=3413 6.49/6.81 6.49/6.81 Low Water (keep): wt=143.000, iters=3545 6.49/6.81 6.49/6.81 Low Water (keep): wt=140.000, iters=3523 6.49/6.81 6.49/6.81 Low Water (keep): wt=119.000, iters=3500 6.49/6.81 6.49/6.81 Low Water (keep): wt=116.000, iters=3861 6.49/6.81 6.49/6.81 Low Water (keep): wt=113.000, iters=3746 6.49/6.81 6.49/6.81 Low Water (keep): wt=89.000, iters=3506 6.49/6.81 6.49/6.81 Low Water (keep): wt=86.000, iters=3392 6.49/6.81 6.49/6.81 Low Water (keep): wt=61.000, iters=3401 6.49/6.81 6.49/6.81 Low Water (keep): wt=50.000, iters=3363 6.49/6.81 6.49/6.81 Low Water (keep): wt=47.000, iters=3341 6.49/6.81 6.49/6.81 Low Water (keep): wt=46.000, iters=3337 6.49/6.81 6.49/6.81 Low Water (keep): wt=43.000, iters=3438 6.49/6.81 6.49/6.81 Low Water (keep): wt=40.000, iters=3336 6.49/6.81 6.49/6.81 Low Water (keep): wt=34.000, iters=3343 6.49/6.81 6.49/6.81 Low Water (displace): id=6029, wt=179.000 6.49/6.81 6.49/6.81 Low Water (displace): id=10954, wt=22.000 6.49/6.81 6.49/6.81 Low Water (displace): id=11079, wt=19.000 6.49/6.81 6.49/6.81 Low Water (keep): wt=32.000, iters=3358 6.49/6.81 6.49/6.81 Low Water (displace): id=12526, wt=16.000 6.49/6.81 6.49/6.81 Low Water (keep): wt=31.000, iters=3338 6.49/6.81 6.49/6.81 Low Water (keep): wt=30.000, iters=3341 6.49/6.81 6.49/6.81 Low Water (keep): wt=28.000, iters=3376 6.49/6.81 6.49/6.81 Low Water (displace): id=16666, wt=14.000 6.49/6.81 6.49/6.81 Low Water (keep): wt=27.000, iters=3349 6.49/6.81 6.49/6.81 Low Water (keep): wt=25.000, iters=3345 6.49/6.81 6.49/6.81 Low Water (displace): id=19475, wt=13.000 6.49/6.81 6.49/6.81 Low Water (displace): id=19498, wt=7.000 6.49/6.81 6.49/6.81 Low Water (displace): id=19695, wt=6.000 50.45/50.81 50.45/50.81 Low Water (keep): wt=24.000, iters=3345 50.45/50.81 50.45/50.81 Low Water (keep): wt=23.000, iters=3378 50.45/50.81 50.45/50.81 Low Water (keep): wt=22.000, iters=3333 50.45/50.81 50.45/50.81 Low Water (displace): id=26481, wt=4.000 50.45/50.81 50.45/50.81 Low Water (keep): wt=21.000, iters=3360 50.45/50.81 50.45/50.81 Low Water (keep): wt=20.000, iters=3391 50.45/50.81 50.45/50.81 Low Water (keep): wt=19.000, iters=3350 50.45/50.81 50.45/50.81 Low Water (keep): wt=18.000, iters=3337 50.45/50.81 50.45/50.81 Low Water (keep): wt=17.000, iters=3348 50.45/50.81 50.45/50.81 Low Water (keep): wt=16.000, iters=3334 50.45/50.81 50.45/50.81 Low Water (keep): wt=15.000, iters=3351 50.45/50.81 50.45/50.81 Low Water (keep): wt=14.000, iters=3344 50.45/50.81 50.45/50.81 Low Water (keep): wt=13.000, iters=3421 50.45/50.81 50.45/50.81 Low Water (keep): wt=12.000, iters=3334 50.45/50.81 50.45/50.81 ============================== PROOF ================================= 50.45/50.81 % SZS status Theorem 50.45/50.81 % SZS output start Refutation 50.45/50.81 50.45/50.81 % Proof 1 at 48.60 (+ 1.15) seconds. 50.45/50.81 % Length of proof is 28. 50.45/50.81 % Level of proof is 6. 50.45/50.81 % Maximum clause weight is 19.000. 50.45/50.81 % Given clauses 3724. 50.45/50.81 50.45/50.81 4 (all X all Y (leq(X,Y) & X != Y -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause). [assumption]. 50.45/50.81 38 (all X all Y (gt(Y,X) <-> leq(X,pred(Y)))) # label(leq_gt_pred) # label(axiom) # label(non_clause). [assumption]. 50.45/50.81 54 (all X (leq(n0,X) & leq(X,n2) -> n1 = X | X = n2 | n0 = X)) # label(finite_domain_2) # label(axiom) # label(non_clause). [assumption]. 50.45/50.81 56 -(use = a_select2(rho_defuse,n1) & a_select2(rho_defuse,n2) = use & use = a_select2(sigma_defuse,n1) & a_select2(sigma_defuse,n2) = use & use = a_select2(sigma_defuse,n4) & a_select3(u_defuse,n1,n0) = use & use = a_select2(xinit_defuse,n3) & a_select2(xinit_defuse,n5) = use & a_select2(xinit_mean_defuse,n4) = use & a_select2(xinit_noise_defuse,n0) = use & use = a_select2(xinit_noise_defuse,n1) & use = a_select2(xinit_noise_defuse,n3) & a_select2(xinit_noise_defuse,n4) = use & use = a_select2(xinit_noise_defuse,n5) & gt(pv5,n0) & (all C all D (leq(n0,C) & leq(n0,D) & leq(C,n2) & leq(D,pred(pv5)) -> use = a_select3(z_defuse,C,D))) & (all A all B (leq(n0,A) & leq(n0,B) & leq(B,pred(pv5)) & leq(A,n2) -> a_select3(u_defuse,A,B) = use)) & leq(pv5,n998) & leq(n0,pv5) & use = a_select2(xinit_noise_defuse,n2) & use = a_select2(xinit_mean_defuse,n5) & 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,n4) = use & use = a_select3(u_defuse,n2,n0) & a_select3(u_defuse,n0,n0) = use & use = a_select2(sigma_defuse,n5) & use = a_select2(sigma_defuse,n3) & use = a_select2(sigma_defuse,n0) & use = a_select2(rho_defuse,n0) -> (all E all F (leq(n0,E) & leq(n0,F) & leq(E,n2) & leq(F,pv5) -> (-(F = pv5 & n2 = E) & -(pv5 = F & n1 = E) & -(E = n0 & F = pv5) -> a_select3(u_defuse,E,F) = use)))) # label(quaternion_ds1_inuse_0013) # label(negated_conjecture) # label(non_clause). [assumption]. 50.45/50.81 65 -leq(A,B) | B = A | gt(B,A) # label(leq_gt2) # label(axiom). [clausify(4)]. 50.45/50.81 306 -gt(A,B) | leq(B,pred(A)) # label(leq_gt_pred) # label(axiom). [clausify(38)]. 50.45/50.81 348 -leq(n0,A) | -leq(A,n2) | n1 = A | n2 = A | n0 = A # label(finite_domain_2) # label(axiom). [clausify(54)]. 50.45/50.81 383 -leq(n0,A) | -leq(n0,B) | -leq(B,pred(pv5)) | -leq(A,n2) | a_select3(u_defuse,A,B) = use # label(quaternion_ds1_inuse_0013) # label(negated_conjecture). [clausify(56)]. 50.45/50.81 399 leq(n0,c1) # label(quaternion_ds1_inuse_0013) # label(negated_conjecture). [clausify(56)]. 50.45/50.81 400 leq(n0,c2) # label(quaternion_ds1_inuse_0013) # label(negated_conjecture). [clausify(56)]. 50.45/50.81 401 leq(c1,n2) # label(quaternion_ds1_inuse_0013) # label(negated_conjecture). [clausify(56)]. 50.45/50.81 402 leq(c2,pv5) # label(quaternion_ds1_inuse_0013) # label(negated_conjecture). [clausify(56)]. 50.45/50.81 403 pv5 != c2 | n2 != c1 # label(quaternion_ds1_inuse_0013) # label(negated_conjecture). [clausify(56)]. 50.45/50.81 404 c2 != pv5 | c1 != n2. [copy(403),flip(a),flip(b)]. 50.45/50.81 405 pv5 != c2 | c1 != n1 # label(quaternion_ds1_inuse_0013) # label(negated_conjecture). [clausify(56)]. 50.45/50.81 406 c2 != pv5 | c1 != n1. [copy(405),flip(a)]. 50.45/50.81 407 c1 != n0 | pv5 != c2 # label(quaternion_ds1_inuse_0013) # label(negated_conjecture). [clausify(56)]. 50.45/50.81 408 c1 != n0 | c2 != pv5. [copy(407),flip(b)]. 50.45/50.81 409 a_select3(u_defuse,c1,c2) != use # label(quaternion_ds1_inuse_0013) # label(negated_conjecture). [clausify(56)]. 50.45/50.81 2868 -leq(n0,A) | -leq(A,pred(pv5)) | a_select3(u_defuse,c1,A) = use. [resolve(399,a,383,a),unit_del(c,401)]. 50.45/50.81 2871 c1 = n1 | c1 = n2 | c1 = n0. [resolve(399,a,348,a),flip(b),flip(c),flip(d),unit_del(a,401)]. 50.45/50.81 4875 c2 = pv5 | gt(pv5,c2). [resolve(402,a,65,a),flip(a)]. 50.45/50.81 30365 c2 = pv5 | leq(c2,pred(pv5)). [resolve(4875,b,306,a)]. 50.45/50.81 49971 c2 = pv5. [resolve(30365,b,2868,b),unit_del(b,400),unit_del(c,409)]. 50.45/50.81 50278 c1 != n0. [back_rewrite(408),rewrite([49971(4)]),xx(b)]. 50.45/50.81 50279 c1 != n1. [back_rewrite(406),rewrite([49971(1)]),xx(a)]. 50.45/50.81 50280 c1 != n2. [back_rewrite(404),rewrite([49971(1)]),xx(a)]. 50.45/50.81 50287 $F. [back_unit_del(2871),unit_del(a,50279),unit_del(b,50280),unit_del(c,50278)]. 50.45/50.81 50.45/50.81 % SZS output end Refutation 50.45/50.81 ============================== end of proof ========================== 50.45/50.81 50.45/50.81 ============================== STATISTICS ============================ 50.45/50.81 50.45/50.81 Given=3724. Generated=1229265. Kept=50207. proofs=1. 50.45/50.81 Usable=3303. Sos=8867. Demods=1633. Limbo=9, Disabled=38362. Hints=0. 50.45/50.81 Megabytes=46.96. 50.45/50.81 User_CPU=48.60, System_CPU=1.15, Wall_clock=49. 50.45/50.81 50.45/50.81 ============================== end of statistics ===================== 50.45/50.81 50.45/50.81 ============================== end of search ========================= 50.45/50.81 50.45/50.81 THEOREM PROVED 50.45/50.81 % SZS status Theorem 50.45/50.81 50.45/50.81 Exiting with 1 proof. 50.45/50.81 50.45/50.81 Process 7774 exit (max_proofs) Thu Jul 2 07:45:05 2020 50.45/50.81 Prover9 interrupted 50.45/50.81 EOF