0.11/0.11	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.12	% Command  : tptp2X_and_run_prover9 %d %s
0.11/0.32	% Computer : n016.cluster.edu
0.11/0.32	% Model    : x86_64 x86_64
0.11/0.32	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.32	% Memory   : 8042.1875MB
0.11/0.32	% OS       : Linux 3.10.0-693.el7.x86_64
0.11/0.32	% CPULimit : 960
0.11/0.32	% WCLimit  : 120
0.11/0.32	% DateTime : Tue Aug  9 03:20:57 EDT 2022
0.17/0.32	% CPUTime  : 
0.76/1.03	============================== Prover9 ===============================
0.76/1.03	Prover9 (32) version 2009-11A, November 2009.
0.76/1.03	Process 22044 was started by sandbox2 on n016.cluster.edu,
0.76/1.03	Tue Aug  9 03:20:57 2022
0.76/1.03	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_21727_n016.cluster.edu".
0.76/1.03	============================== end of head ===========================
0.76/1.03	
0.76/1.03	============================== INPUT =================================
0.76/1.03	
0.76/1.03	% Reading from file /tmp/Prover9_21727_n016.cluster.edu
0.76/1.03	
0.76/1.03	set(prolog_style_variables).
0.76/1.03	set(auto2).
0.76/1.03	    % set(auto2) -> set(auto).
0.76/1.03	    % set(auto) -> set(auto_inference).
0.76/1.03	    % set(auto) -> set(auto_setup).
0.76/1.03	    % set(auto_setup) -> set(predicate_elim).
0.76/1.03	    % set(auto_setup) -> assign(eq_defs, unfold).
0.76/1.03	    % set(auto) -> set(auto_limits).
0.76/1.03	    % set(auto_limits) -> assign(max_weight, "100.000").
0.76/1.03	    % set(auto_limits) -> assign(sos_limit, 20000).
0.76/1.03	    % set(auto) -> set(auto_denials).
0.76/1.03	    % set(auto) -> set(auto_process).
0.76/1.03	    % set(auto2) -> assign(new_constants, 1).
0.76/1.03	    % set(auto2) -> assign(fold_denial_max, 3).
0.76/1.03	    % set(auto2) -> assign(max_weight, "200.000").
0.76/1.03	    % set(auto2) -> assign(max_hours, 1).
0.76/1.03	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.76/1.03	    % set(auto2) -> assign(max_seconds, 0).
0.76/1.03	    % set(auto2) -> assign(max_minutes, 5).
0.76/1.03	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.76/1.03	    % set(auto2) -> set(sort_initial_sos).
0.76/1.03	    % set(auto2) -> assign(sos_limit, -1).
0.76/1.03	    % set(auto2) -> assign(lrs_ticks, 3000).
0.76/1.03	    % set(auto2) -> assign(max_megs, 400).
0.76/1.03	    % set(auto2) -> assign(stats, some).
0.76/1.03	    % set(auto2) -> clear(echo_input).
0.76/1.03	    % set(auto2) -> set(quiet).
0.76/1.03	    % set(auto2) -> clear(print_initial_clauses).
0.76/1.03	    % set(auto2) -> clear(print_given).
0.76/1.03	assign(lrs_ticks,-1).
0.76/1.03	assign(sos_limit,10000).
0.76/1.03	assign(order,kbo).
0.76/1.03	set(lex_order_vars).
0.76/1.03	clear(print_given).
0.76/1.03	
0.76/1.03	% formulas(sos).  % not echoed (92 formulas)
0.76/1.03	
0.76/1.03	============================== end of input ==========================
0.76/1.03	
0.76/1.03	% From the command line: assign(max_seconds, 960).
0.76/1.03	
0.76/1.03	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.76/1.03	
0.76/1.03	% Formulas that are not ordinary clauses:
0.76/1.03	1 (all A all B all C all D all E all F all N all M ((all I all J (leq(n0,I) & leq(I,N) & leq(J,N) & leq(n0,J) -> a_select3(A,I,J) = a_select3(A,J,I))) & (all I all J (leq(n0,I) & leq(n0,J) & leq(J,N) & leq(I,N) -> a_select3(F,J,I) = a_select3(F,I,J))) & (all I all J (leq(n0,I) & leq(I,M) & leq(n0,J) & leq(J,M) -> a_select3(D,J,I) = a_select3(D,I,J))) -> (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.76/1.03	2 (all A all N ((all I all J (leq(n0,I) & leq(I,N) & leq(J,N) & leq(n0,J) -> a_select3(A,I,J) = a_select3(A,J,I))) -> (all I all J all K all VAL (leq(n0,I) & leq(n0,J) & leq(K,N) & leq(n0,K) & leq(J,N) & leq(I,N) -> a_select3(tptp_update3(A,K,K,VAL),I,J) = a_select3(tptp_update3(A,K,K,VAL),J,I))))) # label(matrix_symm_update_diagonal) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	3 (all X all Y (gt(Y,X) -> leq(X,Y))) # label(leq_gt1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	4 (all I all L all U all Val (leq(L,I) & leq(I,U) -> a_select2(tptp_const_array1(dim(L,U),Val),I) = Val)) # label(const_array1_select) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	5 (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.76/1.03	6 (all X minus(X,n1) = pred(X)) # label(pred_minus_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	7 (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.76/1.03	8 (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.76/1.03	9 (all X pred(succ(X)) = X) # label(pred_succ) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	10 (all X succ(succ(X)) = plus(X,n2)) # label(succ_plus_2_r) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	11 (all X all Y (leq(X,Y) <-> leq(succ(X),succ(Y)))) # label(leq_succ_succ) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	12 (all A all N ((all I all J (leq(I,N) & leq(J,N) & leq(n0,J) & leq(n0,I) -> a_select3(A,I,J) = a_select3(A,J,I))) -> (all I all J (leq(n0,I) & leq(n0,J) & leq(J,N) & leq(I,N) -> a_select3(trans(A),I,J) = a_select3(trans(A),J,I))))) # label(matrix_symm_trans) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	13 (all A all N ((all I all J (leq(J,N) & leq(n0,J) & leq(I,N) & leq(n0,I) -> a_select3(A,I,J) = a_select3(A,J,I))) -> (all I all J (leq(I,N) & leq(n0,J) & leq(J,N) & 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.76/1.03	14 (all I all J all U all V all X all VAL all VAL2 (I != U & a_select3(X,U,V) = VAL & V = J -> VAL = a_select3(tptp_update3(X,I,J,VAL2),U,V))) # label(sel3_update_2) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	15 (all X leq(X,X)) # label(reflexivity_leq) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	16 (all Body n0 = sum(n0,tptp_minus_1,Body)) # label(sum_plus_base) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	17 (all X -gt(X,X)) # label(irreflexivity_gt) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	18 (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.76/1.03	19 (all X all Y (leq(succ(X),Y) -> gt(Y,X))) # label(leq_succ_gt) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	20 (all X all Y (gt(Y,X) | X = Y | gt(X,Y))) # label(totality) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	21 (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.76/1.03	22 (all X succ(X) = plus(n1,X)) # label(succ_plus_1_l) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	23 (all I all L1 all U1 all J all L2 all U2 all Val (leq(L1,I) & leq(I,U1) & leq(J,U2) & leq(L2,J) -> Val = a_select3(tptp_const_array2(dim(L1,U1),dim(L2,U2),Val),I,J))) # label(const_array2_select) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	24 (all X gt(succ(X),X)) # label(gt_succ) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	25 (all X all Y (leq(X,Y) -> leq(X,succ(Y)))) # label(leq_succ) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	26 (all X succ(succ(succ(succ(succ(X))))) = plus(X,n5)) # label(succ_plus_5_r) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	27 (all X plus(n3,X) = succ(succ(succ(X)))) # label(succ_plus_3_l) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	28 (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(I,N) & leq(n0,I) -> a_select3(B,I,J) = a_select3(B,J,I))) -> (all I all J (leq(n0,I) & leq(n0,J) & leq(J,N) & leq(I,N) -> a_select3(tptp_msub(A,B),I,J) = a_select3(tptp_msub(A,B),J,I))))) # label(matrix_symm_sub) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	29 (all X succ(succ(succ(succ(succ(X))))) = plus(n5,X)) # label(succ_plus_5_l) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	30 (all X all Y (gt(succ(Y),X) <-> leq(X,Y))) # label(leq_succ_gt_equiv) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	31 (all X succ(succ(X)) = plus(n2,X)) # label(succ_plus_2_l) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	32 (all X all Y (leq(minus(X,Y),X) -> leq(n0,Y))) # label(leq_minus) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	33 (all X all Y (lt(X,Y) <-> gt(Y,X))) # label(lt_gt) # label(axiom) # label(non_clause).  [assumption].
0.76/1.03	34 (all I all U all X all VAL all VAL2 (I != U & VAL = a_select2(X,U) -> VAL = a_select2(tptp_update2(X,I,VAL2),U))) # label(sel2_update_2) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	35 (all X all Y (leq(X,Y) & Y != X -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	36 (all X all C (leq(n0,X) -> leq(uniform_int_rnd(C,X),X))) # label(uniform_int_rand_ranges_hi) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	37 (all X succ(succ(succ(succ(X)))) = plus(n4,X)) # label(succ_plus_4_l) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	38 (all A all B all N ((all I all J (leq(I,N) & leq(J,N) & leq(n0,J) & leq(n0,I) -> 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))),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.76/1.04	39 (all X plus(X,n4) = succ(succ(succ(succ(X))))) # label(succ_plus_4_r) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	40 (all X all Y (geq(X,Y) <-> leq(Y,X))) # label(leq_geq) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	41 (all A all B all N ((all I all J (leq(n0,I) & leq(n0,J) & leq(J,N) & leq(I,N) -> a_select3(A,J,I) = a_select3(A,I,J))) & (all I all J (leq(I,N) & leq(J,N) & leq(n0,J) & leq(n0,I) -> a_select3(B,I,J) = a_select3(B,J,I))) -> (all I all J (leq(I,N) & leq(J,N) & leq(n0,J) & leq(n0,I) -> a_select3(tptp_madd(A,B),I,J) = a_select3(tptp_madd(A,B),J,I))))) # label(matrix_symm_add) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	42 (all X succ(X) = plus(X,n1)) # label(succ_plus_1_r) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	43 (all X succ(succ(succ(X))) = plus(X,n3)) # label(succ_plus_3_r) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	44 (all X all Y (leq(X,pred(Y)) <-> gt(Y,X))) # label(leq_gt_pred) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	45 (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))),J,I) = a_select3(tptp_mmul(A,tptp_mmul(B,trans(A))),I,J))))) # label(matrix_symm_aba2) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	46 (all X X = succ(pred(X))) # label(succ_pred) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	47 (all I all J all U all V all X all VAL (leq(n0,I) & leq(n0,J) & leq(J,V) & leq(I,U) & (all I0 all J0 (leq(n0,I0) & leq(I0,U) & leq(J0,V) & leq(n0,J0) -> VAL = a_select3(X,I0,J0))) -> VAL = a_select3(tptp_update3(X,U,V,VAL),I,J))) # label(sel3_update_3) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	48 (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.76/1.04	49 (all Body tptp_float_0_0 = sum(n0,tptp_minus_1,Body)) # label(sum_plus_base_float) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	50 (all X (leq(n0,X) & leq(X,n0) -> X = n0)) # label(finite_domain_0) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	51 (all X (leq(n0,X) & leq(X,n1) -> X = n1 | X = n0)) # label(finite_domain_1) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	52 (all X (leq(n0,X) & leq(X,n2) -> n0 = X | n1 = X | X = n2)) # label(finite_domain_2) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	53 (all X (leq(X,n3) & leq(n0,X) -> n0 = X | X = n1 | X = n3 | X = n2)) # label(finite_domain_3) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	54 (all X (leq(n0,X) & leq(X,n4) -> n0 = X | n2 = X | X = n3 | n4 = X | X = n1)) # label(finite_domain_4) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	55 (all X (leq(n0,X) & leq(X,n5) -> X = n1 | n4 = X | n5 = X | X = n3 | X = n2 | n0 = X)) # label(finite_domain_5) # label(axiom) # label(non_clause).  [assumption].
0.76/1.04	56 -(use = a_select2(rho_defuse,n1) & use = a_select2(rho_defuse,n2) & use = a_select2(sigma_defuse,n1) & a_select2(sigma_defuse,n4) = use & a_select2(sigma_defuse,n5) = use & a_select3(u_defuse,n0,n0) = use & a_select2(xinit_defuse,n4) = use & use = a_select2(xinit_mean_defuse,n2) & use = a_select2(xinit_mean_defuse,n4) & use = a_select2(xinit_noise_defuse,n0) & use = a_select2(xinit_noise_defuse,n2) & a_select2(xinit_noise_defuse,n3) = use & a_select2(xinit_noise_defuse,n4) = use & use = a_select2(xinit_noise_defuse,n5) & (all A all B (leq(B,pred(pv5)) & leq(A,n2) & leq(n0,B) & leq(n0,A) -> use = a_select3(u_defuse,A,B))) & (all C all D (leq(n0,C) & leq(n0,D) & leq(C,n2) & leq(D,pred(pv5)) -> use = a_select3(z_defuse,C,D))) & gt(pv5,n0) & leq(pv5,n998) & leq(n0,pv5) & a_select2(xinit_noise_defuse,n1) = use & use = a_select2(xinit_mean_defuse,n5) & use = a_select2(xinit_mean_defuse,n3) & use = a_select2(xinit_mean_defuse,n1) & a_select2(xinit_mean_defuse,n0) = use & a_select2(xinit_defuse,n5) = use & use = a_select2(xinit_defuse,n3) & use = a_select3(u_defuse,n2,n0) & a_select3(u_defuse,n1,n0) = use & a_select2(sigma_defuse,n3) = use & use = a_select2(sigma_defuse,n2) & use = a_select2(sigma_defuse,n0) & a_select2(rho_defuse,n0) = use -> (all E all F (leq(n0,E) & leq(E,n2) & leq(F,pv5) & leq(n0,F) -> (-(F = pv5 & E = n0) & -(n2 = E & F = pv5) & -(E = n1 & pv5 = F) -> use = a_select3(z_defuse,E,F))))) # label(quaternion_ds1_inuse_0014) # label(negated_conjecture) # label(non_clause).  [assumption].
6.92/7.22	
6.92/7.22	============================== end of process non-clausal formulas ===
6.92/7.22	
6.92/7.22	============================== PROCESS INITIAL CLAUSES ===============
6.92/7.22	
6.92/7.22	============================== PREDICATE ELIMINATION =================
6.92/7.22	57 lt(A,B) | -gt(B,A) # label(lt_gt) # label(axiom).  [clausify(33)].
6.92/7.22	58 -lt(A,B) | gt(B,A) # label(lt_gt) # label(axiom).  [clausify(33)].
6.92/7.22	59 geq(A,B) | -leq(B,A) # label(leq_geq) # label(axiom).  [clausify(40)].
6.92/7.22	60 -geq(A,B) | leq(B,A) # label(leq_geq) # label(axiom).  [clausify(40)].
6.92/7.22	
6.92/7.22	============================== end predicate elimination =============
6.92/7.22	
6.92/7.22	Auto_denials:  (non-Horn, no changes).
6.92/7.22	
6.92/7.22	Term ordering decisions:
6.92/7.22	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. f7=1. f8=1. f9=1. f10=1. f11=1. f12=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. f22=1. f23=1. tptp_update3=1. f13=1. f24=1. f25=1. f26=1. f27=1. f1=1. f2=1. f3=1. f4=1. f5=1. f6=1.
6.92/7.22	
6.92/7.22	============================== end of process initial clauses ========
6.92/7.22	
6.92/7.22	============================== CLAUSES FOR SEARCH ====================
6.92/7.22	
6.92/7.22	============================== end of clauses for search =============
6.92/7.22	
6.92/7.22	============================== SEARCH ================================
6.92/7.22	
6.92/7.22	% Starting search at 0.26 seconds.
6.92/7.22	
6.92/7.22	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 570 (0.00 of 1.40 sec).
6.92/7.22	
6.92/7.22	Low Water (keep): wt=176.000, iters=3470
6.92/7.22	
6.92/7.22	Low Water (keep): wt=146.000, iters=3416
6.92/7.22	
6.92/7.22	Low Water (keep): wt=116.000, iters=3508
6.92/7.22	
6.92/7.22	Low Water (keep): wt=89.000, iters=3340
6.92/7.22	
6.92/7.22	Low Water (keep): wt=86.000, iters=3380
6.92/7.22	
6.92/7.22	Low Water (keep): wt=83.000, iters=3485
6.92/7.22	
6.92/7.22	Low Water (keep): wt=58.000, iters=3342
6.92/7.22	
6.92/7.22	Low Water (keep): wt=55.000, iters=3443
6.92/7.22	
6.92/7.22	Low Water (keep): wt=53.000, iters=3437
6.92/7.22	
6.92/7.22	Low Water (keep): wt=50.000, iters=3431
6.92/7.22	
6.92/7.22	Low Water (keep): wt=49.000, iters=3421
6.92/7.22	
6.92/7.22	Low Water (keep): wt=47.000, iters=3615
6.92/7.22	
6.92/7.22	Low Water (keep): wt=43.000, iters=3393
6.92/7.22	
6.92/7.22	Low Water (keep): wt=37.000, iters=3335
6.92/7.22	
6.92/7.22	Low Water (keep): wt=35.000, iters=3336
6.92/7.22	
6.92/7.22	Low Water (keep): wt=34.000, iters=3398
6.92/7.22	
6.92/7.22	Low Water (displace): id=4407, wt=179.000
6.92/7.22	
6.92/7.22	Low Water (displace): id=10976, wt=22.000
6.92/7.22	
6.92/7.22	Low Water (displace): id=10977, wt=16.000
6.92/7.22	
6.92/7.22	Low Water (displace): id=11066, wt=15.000
6.92/7.22	
6.92/7.22	Low Water (displace): id=11078, wt=12.000
6.92/7.22	
6.92/7.22	Low Water (displace): id=12398, wt=9.000
6.92/7.22	
6.92/7.22	Low Water (keep): wt=31.000, iters=3340
6.92/7.22	
6.92/7.22	Low Water (displace): id=15584, wt=7.000
6.92/7.22	
6.92/7.22	Low Water (displace): id=16352, wt=6.000
6.92/7.22	
6.92/7.22	Low Water (keep): wt=30.000, iters=3365
6.92/7.22	
6.92/7.22	Low Water (keep): wt=28.000, iters=3338
6.92/7.22	
6.92/7.22	Low Water (keep): wt=27.000, iters=3345
6.92/7.22	
6.92/7.22	Low Water (keep): wt=26.000, iters=3333
6.92/7.22	
6.92/7.22	Low Water (keep): wt=25.000, iters=3355
25.27/25.60	
25.27/25.60	Low Water (keep): wt=24.000, iters=3333
25.27/25.60	
25.27/25.60	Low Water (keep): wt=23.000, iters=3365
25.27/25.60	
25.27/25.60	Low Water (keep): wt=22.000, iters=3338
25.27/25.60	
25.27/25.60	Low Water (keep): wt=21.000, iters=3340
25.27/25.60	
25.27/25.60	Low Water (keep): wt=20.000, iters=3353
25.27/25.60	
25.27/25.60	Low Water (keep): wt=19.000, iters=3423
25.27/25.60	
25.27/25.60	Low Water (keep): wt=18.000, iters=3368
25.27/25.60	
25.27/25.60	Low Water (keep): wt=17.000, iters=3347
25.27/25.60	
25.27/25.60	Low Water (keep): wt=16.000, iters=3335
25.27/25.60	
25.27/25.60	============================== PROOF =================================
25.27/25.60	% SZS status Theorem
25.27/25.60	% SZS output start Refutation
25.27/25.60	
25.27/25.60	% Proof 1 at 24.04 (+ 0.56) seconds.
25.27/25.60	% Length of proof is 29.
25.27/25.60	% Level of proof is 6.
25.27/25.60	% Maximum clause weight is 19.000.
25.27/25.60	% Given clauses 3255.
25.27/25.60	
25.27/25.60	35 (all X all Y (leq(X,Y) & Y != X -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause).  [assumption].
25.27/25.60	44 (all X all Y (leq(X,pred(Y)) <-> gt(Y,X))) # label(leq_gt_pred) # label(axiom) # label(non_clause).  [assumption].
25.27/25.60	52 (all X (leq(n0,X) & leq(X,n2) -> n0 = X | n1 = X | X = n2)) # label(finite_domain_2) # label(axiom) # label(non_clause).  [assumption].
25.27/25.60	56 -(use = a_select2(rho_defuse,n1) & use = a_select2(rho_defuse,n2) & use = a_select2(sigma_defuse,n1) & a_select2(sigma_defuse,n4) = use & a_select2(sigma_defuse,n5) = use & a_select3(u_defuse,n0,n0) = use & a_select2(xinit_defuse,n4) = use & use = a_select2(xinit_mean_defuse,n2) & use = a_select2(xinit_mean_defuse,n4) & use = a_select2(xinit_noise_defuse,n0) & use = a_select2(xinit_noise_defuse,n2) & a_select2(xinit_noise_defuse,n3) = use & a_select2(xinit_noise_defuse,n4) = use & use = a_select2(xinit_noise_defuse,n5) & (all A all B (leq(B,pred(pv5)) & leq(A,n2) & leq(n0,B) & leq(n0,A) -> use = a_select3(u_defuse,A,B))) & (all C all D (leq(n0,C) & leq(n0,D) & leq(C,n2) & leq(D,pred(pv5)) -> use = a_select3(z_defuse,C,D))) & gt(pv5,n0) & leq(pv5,n998) & leq(n0,pv5) & a_select2(xinit_noise_defuse,n1) = use & use = a_select2(xinit_mean_defuse,n5) & use = a_select2(xinit_mean_defuse,n3) & use = a_select2(xinit_mean_defuse,n1) & a_select2(xinit_mean_defuse,n0) = use & a_select2(xinit_defuse,n5) = use & use = a_select2(xinit_defuse,n3) & use = a_select3(u_defuse,n2,n0) & a_select3(u_defuse,n1,n0) = use & a_select2(sigma_defuse,n3) = use & use = a_select2(sigma_defuse,n2) & use = a_select2(sigma_defuse,n0) & a_select2(rho_defuse,n0) = use -> (all E all F (leq(n0,E) & leq(E,n2) & leq(F,pv5) & leq(n0,F) -> (-(F = pv5 & E = n0) & -(n2 = E & F = pv5) & -(E = n1 & pv5 = F) -> use = a_select3(z_defuse,E,F))))) # label(quaternion_ds1_inuse_0014) # label(negated_conjecture) # label(non_clause).  [assumption].
25.27/25.60	268 -leq(A,B) | B = A | gt(B,A) # label(leq_gt2) # label(axiom).  [clausify(35)].
25.27/25.60	308 leq(A,pred(B)) | -gt(B,A) # label(leq_gt_pred) # label(axiom).  [clausify(44)].
25.27/25.60	344 -leq(n0,A) | -leq(A,n2) | A = n0 | n1 = A | n2 = A # label(finite_domain_2) # label(axiom).  [clausify(52)].
25.27/25.60	345 -leq(n0,A) | -leq(A,n2) | n0 = A | n1 = A | n2 = A.  [copy(344),flip(c)].
25.27/25.60	387 -leq(n0,A) | -leq(n0,B) | -leq(A,n2) | -leq(B,pred(pv5)) | a_select3(z_defuse,A,B) = use # label(quaternion_ds1_inuse_0014) # label(negated_conjecture).  [clausify(56)].
25.27/25.60	404 leq(n0,c1) # label(quaternion_ds1_inuse_0014) # label(negated_conjecture).  [clausify(56)].
25.27/25.60	405 leq(c1,n2) # label(quaternion_ds1_inuse_0014) # label(negated_conjecture).  [clausify(56)].
25.27/25.60	406 leq(c2,pv5) # label(quaternion_ds1_inuse_0014) # label(negated_conjecture).  [clausify(56)].
25.27/25.60	407 leq(n0,c2) # label(quaternion_ds1_inuse_0014) # label(negated_conjecture).  [clausify(56)].
25.27/25.60	408 pv5 != c2 | n0 != c1 # label(quaternion_ds1_inuse_0014) # label(negated_conjecture).  [clausify(56)].
25.27/25.60	409 c2 != pv5 | c1 != n0.  [copy(408),flip(a),flip(b)].
25.27/25.60	410 n2 != c1 | pv5 != c2 # label(quaternion_ds1_inuse_0014) # label(negated_conjecture).  [clausify(56)].
25.27/25.60	411 c1 != n2 | c2 != pv5.  [copy(410),flip(a),flip(b)].
25.27/25.60	412 n1 != c1 | pv5 != c2 # label(quaternion_ds1_inuse_0014) # label(negated_conjecture).  [clausify(56)].
25.27/25.60	413 c1 != n1 | c2 != pv5.  [copy(412),flip(a),flip(b)].
25.27/25.60	414 a_select3(z_defuse,c1,c2) != use # label(quaternion_ds1_inuse_0014) # label(negated_conjecture).  [clausify(56)].
25.27/25.60	2892 -leq(n0,A) | -leq(A,pred(pv5)) | a_select3(z_defuse,c1,A) = use.  [resolve(404,a,387,a),unit_del(b,405)].
25.27/25.60	2897 c1 = n0 | c1 = n1 | c1 = n2.  [resolve(404,a,345,a),flip(b),flip(c),flip(d),unit_del(a,405)].
25.27/25.60	3967 c2 = pv5 | gt(pv5,c2).  [resolve(406,a,268,a),flip(a)].
25.27/25.60	43711 c2 = pv5 | leq(c2,pred(pv5)).  [resolve(3967,b,308,b)].
25.27/25.60	61230 c2 = pv5.  [resolve(43711,b,2892,b),unit_del(b,407),unit_del(c,414)].
25.27/25.60	61596 c1 != n1.  [back_rewrite(413),rewrite([61230(4)]),xx(b)].
25.27/25.60	61597 c1 != n2.  [back_rewrite(411),rewrite([61230(4)]),xx(b)].
25.27/25.60	61598 c1 != n0.  [back_rewrite(409),rewrite([61230(1)]),xx(a)].
25.27/25.60	61600 $F.  [back_unit_del(2897),unit_del(a,61598),unit_del(b,61596),unit_del(c,61597)].
25.27/25.60	
25.27/25.60	% SZS output end Refutation
25.27/25.60	============================== end of proof ==========================
25.27/25.60	
25.27/25.60	============================== STATISTICS ============================
25.27/25.60	
25.27/25.60	Given=3255. Generated=995681. Kept=61515. proofs=1.
25.27/25.60	Usable=2992. Sos=9131. Demods=1452. Limbo=4, Disabled=49722. Hints=0.
25.27/25.60	Megabytes=52.61.
25.27/25.60	User_CPU=24.04, System_CPU=0.56, Wall_clock=25.
25.27/25.60	
25.27/25.60	============================== end of statistics =====================
25.27/25.60	
25.27/25.60	============================== end of search =========================
25.27/25.60	
25.27/25.60	THEOREM PROVED
25.27/25.60	% SZS status Theorem
25.27/25.60	
25.27/25.60	Exiting with 1 proof.
25.27/25.60	
25.27/25.60	Process 22044 exit (max_proofs) Tue Aug  9 03:21:22 2022
25.27/25.60	Prover9 interrupted
25.27/25.61	EOF