0.00/0.03 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % Command : tptp2X_and_run_prover9 %d %s 0.02/0.23 % Computer : n014.star.cs.uiowa.edu 0.02/0.23 % Model : x86_64 x86_64 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.02/0.23 % Memory : 32218.625MB 0.02/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.02/0.23 % CPULimit : 300 0.02/0.23 % DateTime : Sat Jul 14 04:52:25 CDT 2018 0.02/0.23 % CPUTime : 0.31/0.53 ============================== Prover9 =============================== 0.31/0.53 Prover9 (32) version 2009-11A, November 2009. 0.31/0.53 Process 58295 was started by sandbox2 on n014.star.cs.uiowa.edu, 0.31/0.53 Sat Jul 14 04:52:25 2018 0.31/0.53 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_58263_n014.star.cs.uiowa.edu". 0.31/0.53 ============================== end of head =========================== 0.31/0.53 0.31/0.53 ============================== INPUT ================================= 0.31/0.53 0.31/0.53 % Reading from file /tmp/Prover9_58263_n014.star.cs.uiowa.edu 0.31/0.53 0.31/0.53 set(prolog_style_variables). 0.31/0.53 set(auto2). 0.31/0.53 % set(auto2) -> set(auto). 0.31/0.53 % set(auto) -> set(auto_inference). 0.31/0.53 % set(auto) -> set(auto_setup). 0.31/0.53 % set(auto_setup) -> set(predicate_elim). 0.31/0.53 % set(auto_setup) -> assign(eq_defs, unfold). 0.31/0.53 % set(auto) -> set(auto_limits). 0.31/0.53 % set(auto_limits) -> assign(max_weight, "100.000"). 0.31/0.53 % set(auto_limits) -> assign(sos_limit, 20000). 0.31/0.53 % set(auto) -> set(auto_denials). 0.31/0.53 % set(auto) -> set(auto_process). 0.31/0.53 % set(auto2) -> assign(new_constants, 1). 0.31/0.53 % set(auto2) -> assign(fold_denial_max, 3). 0.31/0.53 % set(auto2) -> assign(max_weight, "200.000"). 0.31/0.53 % set(auto2) -> assign(max_hours, 1). 0.31/0.53 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.31/0.53 % set(auto2) -> assign(max_seconds, 0). 0.31/0.53 % set(auto2) -> assign(max_minutes, 5). 0.31/0.53 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.31/0.53 % set(auto2) -> set(sort_initial_sos). 0.31/0.53 % set(auto2) -> assign(sos_limit, -1). 0.31/0.53 % set(auto2) -> assign(lrs_ticks, 3000). 0.31/0.53 % set(auto2) -> assign(max_megs, 400). 0.31/0.53 % set(auto2) -> assign(stats, some). 0.31/0.53 % set(auto2) -> clear(echo_input). 0.31/0.53 % set(auto2) -> set(quiet). 0.31/0.53 % set(auto2) -> clear(print_initial_clauses). 0.31/0.53 % set(auto2) -> clear(print_given). 0.31/0.53 assign(lrs_ticks,-1). 0.31/0.53 assign(sos_limit,10000). 0.31/0.53 assign(order,kbo). 0.31/0.53 set(lex_order_vars). 0.31/0.53 clear(print_given). 0.31/0.53 0.31/0.53 % formulas(sos). % not echoed (92 formulas) 0.31/0.53 0.31/0.53 ============================== end of input ========================== 0.31/0.53 0.31/0.53 % From the command line: assign(max_seconds, 300). 0.31/0.53 0.31/0.53 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.31/0.53 0.31/0.53 % Formulas that are not ordinary clauses: 0.31/0.53 1 (all A all N ((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(I,N) & leq(J,N) & leq(n0,J) -> a_select3(trans(A),J,I) = a_select3(trans(A),I,J))))) # label(matrix_symm_trans) # label(axiom) # label(non_clause). [assumption]. 0.31/0.53 2 (all X plus(n4,X) = succ(succ(succ(succ(X))))) # label(succ_plus_4_l) # label(axiom) # label(non_clause). [assumption]. 0.31/0.53 3 (all X succ(X) = plus(n1,X)) # label(succ_plus_1_l) # label(axiom) # label(non_clause). [assumption]. 0.31/0.53 4 (all I all U all X all VAL (leq(n0,I) & leq(I,U) & (all I0 (leq(I0,U) & leq(n0,I0) -> VAL = a_select2(X,I0))) -> VAL = a_select2(tptp_update2(X,U,VAL),I))) # label(sel2_update_3) # label(axiom) # label(non_clause). [assumption]. 0.31/0.53 5 (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.31/0.53 6 (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.31/0.53 7 (all I all U all X all VAL all VAL2 (VAL = a_select2(X,U) & I != U -> a_select2(tptp_update2(X,I,VAL2),U) = VAL)) # label(sel2_update_2) # label(axiom) # label(non_clause). [assumption]. 0.31/0.53 8 (all Body sum(n0,tptp_minus_1,Body) = n0) # label(sum_plus_base) # label(axiom) # label(non_clause). [assumption]. 0.31/0.53 9 (all I all L all U all Val (leq(I,U) & leq(L,I) -> a_select2(tptp_const_array1(dim(L,U),Val),I) = Val)) # label(const_array1_select) # label(axiom) # label(non_clause). [assumption]. 0.31/0.53 10 (all X all Y (leq(succ(X),succ(Y)) <-> leq(X,Y))) # label(leq_succ_succ) # label(axiom) # label(non_clause). [assumption]. 0.31/0.53 11 (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) -> 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]. 0.31/0.53 12 (all X succ(pred(X)) = X) # label(succ_pred) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 13 (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.31/0.54 14 (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 all K all VAL (leq(n0,I) & leq(n0,J) & leq(n0,K) & leq(K,N) & leq(J,N) & leq(I,N) -> a_select3(tptp_update3(A,K,K,VAL),I,J) = a_select3(tptp_update3(A,K,K,VAL),J,I))))) # label(matrix_symm_update_diagonal) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 15 (all A all B all N all M ((all I all J (leq(n0,I) & leq(J,M) & leq(n0,J) & leq(I,M) -> a_select3(B,I,J) = a_select3(B,J,I))) -> (all I all J (leq(J,N) & leq(n0,J) & leq(I,N) & leq(n0,I) -> a_select3(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.31/0.54 16 (all X all Y (gt(Y,X) -> leq(X,Y))) # label(leq_gt1) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 17 (all X all Y (X != Y & leq(X,Y) -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 18 (all X all Y (X = Y | gt(Y,X) | gt(X,Y))) # label(totality) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 19 (all X plus(X,n4) = succ(succ(succ(succ(X))))) # label(succ_plus_4_r) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 20 (all I all J all U all V all X all VAL (leq(I,U) & leq(n0,J) & leq(J,V) & leq(n0,I) & (all I0 all J0 (leq(n0,I0) & leq(I0,U) & leq(J0,V) & leq(n0,J0) -> a_select3(X,I0,J0) = VAL)) -> a_select3(tptp_update3(X,U,V,VAL),I,J) = VAL)) # label(sel3_update_3) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 21 (all X plus(X,n1) = succ(X)) # label(succ_plus_1_r) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 22 (all X all Y (leq(X,Y) -> leq(X,succ(Y)))) # label(leq_succ) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 23 (all X plus(X,n5) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_r) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 24 (all X all Y (leq(minus(X,Y),X) -> leq(n0,Y))) # label(leq_minus) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 25 (all A all B all C all D all E all F all N all M ((all I all J (leq(I,N) & leq(n0,J) & leq(J,N) & leq(n0,I) -> a_select3(F,J,I) = a_select3(F,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,M) & leq(n0,J) & leq(I,M) -> a_select3(D,I,J) = a_select3(D,J,I))) -> (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)))),I,J) = 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))))) # label(matrix_symm_joseph_update) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 26 (all X all Y all Z (leq(Y,Z) & leq(X,Y) -> leq(X,Z))) # label(transitivity_leq) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 27 (all X minus(X,n1) = pred(X)) # label(pred_minus_1) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 28 (all X -gt(X,X)) # label(irreflexivity_gt) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 29 (all X all Y (gt(succ(Y),X) <-> leq(X,Y))) # label(leq_succ_gt_equiv) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 30 (all I all J all U all V all X all VAL all VAL2 (V = J & a_select3(X,U,V) = VAL & U != I -> a_select3(tptp_update3(X,I,J,VAL2),U,V) = VAL)) # label(sel3_update_2) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 31 (all X all Y (lt(X,Y) <-> gt(Y,X))) # label(lt_gt) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 32 (all X succ(succ(X)) = plus(X,n2)) # label(succ_plus_2_r) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 33 (all X all Y (geq(X,Y) <-> leq(Y,X))) # label(leq_geq) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 34 (all X plus(n2,X) = succ(succ(X))) # label(succ_plus_2_l) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 35 (all A all N ((all I all J (leq(n0,I) & leq(I,N) & leq(J,N) & leq(n0,J) -> a_select3(A,J,I) = a_select3(A,I,J))) -> (all I all J (leq(I,N) & leq(J,N) & leq(n0,J) & leq(n0,I) -> a_select3(inv(A),I,J) = a_select3(inv(A),J,I))))) # label(matrix_symm_inv) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 36 (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(I,N) & leq(n0,J) & leq(J,N) & leq(n0,I) -> a_select3(A,J,I) = a_select3(A,I,J))) -> (all I all J (leq(n0,I) & leq(n0,J) & leq(J,N) & leq(I,N) -> a_select3(tptp_madd(A,B),I,J) = a_select3(tptp_madd(A,B),J,I))))) # label(matrix_symm_add) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 37 (all X pred(succ(X)) = X) # label(pred_succ) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 38 (all Body tptp_float_0_0 = sum(n0,tptp_minus_1,Body)) # label(sum_plus_base_float) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 39 (all X succ(succ(succ(X))) = plus(X,n3)) # label(succ_plus_3_r) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 40 (all X all Y (gt(Y,X) <-> leq(X,pred(Y)))) # label(leq_gt_pred) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 41 (all X leq(X,X)) # label(reflexivity_leq) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 42 (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,I,J) = a_select3(B,J,I))) -> (all I all J (leq(I,N) & leq(n0,J) & leq(J,N) & leq(n0,I) -> a_select3(tptp_mmul(A,tptp_mmul(B,trans(A))),I,J) = a_select3(tptp_mmul(A,tptp_mmul(B,trans(A))),J,I))))) # label(matrix_symm_aba1) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 43 (all X all U all V all VAL a_select3(tptp_update3(X,U,V,VAL),U,V) = VAL) # label(sel3_update_1) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 44 (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(I,N) & leq(J,N) & leq(n0,J) & leq(n0,I) -> a_select3(tptp_msub(A,B),J,I) = a_select3(tptp_msub(A,B),I,J))))) # label(matrix_symm_sub) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 45 (all X all U all VAL a_select2(tptp_update2(X,U,VAL),U) = VAL) # label(sel2_update_1) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 46 (all X succ(succ(succ(X))) = plus(n3,X)) # label(succ_plus_3_l) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 47 (all X succ(succ(succ(succ(succ(X))))) = plus(n5,X)) # label(succ_plus_5_l) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 48 (all X all Y (leq(succ(X),Y) -> gt(Y,X))) # label(leq_succ_gt) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 49 (all X gt(succ(X),X)) # label(gt_succ) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 50 (all X (leq(n0,X) & leq(X,n4) -> n0 = X | X = n1 | n3 = X | n4 = X | X = n2)) # label(finite_domain_4) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 51 (all X (leq(X,n5) & leq(n0,X) -> n1 = X | X = n2 | X = n4 | n5 = X | n3 = X | n0 = X)) # label(finite_domain_5) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 52 (all X (leq(X,n2) & leq(n0,X) -> X = n2 | X = n1 | X = n0)) # label(finite_domain_2) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 53 (all X (leq(X,n3) & leq(n0,X) -> n2 = X | X = n3 | n1 = X | n0 = X)) # label(finite_domain_3) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 54 (all X (leq(n0,X) & leq(X,n0) -> X = n0)) # label(finite_domain_0) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 55 (all X (leq(X,n1) & leq(n0,X) -> X = n0 | X = n1)) # label(finite_domain_1) # label(axiom) # label(non_clause). [assumption]. 0.31/0.54 56 -(a_select2(rho_defuse,n0) = use & use = a_select2(rho_defuse,n2) & use = a_select2(sigma_defuse,n0) & a_select2(sigma_defuse,n2) = use & a_select2(sigma_defuse,n4) = use & a_select2(sigma_defuse,n5) = use & use = a_select3(u_defuse,n0,n0) & a_select3(u_defuse,n2,n0) = use & a_select2(xinit_defuse,n3) = use & use = a_select2(xinit_defuse,n4) & use = a_select2(xinit_defuse,n5) & a_select2(xinit_mean_defuse,n4) = use & a_select2(xinit_noise_defuse,n1) = use & use = a_select2(xinit_noise_defuse,n2) & a_select2(xinit_noise_defuse,n4) = use & leq(n0,pv5) & leq(pv5,n0) & leq(pv5,n998) & (all C all D (leq(n0,C) & leq(D,pred(pv5)) & leq(C,n2) & leq(n0,D) -> a_select3(z_defuse,C,D) = use)) & (all A all B (leq(n0,B) & leq(A,n2) & leq(B,pred(pv5)) & leq(n0,A) -> a_select3(u_defuse,A,B) = use)) & use = a_select2(xinit_noise_defuse,n5) & use = a_select2(xinit_noise_defuse,n3) & use = a_select2(xinit_noise_defuse,n0) & a_select2(xinit_mean_defuse,n5) = use & a_select2(xinit_mean_defuse,n3) = use & a_select2(xinit_mean_defuse,n2) = use & use = a_select2(xinit_mean_defuse,n1) & a_select2(xinit_mean_defuse,n0) = use & use = a_select3(u_defuse,n1,n0) & use = a_select2(sigma_defuse,n3) & a_select2(sigma_defuse,n1) = use & a_select2(rho_defuse,n1) = use -> (all E all F (leq(F,pv5) & leq(E,n2) & leq(n0,F) & leq(n0,E) -> a_select3(u_defuse,E,F) = use))) # label(quaternion_ds1_inuse_0009) # label(negated_conjecture) # label(non_clause). [assumption]. 7.95/8.21 7.95/8.21 ============================== end of process non-clausal formulas === 7.95/8.21 7.95/8.21 ============================== PROCESS INITIAL CLAUSES =============== 7.95/8.21 7.95/8.21 ============================== PREDICATE ELIMINATION ================= 7.95/8.21 57 lt(A,B) | -gt(B,A) # label(lt_gt) # label(axiom). [clausify(31)]. 7.95/8.21 58 -lt(A,B) | gt(B,A) # label(lt_gt) # label(axiom). [clausify(31)]. 7.95/8.21 59 geq(A,B) | -leq(B,A) # label(leq_geq) # label(axiom). [clausify(33)]. 7.95/8.21 60 -geq(A,B) | leq(B,A) # label(leq_geq) # label(axiom). [clausify(33)]. 7.95/8.21 7.95/8.21 ============================== end predicate elimination ============= 7.95/8.21 7.95/8.21 Auto_denials: (non-Horn, no changes). 7.95/8.21 7.95/8.21 Term ordering decisions: 7.95/8.21 Function symbol KB weights: n0=1. use=1. n2=1. n1=1. n3=1. n4=1. n5=1. tptp_minus_1=1. n998=1. pv5=1. sigma_defuse=1. xinit_mean_defuse=1. xinit_noise_defuse=1. u_defuse=1. rho_defuse=1. xinit_defuse=1. tptp_float_0_0=1. z_defuse=1. def=1. c1=1. c2=1. tptp_mmul=1. tptp_madd=1. tptp_msub=1. a_select2=1. plus=1. dim=1. minus=1. uniform_int_rnd=1. tptp_const_array1=1. f1=1. f2=1. f4=1. f5=1. f16=1. f17=1. trans=1. succ=1. inv=1. pred=1. a_select3=1. tptp_update2=1. sum=1. tptp_const_array2=1. f18=1. f19=1. f20=1. f21=1. f22=1. f23=1. f24=1. f25=1. f26=1. f27=1. tptp_update3=1. f3=1. f6=1. f7=1. f8=1. f9=1. f10=1. f11=1. f12=1. f13=1. f14=1. f15=1. 7.95/8.22 7.95/8.22 ============================== end of process initial clauses ======== 7.95/8.22 7.95/8.22 ============================== CLAUSES FOR SEARCH ==================== 7.95/8.22 7.95/8.22 ============================== end of clauses for search ============= 7.95/8.22 7.95/8.22 ============================== SEARCH ================================ 7.95/8.22 7.95/8.22 % Starting search at 0.21 seconds. 7.95/8.22 7.95/8.22 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 248 (0.00 of 1.16 sec). 7.95/8.22 7.95/8.22 Low Water (keep): wt=173.000, iters=3541 7.95/8.22 7.95/8.22 Low Water (keep): wt=143.000, iters=3433 7.95/8.22 7.95/8.22 Low Water (keep): wt=140.000, iters=3600 7.95/8.22 7.95/8.22 Low Water (keep): wt=119.000, iters=3585 7.95/8.22 7.95/8.22 Low Water (keep): wt=116.000, iters=3345 7.95/8.22 7.95/8.22 Low Water (keep): wt=110.000, iters=3517 7.95/8.22 7.95/8.22 Low Water (keep): wt=89.000, iters=3427 7.95/8.22 7.95/8.22 Low Water (keep): wt=86.000, iters=3621 7.95/8.22 7.95/8.22 Low Water (keep): wt=80.000, iters=3493 7.95/8.22 7.95/8.22 Low Water (keep): wt=58.000, iters=3453 7.95/8.22 7.95/8.22 Low Water (keep): wt=47.000, iters=3343 7.95/8.22 7.95/8.22 Low Water (keep): wt=46.000, iters=3493 7.95/8.22 7.95/8.22 Low Water (keep): wt=40.000, iters=3343 7.95/8.22 7.95/8.22 Low Water (keep): wt=34.000, iters=3396 7.95/8.22 7.95/8.22 Low Water (displace): id=6625, wt=179.000 7.95/8.22 7.95/8.22 Low Water (displace): id=10964, wt=19.000 7.95/8.22 7.95/8.22 Low Water (displace): id=10969, wt=16.000 7.95/8.22 7.95/8.22 Low Water (displace): id=11340, wt=15.000 7.95/8.22 7.95/8.22 Low Water (displace): id=11476, wt=13.000 7.95/8.22 7.95/8.22 Low Water (keep): wt=32.000, iters=3333 7.95/8.22 7.95/8.22 Low Water (keep): wt=31.000, iters=3345 7.95/8.22 7.95/8.22 Low Water (keep): wt=30.000, iters=3370 7.95/8.22 7.95/8.22 Low Water (keep): wt=28.000, iters=3353 7.95/8.22 7.95/8.22 Low Water (displace): id=17215, wt=11.000 7.95/8.22 7.95/8.22 Low Water (displace): id=17958, wt=8.000 7.95/8.22 7.95/8.22 Low Water (keep): wt=27.000, iters=3365 7.95/8.22 7.95/8.22 Low Water (keep): wt=26.000, iters=3351 7.95/8.22 7.95/8.22 Low Water (keep): wt=25.000, iters=3356 7.95/8.22 7.95/8.22 Low Water (displace): id=20292, wt=6.000 7.95/8.22 7.95/8.22 Low Water (displace): id=21365, wt=5.000 7.95/8.22 7.95/8.22 Low Water (keep): wt=24.000, iters=3348 19.65/19.88 19.65/19.88 Low Water (keep): wt=23.000, iters=3356 19.65/19.88 19.65/19.88 Low Water (keep): wt=22.000, iters=3346 19.65/19.88 19.65/19.88 Low Water (keep): wt=21.000, iters=3675 19.65/19.88 19.65/19.88 Low Water (keep): wt=20.000, iters=3468 19.65/19.88 19.65/19.88 Low Water (keep): wt=19.000, iters=3399 19.65/19.88 19.65/19.88 Low Water (keep): wt=18.000, iters=3336 19.65/19.88 19.65/19.88 ============================== PROOF ================================= 19.65/19.88 % SZS status Theorem 19.65/19.88 % SZS output start Refutation 19.65/19.88 19.65/19.88 % Proof 1 at 19.07 (+ 0.28) seconds. 19.65/19.88 % Length of proof is 25. 19.65/19.88 % Level of proof is 9. 19.65/19.88 % Maximum clause weight is 15.000. 19.65/19.88 % Given clauses 2280. 19.65/19.88 19.65/19.88 52 (all X (leq(X,n2) & leq(n0,X) -> X = n2 | X = n1 | X = n0)) # label(finite_domain_2) # label(axiom) # label(non_clause). [assumption]. 19.65/19.88 54 (all X (leq(n0,X) & leq(X,n0) -> X = n0)) # label(finite_domain_0) # label(axiom) # label(non_clause). [assumption]. 19.65/19.88 56 -(a_select2(rho_defuse,n0) = use & use = a_select2(rho_defuse,n2) & use = a_select2(sigma_defuse,n0) & a_select2(sigma_defuse,n2) = use & a_select2(sigma_defuse,n4) = use & a_select2(sigma_defuse,n5) = use & use = a_select3(u_defuse,n0,n0) & a_select3(u_defuse,n2,n0) = use & a_select2(xinit_defuse,n3) = use & use = a_select2(xinit_defuse,n4) & use = a_select2(xinit_defuse,n5) & a_select2(xinit_mean_defuse,n4) = use & a_select2(xinit_noise_defuse,n1) = use & use = a_select2(xinit_noise_defuse,n2) & a_select2(xinit_noise_defuse,n4) = use & leq(n0,pv5) & leq(pv5,n0) & leq(pv5,n998) & (all C all D (leq(n0,C) & leq(D,pred(pv5)) & leq(C,n2) & leq(n0,D) -> a_select3(z_defuse,C,D) = use)) & (all A all B (leq(n0,B) & leq(A,n2) & leq(B,pred(pv5)) & leq(n0,A) -> a_select3(u_defuse,A,B) = use)) & use = a_select2(xinit_noise_defuse,n5) & use = a_select2(xinit_noise_defuse,n3) & use = a_select2(xinit_noise_defuse,n0) & a_select2(xinit_mean_defuse,n5) = use & a_select2(xinit_mean_defuse,n3) = use & a_select2(xinit_mean_defuse,n2) = use & use = a_select2(xinit_mean_defuse,n1) & a_select2(xinit_mean_defuse,n0) = use & use = a_select3(u_defuse,n1,n0) & use = a_select2(sigma_defuse,n3) & a_select2(sigma_defuse,n1) = use & a_select2(rho_defuse,n1) = use -> (all E all F (leq(F,pv5) & leq(E,n2) & leq(n0,F) & leq(n0,E) -> a_select3(u_defuse,E,F) = use))) # label(quaternion_ds1_inuse_0009) # label(negated_conjecture) # label(non_clause). [assumption]. 19.65/19.89 342 -leq(A,n2) | -leq(n0,A) | n2 = A | n1 = A | A = n0 # label(finite_domain_2) # label(axiom). [clausify(52)]. 19.65/19.89 343 -leq(A,n2) | -leq(n0,A) | n2 = A | n1 = A | n0 = A. [copy(342),flip(e)]. 19.65/19.89 369 -leq(n0,A) | -leq(A,n0) | A = n0 # label(finite_domain_0) # label(axiom). [clausify(54)]. 19.65/19.89 370 -leq(n0,A) | -leq(A,n0) | n0 = A. [copy(369),flip(c)]. 19.65/19.89 379 a_select3(u_defuse,n0,n0) = use # label(quaternion_ds1_inuse_0009) # label(negated_conjecture). [clausify(56)]. 19.65/19.89 380 a_select3(u_defuse,n2,n0) = use # label(quaternion_ds1_inuse_0009) # label(negated_conjecture). [clausify(56)]. 19.65/19.89 388 leq(n0,pv5) # label(quaternion_ds1_inuse_0009) # label(negated_conjecture). [clausify(56)]. 19.65/19.89 389 leq(pv5,n0) # label(quaternion_ds1_inuse_0009) # label(negated_conjecture). [clausify(56)]. 19.65/19.89 401 a_select3(u_defuse,n1,n0) = use # label(quaternion_ds1_inuse_0009) # label(negated_conjecture). [clausify(56)]. 19.65/19.89 405 leq(c2,pv5) # label(quaternion_ds1_inuse_0009) # label(negated_conjecture). [clausify(56)]. 19.65/19.89 406 leq(c1,n2) # label(quaternion_ds1_inuse_0009) # label(negated_conjecture). [clausify(56)]. 19.65/19.89 407 leq(n0,c2) # label(quaternion_ds1_inuse_0009) # label(negated_conjecture). [clausify(56)]. 19.65/19.89 408 leq(n0,c1) # label(quaternion_ds1_inuse_0009) # label(negated_conjecture). [clausify(56)]. 19.65/19.89 409 a_select3(u_defuse,c1,c2) != use # label(quaternion_ds1_inuse_0009) # label(negated_conjecture). [clausify(56)]. 19.65/19.89 1834 pv5 = n0. [resolve(388,a,370,a),flip(b),unit_del(a,389)]. 19.65/19.89 1841 leq(c2,n0). [back_rewrite(405),rewrite([1834(2)])]. 19.65/19.89 1868 c1 = n2 | c1 = n1 | c1 = n0. [resolve(406,a,343,a),flip(b),flip(c),flip(d),unit_del(a,408)]. 19.65/19.89 2146 c2 = n0. [resolve(407,a,370,a),flip(b),unit_del(a,1841)]. 19.65/19.89 2147 a_select3(u_defuse,c1,n0) != use. [back_rewrite(409),rewrite([2146(3)])]. 19.65/19.89 37609 c1 = n2 | c1 = n0. [para(1868(b,1),2147(a,1,2)),rewrite([401(10)]),xx(c)]. 19.65/19.89 38223 c1 = n0. [para(37609(a,1),2147(a,1,2)),rewrite([380(7)]),xx(b)]. 19.65/19.89 38535 $F. [back_rewrite(2147),rewrite([38223(2),379(4)]),xx(a)]. 19.65/19.89 19.65/19.89 % SZS output end Refutation 19.65/19.89 ============================== end of proof ========================== 19.65/19.89 19.65/19.89 ============================== STATISTICS ============================ 19.65/19.89 19.65/19.89 Given=2280. Generated=491096. Kept=38452. proofs=1. 19.65/19.89 Usable=1934. Sos=7141. Demods=1076. Limbo=312, Disabled=29396. Hints=0. 19.65/19.89 Megabytes=43.56. 19.65/19.89 User_CPU=19.07, System_CPU=0.28, Wall_clock=19. 19.65/19.89 19.65/19.89 ============================== end of statistics ===================== 19.65/19.89 19.65/19.89 ============================== end of search ========================= 19.65/19.89 19.65/19.89 THEOREM PROVED 19.65/19.89 % SZS status Theorem 19.65/19.89 19.65/19.89 Exiting with 1 proof. 19.65/19.89 19.65/19.89 Process 58295 exit (max_proofs) Sat Jul 14 04:52:44 2018 19.65/19.89 Prover9 interrupted 19.65/19.89 EOF