0.12/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s 0.13/0.32 % Computer : n012.cluster.edu 0.13/0.32 % Model : x86_64 x86_64 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.32 % Memory : 8042.1875MB 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.32 % CPULimit : 960 0.13/0.32 % DateTime : Thu Jul 2 06:47:36 EDT 2020 0.13/0.32 % CPUTime : 0.77/1.04 ============================== Prover9 =============================== 0.77/1.04 Prover9 (32) version 2009-11A, November 2009. 0.77/1.04 Process 7456 was started by sandbox2 on n012.cluster.edu, 0.77/1.04 Thu Jul 2 06:47:37 2020 0.77/1.04 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_7296_n012.cluster.edu". 0.77/1.04 ============================== end of head =========================== 0.77/1.04 0.77/1.04 ============================== INPUT ================================= 0.77/1.04 0.77/1.04 % Reading from file /tmp/Prover9_7296_n012.cluster.edu 0.77/1.04 0.77/1.04 set(prolog_style_variables). 0.77/1.04 set(auto2). 0.77/1.04 % set(auto2) -> set(auto). 0.77/1.04 % set(auto) -> set(auto_inference). 0.77/1.04 % set(auto) -> set(auto_setup). 0.77/1.04 % set(auto_setup) -> set(predicate_elim). 0.77/1.04 % set(auto_setup) -> assign(eq_defs, unfold). 0.77/1.04 % set(auto) -> set(auto_limits). 0.77/1.04 % set(auto_limits) -> assign(max_weight, "100.000"). 0.77/1.04 % set(auto_limits) -> assign(sos_limit, 20000). 0.77/1.04 % set(auto) -> set(auto_denials). 0.77/1.04 % set(auto) -> set(auto_process). 0.77/1.04 % set(auto2) -> assign(new_constants, 1). 0.77/1.04 % set(auto2) -> assign(fold_denial_max, 3). 0.77/1.04 % set(auto2) -> assign(max_weight, "200.000"). 0.77/1.04 % set(auto2) -> assign(max_hours, 1). 0.77/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.77/1.04 % set(auto2) -> assign(max_seconds, 0). 0.77/1.04 % set(auto2) -> assign(max_minutes, 5). 0.77/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.77/1.04 % set(auto2) -> set(sort_initial_sos). 0.77/1.04 % set(auto2) -> assign(sos_limit, -1). 0.77/1.04 % set(auto2) -> assign(lrs_ticks, 3000). 0.77/1.04 % set(auto2) -> assign(max_megs, 400). 0.77/1.04 % set(auto2) -> assign(stats, some). 0.77/1.04 % set(auto2) -> clear(echo_input). 0.77/1.04 % set(auto2) -> set(quiet). 0.77/1.04 % set(auto2) -> clear(print_initial_clauses). 0.77/1.04 % set(auto2) -> clear(print_given). 0.77/1.04 assign(lrs_ticks,-1). 0.77/1.04 assign(sos_limit,10000). 0.77/1.04 assign(order,kbo). 0.77/1.04 set(lex_order_vars). 0.77/1.04 clear(print_given). 0.77/1.04 0.77/1.04 % formulas(sos). % not echoed (92 formulas) 0.77/1.04 0.77/1.04 ============================== end of input ========================== 0.77/1.04 0.77/1.04 % From the command line: assign(max_seconds, 960). 0.77/1.04 0.77/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.77/1.04 0.77/1.04 % Formulas that are not ordinary clauses: 0.77/1.04 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.77/1.04 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.77/1.04 3 (all X all Y (leq(X,Y) <-> gt(succ(Y),X))) # label(leq_succ_gt_equiv) # label(axiom) # label(non_clause). [assumption]. 0.77/1.04 4 (all X all Y (leq(X,Y) & X != Y -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause). [assumption]. 0.77/1.04 5 (all X succ(succ(succ(succ(succ(X))))) = plus(X,n5)) # label(succ_plus_5_r) # label(axiom) # label(non_clause). [assumption]. 0.77/1.04 6 (all X minus(X,n1) = pred(X)) # label(pred_minus_1) # label(axiom) # label(non_clause). [assumption]. 0.77/1.04 7 (all X succ(succ(succ(succ(X)))) = plus(X,n4)) # label(succ_plus_4_r) # label(axiom) # label(non_clause). [assumption]. 0.77/1.04 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.77/1.04 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.77/1.04 10 (all X X = pred(succ(X))) # label(pred_succ) # label(axiom) # label(non_clause). [assumption]. 0.77/1.04 11 (all X succ(succ(succ(succ(X)))) = plus(n4,X)) # label(succ_plus_4_l) # label(axiom) # label(non_clause). [assumption]. 0.77/1.04 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.77/1.04 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.77/1.05 14 (all X succ(succ(succ(X))) = plus(n3,X)) # label(succ_plus_3_l) # label(axiom) # label(non_clause). [assumption]. 0.77/1.05 15 (all X plus(X,n1) = succ(X)) # label(succ_plus_1_r) # label(axiom) # label(non_clause). [assumption]. 0.77/1.05 16 (all X succ(X) = plus(n1,X)) # label(succ_plus_1_l) # label(axiom) # label(non_clause). [assumption]. 0.77/1.05 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.77/1.05 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.77/1.05 19 (all X -gt(X,X)) # label(irreflexivity_gt) # label(axiom) # label(non_clause). [assumption]. 0.77/1.05 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.77/1.05 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.77/1.05 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.77/1.05 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.77/1.05 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.77/1.05 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.77/1.05 26 (all X plus(n5,X) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_l) # label(axiom) # label(non_clause). [assumption]. 0.77/1.05 27 (all X succ(succ(X)) = plus(n2,X)) # label(succ_plus_2_l) # label(axiom) # label(non_clause). [assumption]. 0.77/1.05 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.77/1.05 29 (all X succ(succ(succ(X))) = plus(X,n3)) # label(succ_plus_3_r) # label(axiom) # label(non_clause). [assumption]. 0.77/1.05 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.77/1.05 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.77/1.05 32 (all X all Y (leq(succ(X),Y) -> gt(Y,X))) # label(leq_succ_gt) # label(axiom) # label(non_clause). [assumption]. 0.77/1.05 33 (all X all Y (gt(Y,X) -> leq(X,Y))) # label(leq_gt1) # label(axiom) # label(non_clause). [assumption]. 0.77/1.05 34 (all Body n0 = sum(n0,tptp_minus_1,Body)) # label(sum_plus_base) # label(axiom) # label(non_clause). [assumption]. 0.77/1.05 35 (all X all Y (leq(X,Y) <-> leq(succ(X),succ(Y)))) # label(leq_succ_succ) # label(axiom) # label(non_clause). [assumption]. 0.77/1.05 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.77/1.05 37 (all X all Y (geq(X,Y) <-> leq(Y,X))) # label(leq_geq) # label(axiom) # label(non_clause). [assumption]. 0.77/1.05 38 (all X all Y (gt(Y,X) <-> leq(X,pred(Y)))) # label(leq_gt_pred) # label(axiom) # label(non_clause). [assumption]. 0.77/1.05 39 (all X all Y (lt(X,Y) <-> gt(Y,X))) # label(lt_gt) # label(axiom) # label(non_clause). [assumption]. 0.77/1.05 40 (all X leq(X,X)) # label(reflexivity_leq) # label(axiom) # label(non_clause). [assumption]. 0.77/1.05 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.77/1.05 42 (all X gt(succ(X),X)) # label(gt_succ) # label(axiom) # label(non_clause). [assumption]. 0.77/1.05 43 (all X all Y (gt(X,Y) | X = Y | gt(Y,X))) # label(totality) # label(axiom) # label(non_clause). [assumption]. 0.77/1.05 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.77/1.05 45 (all X succ(pred(X)) = X) # label(succ_pred) # label(axiom) # label(non_clause). [assumption]. 0.77/1.05 46 (all X succ(succ(X)) = plus(X,n2)) # label(succ_plus_2_r) # label(axiom) # label(non_clause). [assumption]. 0.77/1.05 47 (all X all Y (leq(X,Y) -> leq(X,succ(Y)))) # label(leq_succ) # label(axiom) # label(non_clause). [assumption]. 0.77/1.05 48 (all X all Y (leq(minus(X,Y),X) -> leq(n0,Y))) # label(leq_minus) # label(axiom) # label(non_clause). [assumption]. 0.77/1.05 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.77/1.05 50 (all X (leq(X,n0) & leq(n0,X) -> X = n0)) # label(finite_domain_0) # label(axiom) # label(non_clause). [assumption]. 0.77/1.05 51 (all X (leq(X,n2) & leq(n0,X) -> n0 = X | X = n1 | n2 = X)) # label(finite_domain_2) # label(axiom) # label(non_clause). [assumption]. 0.77/1.05 52 (all X (leq(X,n4) & leq(n0,X) -> n1 = X | n2 = X | n4 = X | n3 = X | X = n0)) # label(finite_domain_4) # label(axiom) # label(non_clause). [assumption]. 0.77/1.05 53 (all X (leq(n0,X) & leq(X,n3) -> n3 = X | X = n2 | X = n1 | n0 = X)) # label(finite_domain_3) # label(axiom) # label(non_clause). [assumption]. 0.77/1.05 54 (all X (leq(X,n5) & leq(n0,X) -> X = n2 | X = n3 | n4 = X | n5 = X | n1 = X | n0 = X)) # label(finite_domain_5) # label(axiom) # label(non_clause). [assumption]. 0.77/1.05 55 (all X (leq(n0,X) & leq(X,n1) -> n1 = X | n0 = X)) # label(finite_domain_1) # label(axiom) # label(non_clause). [assumption]. 0.77/1.05 56 -(a_select2(rho_defuse,n2) = use & use = a_select2(sigma_defuse,n0) & a_select2(sigma_defuse,n1) = use & a_select2(sigma_defuse,n2) = use & use = a_select2(sigma_defuse,n5) & use = a_select3(u_defuse,n1,n0) & a_select3(u_defuse,n2,n0) = use & a_select2(xinit_mean_defuse,n0) = use & a_select2(xinit_mean_defuse,n1) = use & use = a_select2(xinit_mean_defuse,n3) & use = a_select2(xinit_mean_defuse,n5) & a_select2(xinit_noise_defuse,n0) = use & a_select2(xinit_noise_defuse,n1) = use & a_select2(xinit_noise_defuse,n2) = use & use = a_select2(xinit_noise_defuse,n3) & use = a_select2(xinit_noise_defuse,n4) & use = a_select2(xinit_noise_defuse,n5) & leq(n0,pv5) & leq(pv5,n0) & (all A all B (leq(n0,A) & leq(A,n2) & leq(B,pred(pv5)) & leq(n0,B) -> a_select3(u_defuse,A,B) = 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))) & leq(pv5,n998) & use = a_select2(xinit_mean_defuse,n4) & use = a_select2(xinit_mean_defuse,n2) & a_select2(xinit_defuse,n5) = use & a_select2(xinit_defuse,n4) = use & a_select2(xinit_defuse,n3) = use & use = a_select3(u_defuse,n0,n0) & use = a_select2(sigma_defuse,n4) & use = a_select2(sigma_defuse,n3) & a_select2(rho_defuse,n1) = use & use = a_select2(rho_defuse,n0) -> (all E all F (leq(n0,F) & leq(E,n2) & leq(F,pv5) & leq(n0,E) -> (-(E = n2 & F = pv5) & -(F = pv5 & n1 = E) & -(pv5 = F & n0 = E) -> use = a_select3(z_defuse,E,F))))) # label(quaternion_ds1_inuse_0010) # label(negated_conjecture) # label(non_clause). [assumption]. 1.71/2.06 1.71/2.06 ============================== end of process non-clausal formulas === 1.71/2.06 1.71/2.06 ============================== PROCESS INITIAL CLAUSES =============== 1.71/2.06 1.71/2.06 ============================== PREDICATE ELIMINATION ================= 1.71/2.06 57 geq(A,B) | -leq(B,A) # label(leq_geq) # label(axiom). [clausify(37)]. 1.71/2.06 58 -geq(A,B) | leq(B,A) # label(leq_geq) # label(axiom). [clausify(37)]. 1.71/2.06 59 lt(A,B) | -gt(B,A) # label(lt_gt) # label(axiom). [clausify(39)]. 1.71/2.06 60 -lt(A,B) | gt(B,A) # label(lt_gt) # label(axiom). [clausify(39)]. 1.71/2.06 1.71/2.06 ============================== end predicate elimination ============= 1.71/2.06 1.71/2.06 Auto_denials: (non-Horn, no changes). 1.71/2.06 1.71/2.06 Term ordering decisions: 1.71/2.06 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. 1.71/2.06 1.71/2.06 ============================== end of process initial clauses ======== 1.71/2.06 1.71/2.06 ============================== CLAUSES FOR SEARCH ==================== 1.71/2.06 1.71/2.06 ============================== end of clauses for search ============= 1.71/2.06 1.71/2.06 ============================== SEARCH ================================ 1.71/2.06 1.71/2.06 % Starting search at 0.29 seconds. 1.71/2.06 1.71/2.06 ============================== PROOF ================================= 1.71/2.06 % SZS status Theorem 1.71/2.06 % SZS output start Refutation 1.71/2.06 1.71/2.06 % Proof 1 at 1.02 (+ 0.01) seconds. 1.71/2.06 % Length of proof is 27. 1.71/2.06 % Level of proof is 6. 1.71/2.06 % Maximum clause weight is 15.000. 1.71/2.06 % Given clauses 312. 1.71/2.06 1.71/2.06 50 (all X (leq(X,n0) & leq(n0,X) -> X = n0)) # label(finite_domain_0) # label(axiom) # label(non_clause). [assumption]. 1.71/2.06 51 (all X (leq(X,n2) & leq(n0,X) -> n0 = X | X = n1 | n2 = X)) # label(finite_domain_2) # label(axiom) # label(non_clause). [assumption]. 1.71/2.06 56 -(a_select2(rho_defuse,n2) = use & use = a_select2(sigma_defuse,n0) & a_select2(sigma_defuse,n1) = use & a_select2(sigma_defuse,n2) = use & use = a_select2(sigma_defuse,n5) & use = a_select3(u_defuse,n1,n0) & a_select3(u_defuse,n2,n0) = use & a_select2(xinit_mean_defuse,n0) = use & a_select2(xinit_mean_defuse,n1) = use & use = a_select2(xinit_mean_defuse,n3) & use = a_select2(xinit_mean_defuse,n5) & a_select2(xinit_noise_defuse,n0) = use & a_select2(xinit_noise_defuse,n1) = use & a_select2(xinit_noise_defuse,n2) = use & use = a_select2(xinit_noise_defuse,n3) & use = a_select2(xinit_noise_defuse,n4) & use = a_select2(xinit_noise_defuse,n5) & leq(n0,pv5) & leq(pv5,n0) & (all A all B (leq(n0,A) & leq(A,n2) & leq(B,pred(pv5)) & leq(n0,B) -> a_select3(u_defuse,A,B) = 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))) & leq(pv5,n998) & use = a_select2(xinit_mean_defuse,n4) & use = a_select2(xinit_mean_defuse,n2) & a_select2(xinit_defuse,n5) = use & a_select2(xinit_defuse,n4) = use & a_select2(xinit_defuse,n3) = use & use = a_select3(u_defuse,n0,n0) & use = a_select2(sigma_defuse,n4) & use = a_select2(sigma_defuse,n3) & a_select2(rho_defuse,n1) = use & use = a_select2(rho_defuse,n0) -> (all E all F (leq(n0,F) & leq(E,n2) & leq(F,pv5) & leq(n0,E) -> (-(E = n2 & F = pv5) & -(F = pv5 & n1 = E) & -(pv5 = F & n0 = E) -> use = a_select3(z_defuse,E,F))))) # label(quaternion_ds1_inuse_0010) # label(negated_conjecture) # label(non_clause). [assumption]. 1.71/2.06 323 -leq(A,n0) | -leq(n0,A) | n0 = A # label(finite_domain_0) # label(axiom). [clausify(50)]. 1.71/2.06 329 -leq(A,n2) | -leq(n0,A) | n0 = A | n1 = A | n2 = A # label(finite_domain_2) # label(axiom). [clausify(51)]. 1.71/2.06 383 leq(n0,pv5) # label(quaternion_ds1_inuse_0010) # label(negated_conjecture). [clausify(56)]. 1.71/2.06 384 leq(pv5,n0) # label(quaternion_ds1_inuse_0010) # label(negated_conjecture). [clausify(56)]. 1.71/2.06 398 leq(n0,c2) # label(quaternion_ds1_inuse_0010) # label(negated_conjecture). [clausify(56)]. 1.71/2.06 399 leq(c1,n2) # label(quaternion_ds1_inuse_0010) # label(negated_conjecture). [clausify(56)]. 1.71/2.06 400 leq(c2,pv5) # label(quaternion_ds1_inuse_0010) # label(negated_conjecture). [clausify(56)]. 1.71/2.06 401 leq(n0,c1) # label(quaternion_ds1_inuse_0010) # label(negated_conjecture). [clausify(56)]. 1.71/2.06 402 n2 != c1 | pv5 != c2 # label(quaternion_ds1_inuse_0010) # label(negated_conjecture). [clausify(56)]. 1.71/2.06 403 c1 != n2 | c2 != pv5. [copy(402),flip(a),flip(b)]. 1.71/2.06 404 pv5 != c2 | c1 != n1 # label(quaternion_ds1_inuse_0010) # label(negated_conjecture). [clausify(56)]. 1.71/2.06 405 c2 != pv5 | c1 != n1. [copy(404),flip(a)]. 1.71/2.06 406 pv5 != c2 | c1 != n0 # label(quaternion_ds1_inuse_0010) # label(negated_conjecture). [clausify(56)]. 1.71/2.06 407 c2 != pv5 | c1 != n0. [copy(406),flip(a)]. 1.71/2.06 1814 pv5 = n0. [resolve(383,a,323,b),flip(b),unit_del(a,384)]. 1.71/2.06 1821 c2 != n0 | c1 != n0. [back_rewrite(407),rewrite([1814(2)])]. 1.71/2.06 1822 c2 != n0 | c1 != n1. [back_rewrite(405),rewrite([1814(2)])]. 1.71/2.06 1823 c1 != n2 | c2 != n0. [back_rewrite(403),rewrite([1814(5)])]. 1.71/2.06 1824 leq(c2,n0). [back_rewrite(400),rewrite([1814(2)])]. 1.71/2.06 1852 c2 = n0. [resolve(398,a,323,b),flip(b),unit_del(a,1824)]. 1.71/2.06 1853 c1 != n2. [back_rewrite(1823),rewrite([1852(4)]),xx(b)]. 1.71/2.06 1854 c1 != n1. [back_rewrite(1822),rewrite([1852(1)]),xx(a)]. 1.71/2.06 1855 c1 != n0. [back_rewrite(1821),rewrite([1852(1)]),xx(a)]. 1.71/2.06 1857 $F. [resolve(399,a,329,a),flip(b),flip(c),flip(d),unit_del(a,401),unit_del(b,1855),unit_del(c,1854),unit_del(d,1853)]. 1.71/2.06 1.71/2.06 % SZS output end Refutation 1.71/2.06 ============================== end of proof ========================== 1.71/2.06 1.71/2.06 ============================== STATISTICS ============================ 1.71/2.06 1.71/2.06 Given=312. Generated=7194. Kept=1778. proofs=1. 1.71/2.06 Usable=310. Sos=1413. Demods=57. Limbo=0, Disabled=389. Hints=0. 1.71/2.06 Megabytes=5.43. 1.71/2.06 User_CPU=1.02, System_CPU=0.01, Wall_clock=1. 1.71/2.06 1.71/2.06 ============================== end of statistics ===================== 1.71/2.06 1.71/2.06 ============================== end of search ========================= 1.71/2.06 1.71/2.06 THEOREM PROVED 1.71/2.06 % SZS status Theorem 1.71/2.06 1.71/2.06 Exiting with 1 proof. 1.71/2.06 1.71/2.06 Process 7456 exit (max_proofs) Thu Jul 2 06:47:38 2020 1.71/2.06 Prover9 interrupted 1.71/2.06 EOF