0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer   : n005.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	% DateTime   : Thu Jul  2 06:48:06 EDT 2020
0.12/0.33	% CPUTime    : 
0.94/1.20	============================== Prover9 ===============================
0.94/1.20	Prover9 (32) version 2009-11A, November 2009.
0.94/1.20	Process 22206 was started by sandbox2 on n005.cluster.edu,
0.94/1.20	Thu Jul  2 06:48:07 2020
0.94/1.20	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_22053_n005.cluster.edu".
0.94/1.20	============================== end of head ===========================
0.94/1.20	
0.94/1.20	============================== INPUT =================================
0.94/1.20	
0.94/1.20	% Reading from file /tmp/Prover9_22053_n005.cluster.edu
0.94/1.20	
0.94/1.20	set(prolog_style_variables).
0.94/1.20	set(auto2).
0.94/1.20	    % set(auto2) -> set(auto).
0.94/1.20	    % set(auto) -> set(auto_inference).
0.94/1.20	    % set(auto) -> set(auto_setup).
0.94/1.20	    % set(auto_setup) -> set(predicate_elim).
0.94/1.20	    % set(auto_setup) -> assign(eq_defs, unfold).
0.94/1.20	    % set(auto) -> set(auto_limits).
0.94/1.20	    % set(auto_limits) -> assign(max_weight, "100.000").
0.94/1.20	    % set(auto_limits) -> assign(sos_limit, 20000).
0.94/1.20	    % set(auto) -> set(auto_denials).
0.94/1.20	    % set(auto) -> set(auto_process).
0.94/1.20	    % set(auto2) -> assign(new_constants, 1).
0.94/1.20	    % set(auto2) -> assign(fold_denial_max, 3).
0.94/1.20	    % set(auto2) -> assign(max_weight, "200.000").
0.94/1.20	    % set(auto2) -> assign(max_hours, 1).
0.94/1.20	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.94/1.20	    % set(auto2) -> assign(max_seconds, 0).
0.94/1.20	    % set(auto2) -> assign(max_minutes, 5).
0.94/1.20	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.94/1.20	    % set(auto2) -> set(sort_initial_sos).
0.94/1.20	    % set(auto2) -> assign(sos_limit, -1).
0.94/1.20	    % set(auto2) -> assign(lrs_ticks, 3000).
0.94/1.20	    % set(auto2) -> assign(max_megs, 400).
0.94/1.20	    % set(auto2) -> assign(stats, some).
0.94/1.20	    % set(auto2) -> clear(echo_input).
0.94/1.20	    % set(auto2) -> set(quiet).
0.94/1.20	    % set(auto2) -> clear(print_initial_clauses).
0.94/1.20	    % set(auto2) -> clear(print_given).
0.94/1.20	assign(lrs_ticks,-1).
0.94/1.20	assign(sos_limit,10000).
0.94/1.20	assign(order,kbo).
0.94/1.20	set(lex_order_vars).
0.94/1.20	clear(print_given).
0.94/1.20	
0.94/1.20	% formulas(sos).  % not echoed (92 formulas)
0.94/1.20	
0.94/1.20	============================== end of input ==========================
0.94/1.20	
0.94/1.20	% From the command line: assign(max_seconds, 960).
0.94/1.20	
0.94/1.20	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.94/1.20	
0.94/1.20	% Formulas that are not ordinary clauses:
0.94/1.20	1 (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.94/1.20	2 (all I all L all U all Val (leq(I,U) & leq(L,I) -> Val = a_select2(tptp_const_array1(dim(L,U),Val),I))) # label(const_array1_select) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	3 (all X all Y (leq(X,Y) <-> gt(succ(Y),X))) # label(leq_succ_gt_equiv) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	4 (all X all Y (leq(X,Y) & X != Y -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	5 (all X succ(succ(succ(succ(succ(X))))) = plus(X,n5)) # label(succ_plus_5_r) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	6 (all X minus(X,n1) = pred(X)) # label(pred_minus_1) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	7 (all X succ(succ(succ(succ(X)))) = plus(X,n4)) # label(succ_plus_4_r) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	8 (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.94/1.20	9 (all A all B all N all M ((all I all J (leq(n0,I) & leq(I,M) & leq(J,M) & leq(n0,J) -> a_select3(B,J,I) = a_select3(B,I,J))) -> (all I all J (leq(n0,I) & leq(J,N) & leq(I,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.94/1.20	10 (all X X = pred(succ(X))) # label(pred_succ) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	11 (all X succ(succ(succ(succ(X)))) = plus(n4,X)) # label(succ_plus_4_l) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	12 (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.94/1.20	13 (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 (leq(n0,I) & leq(I,N) & leq(J,N) & leq(n0,J) -> a_select3(inv(A),J,I) = a_select3(inv(A),I,J))))) # label(matrix_symm_inv) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	14 (all X succ(succ(succ(X))) = plus(n3,X)) # label(succ_plus_3_l) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	15 (all X plus(X,n1) = succ(X)) # label(succ_plus_1_r) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	16 (all X succ(X) = plus(n1,X)) # label(succ_plus_1_l) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	17 (all I all U all X all VAL all VAL2 (VAL = a_select2(X,U) & U != I -> VAL = a_select2(tptp_update2(X,I,VAL2),U))) # label(sel2_update_2) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	18 (all A all N ((all I all J (leq(n0,J) & leq(n0,I) & leq(J,N) & leq(I,N) -> a_select3(A,J,I) = a_select3(A,I,J))) -> (all I all J all K all VAL (leq(n0,K) & leq(K,N) & leq(J,N) & leq(n0,J) & leq(I,N) & leq(n0,I) -> 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.94/1.20	19 (all X -gt(X,X)) # label(irreflexivity_gt) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	20 (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.94/1.20	21 (all A all B all C all D all E all F all N all M ((all I all J (leq(n0,I) & leq(n0,J) & leq(J,M) & leq(I,M) -> a_select3(D,J,I) = a_select3(D,I,J))) & (all I all J (leq(n0,I) & leq(J,N) & leq(n0,J) & leq(I,N) -> a_select3(A,J,I) = a_select3(A,I,J))) & (all I all J (leq(n0,I) & leq(J,N) & leq(n0,J) & leq(I,N) -> a_select3(F,I,J) = a_select3(F,J,I))) -> (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.94/1.20	22 (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(n0,I) & 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(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.94/1.20	23 (all A all B all N ((all I all J (leq(n0,J) & leq(I,N) & leq(n0,I) & leq(J,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,J,I) = a_select3(B,I,J))) -> (all I all J (leq(n0,I) & leq(J,N) & leq(n0,J) & leq(I,N) -> a_select3(tptp_madd(A,B),J,I) = a_select3(tptp_madd(A,B),I,J))))) # label(matrix_symm_add) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	24 (all A all N ((all I all J (leq(n0,J) & leq(n0,I) & leq(J,N) & leq(I,N) -> 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),I,J) = a_select3(trans(A),J,I))))) # label(matrix_symm_trans) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	25 (all A all B all N ((all I all J (leq(J,N) & leq(n0,I) & leq(I,N) & leq(n0,J) -> a_select3(B,J,I) = a_select3(B,I,J))) -> (all I all J (leq(n0,I) & leq(J,N) & leq(n0,J) & leq(I,N) -> 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.94/1.20	26 (all X plus(n5,X) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_l) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	27 (all X succ(succ(X)) = plus(n2,X)) # label(succ_plus_2_l) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	28 (all Body sum(n0,tptp_minus_1,Body) = tptp_float_0_0) # label(sum_plus_base_float) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	29 (all X succ(succ(succ(X))) = plus(X,n3)) # label(succ_plus_3_r) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	30 (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.94/1.20	31 (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.94/1.20	32 (all X all Y (leq(succ(X),Y) -> gt(Y,X))) # label(leq_succ_gt) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	33 (all X all Y (gt(Y,X) -> leq(X,Y))) # label(leq_gt1) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	34 (all Body n0 = sum(n0,tptp_minus_1,Body)) # label(sum_plus_base) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	35 (all X all Y (leq(X,Y) <-> leq(succ(X),succ(Y)))) # label(leq_succ_succ) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	36 (all I all J all U all V all X all VAL (leq(I,U) & (all I0 all J0 (leq(n0,I0) & leq(n0,J0) & leq(I0,U) & leq(J0,V) -> a_select3(X,I0,J0) = VAL)) & leq(J,V) & leq(n0,J) & leq(n0,I) -> a_select3(tptp_update3(X,U,V,VAL),I,J) = VAL)) # label(sel3_update_3) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	37 (all X all Y (geq(X,Y) <-> leq(Y,X))) # label(leq_geq) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	38 (all X all Y (gt(Y,X) <-> leq(X,pred(Y)))) # label(leq_gt_pred) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	39 (all X all Y (lt(X,Y) <-> gt(Y,X))) # label(lt_gt) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	40 (all X leq(X,X)) # label(reflexivity_leq) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	41 (all I all J all U all V all X all VAL all VAL2 (I != U & 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.94/1.20	42 (all X gt(succ(X),X)) # label(gt_succ) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	43 (all X all Y (gt(X,Y) | X = Y | gt(Y,X))) # label(totality) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	44 (all I all L1 all U1 all J all L2 all U2 all Val (leq(L2,J) & leq(J,U2) & leq(I,U1) & leq(L1,I) -> 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.94/1.20	45 (all X succ(pred(X)) = X) # label(succ_pred) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	46 (all X succ(succ(X)) = plus(X,n2)) # label(succ_plus_2_r) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	47 (all X all Y (leq(X,Y) -> leq(X,succ(Y)))) # label(leq_succ) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	48 (all X all Y (leq(minus(X,Y),X) -> leq(n0,Y))) # label(leq_minus) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	49 (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.94/1.20	50 (all X (leq(X,n2) & leq(n0,X) -> X = n2 | X = n1 | X = n0)) # label(finite_domain_2) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	51 (all X (leq(n0,X) & leq(X,n0) -> X = n0)) # label(finite_domain_0) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	52 (all X (leq(n0,X) & leq(X,n4) -> n2 = X | X = n4 | X = n3 | X = n1 | X = n0)) # label(finite_domain_4) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	53 (all X (leq(X,n5) & leq(n0,X) -> X = n1 | X = n2 | n4 = X | n5 = X | n3 = X | X = n0)) # label(finite_domain_5) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	54 (all X (leq(n0,X) & leq(X,n1) -> n0 = X | n1 = X)) # label(finite_domain_1) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	55 (all X (leq(X,n3) & leq(n0,X) -> X = n2 | X = n3 | n1 = X | X = n0)) # label(finite_domain_3) # label(axiom) # label(non_clause).  [assumption].
0.94/1.20	56 -(sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))) = pv70 & leq(n0,pv10) & (all B (leq(B,pred(pv10)) & leq(n0,B) -> n1 = sum(n0,n4,a_select3(q,B,tptp_sum_index)))) & (all A (leq(A,pred(pv12)) & leq(n0,A) -> a_select3(q,pv10,A) = divide(sqrt(times(minus(a_select3(center,A,n0),a_select2(x,pv10)),minus(a_select3(center,A,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))))) & leq(pv12,n4) & leq(pv10,n135299) & leq(n0,pv12) -> (all C (leq(C,pv12) & leq(n0,C) -> (C != pv12 -> divide(sqrt(times(minus(a_select3(center,C,n0),a_select2(x,pv10)),minus(a_select3(center,C,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) = a_select3(q,pv10,C))))) # label(cl5_nebula_norm_0003) # label(negated_conjecture) # label(non_clause).  [assumption].
7.62/7.88	
7.62/7.88	============================== end of process non-clausal formulas ===
7.62/7.88	
7.62/7.88	============================== PROCESS INITIAL CLAUSES ===============
7.62/7.88	
7.62/7.88	============================== PREDICATE ELIMINATION =================
7.62/7.88	57 geq(A,B) | -leq(B,A) # label(leq_geq) # label(axiom).  [clausify(37)].
7.62/7.88	58 -geq(A,B) | leq(B,A) # label(leq_geq) # label(axiom).  [clausify(37)].
7.62/7.88	59 lt(A,B) | -gt(B,A) # label(lt_gt) # label(axiom).  [clausify(39)].
7.62/7.88	60 -lt(A,B) | gt(B,A) # label(lt_gt) # label(axiom).  [clausify(39)].
7.62/7.88	
7.62/7.88	============================== end predicate elimination =============
7.62/7.88	
7.62/7.88	Auto_denials:  (non-Horn, no changes).
7.62/7.88	
7.62/7.88	Term ordering decisions:
7.62/7.88	Function symbol KB weights:  n0=1. n1=1. n4=1. n2=1. n3=1. n5=1. pv10=1. tptp_minus_1=1. n135299=1. center=1. x=1. tptp_sum_index=1. pv12=1. q=1. pv70=1. tptp_float_0_0=1. def=1. use=1. c1=1. tptp_mmul=1. tptp_madd=1. tptp_msub=1. a_select2=1. plus=1. minus=1. dim=1. times=1. uniform_int_rnd=1. divide=1. tptp_const_array1=1. f4=1. f5=1. f6=1. f7=1. f22=1. f23=1. trans=1. succ=1. inv=1. pred=1. sqrt=1. a_select3=1. sum=1. tptp_update2=1. tptp_const_array2=1. f14=1. f15=1. f16=1. f17=1. f18=1. f19=1. f20=1. f21=1. f24=1. f25=1. tptp_update3=1. f1=1. f2=1. f3=1. f26=1. f27=1. f8=1. f9=1. f10=1. f11=1. f12=1. f13=1.
7.62/7.88	
7.62/7.88	============================== end of process initial clauses ========
7.62/7.88	
7.62/7.88	============================== CLAUSES FOR SEARCH ====================
7.62/7.88	
7.62/7.88	============================== end of clauses for search =============
7.62/7.88	
7.62/7.88	============================== SEARCH ================================
7.62/7.88	
7.62/7.88	% Starting search at 0.29 seconds.
7.62/7.88	
7.62/7.88	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 846 (0.00 of 2.13 sec).
7.62/7.88	
7.62/7.88	Low Water (keep): wt=179.000, iters=3364
7.62/7.88	
7.62/7.88	Low Water (keep): wt=149.000, iters=3351
7.62/7.88	
7.62/7.88	Low Water (keep): wt=119.000, iters=3388
7.62/7.88	
7.62/7.88	Low Water (keep): wt=116.000, iters=3498
7.62/7.88	
7.62/7.88	Low Water (keep): wt=89.000, iters=3706
7.62/7.88	
7.62/7.88	Low Water (keep): wt=86.000, iters=3461
7.62/7.88	
7.62/7.88	Low Water (keep): wt=83.000, iters=3646
7.62/7.88	
7.62/7.88	Low Water (keep): wt=80.000, iters=3446
7.62/7.88	
7.62/7.88	Low Water (keep): wt=58.000, iters=3473
7.62/7.88	
7.62/7.88	Low Water (keep): wt=47.000, iters=3374
7.62/7.88	
7.62/7.88	Low Water (keep): wt=46.000, iters=3378
7.62/7.88	
7.62/7.88	Low Water (keep): wt=43.000, iters=3414
7.62/7.88	
7.62/7.88	Low Water (keep): wt=34.000, iters=3335
7.62/7.88	
7.62/7.88	Low Water (displace): id=6130, wt=179.000
7.62/7.88	
7.62/7.88	Low Water (displace): id=10927, wt=28.000
7.62/7.88	
7.62/7.88	Low Water (displace): id=10928, wt=25.000
7.62/7.88	
7.62/7.88	Low Water (displace): id=11001, wt=19.000
7.62/7.88	
7.62/7.88	Low Water (keep): wt=31.000, iters=3333
7.62/7.88	
7.62/7.88	Low Water (displace): id=12560, wt=17.000
7.62/7.88	
7.62/7.88	Low Water (displace): id=12585, wt=16.000
7.62/7.88	
7.62/7.88	Low Water (keep): wt=28.000, iters=3341
7.62/7.88	
7.62/7.88	Low Water (keep): wt=27.000, iters=3334
7.62/7.88	
7.62/7.88	Low Water (keep): wt=26.000, iters=3335
7.62/7.88	
7.62/7.88	Low Water (keep): wt=25.000, iters=3351
7.62/7.88	
7.62/7.88	Low Water (displace): id=18702, wt=14.000
7.62/7.88	
7.62/7.88	Low Water (displace): id=18703, wt=13.000
7.62/7.88	
7.62/7.88	Low Water (displace): id=18737, wt=7.000
7.62/7.88	
7.62/7.88	Low Water (displace): id=18884, wt=6.000
7.62/7.88	
7.62/7.88	============================== PROOF =================================
7.62/7.88	% SZS status Theorem
7.62/7.88	% SZS output start Refutation
7.62/7.88	
7.62/7.88	% Proof 1 at 6.60 (+ 0.09) seconds.
7.62/7.88	% Length of proof is 17.
7.62/7.88	% Level of proof is 5.
7.62/7.88	% Maximum clause weight is 32.000.
7.62/7.88	% Given clauses 923.
7.62/7.88	
7.62/7.88	4 (all X all Y (leq(X,Y) & X != Y -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause).  [assumption].
7.62/7.88	38 (all X all Y (gt(Y,X) <-> leq(X,pred(Y)))) # label(leq_gt_pred) # label(axiom) # label(non_clause).  [assumption].
7.62/7.88	56 -(sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))) = pv70 & leq(n0,pv10) & (all B (leq(B,pred(pv10)) & leq(n0,B) -> n1 = sum(n0,n4,a_select3(q,B,tptp_sum_index)))) & (all A (leq(A,pred(pv12)) & leq(n0,A) -> a_select3(q,pv10,A) = divide(sqrt(times(minus(a_select3(center,A,n0),a_select2(x,pv10)),minus(a_select3(center,A,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))))) & leq(pv12,n4) & leq(pv10,n135299) & leq(n0,pv12) -> (all C (leq(C,pv12) & leq(n0,C) -> (C != pv12 -> divide(sqrt(times(minus(a_select3(center,C,n0),a_select2(x,pv10)),minus(a_select3(center,C,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) = a_select3(q,pv10,C))))) # label(cl5_nebula_norm_0003) # label(negated_conjecture) # label(non_clause).  [assumption].
7.62/7.88	65 -leq(A,B) | B = A | gt(B,A) # label(leq_gt2) # label(axiom).  [clausify(4)].
7.62/7.88	306 -gt(A,B) | leq(B,pred(A)) # label(leq_gt_pred) # label(axiom).  [clausify(38)].
7.62/7.88	368 sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))) = pv70 # label(cl5_nebula_norm_0003) # label(negated_conjecture).  [clausify(56)].
7.62/7.88	371 -leq(A,pred(pv12)) | -leq(n0,A) | divide(sqrt(times(minus(a_select3(center,A,n0),a_select2(x,pv10)),minus(a_select3(center,A,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) = a_select3(q,pv10,A) # label(cl5_nebula_norm_0003) # label(negated_conjecture).  [clausify(56)].
7.62/7.88	372 -leq(A,pred(pv12)) | -leq(n0,A) | divide(sqrt(times(minus(a_select3(center,A,n0),a_select2(x,pv10)),minus(a_select3(center,A,n0),a_select2(x,pv10)))),pv70) = a_select3(q,pv10,A).  [copy(371),rewrite([368(42)])].
7.62/7.88	376 leq(c1,pv12) # label(cl5_nebula_norm_0003) # label(negated_conjecture).  [clausify(56)].
7.62/7.88	377 leq(n0,c1) # label(cl5_nebula_norm_0003) # label(negated_conjecture).  [clausify(56)].
7.62/7.88	378 pv12 != c1 # label(cl5_nebula_norm_0003) # label(negated_conjecture).  [clausify(56)].
7.62/7.88	379 c1 != pv12.  [copy(378),flip(a)].
7.62/7.88	380 divide(sqrt(times(minus(a_select3(center,c1,n0),a_select2(x,pv10)),minus(a_select3(center,c1,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) != a_select3(q,pv10,c1) # label(cl5_nebula_norm_0003) # label(negated_conjecture).  [clausify(56)].
7.62/7.88	381 divide(sqrt(times(minus(a_select3(center,c1,n0),a_select2(x,pv10)),minus(a_select3(center,c1,n0),a_select2(x,pv10)))),pv70) != a_select3(q,pv10,c1).  [copy(380),rewrite([368(39)])].
7.62/7.88	4018 gt(pv12,c1).  [resolve(376,a,65,a),flip(a),unit_del(a,379)].
7.62/7.88	12845 leq(c1,pred(pv12)).  [resolve(4018,a,306,a)].
7.62/7.88	19019 $F.  [resolve(12845,a,372,a),unit_del(a,377),unit_del(b,381)].
7.62/7.88	
7.62/7.88	% SZS output end Refutation
7.62/7.88	============================== end of proof ==========================
7.62/7.88	
7.62/7.88	============================== STATISTICS ============================
7.62/7.88	
7.62/7.88	Given=923. Generated=77836. Kept=18938. proofs=1.
7.62/7.88	Usable=908. Sos=9986. Demods=300. Limbo=58, Disabled=8291. Hints=0.
7.62/7.88	Megabytes=33.45.
7.62/7.88	User_CPU=6.60, System_CPU=0.09, Wall_clock=6.
7.62/7.88	
7.62/7.88	============================== end of statistics =====================
7.62/7.88	
7.62/7.88	============================== end of search =========================
7.62/7.88	
7.62/7.88	THEOREM PROVED
7.62/7.88	% SZS status Theorem
7.62/7.88	
7.62/7.88	Exiting with 1 proof.
7.62/7.88	
7.62/7.88	Process 22206 exit (max_proofs) Thu Jul  2 06:48:13 2020
7.62/7.88	Prover9 interrupted
7.62/7.89	EOF