0.04/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.13	% Command  : tptp2X_and_run_prover9 %d %s
0.12/0.34	% Computer : n010.cluster.edu
0.12/0.34	% Model    : x86_64 x86_64
0.12/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory   : 8042.1875MB
0.12/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit : 1440
0.12/0.34	% WCLimit  : 180
0.12/0.34	% DateTime : Mon Jul  3 04:39:39 EDT 2023
0.12/0.34	% CPUTime  : 
0.79/1.10	============================== Prover9 ===============================
0.79/1.10	Prover9 (32) version 2009-11A, November 2009.
0.79/1.10	Process 3807 was started by sandbox2 on n010.cluster.edu,
0.79/1.10	Mon Jul  3 04:39:40 2023
0.79/1.10	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1440 -f /tmp/Prover9_3410_n010.cluster.edu".
0.79/1.10	============================== end of head ===========================
0.79/1.10	
0.79/1.10	============================== INPUT =================================
0.79/1.10	
0.79/1.10	% Reading from file /tmp/Prover9_3410_n010.cluster.edu
0.79/1.10	
0.79/1.10	set(prolog_style_variables).
0.79/1.10	set(auto2).
0.79/1.10	    % set(auto2) -> set(auto).
0.79/1.10	    % set(auto) -> set(auto_inference).
0.79/1.10	    % set(auto) -> set(auto_setup).
0.79/1.10	    % set(auto_setup) -> set(predicate_elim).
0.79/1.10	    % set(auto_setup) -> assign(eq_defs, unfold).
0.79/1.10	    % set(auto) -> set(auto_limits).
0.79/1.10	    % set(auto_limits) -> assign(max_weight, "100.000").
0.79/1.10	    % set(auto_limits) -> assign(sos_limit, 20000).
0.79/1.10	    % set(auto) -> set(auto_denials).
0.79/1.10	    % set(auto) -> set(auto_process).
0.79/1.10	    % set(auto2) -> assign(new_constants, 1).
0.79/1.10	    % set(auto2) -> assign(fold_denial_max, 3).
0.79/1.10	    % set(auto2) -> assign(max_weight, "200.000").
0.79/1.10	    % set(auto2) -> assign(max_hours, 1).
0.79/1.10	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.79/1.10	    % set(auto2) -> assign(max_seconds, 0).
0.79/1.10	    % set(auto2) -> assign(max_minutes, 5).
0.79/1.10	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.79/1.10	    % set(auto2) -> set(sort_initial_sos).
0.79/1.10	    % set(auto2) -> assign(sos_limit, -1).
0.79/1.10	    % set(auto2) -> assign(lrs_ticks, 3000).
0.79/1.10	    % set(auto2) -> assign(max_megs, 400).
0.79/1.10	    % set(auto2) -> assign(stats, some).
0.79/1.10	    % set(auto2) -> clear(echo_input).
0.79/1.10	    % set(auto2) -> set(quiet).
0.79/1.10	    % set(auto2) -> clear(print_initial_clauses).
0.79/1.10	    % set(auto2) -> clear(print_given).
0.79/1.10	assign(lrs_ticks,-1).
0.79/1.10	assign(sos_limit,10000).
0.79/1.10	assign(order,kbo).
0.79/1.10	set(lex_order_vars).
0.79/1.10	clear(print_given).
0.79/1.10	
0.79/1.10	% formulas(sos).  % not echoed (92 formulas)
0.79/1.10	
0.79/1.10	============================== end of input ==========================
0.79/1.10	
0.79/1.10	% From the command line: assign(max_seconds, 1440).
0.79/1.10	
0.79/1.10	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.79/1.10	
0.79/1.10	% Formulas that are not ordinary clauses:
0.79/1.10	1 (all A all N ((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(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.79/1.10	2 (all X plus(n5,X) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_l) # label(axiom) # label(non_clause).  [assumption].
0.79/1.10	3 (all X succ(succ(succ(X))) = plus(n3,X)) # label(succ_plus_3_l) # label(axiom) # label(non_clause).  [assumption].
0.79/1.10	4 (all I all J all U all V all X all VAL ((all I0 all J0 (leq(J0,V) & leq(I0,U) & leq(n0,J0) & leq(n0,I0) -> a_select3(X,I0,J0) = VAL)) & leq(n0,I) & leq(I,U) & leq(J,V) & leq(n0,J) -> a_select3(tptp_update3(X,U,V,VAL),I,J) = VAL)) # label(sel3_update_3) # label(axiom) # label(non_clause).  [assumption].
0.79/1.10	5 (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.79/1.10	6 (all X all Y (leq(minus(X,Y),X) -> leq(n0,Y))) # label(leq_minus) # label(axiom) # label(non_clause).  [assumption].
0.79/1.10	7 (all X succ(succ(succ(succ(X)))) = plus(X,n4)) # label(succ_plus_4_r) # label(axiom) # label(non_clause).  [assumption].
0.79/1.10	8 (all X all Y (gt(Y,X) <-> lt(X,Y))) # label(lt_gt) # label(axiom) # label(non_clause).  [assumption].
0.79/1.10	9 (all X pred(succ(X)) = X) # label(pred_succ) # label(axiom) # label(non_clause).  [assumption].
0.79/1.10	10 (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.79/1.10	11 (all X succ(succ(X)) = plus(n2,X)) # label(succ_plus_2_l) # label(axiom) # label(non_clause).  [assumption].
0.79/1.10	12 (all Body sum(n0,tptp_minus_1,Body) = n0) # label(sum_plus_base) # label(axiom) # label(non_clause).  [assumption].
0.79/1.10	13 (all I all J all U all V all X all VAL all VAL2 (U != I & 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.79/1.10	14 (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(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(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.79/1.10	15 (all A all B all N all M ((all I all J (leq(J,M) & leq(n0,J) & leq(I,M) & leq(n0,I) -> 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_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.79/1.10	16 (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 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),I,J) = a_select3(tptp_update3(A,K,K,VAL),J,I))))) # label(matrix_symm_update_diagonal) # label(axiom) # label(non_clause).  [assumption].
0.79/1.10	17 (all I all L1 all U1 all J all L2 all U2 all Val (leq(L1,I) & leq(J,U2) & leq(L2,J) & leq(I,U1) -> 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.79/1.10	18 (all X succ(X) = plus(X,n1)) # label(succ_plus_1_r) # label(axiom) # label(non_clause).  [assumption].
0.79/1.10	19 (all X leq(X,X)) # label(reflexivity_leq) # label(axiom) # label(non_clause).  [assumption].
0.79/1.10	20 (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.79/1.10	21 (all X all Y (gt(succ(Y),X) <-> leq(X,Y))) # label(leq_succ_gt_equiv) # label(axiom) # label(non_clause).  [assumption].
0.79/1.10	22 (all X all Y (geq(X,Y) <-> leq(Y,X))) # label(leq_geq) # label(axiom) # label(non_clause).  [assumption].
0.79/1.10	23 (all X all Y (gt(Y,X) <-> leq(X,pred(Y)))) # label(leq_gt_pred) # label(axiom) # label(non_clause).  [assumption].
0.79/1.10	24 (all X all Y (gt(Y,X) | Y = X | gt(X,Y))) # label(totality) # label(axiom) # label(non_clause).  [assumption].
0.79/1.10	25 (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,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(A,J,I) = a_select3(A,I,J))) -> (all I all J (leq(J,N) & leq(n0,J) & leq(I,N) & 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.79/1.10	26 (all A all B all N ((all I all J (leq(n0,I) & leq(I,N) & leq(J,N) & leq(n0,J) -> 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.79/1.10	27 (all X all Y (gt(Y,X) -> leq(X,Y))) # label(leq_gt1) # label(axiom) # label(non_clause).  [assumption].
0.79/1.10	28 (all I all U all X all VAL all VAL2 (I != U & VAL = a_select2(X,U) -> a_select2(tptp_update2(X,I,VAL2),U) = VAL)) # label(sel2_update_2) # label(axiom) # label(non_clause).  [assumption].
0.79/1.10	29 (all X pred(X) = minus(X,n1)) # label(pred_minus_1) # label(axiom) # label(non_clause).  [assumption].
0.79/1.10	30 (all X plus(n4,X) = succ(succ(succ(succ(X))))) # label(succ_plus_4_l) # label(axiom) # label(non_clause).  [assumption].
0.79/1.10	31 (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.79/1.10	32 (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.79/1.10	33 (all X succ(succ(succ(X))) = plus(X,n3)) # label(succ_plus_3_r) # label(axiom) # label(non_clause).  [assumption].
0.79/1.11	34 (all X succ(X) = plus(n1,X)) # label(succ_plus_1_l) # label(axiom) # label(non_clause).  [assumption].
0.79/1.11	35 (all X all Y (leq(X,Y) -> leq(X,succ(Y)))) # label(leq_succ) # label(axiom) # label(non_clause).  [assumption].
0.79/1.11	36 (all X gt(succ(X),X)) # label(gt_succ) # label(axiom) # label(non_clause).  [assumption].
0.79/1.11	37 (all I all U all X all VAL (leq(n0,I) & leq(I,U) & (all I0 (leq(n0,I0) & leq(I0,U) -> a_select2(X,I0) = VAL)) -> a_select2(tptp_update2(X,U,VAL),I) = VAL)) # label(sel2_update_3) # label(axiom) # label(non_clause).  [assumption].
0.79/1.11	38 (all X X = succ(pred(X))) # label(succ_pred) # label(axiom) # label(non_clause).  [assumption].
0.79/1.11	39 (all X all Y (leq(succ(X),Y) -> gt(Y,X))) # label(leq_succ_gt) # label(axiom) # label(non_clause).  [assumption].
0.79/1.11	40 (all A all B all C all D all E all F all N all M ((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,I) & leq(I,N) & leq(n0,J) & leq(J,N) -> a_select3(F,I,J) = a_select3(F,J,I))) & (all I all J (leq(I,M) & leq(n0,J) & leq(J,M) & leq(n0,I) -> a_select3(D,J,I) = a_select3(D,I,J))) -> (all I all J (leq(I,N) & leq(n0,J) & leq(J,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)))),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.79/1.11	41 (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.79/1.11	42 (all Body sum(n0,tptp_minus_1,Body) = tptp_float_0_0) # label(sum_plus_base_float) # label(axiom) # label(non_clause).  [assumption].
0.79/1.11	43 (all X all Y (leq(succ(X),succ(Y)) <-> leq(X,Y))) # label(leq_succ_succ) # label(axiom) # label(non_clause).  [assumption].
0.79/1.11	44 (all X all Y (X != Y & leq(X,Y) -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause).  [assumption].
0.79/1.11	45 (all X -gt(X,X)) # label(irreflexivity_gt) # label(axiom) # label(non_clause).  [assumption].
0.79/1.11	46 (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.79/1.11	47 (all X plus(X,n2) = succ(succ(X))) # label(succ_plus_2_r) # label(axiom) # label(non_clause).  [assumption].
0.79/1.11	48 (all X plus(X,n5) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_r) # label(axiom) # label(non_clause).  [assumption].
0.79/1.11	49 (all A 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(I,N) & leq(J,N) & leq(n0,J) & 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.79/1.11	50 (all X (leq(X,n0) & leq(n0,X) -> X = n0)) # label(finite_domain_0) # label(axiom) # label(non_clause).  [assumption].
0.79/1.11	51 (all X (leq(n0,X) & leq(X,n4) -> X = n0 | n2 = X | n4 = X | n3 = X | n1 = X)) # label(finite_domain_4) # label(axiom) # label(non_clause).  [assumption].
0.79/1.11	52 (all X (leq(X,n5) & leq(n0,X) -> n0 = X | n1 = X | X = n5 | X = n4 | n3 = X | X = n2)) # label(finite_domain_5) # label(axiom) # label(non_clause).  [assumption].
0.79/1.11	53 (all X (leq(X,n1) & leq(n0,X) -> X = n1 | n0 = X)) # label(finite_domain_1) # label(axiom) # label(non_clause).  [assumption].
0.79/1.11	54 (all X (leq(X,n3) & leq(n0,X) -> X = n0 | n1 = X | n2 = X | X = n3)) # label(finite_domain_3) # label(axiom) # label(non_clause).  [assumption].
0.79/1.11	55 (all X (leq(n0,X) & leq(X,n2) -> n1 = X | n2 = X | X = n0)) # label(finite_domain_2) # label(axiom) # label(non_clause).  [assumption].
0.79/1.11	56 -(use = a_select2(rho_defuse,n1) & a_select2(sigma_defuse,n0) = use & a_select2(sigma_defuse,n1) = use & use = a_select2(sigma_defuse,n3) & a_select2(sigma_defuse,n5) = use & use = a_select3(u_defuse,n1,n0) & use = a_select3(u_defuse,n2,n0) & use = a_select2(xinit_mean_defuse,n1) & use = a_select2(xinit_mean_defuse,n3) & use = a_select2(xinit_mean_defuse,n4) & use = a_select2(xinit_mean_defuse,n5) & a_select2(xinit_noise_defuse,n0) = use & use = a_select2(xinit_noise_defuse,n1) & use = a_select2(xinit_noise_defuse,n2) & a_select2(xinit_noise_defuse,n3) = use & a_select2(xinit_noise_defuse,n4) = use & (all C all D (leq(n0,D) & leq(C,n2) & leq(D,n998) & leq(n0,C) -> a_select3(z_defuse,C,D) = use)) & (all A all B (leq(n0,A) & leq(B,n998) & leq(A,n2) & leq(n0,B) -> a_select3(u_defuse,A,B) = use)) & use = a_select2(xinit_noise_defuse,n5) & use = a_select2(xinit_mean_defuse,n2) & a_select2(xinit_mean_defuse,n0) = use & a_select2(xinit_defuse,n5) = use & a_select2(xinit_defuse,n4) = use & use = a_select2(xinit_defuse,n3) & use = a_select3(u_defuse,n0,n0) & a_select2(sigma_defuse,n4) = use & use = a_select2(sigma_defuse,n2) & a_select2(rho_defuse,n2) = use & a_select2(rho_defuse,n0) = use -> (all E (leq(n0,E) & leq(E,n2) -> a_select2(rho_defuse,E) = use))) # label(quaternion_ds1_inuse_0015) # label(negated_conjecture) # label(non_clause).  [assumption].
5.88/6.14	
5.88/6.14	============================== end of process non-clausal formulas ===
5.88/6.14	
5.88/6.14	============================== PROCESS INITIAL CLAUSES ===============
5.88/6.14	
5.88/6.14	============================== PREDICATE ELIMINATION =================
5.88/6.14	57 gt(A,B) | -lt(B,A) # label(lt_gt) # label(axiom).  [clausify(8)].
5.88/6.14	58 -gt(A,B) | lt(B,A) # label(lt_gt) # label(axiom).  [clausify(8)].
5.88/6.14	59 geq(A,B) | -leq(B,A) # label(leq_geq) # label(axiom).  [clausify(22)].
5.88/6.14	60 -geq(A,B) | leq(B,A) # label(leq_geq) # label(axiom).  [clausify(22)].
5.88/6.14	
5.88/6.14	============================== end predicate elimination =============
5.88/6.14	
5.88/6.14	Auto_denials:  (non-Horn, no changes).
5.88/6.14	
5.88/6.14	Term ordering decisions:
5.88/6.14	Function symbol KB weights:  n0=1. use=1. n2=1. n1=1. n3=1. n4=1. n5=1. tptp_minus_1=1. n998=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. 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. f11=1. f12=1. f26=1. f27=1. trans=1. succ=1. inv=1. pred=1. a_select3=1. tptp_update2=1. sum=1. tptp_const_array2=1. f5=1. f6=1. f7=1. f8=1. f13=1. f14=1. f15=1. f16=1. f17=1. f18=1. tptp_update3=1. f9=1. f10=1. f19=1. f3=1. f4=1. f20=1. f21=1. f22=1. f23=1. f24=1. f25=1.
5.88/6.14	
5.88/6.14	============================== end of process initial clauses ========
5.88/6.14	
5.88/6.14	============================== CLAUSES FOR SEARCH ====================
5.88/6.14	
5.88/6.14	============================== end of clauses for search =============
5.88/6.14	
5.88/6.14	============================== SEARCH ================================
5.88/6.14	
5.88/6.14	% Starting search at 0.23 seconds.
5.88/6.14	
5.88/6.14	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 491 (0.00 of 0.76 sec).
5.88/6.14	
5.88/6.14	Low Water (keep): wt=176.000, iters=3473
5.88/6.14	
5.88/6.14	Low Water (keep): wt=146.000, iters=3412
5.88/6.14	
5.88/6.14	Low Water (keep): wt=116.000, iters=3481
5.88/6.14	
5.88/6.14	Low Water (keep): wt=113.000, iters=3368
5.88/6.14	
5.88/6.14	Low Water (keep): wt=86.000, iters=3341
5.88/6.14	
5.88/6.14	Low Water (keep): wt=83.000, iters=3689
5.88/6.14	
5.88/6.14	Low Water (keep): wt=80.000, iters=3489
5.88/6.14	
5.88/6.14	Low Water (keep): wt=58.000, iters=3509
5.88/6.14	
5.88/6.14	Low Water (keep): wt=47.000, iters=3413
5.88/6.14	
5.88/6.14	Low Water (keep): wt=46.000, iters=3460
5.88/6.14	
5.88/6.14	Low Water (keep): wt=43.000, iters=3357
5.88/6.14	
5.88/6.14	Low Water (keep): wt=37.000, iters=3431
5.88/6.14	
5.88/6.14	Low Water (keep): wt=35.000, iters=3342
5.88/6.14	
5.88/6.14	Low Water (keep): wt=34.000, iters=3403
5.88/6.14	
5.88/6.14	Low Water (displace): id=6061, wt=179.000
5.88/6.14	
5.88/6.14	Low Water (displace): id=10960, wt=28.000
5.88/6.14	
5.88/6.14	Low Water (displace): id=11068, wt=25.000
5.88/6.14	
5.88/6.14	Low Water (displace): id=11127, wt=22.000
5.88/6.14	
5.88/6.14	Low Water (keep): wt=31.000, iters=3374
5.88/6.14	
5.88/6.14	Low Water (displace): id=11910, wt=20.000
5.88/6.14	
5.88/6.14	Low Water (displace): id=11961, wt=19.000
5.88/6.14	
5.88/6.14	Low Water (keep): wt=30.000, iters=3397
5.88/6.14	
5.88/6.14	Low Water (keep): wt=28.000, iters=3373
5.88/6.14	
5.88/6.14	Low Water (displace): id=14253, wt=18.000
5.88/6.14	
5.88/6.14	Low Water (displace): id=14343, wt=17.000
5.88/6.14	
5.88/6.14	Low Water (keep): wt=27.000, iters=3361
5.88/6.14	
5.88/6.14	Low Water (keep): wt=26.000, iters=3376
5.88/6.14	
5.88/6.14	Low Water (keep): wt=25.000, iters=3360
5.88/6.14	
5.88/6.14	Low Water (displace): id=17302, wt=13.000
5.88/6.14	
5.88/6.14	Low Water (displace): id=17369, wt=7.000
5.88/6.14	
5.88/6.14	Low Water (displace): id=17615, wt=6.000
5.88/6.14	
5.88/6.14	Low Water (displace): id=17773, wt=5.000
5.88/6.14	
5.88/6.14	Low Water (keep): wt=24.000, iters=3363
5.88/6.14	
5.88/6.14	Low Water (keep): wt=23.000, iters=3334
16.90/17.19	
16.90/17.19	Low Water (keep): wt=22.000, iters=3351
16.90/17.19	
16.90/17.19	Low Water (keep): wt=21.000, iters=3348
16.90/17.19	
16.90/17.19	Low Water (keep): wt=20.000, iters=3440
16.90/17.19	
16.90/17.19	Low Water (keep): wt=19.000, iters=3341
16.90/17.19	
16.90/17.19	Low Water (keep): wt=18.000, iters=3339
16.90/17.19	
16.90/17.19	Low Water (keep): wt=17.000, iters=3436
16.90/17.19	
16.90/17.19	Low Water (keep): wt=16.000, iters=3335
16.90/17.19	
16.90/17.19	============================== PROOF =================================
16.90/17.19	% SZS status Theorem
16.90/17.19	% SZS output start Refutation
16.90/17.19	
16.90/17.19	% Proof 1 at 15.73 (+ 0.38) seconds.
16.90/17.19	% Length of proof is 14.
16.90/17.19	% Level of proof is 6.
16.90/17.19	% Maximum clause weight is 15.000.
16.90/17.19	% Given clauses 2544.
16.90/17.19	
16.90/17.19	55 (all X (leq(n0,X) & leq(X,n2) -> n1 = X | n2 = X | X = n0)) # label(finite_domain_2) # label(axiom) # label(non_clause).  [assumption].
16.90/17.19	56 -(use = a_select2(rho_defuse,n1) & a_select2(sigma_defuse,n0) = use & a_select2(sigma_defuse,n1) = use & use = a_select2(sigma_defuse,n3) & a_select2(sigma_defuse,n5) = use & use = a_select3(u_defuse,n1,n0) & use = a_select3(u_defuse,n2,n0) & use = a_select2(xinit_mean_defuse,n1) & use = a_select2(xinit_mean_defuse,n3) & use = a_select2(xinit_mean_defuse,n4) & use = a_select2(xinit_mean_defuse,n5) & a_select2(xinit_noise_defuse,n0) = use & use = a_select2(xinit_noise_defuse,n1) & use = a_select2(xinit_noise_defuse,n2) & a_select2(xinit_noise_defuse,n3) = use & a_select2(xinit_noise_defuse,n4) = use & (all C all D (leq(n0,D) & leq(C,n2) & leq(D,n998) & leq(n0,C) -> a_select3(z_defuse,C,D) = use)) & (all A all B (leq(n0,A) & leq(B,n998) & leq(A,n2) & leq(n0,B) -> a_select3(u_defuse,A,B) = use)) & use = a_select2(xinit_noise_defuse,n5) & use = a_select2(xinit_mean_defuse,n2) & a_select2(xinit_mean_defuse,n0) = use & a_select2(xinit_defuse,n5) = use & a_select2(xinit_defuse,n4) = use & use = a_select2(xinit_defuse,n3) & use = a_select3(u_defuse,n0,n0) & a_select2(sigma_defuse,n4) = use & use = a_select2(sigma_defuse,n2) & a_select2(rho_defuse,n2) = use & a_select2(rho_defuse,n0) = use -> (all E (leq(n0,E) & leq(E,n2) -> a_select2(rho_defuse,E) = use))) # label(quaternion_ds1_inuse_0015) # label(negated_conjecture) # label(non_clause).  [assumption].
16.90/17.19	371 -leq(n0,A) | -leq(A,n2) | n1 = A | n2 = A | A = n0 # label(finite_domain_2) # label(axiom).  [clausify(55)].
16.90/17.19	372 -leq(n0,A) | -leq(A,n2) | n1 = A | n2 = A | n0 = A.  [copy(371),flip(e)].
16.90/17.19	373 a_select2(rho_defuse,n1) = use # label(quaternion_ds1_inuse_0015) # label(negated_conjecture).  [clausify(56)].
16.90/17.19	400 a_select2(rho_defuse,n2) = use # label(quaternion_ds1_inuse_0015) # label(negated_conjecture).  [clausify(56)].
16.90/17.19	401 a_select2(rho_defuse,n0) = use # label(quaternion_ds1_inuse_0015) # label(negated_conjecture).  [clausify(56)].
16.90/17.19	402 leq(n0,c1) # label(quaternion_ds1_inuse_0015) # label(negated_conjecture).  [clausify(56)].
16.90/17.19	403 leq(c1,n2) # label(quaternion_ds1_inuse_0015) # label(negated_conjecture).  [clausify(56)].
16.90/17.19	404 a_select2(rho_defuse,c1) != use # label(quaternion_ds1_inuse_0015) # label(negated_conjecture).  [clausify(56)].
16.90/17.19	1843 c1 = n1 | c1 = n2 | c1 = n0.  [resolve(402,a,372,a),flip(b),flip(c),flip(d),unit_del(a,403)].
16.90/17.19	35730 c1 = n2 | c1 = n0.  [para(1843(a,1),404(a,1,2)),rewrite([373(9)]),xx(c)].
16.90/17.19	37434 c1 = n0.  [para(35730(a,1),404(a,1,2)),rewrite([400(6)]),xx(b)].
16.90/17.19	37656 $F.  [back_rewrite(404),rewrite([37434(2),401(3)]),xx(a)].
16.90/17.19	
16.90/17.19	% SZS output end Refutation
16.90/17.19	============================== end of proof ==========================
16.90/17.19	
16.90/17.19	============================== STATISTICS ============================
16.90/17.19	
16.90/17.19	Given=2544. Generated=640979. Kept=37573. proofs=1.
16.90/17.19	Usable=2107. Sos=6893. Demods=1148. Limbo=222, Disabled=28677. Hints=0.
16.90/17.19	Megabytes=42.99.
16.90/17.19	User_CPU=15.73, System_CPU=0.38, Wall_clock=16.
16.90/17.19	
16.90/17.19	============================== end of statistics =====================
16.90/17.19	
16.90/17.19	============================== end of search =========================
16.90/17.19	
16.90/17.19	THEOREM PROVED
16.90/17.19	% SZS status Theorem
16.90/17.19	
16.90/17.19	Exiting with 1 proof.
16.90/17.19	
16.90/17.19	Process 3807 exit (max_proofs) Mon Jul  3 04:39:56 2023
16.90/17.19	Prover9 interrupted
16.90/17.19	EOF