0.00/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer   : n016.cluster.edu
0.12/0.33	% Model      : x86_64 x86_64
0.12/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory     : 8042.1875MB
0.12/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 180
0.12/0.33	% DateTime   : Thu Aug 29 10:35:08 EDT 2019
0.12/0.33	% CPUTime    : 
0.41/1.06	============================== Prover9 ===============================
0.41/1.06	Prover9 (32) version 2009-11A, November 2009.
0.41/1.06	Process 6764 was started by sandbox on n016.cluster.edu,
0.41/1.06	Thu Aug 29 10:35:09 2019
0.41/1.06	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 180 -f /tmp/Prover9_6610_n016.cluster.edu".
0.41/1.06	============================== end of head ===========================
0.41/1.06	
0.41/1.06	============================== INPUT =================================
0.41/1.06	
0.41/1.06	% Reading from file /tmp/Prover9_6610_n016.cluster.edu
0.41/1.06	
0.41/1.06	set(prolog_style_variables).
0.41/1.06	set(auto2).
0.41/1.06	    % set(auto2) -> set(auto).
0.41/1.06	    % set(auto) -> set(auto_inference).
0.41/1.06	    % set(auto) -> set(auto_setup).
0.41/1.06	    % set(auto_setup) -> set(predicate_elim).
0.41/1.06	    % set(auto_setup) -> assign(eq_defs, unfold).
0.41/1.06	    % set(auto) -> set(auto_limits).
0.41/1.06	    % set(auto_limits) -> assign(max_weight, "100.000").
0.41/1.06	    % set(auto_limits) -> assign(sos_limit, 20000).
0.41/1.06	    % set(auto) -> set(auto_denials).
0.41/1.06	    % set(auto) -> set(auto_process).
0.41/1.06	    % set(auto2) -> assign(new_constants, 1).
0.41/1.06	    % set(auto2) -> assign(fold_denial_max, 3).
0.41/1.06	    % set(auto2) -> assign(max_weight, "200.000").
0.41/1.06	    % set(auto2) -> assign(max_hours, 1).
0.41/1.06	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.41/1.06	    % set(auto2) -> assign(max_seconds, 0).
0.41/1.06	    % set(auto2) -> assign(max_minutes, 5).
0.41/1.06	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.41/1.06	    % set(auto2) -> set(sort_initial_sos).
0.41/1.06	    % set(auto2) -> assign(sos_limit, -1).
0.41/1.06	    % set(auto2) -> assign(lrs_ticks, 3000).
0.41/1.06	    % set(auto2) -> assign(max_megs, 400).
0.41/1.06	    % set(auto2) -> assign(stats, some).
0.41/1.06	    % set(auto2) -> clear(echo_input).
0.41/1.06	    % set(auto2) -> set(quiet).
0.41/1.06	    % set(auto2) -> clear(print_initial_clauses).
0.41/1.06	    % set(auto2) -> clear(print_given).
0.41/1.06	assign(lrs_ticks,-1).
0.41/1.06	assign(sos_limit,10000).
0.41/1.06	assign(order,kbo).
0.41/1.06	set(lex_order_vars).
0.41/1.06	clear(print_given).
0.41/1.06	
0.41/1.06	% formulas(sos).  % not echoed (92 formulas)
0.41/1.06	
0.41/1.06	============================== end of input ==========================
0.41/1.06	
0.41/1.06	% From the command line: assign(max_seconds, 180).
0.41/1.06	
0.41/1.06	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.41/1.06	
0.41/1.06	% Formulas that are not ordinary clauses:
0.41/1.06	1 (all X all Y (leq(minus(X,Y),X) -> leq(n0,Y))) # label(leq_minus) # label(axiom) # label(non_clause).  [assumption].
0.41/1.06	2 (all X all Y (gt(succ(Y),X) <-> leq(X,Y))) # label(leq_succ_gt_equiv) # label(axiom) # label(non_clause).  [assumption].
0.41/1.06	3 (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.41/1.06	4 (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.41/1.06	5 (all X succ(X) = plus(n1,X)) # label(succ_plus_1_l) # label(axiom) # label(non_clause).  [assumption].
0.41/1.06	6 (all X plus(n4,X) = succ(succ(succ(succ(X))))) # label(succ_plus_4_l) # label(axiom) # label(non_clause).  [assumption].
0.41/1.06	7 (all I all L all U all Val (leq(L,I) & leq(I,U) -> Val = a_select2(tptp_const_array1(dim(L,U),Val),I))) # label(const_array1_select) # label(axiom) # label(non_clause).  [assumption].
0.41/1.06	8 (all X succ(succ(X)) = plus(n2,X)) # label(succ_plus_2_l) # label(axiom) # label(non_clause).  [assumption].
0.41/1.06	9 (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 all K all VAL (leq(n0,I) & leq(n0,K) & leq(K,N) & leq(J,N) & leq(n0,J) & leq(I,N) -> a_select3(tptp_update3(A,K,K,VAL),J,I) = a_select3(tptp_update3(A,K,K,VAL),I,J))))) # label(matrix_symm_update_diagonal) # label(axiom) # label(non_clause).  [assumption].
0.41/1.06	10 (all X -gt(X,X)) # label(irreflexivity_gt) # label(axiom) # label(non_clause).  [assumption].
0.41/1.06	11 (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(F,J,I) = a_select3(F,I,J))) & (all I all J (leq(I,N) & leq(J,N) & leq(n0,J) & 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,M) & leq(I,M) -> a_select3(D,I,J) = a_select3(D,J,I))) -> (all I all J (leq(J,N) & leq(n0,J) & 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.41/1.07	12 (all A all B all N ((all I all J (leq(n0,I) & leq(J,N) & leq(n0,J) & leq(I,N) -> a_select3(B,J,I) = a_select3(B,I,J))) & (all I all J (leq(n0,I) & leq(I,N) & leq(n0,J) & leq(J,N) -> 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(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.41/1.07	13 (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.41/1.07	14 (all Body sum(n0,tptp_minus_1,Body) = tptp_float_0_0) # label(sum_plus_base_float) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	15 (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(n0,I) & leq(n0,J) & leq(J,N) & leq(I,N) -> a_select3(inv(A),J,I) = a_select3(inv(A),I,J))))) # label(matrix_symm_inv) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	16 (all X all Y (leq(Y,X) <-> geq(X,Y))) # label(leq_geq) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	17 (all X all Y (leq(X,Y) -> leq(X,succ(Y)))) # label(leq_succ) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	18 (all X plus(X,n3) = succ(succ(succ(X)))) # label(succ_plus_3_r) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	19 (all A all B 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(B,J,I) = a_select3(B,I,J))) -> (all I all J (leq(I,N) & leq(J,N) & leq(n0,J) & leq(n0,I) -> 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.41/1.07	20 (all X X = pred(succ(X))) # label(pred_succ) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	21 (all X all Y (gt(Y,X) <-> lt(X,Y))) # label(lt_gt) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	22 (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.41/1.07	23 (all X plus(X,n1) = succ(X)) # label(succ_plus_1_r) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	24 (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,I,J) = a_select3(B,J,I))) -> (all I all J (leq(n0,J) & leq(J,N) & 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_aba1) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	25 (all X plus(X,n5) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_r) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	26 (all X pred(X) = minus(X,n1)) # label(pred_minus_1) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	27 (all X plus(n5,X) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_l) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	28 (all Body sum(n0,tptp_minus_1,Body) = n0) # label(sum_plus_base) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	29 (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) -> 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.41/1.07	30 (all I all U all X all VAL ((all I0 (leq(n0,I0) & leq(I0,U) -> a_select2(X,I0) = VAL)) & leq(I,U) & leq(n0,I) -> VAL = a_select2(tptp_update2(X,U,VAL),I))) # label(sel2_update_3) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	31 (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.41/1.07	32 (all X succ(succ(X)) = plus(X,n2)) # label(succ_plus_2_r) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	33 (all X succ(succ(succ(X))) = plus(n3,X)) # label(succ_plus_3_l) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	34 (all X all Y (gt(Y,X) -> leq(X,Y))) # label(leq_gt1) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	35 (all X leq(X,X)) # label(reflexivity_leq) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	36 (all I all J all U all V all X all VAL ((all I0 all J0 (leq(n0,I0) & leq(I0,U) & leq(J0,V) & leq(n0,J0) -> a_select3(X,I0,J0) = VAL)) & leq(n0,I) & leq(J,V) & leq(n0,J) & leq(I,U) -> a_select3(tptp_update3(X,U,V,VAL),I,J) = VAL)) # label(sel3_update_3) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	37 (all X all Y (leq(succ(X),succ(Y)) <-> leq(X,Y))) # label(leq_succ_succ) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	38 (all X all Y (leq(X,Y) & X != Y -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	39 (all X succ(pred(X)) = X) # label(succ_pred) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	40 (all X all Y (leq(X,pred(Y)) <-> gt(Y,X))) # label(leq_gt_pred) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	41 (all X all Y (leq(succ(X),Y) -> gt(Y,X))) # label(leq_succ_gt) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	42 (all X plus(X,n4) = succ(succ(succ(succ(X))))) # label(succ_plus_4_r) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	43 (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.41/1.07	44 (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.41/1.07	45 (all X all Y (gt(X,Y) | X = Y | gt(Y,X))) # label(totality) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	46 (all X gt(succ(X),X)) # label(gt_succ) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	47 (all A all N ((all I all J (leq(I,N) & leq(n0,J) & leq(J,N) & leq(n0,I) -> 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),J,I) = a_select3(trans(A),I,J))))) # label(matrix_symm_trans) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	48 (all I all J all U all V all X all VAL all VAL2 (VAL = a_select3(X,U,V) & V = J & U != I -> VAL = a_select3(tptp_update3(X,I,J,VAL2),U,V))) # label(sel3_update_2) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	49 (all A all B all N all M ((all I all J (leq(n0,I) & leq(I,M) & leq(n0,J) & leq(J,M) -> a_select3(B,I,J) = a_select3(B,J,I))) -> (all I all J (leq(n0,J) & leq(J,N) & 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.41/1.07	50 (all X (leq(n0,X) & leq(X,n0) -> X = n0)) # label(finite_domain_0) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	51 (all X (leq(n0,X) & leq(X,n1) -> X = n1 | X = n0)) # label(finite_domain_1) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	52 (all X (leq(n0,X) & leq(X,n5) -> X = n0 | n1 = X | X = n4 | n5 = X | n3 = X | X = n2)) # label(finite_domain_5) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	53 (all X (leq(n0,X) & leq(X,n3) -> X = n1 | X = n2 | n3 = X | n0 = X)) # label(finite_domain_3) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	54 (all X (leq(X,n4) & leq(n0,X) -> n1 = X | X = n3 | n4 = X | n2 = X | n0 = X)) # label(finite_domain_4) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	55 (all X (leq(X,n2) & leq(n0,X) -> X = n0 | n1 = X | n2 = X)) # label(finite_domain_2) # label(axiom) # label(non_clause).  [assumption].
0.41/1.07	56 -(a_select2(rho_defuse,n1) = use & a_select2(sigma_defuse,n1) = use & a_select2(sigma_defuse,n2) = use & use = a_select2(sigma_defuse,n3) & use = a_select2(sigma_defuse,n4) & a_select2(sigma_defuse,n5) = use & a_select3(u_defuse,n0,n0) = use & use = a_select3(u_defuse,n1,n0) & a_select3(u_defuse,n2,n0) = use & use = a_select2(xinit_defuse,n4) & use = a_select2(xinit_mean_defuse,n2) & use = a_select2(xinit_mean_defuse,n3) & use = a_select2(xinit_mean_defuse,n4) & a_select2(xinit_mean_defuse,n5) = use & a_select2(xinit_noise_defuse,n3) = use & leq(n0,pv5) & leq(pv5,n998) & gt(pv5,n0) & (all A all B (leq(n0,A) & leq(B,pred(pv5)) & leq(A,n2) & leq(n0,B) -> use = a_select3(u_defuse,A,B))) & (all C all D (leq(n0,C) & leq(C,n2) & leq(D,pred(pv5)) & leq(n0,D) -> a_select3(z_defuse,C,D) = use)) & a_select2(xinit_noise_defuse,n5) = use & use = a_select2(xinit_noise_defuse,n4) & use = a_select2(xinit_noise_defuse,n2) & use = a_select2(xinit_noise_defuse,n1) & use = a_select2(xinit_noise_defuse,n0) & use = a_select2(xinit_mean_defuse,n1) & use = a_select2(xinit_mean_defuse,n0) & a_select2(xinit_defuse,n5) = use & a_select2(xinit_defuse,n3) = use & a_select2(sigma_defuse,n0) = use & a_select2(rho_defuse,n2) = use & use = a_select2(rho_defuse,n0) -> (all E all F (leq(n0,E) & leq(n0,F) & leq(F,pv5) & leq(E,n2) -> (-(E = n1 & F = pv5) & -(F = pv5 & n2 = E) & -(pv5 = F & E = n0) -> a_select3(z_defuse,E,F) = use)))) # label(quaternion_ds1_inuse_0014) # label(negated_conjecture) # label(non_clause).  [assumption].
5.04/5.37	
5.04/5.37	============================== end of process non-clausal formulas ===
5.04/5.37	
5.04/5.37	============================== PROCESS INITIAL CLAUSES ===============
5.04/5.37	
5.04/5.37	============================== PREDICATE ELIMINATION =================
5.04/5.37	57 leq(A,B) | -geq(B,A) # label(leq_geq) # label(axiom).  [clausify(16)].
5.04/5.37	58 -leq(A,B) | geq(B,A) # label(leq_geq) # label(axiom).  [clausify(16)].
5.04/5.37	59 gt(A,B) | -lt(B,A) # label(lt_gt) # label(axiom).  [clausify(21)].
5.04/5.37	60 -gt(A,B) | lt(B,A) # label(lt_gt) # label(axiom).  [clausify(21)].
5.04/5.37	
5.04/5.37	============================== end predicate elimination =============
5.04/5.37	
5.04/5.37	Auto_denials:  (non-Horn, no changes).
5.04/5.37	
5.04/5.37	Term ordering decisions:
5.04/5.37	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. f13=1. f14=1. f24=1. f25=1. trans=1. succ=1. inv=1. pred=1. a_select3=1. tptp_update2=1. sum=1. tptp_const_array2=1. f9=1. f10=1. f11=1. f12=1. f15=1. f16=1. f17=1. f18=1. f19=1. f20=1. tptp_update3=1. f21=1. f26=1. f27=1. f22=1. f23=1. f3=1. f4=1. f5=1. f6=1. f7=1. f8=1.
5.04/5.37	
5.04/5.37	============================== end of process initial clauses ========
5.04/5.37	
5.04/5.37	============================== CLAUSES FOR SEARCH ====================
5.04/5.37	
5.04/5.37	============================== end of clauses for search =============
5.04/5.37	
5.04/5.37	============================== SEARCH ================================
5.04/5.37	
5.04/5.37	% Starting search at 0.27 seconds.
5.04/5.37	
5.04/5.37	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 854 (0.00 of 1.39 sec).
5.04/5.37	
5.04/5.37	Low Water (keep): wt=170.000, iters=3468
5.04/5.37	
5.04/5.37	Low Water (keep): wt=140.000, iters=3339
5.04/5.37	
5.04/5.37	Low Water (keep): wt=113.000, iters=3335
5.04/5.37	
5.04/5.37	Low Water (keep): wt=89.000, iters=3508
5.04/5.37	
5.04/5.37	Low Water (keep): wt=86.000, iters=3549
5.04/5.37	
5.04/5.37	Low Water (keep): wt=83.000, iters=3344
5.04/5.37	
5.04/5.37	Low Water (keep): wt=53.000, iters=3371
5.04/5.37	
5.04/5.37	Low Water (keep): wt=49.000, iters=3356
5.04/5.37	
5.04/5.37	Low Water (keep): wt=46.000, iters=3440
5.04/5.37	
5.04/5.37	Low Water (keep): wt=44.000, iters=3365
5.04/5.37	
5.04/5.37	Low Water (keep): wt=43.000, iters=3361
5.04/5.37	
5.04/5.37	Low Water (keep): wt=40.000, iters=3545
5.04/5.37	
5.04/5.37	Low Water (keep): wt=37.000, iters=3536
5.04/5.37	
5.04/5.37	Low Water (keep): wt=34.000, iters=3395
5.04/5.37	
5.04/5.37	Low Water (displace): id=3802, wt=179.000
5.04/5.37	
5.04/5.37	Low Water (displace): id=10959, wt=31.000
5.04/5.37	
5.04/5.37	Low Water (displace): id=10966, wt=25.000
5.04/5.37	
5.04/5.37	Low Water (displace): id=10967, wt=22.000
5.04/5.37	
5.04/5.37	Low Water (displace): id=11059, wt=19.000
5.04/5.37	
5.04/5.37	Low Water (displace): id=11297, wt=16.000
5.04/5.37	
5.04/5.37	Low Water (keep): wt=31.000, iters=3342
5.04/5.37	
5.04/5.37	Low Water (keep): wt=30.000, iters=3442
5.04/5.37	
5.04/5.37	Low Water (keep): wt=28.000, iters=3406
5.04/5.37	
5.04/5.37	Low Water (displace): id=16047, wt=15.000
5.04/5.37	
5.04/5.37	Low Water (displace): id=16339, wt=14.000
5.04/5.37	
5.04/5.37	Low Water (keep): wt=27.000, iters=3343
5.04/5.37	
5.04/5.37	Low Water (keep): wt=26.000, iters=3336
5.04/5.37	
5.04/5.37	Low Water (keep): wt=25.000, iters=3350
5.04/5.37	
5.04/5.37	Low Water (displace): id=18371, wt=12.000
5.04/5.37	
5.04/5.37	Low Water (displace): id=18372, wt=8.000
28.67/29.01	
28.67/29.01	Low Water (displace): id=18375, wt=7.000
28.67/29.01	
28.67/29.01	Low Water (displace): id=18588, wt=5.000
28.67/29.01	
28.67/29.01	Low Water (keep): wt=24.000, iters=3333
28.67/29.01	
28.67/29.01	Low Water (keep): wt=23.000, iters=3354
28.67/29.01	
28.67/29.01	Low Water (keep): wt=22.000, iters=3363
28.67/29.01	
28.67/29.01	Low Water (keep): wt=21.000, iters=3340
28.67/29.01	
28.67/29.01	Low Water (keep): wt=20.000, iters=3448
28.67/29.01	
28.67/29.01	Low Water (keep): wt=19.000, iters=3348
28.67/29.01	
28.67/29.01	Low Water (keep): wt=18.000, iters=3441
28.67/29.01	
28.67/29.01	Low Water (keep): wt=17.000, iters=3413
28.67/29.01	
28.67/29.01	Low Water (keep): wt=16.000, iters=3351
28.67/29.01	
28.67/29.01	Low Water (keep): wt=15.000, iters=3342
28.67/29.01	
28.67/29.01	Low Water (keep): wt=14.000, iters=3333
28.67/29.01	
28.67/29.01	Low Water (keep): wt=13.000, iters=3368
28.67/29.01	
28.67/29.01	Low Water (keep): wt=12.000, iters=3451
28.67/29.01	
28.67/29.01	Low Water (keep): wt=9.000, iters=4127
28.67/29.01	
28.67/29.01	============================== PROOF =================================
28.67/29.01	% SZS status Theorem
28.67/29.01	% SZS output start Refutation
28.67/29.01	
28.67/29.01	% Proof 1 at 27.29 (+ 0.67) seconds.
28.67/29.01	% Length of proof is 28.
28.67/29.01	% Level of proof is 6.
28.67/29.01	% Maximum clause weight is 19.000.
28.67/29.01	% Given clauses 3672.
28.67/29.01	
28.67/29.01	38 (all X all Y (leq(X,Y) & X != Y -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause).  [assumption].
28.67/29.01	40 (all X all Y (leq(X,pred(Y)) <-> gt(Y,X))) # label(leq_gt_pred) # label(axiom) # label(non_clause).  [assumption].
28.67/29.01	55 (all X (leq(X,n2) & leq(n0,X) -> X = n0 | n1 = X | n2 = X)) # label(finite_domain_2) # label(axiom) # label(non_clause).  [assumption].
28.67/29.01	56 -(a_select2(rho_defuse,n1) = use & a_select2(sigma_defuse,n1) = use & a_select2(sigma_defuse,n2) = use & use = a_select2(sigma_defuse,n3) & use = a_select2(sigma_defuse,n4) & a_select2(sigma_defuse,n5) = use & a_select3(u_defuse,n0,n0) = use & use = a_select3(u_defuse,n1,n0) & a_select3(u_defuse,n2,n0) = use & use = a_select2(xinit_defuse,n4) & use = a_select2(xinit_mean_defuse,n2) & use = a_select2(xinit_mean_defuse,n3) & use = a_select2(xinit_mean_defuse,n4) & a_select2(xinit_mean_defuse,n5) = use & a_select2(xinit_noise_defuse,n3) = use & leq(n0,pv5) & leq(pv5,n998) & gt(pv5,n0) & (all A all B (leq(n0,A) & leq(B,pred(pv5)) & leq(A,n2) & leq(n0,B) -> use = a_select3(u_defuse,A,B))) & (all C all D (leq(n0,C) & leq(C,n2) & leq(D,pred(pv5)) & leq(n0,D) -> a_select3(z_defuse,C,D) = use)) & a_select2(xinit_noise_defuse,n5) = use & use = a_select2(xinit_noise_defuse,n4) & use = a_select2(xinit_noise_defuse,n2) & use = a_select2(xinit_noise_defuse,n1) & use = a_select2(xinit_noise_defuse,n0) & use = a_select2(xinit_mean_defuse,n1) & use = a_select2(xinit_mean_defuse,n0) & a_select2(xinit_defuse,n5) = use & a_select2(xinit_defuse,n3) = use & a_select2(sigma_defuse,n0) = use & a_select2(rho_defuse,n2) = use & use = a_select2(rho_defuse,n0) -> (all E all F (leq(n0,E) & leq(n0,F) & leq(F,pv5) & leq(E,n2) -> (-(E = n1 & F = pv5) & -(F = pv5 & n2 = E) & -(pv5 = F & E = n0) -> a_select3(z_defuse,E,F) = use)))) # label(quaternion_ds1_inuse_0014) # label(negated_conjecture) # label(non_clause).  [assumption].
28.67/29.01	299 -leq(A,B) | B = A | gt(B,A) # label(leq_gt2) # label(axiom).  [clausify(38)].
28.67/29.01	302 leq(A,pred(B)) | -gt(B,A) # label(leq_gt_pred) # label(axiom).  [clausify(40)].
28.67/29.01	364 -leq(A,n2) | -leq(n0,A) | n0 = A | n1 = A | n2 = A # label(finite_domain_2) # label(axiom).  [clausify(55)].
28.67/29.01	385 -leq(n0,A) | -leq(A,n2) | -leq(B,pred(pv5)) | -leq(n0,B) | a_select3(z_defuse,A,B) = use # label(quaternion_ds1_inuse_0014) # label(negated_conjecture).  [clausify(56)].
28.67/29.01	398 leq(n0,c1) # label(quaternion_ds1_inuse_0014) # label(negated_conjecture).  [clausify(56)].
28.67/29.01	399 leq(n0,c2) # label(quaternion_ds1_inuse_0014) # label(negated_conjecture).  [clausify(56)].
28.67/29.01	400 leq(c2,pv5) # label(quaternion_ds1_inuse_0014) # label(negated_conjecture).  [clausify(56)].
28.67/29.01	401 leq(c1,n2) # label(quaternion_ds1_inuse_0014) # label(negated_conjecture).  [clausify(56)].
28.67/29.01	402 c1 != n1 | pv5 != c2 # label(quaternion_ds1_inuse_0014) # label(negated_conjecture).  [clausify(56)].
28.67/29.01	403 c1 != n1 | c2 != pv5.  [copy(402),flip(b)].
28.67/29.01	404 pv5 != c2 | c1 != n2 # label(quaternion_ds1_inuse_0014) # label(negated_conjecture).  [clausify(56)].
28.67/29.01	405 c2 != pv5 | c1 != n2.  [copy(404),flip(a)].
28.67/29.01	406 pv5 != c2 | c1 != n0 # label(quaternion_ds1_inuse_0014) # label(negated_conjecture).  [clausify(56)].
28.67/29.01	407 c2 != pv5 | c1 != n0.  [copy(406),flip(a)].
28.67/29.01	408 a_select3(z_defuse,c1,c2) != use # label(quaternion_ds1_inuse_0014) # label(negated_conjecture).  [clausify(56)].
28.67/29.01	2866 -leq(A,pred(pv5)) | -leq(n0,A) | a_select3(z_defuse,c1,A) = use.  [resolve(398,a,385,a),unit_del(a,401)].
28.67/29.01	2868 c1 = n0 | c1 = n1 | c1 = n2.  [resolve(398,a,364,b),flip(b),flip(c),flip(d),unit_del(a,401)].
28.67/29.01	4383 c2 = pv5 | gt(pv5,c2).  [resolve(400,a,299,a),flip(a)].
28.67/29.01	30965 c2 = pv5 | leq(c2,pred(pv5)).  [resolve(4383,b,302,b)].
28.67/29.01	45071 c2 = pv5.  [resolve(30965,b,2866,a),unit_del(b,399),unit_del(c,408)].
28.67/29.01	45359 c1 != n0.  [back_rewrite(407),rewrite([45071(1)]),xx(a)].
28.67/29.01	45360 c1 != n2.  [back_rewrite(405),rewrite([45071(1)]),xx(a)].
28.67/29.01	45361 c1 != n1.  [back_rewrite(403),rewrite([45071(4)]),xx(b)].
28.67/29.01	45379 $F.  [back_unit_del(2868),unit_del(a,45359),unit_del(b,45361),unit_del(c,45360)].
28.67/29.01	
28.67/29.01	% SZS output end Refutation
28.67/29.01	============================== end of proof ==========================
28.67/29.01	
28.67/29.01	============================== STATISTICS ============================
28.67/29.01	
28.67/29.01	Given=3672. Generated=1218395. Kept=45300. proofs=1.
28.67/29.01	Usable=3192. Sos=8661. Demods=1642. Limbo=20, Disabled=33761. Hints=0.
28.67/29.01	Megabytes=43.21.
28.67/29.01	User_CPU=27.29, System_CPU=0.67, Wall_clock=28.
28.67/29.01	
28.67/29.01	============================== end of statistics =====================
28.67/29.01	
28.67/29.01	============================== end of search =========================
28.67/29.01	
28.67/29.01	THEOREM PROVED
28.67/29.01	% SZS status Theorem
28.67/29.01	
28.67/29.01	Exiting with 1 proof.
28.67/29.01	
28.67/29.01	Process 6764 exit (max_proofs) Thu Aug 29 10:35:37 2019
28.67/29.01	Prover9 interrupted
28.67/29.01	EOF