0.07/0.11	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% Command  : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer : n007.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 : 960
0.12/0.33	% WCLimit  : 120
0.12/0.33	% DateTime : Tue Aug  9 02:46:56 EDT 2022
0.12/0.33	% CPUTime  : 
0.78/1.05	============================== Prover9 ===============================
0.78/1.05	Prover9 (32) version 2009-11A, November 2009.
0.78/1.05	Process 22317 was started by sandbox on n007.cluster.edu,
0.78/1.05	Tue Aug  9 02:46:57 2022
0.78/1.05	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_22058_n007.cluster.edu".
0.78/1.05	============================== end of head ===========================
0.78/1.05	
0.78/1.05	============================== INPUT =================================
0.78/1.05	
0.78/1.05	% Reading from file /tmp/Prover9_22058_n007.cluster.edu
0.78/1.05	
0.78/1.05	set(prolog_style_variables).
0.78/1.05	set(auto2).
0.78/1.05	    % set(auto2) -> set(auto).
0.78/1.05	    % set(auto) -> set(auto_inference).
0.78/1.05	    % set(auto) -> set(auto_setup).
0.78/1.05	    % set(auto_setup) -> set(predicate_elim).
0.78/1.05	    % set(auto_setup) -> assign(eq_defs, unfold).
0.78/1.05	    % set(auto) -> set(auto_limits).
0.78/1.05	    % set(auto_limits) -> assign(max_weight, "100.000").
0.78/1.05	    % set(auto_limits) -> assign(sos_limit, 20000).
0.78/1.05	    % set(auto) -> set(auto_denials).
0.78/1.05	    % set(auto) -> set(auto_process).
0.78/1.05	    % set(auto2) -> assign(new_constants, 1).
0.78/1.05	    % set(auto2) -> assign(fold_denial_max, 3).
0.78/1.05	    % set(auto2) -> assign(max_weight, "200.000").
0.78/1.05	    % set(auto2) -> assign(max_hours, 1).
0.78/1.05	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.78/1.05	    % set(auto2) -> assign(max_seconds, 0).
0.78/1.05	    % set(auto2) -> assign(max_minutes, 5).
0.78/1.05	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.78/1.05	    % set(auto2) -> set(sort_initial_sos).
0.78/1.05	    % set(auto2) -> assign(sos_limit, -1).
0.78/1.05	    % set(auto2) -> assign(lrs_ticks, 3000).
0.78/1.05	    % set(auto2) -> assign(max_megs, 400).
0.78/1.05	    % set(auto2) -> assign(stats, some).
0.78/1.05	    % set(auto2) -> clear(echo_input).
0.78/1.05	    % set(auto2) -> set(quiet).
0.78/1.05	    % set(auto2) -> clear(print_initial_clauses).
0.78/1.05	    % set(auto2) -> clear(print_given).
0.78/1.05	assign(lrs_ticks,-1).
0.78/1.05	assign(sos_limit,10000).
0.78/1.05	assign(order,kbo).
0.78/1.05	set(lex_order_vars).
0.78/1.05	clear(print_given).
0.78/1.05	
0.78/1.05	% formulas(sos).  % not echoed (92 formulas)
0.78/1.05	
0.78/1.05	============================== end of input ==========================
0.78/1.05	
0.78/1.05	% From the command line: assign(max_seconds, 960).
0.78/1.05	
0.78/1.05	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.78/1.05	
0.78/1.05	% Formulas that are not ordinary clauses:
0.78/1.05	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.78/1.05	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.78/1.05	3 (all X all Y (gt(Y,X) -> leq(X,Y))) # label(leq_gt1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.05	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.78/1.05	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.78/1.05	6 (all X minus(X,n1) = pred(X)) # label(pred_minus_1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.05	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.78/1.05	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.78/1.06	9 (all X pred(succ(X)) = X) # label(pred_succ) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	10 (all X succ(succ(X)) = plus(X,n2)) # label(succ_plus_2_r) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	11 (all X all Y (leq(X,Y) <-> leq(succ(X),succ(Y)))) # label(leq_succ_succ) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	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.78/1.06	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.78/1.06	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.78/1.06	15 (all X leq(X,X)) # label(reflexivity_leq) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	16 (all Body n0 = sum(n0,tptp_minus_1,Body)) # label(sum_plus_base) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	17 (all X -gt(X,X)) # label(irreflexivity_gt) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	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.78/1.06	19 (all X all Y (leq(succ(X),Y) -> gt(Y,X))) # label(leq_succ_gt) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	20 (all X all Y (gt(Y,X) | X = Y | gt(X,Y))) # label(totality) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	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.78/1.06	22 (all X succ(X) = plus(n1,X)) # label(succ_plus_1_l) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	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.78/1.06	24 (all X gt(succ(X),X)) # label(gt_succ) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	25 (all X all Y (leq(X,Y) -> leq(X,succ(Y)))) # label(leq_succ) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	26 (all X succ(succ(succ(succ(succ(X))))) = plus(X,n5)) # label(succ_plus_5_r) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	27 (all X plus(n3,X) = succ(succ(succ(X)))) # label(succ_plus_3_l) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	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.78/1.06	29 (all X succ(succ(succ(succ(succ(X))))) = plus(n5,X)) # label(succ_plus_5_l) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	30 (all X all Y (gt(succ(Y),X) <-> leq(X,Y))) # label(leq_succ_gt_equiv) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	31 (all X succ(succ(X)) = plus(n2,X)) # label(succ_plus_2_l) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	32 (all X all Y (leq(minus(X,Y),X) -> leq(n0,Y))) # label(leq_minus) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	33 (all X all Y (lt(X,Y) <-> gt(Y,X))) # label(lt_gt) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	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.78/1.06	35 (all X all Y (leq(X,Y) & Y != X -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	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.78/1.06	37 (all X succ(succ(succ(succ(X)))) = plus(n4,X)) # label(succ_plus_4_l) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	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.78/1.06	39 (all X plus(X,n4) = succ(succ(succ(succ(X))))) # label(succ_plus_4_r) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	40 (all X all Y (geq(X,Y) <-> leq(Y,X))) # label(leq_geq) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	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.78/1.06	42 (all X succ(X) = plus(X,n1)) # label(succ_plus_1_r) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	43 (all X succ(succ(succ(X))) = plus(X,n3)) # label(succ_plus_3_r) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	44 (all X all Y (leq(X,pred(Y)) <-> gt(Y,X))) # label(leq_gt_pred) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	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.78/1.06	46 (all X X = succ(pred(X))) # label(succ_pred) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	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.78/1.06	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.78/1.06	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.78/1.06	50 (all X (leq(X,n1) & leq(n0,X) -> n0 = X | X = n1)) # label(finite_domain_1) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	51 (all X (leq(n0,X) & leq(X,n5) -> n0 = X | X = n1 | n3 = X | n5 = X | n4 = X | n2 = X)) # label(finite_domain_5) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	52 (all X (leq(n0,X) & leq(X,n4) -> X = n0 | n2 = X | X = n4 | n3 = X | X = n1)) # label(finite_domain_4) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	53 (all X (leq(X,n2) & leq(n0,X) -> n0 = X | n2 = X | n1 = X)) # label(finite_domain_2) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	54 (all X (leq(X,n0) & leq(n0,X) -> n0 = X)) # label(finite_domain_0) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	55 (all X (leq(X,n3) & leq(n0,X) -> X = n0 | X = n1 | X = n2 | X = n3)) # label(finite_domain_3) # label(axiom) # label(non_clause).  [assumption].
0.78/1.06	56 -((all A (leq(n0,A) & leq(A,pred(pv10)) -> sum(n0,n4,a_select3(q,A,tptp_sum_index)) = n1)) & leq(pv10,n135299) & leq(n0,pv10) & sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1 -> (all B (leq(n0,B) & leq(B,pv10) -> n1 = sum(n0,n4,a_select3(q,B,tptp_sum_index))))) # label(cl5_nebula_norm_0012) # label(negated_conjecture) # label(non_clause).  [assumption].
0.78/1.06	
0.78/1.06	============================== end of process non-clausal formulas ===
19.29/19.59	
19.29/19.59	============================== PROCESS INITIAL CLAUSES ===============
19.29/19.59	
19.29/19.59	============================== PREDICATE ELIMINATION =================
19.29/19.59	57 lt(A,B) | -gt(B,A) # label(lt_gt) # label(axiom).  [clausify(33)].
19.29/19.59	58 -lt(A,B) | gt(B,A) # label(lt_gt) # label(axiom).  [clausify(33)].
19.29/19.59	59 geq(A,B) | -leq(B,A) # label(leq_geq) # label(axiom).  [clausify(40)].
19.29/19.59	60 -geq(A,B) | leq(B,A) # label(leq_geq) # label(axiom).  [clausify(40)].
19.29/19.59	
19.29/19.59	============================== end predicate elimination =============
19.29/19.59	
19.29/19.59	Auto_denials:  (non-Horn, no changes).
19.29/19.59	
19.29/19.59	Term ordering decisions:
19.29/19.59	Function symbol KB weights:  n0=1. n1=1. n2=1. n4=1. n3=1. n5=1. tptp_minus_1=1. n135299=1. pv10=1. q=1. tptp_sum_index=1. tptp_float_0_0=1. def=1. use=1. c1=1. tptp_mmul=1. tptp_madd=1. tptp_msub=1. plus=1. a_select2=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.
19.29/19.59	
19.29/19.59	============================== end of process initial clauses ========
19.29/19.59	
19.29/19.59	============================== CLAUSES FOR SEARCH ====================
19.29/19.59	
19.29/19.59	============================== end of clauses for search =============
19.29/19.59	
19.29/19.59	============================== SEARCH ================================
19.29/19.59	
19.29/19.59	% Starting search at 0.25 seconds.
19.29/19.59	
19.29/19.59	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 654 (0.00 of 1.11 sec).
19.29/19.59	
19.29/19.59	Low Water (keep): wt=173.000, iters=3496
19.29/19.59	
19.29/19.59	Low Water (keep): wt=143.000, iters=3401
19.29/19.59	
19.29/19.59	Low Water (keep): wt=119.000, iters=3483
19.29/19.59	
19.29/19.59	Low Water (keep): wt=116.000, iters=3431
19.29/19.59	
19.29/19.59	Low Water (keep): wt=113.000, iters=3850
19.29/19.59	
19.29/19.59	Low Water (keep): wt=110.000, iters=3730
19.29/19.59	
19.29/19.59	Low Water (keep): wt=89.000, iters=3610
19.29/19.59	
19.29/19.59	Low Water (keep): wt=86.000, iters=3955
19.29/19.59	
19.29/19.59	Low Water (keep): wt=50.000, iters=3373
19.29/19.59	
19.29/19.59	Low Water (keep): wt=46.000, iters=3333
19.29/19.59	
19.29/19.59	Low Water (keep): wt=43.000, iters=3460
19.29/19.59	
19.29/19.59	Low Water (keep): wt=37.000, iters=3425
19.29/19.59	
19.29/19.59	Low Water (keep): wt=34.000, iters=3374
19.29/19.59	
19.29/19.59	Low Water (displace): id=6514, wt=179.000
19.29/19.59	
19.29/19.59	Low Water (displace): id=10935, wt=31.000
19.29/19.59	
19.29/19.59	Low Water (displace): id=10945, wt=22.000
19.29/19.59	
19.29/19.59	Low Water (displace): id=10949, wt=17.000
19.29/19.59	
19.29/19.59	Low Water (displace): id=10950, wt=15.000
19.29/19.59	
19.29/19.59	Low Water (displace): id=10962, wt=12.000
19.29/19.59	
19.29/19.59	Low Water (keep): wt=33.000, iters=3336
19.29/19.59	
19.29/19.59	Low Water (keep): wt=32.000, iters=3348
19.29/19.59	
19.29/19.59	Low Water (displace): id=15380, wt=9.000
19.29/19.59	
19.29/19.59	Low Water (displace): id=15384, wt=7.000
19.29/19.59	
19.29/19.59	Low Water (keep): wt=31.000, iters=3336
19.29/19.59	
19.29/19.59	Low Water (displace): id=16652, wt=6.000
19.29/19.59	
19.29/19.59	Low Water (keep): wt=30.000, iters=3353
19.29/19.59	
19.29/19.59	Low Water (keep): wt=29.000, iters=3340
19.29/19.59	
19.29/19.59	Low Water (keep): wt=28.000, iters=3338
19.29/19.59	
19.29/19.59	Low Water (keep): wt=27.000, iters=3335
19.29/19.59	
19.29/19.59	Low Water (keep): wt=26.000, iters=3373
19.29/19.59	
19.29/19.59	Low Water (keep): wt=25.000, iters=3346
19.29/19.59	
19.29/19.59	Low Water (keep): wt=24.000, iters=3355
19.29/19.59	
19.29/19.59	Low Water (keep): wt=23.000, iters=3341
19.29/19.59	
19.29/19.59	Low Water (keep): wt=22.000, iters=3650
19.29/19.59	
19.29/19.59	Low Water (keep): wt=21.000, iters=3345
19.29/19.59	
19.29/19.59	Low Water (keep): wt=20.000, iters=3376
19.29/19.59	
19.29/19.59	Low Water (keep): wt=19.000, iters=3338
19.29/19.59	
19.29/19.59	Low Water (keep): wt=18.000, iters=3371
19.29/19.59	
19.29/19.59	============================== PROOF =================================
19.29/19.59	% SZS status Theorem
19.29/19.59	% SZS output start Refutation
19.29/19.59	
19.29/19.59	% Proof 1 at 18.10 (+ 0.46) seconds.
19.29/19.59	% Length of proof is 14.
19.29/19.59	% Level of proof is 5.
19.29/19.59	% Maximum clause weight is 16.000.
19.29/19.59	% Given clauses 2676.
19.29/19.59	
19.29/19.59	35 (all X all Y (leq(X,Y) & Y != X -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause).  [assumption].
19.29/19.59	44 (all X all Y (leq(X,pred(Y)) <-> gt(Y,X))) # label(leq_gt_pred) # label(axiom) # label(non_clause).  [assumption].
19.29/19.59	56 -((all A (leq(n0,A) & leq(A,pred(pv10)) -> sum(n0,n4,a_select3(q,A,tptp_sum_index)) = n1)) & leq(pv10,n135299) & leq(n0,pv10) & sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1 -> (all B (leq(n0,B) & leq(B,pv10) -> n1 = sum(n0,n4,a_select3(q,B,tptp_sum_index))))) # label(cl5_nebula_norm_0012) # label(negated_conjecture) # label(non_clause).  [assumption].
19.29/19.59	267 -leq(A,B) | B = A | gt(B,A) # label(leq_gt2) # label(axiom).  [clausify(35)].
19.29/19.59	307 leq(A,pred(B)) | -gt(B,A) # label(leq_gt_pred) # label(axiom).  [clausify(44)].
19.29/19.59	372 -leq(n0,A) | -leq(A,pred(pv10)) | sum(n0,n4,a_select3(q,A,tptp_sum_index)) = n1 # label(cl5_nebula_norm_0012) # label(negated_conjecture).  [clausify(56)].
19.29/19.59	375 sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1 # label(cl5_nebula_norm_0012) # label(negated_conjecture).  [clausify(56)].
19.29/19.59	376 leq(n0,c1) # label(cl5_nebula_norm_0012) # label(negated_conjecture).  [clausify(56)].
19.29/19.59	377 leq(c1,pv10) # label(cl5_nebula_norm_0012) # label(negated_conjecture).  [clausify(56)].
19.29/19.59	378 sum(n0,n4,a_select3(q,c1,tptp_sum_index)) != n1 # label(cl5_nebula_norm_0012) # label(negated_conjecture).  [clausify(56)].
19.29/19.59	3569 c1 = pv10 | gt(pv10,c1).  [resolve(377,a,267,a),flip(a)].
19.29/19.59	37781 c1 = pv10 | leq(c1,pred(pv10)).  [resolve(3569,b,307,b)].
19.29/19.59	52351 c1 = pv10.  [resolve(37781,b,372,b),unit_del(b,376),unit_del(c,378)].
19.29/19.59	52681 $F.  [back_rewrite(378),rewrite([52351(4),375(7)]),xx(a)].
19.29/19.59	
19.29/19.59	% SZS output end Refutation
19.29/19.59	============================== end of proof ==========================
19.29/19.59	
19.29/19.59	============================== STATISTICS ============================
19.29/19.59	
19.29/19.59	Given=2676. Generated=788838. Kept=52599. proofs=1.
19.29/19.59	Usable=2398. Sos=8470. Demods=1146. Limbo=330, Disabled=41702. Hints=0.
19.29/19.59	Megabytes=47.11.
19.29/19.59	User_CPU=18.10, System_CPU=0.46, Wall_clock=19.
19.29/19.59	
19.29/19.59	============================== end of statistics =====================
19.29/19.59	
19.29/19.59	============================== end of search =========================
19.29/19.59	
19.29/19.59	THEOREM PROVED
19.29/19.59	% SZS status Theorem
19.29/19.59	
19.29/19.59	Exiting with 1 proof.
19.29/19.59	
19.29/19.59	Process 22317 exit (max_proofs) Tue Aug  9 02:47:16 2022
19.29/19.59	Prover9 interrupted
19.29/19.59	EOF