0.00/0.04	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.04	% Command    : tptp2X_and_run_prover9 %d %s
0.02/0.24	% Computer   : n162.star.cs.uiowa.edu
0.02/0.24	% Model      : x86_64 x86_64
0.02/0.24	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.02/0.24	% Memory     : 32218.625MB
0.02/0.24	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.02/0.24	% CPULimit   : 300
0.02/0.24	% DateTime   : Sat Jul 14 04:20:25 CDT 2018
0.02/0.24	% CPUTime    : 
0.31/0.55	============================== Prover9 ===============================
0.31/0.55	Prover9 (32) version 2009-11A, November 2009.
0.31/0.55	Process 46443 was started by sandbox2 on n162.star.cs.uiowa.edu,
0.31/0.55	Sat Jul 14 04:20:25 2018
0.31/0.55	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_46411_n162.star.cs.uiowa.edu".
0.31/0.55	============================== end of head ===========================
0.31/0.55	
0.31/0.55	============================== INPUT =================================
0.31/0.55	
0.31/0.55	% Reading from file /tmp/Prover9_46411_n162.star.cs.uiowa.edu
0.31/0.55	
0.31/0.55	set(prolog_style_variables).
0.31/0.55	set(auto2).
0.31/0.55	    % set(auto2) -> set(auto).
0.31/0.55	    % set(auto) -> set(auto_inference).
0.31/0.55	    % set(auto) -> set(auto_setup).
0.31/0.55	    % set(auto_setup) -> set(predicate_elim).
0.31/0.55	    % set(auto_setup) -> assign(eq_defs, unfold).
0.31/0.55	    % set(auto) -> set(auto_limits).
0.31/0.55	    % set(auto_limits) -> assign(max_weight, "100.000").
0.31/0.55	    % set(auto_limits) -> assign(sos_limit, 20000).
0.31/0.55	    % set(auto) -> set(auto_denials).
0.31/0.55	    % set(auto) -> set(auto_process).
0.31/0.55	    % set(auto2) -> assign(new_constants, 1).
0.31/0.55	    % set(auto2) -> assign(fold_denial_max, 3).
0.31/0.55	    % set(auto2) -> assign(max_weight, "200.000").
0.31/0.55	    % set(auto2) -> assign(max_hours, 1).
0.31/0.55	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.31/0.55	    % set(auto2) -> assign(max_seconds, 0).
0.31/0.55	    % set(auto2) -> assign(max_minutes, 5).
0.31/0.55	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.31/0.55	    % set(auto2) -> set(sort_initial_sos).
0.31/0.55	    % set(auto2) -> assign(sos_limit, -1).
0.31/0.55	    % set(auto2) -> assign(lrs_ticks, 3000).
0.31/0.55	    % set(auto2) -> assign(max_megs, 400).
0.31/0.55	    % set(auto2) -> assign(stats, some).
0.31/0.55	    % set(auto2) -> clear(echo_input).
0.31/0.55	    % set(auto2) -> set(quiet).
0.31/0.55	    % set(auto2) -> clear(print_initial_clauses).
0.31/0.55	    % set(auto2) -> clear(print_given).
0.31/0.55	assign(lrs_ticks,-1).
0.31/0.55	assign(sos_limit,10000).
0.31/0.55	assign(order,kbo).
0.31/0.55	set(lex_order_vars).
0.31/0.55	clear(print_given).
0.31/0.55	
0.31/0.55	% formulas(sos).  % not echoed (92 formulas)
0.31/0.55	
0.31/0.55	============================== end of input ==========================
0.31/0.55	
0.31/0.55	% From the command line: assign(max_seconds, 300).
0.31/0.55	
0.31/0.55	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.31/0.55	
0.31/0.55	% Formulas that are not ordinary clauses:
0.31/0.55	1 (all A all N ((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(I,N) & leq(J,N) & leq(n0,J) -> a_select3(trans(A),J,I) = a_select3(trans(A),I,J))))) # label(matrix_symm_trans) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	2 (all X plus(n4,X) = succ(succ(succ(succ(X))))) # label(succ_plus_4_l) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	3 (all X succ(X) = plus(n1,X)) # label(succ_plus_1_l) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	4 (all I all U all X all VAL (leq(n0,I) & leq(I,U) & (all I0 (leq(I0,U) & leq(n0,I0) -> VAL = a_select2(X,I0))) -> VAL = a_select2(tptp_update2(X,U,VAL),I))) # label(sel2_update_3) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	5 (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.31/0.55	6 (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.31/0.55	7 (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.31/0.55	8 (all Body sum(n0,tptp_minus_1,Body) = n0) # label(sum_plus_base) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	9 (all I all L all U all Val (leq(I,U) & leq(L,I) -> a_select2(tptp_const_array1(dim(L,U),Val),I) = Val)) # label(const_array1_select) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	10 (all X all Y (leq(succ(X),succ(Y)) <-> leq(X,Y))) # label(leq_succ_succ) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	11 (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) -> 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.31/0.55	12 (all X succ(pred(X)) = X) # label(succ_pred) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	13 (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.31/0.55	14 (all A all N ((all I all J (leq(n0,J) & leq(J,N) & 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,J) & leq(n0,K) & leq(K,N) & 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.31/0.55	15 (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))),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.31/0.55	16 (all X all Y (gt(Y,X) -> leq(X,Y))) # label(leq_gt1) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	17 (all X all Y (X != Y & leq(X,Y) -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	18 (all X all Y (X = Y | gt(Y,X) | gt(X,Y))) # label(totality) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	19 (all X plus(X,n4) = succ(succ(succ(succ(X))))) # label(succ_plus_4_r) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	20 (all I all J all U all V all X all VAL (leq(I,U) & leq(n0,J) & leq(J,V) & leq(n0,I) & (all I0 all J0 (leq(n0,I0) & leq(I0,U) & leq(J0,V) & leq(n0,J0) -> a_select3(X,I0,J0) = VAL)) -> a_select3(tptp_update3(X,U,V,VAL),I,J) = VAL)) # label(sel3_update_3) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	21 (all X plus(X,n1) = succ(X)) # label(succ_plus_1_r) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	22 (all X all Y (leq(X,Y) -> leq(X,succ(Y)))) # label(leq_succ) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	23 (all X plus(X,n5) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_r) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	24 (all X all Y (leq(minus(X,Y),X) -> leq(n0,Y))) # label(leq_minus) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	25 (all A all B all C all D all E all F all N all M ((all I all J (leq(I,N) & leq(n0,J) & leq(J,N) & leq(n0,I) -> a_select3(F,J,I) = a_select3(F,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,M) & leq(n0,J) & leq(I,M) -> a_select3(D,I,J) = a_select3(D,J,I))) -> (all I all J (leq(n0,J) & leq(J,N) & 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.31/0.55	26 (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.31/0.55	27 (all X minus(X,n1) = pred(X)) # label(pred_minus_1) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	28 (all X -gt(X,X)) # label(irreflexivity_gt) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	29 (all X all Y (gt(succ(Y),X) <-> leq(X,Y))) # label(leq_succ_gt_equiv) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	30 (all I all J all U all V all X all VAL all VAL2 (V = J & a_select3(X,U,V) = VAL & U != I -> a_select3(tptp_update3(X,I,J,VAL2),U,V) = VAL)) # label(sel3_update_2) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	31 (all X all Y (lt(X,Y) <-> gt(Y,X))) # label(lt_gt) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	32 (all X succ(succ(X)) = plus(X,n2)) # label(succ_plus_2_r) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	33 (all X all Y (geq(X,Y) <-> leq(Y,X))) # label(leq_geq) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	34 (all X plus(n2,X) = succ(succ(X))) # label(succ_plus_2_l) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	35 (all A 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(inv(A),I,J) = a_select3(inv(A),J,I))))) # label(matrix_symm_inv) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	36 (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,J,I) = a_select3(B,I,J))) & (all I all J (leq(I,N) & leq(n0,J) & leq(J,N) & 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,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.31/0.55	37 (all X pred(succ(X)) = X) # label(pred_succ) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	38 (all Body tptp_float_0_0 = sum(n0,tptp_minus_1,Body)) # label(sum_plus_base_float) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	39 (all X succ(succ(succ(X))) = plus(X,n3)) # label(succ_plus_3_r) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	40 (all X all Y (gt(Y,X) <-> leq(X,pred(Y)))) # label(leq_gt_pred) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	41 (all X leq(X,X)) # label(reflexivity_leq) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	42 (all A all B all N ((all I all J (leq(n0,I) & leq(n0,J) & leq(J,N) & leq(I,N) -> 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.31/0.55	43 (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.31/0.55	44 (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,J,I) = a_select3(B,I,J))) & (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(J,N) & leq(n0,J) & 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.31/0.55	45 (all X all U all VAL a_select2(tptp_update2(X,U,VAL),U) = VAL) # label(sel2_update_1) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	46 (all X succ(succ(succ(X))) = plus(n3,X)) # label(succ_plus_3_l) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	47 (all X succ(succ(succ(succ(succ(X))))) = plus(n5,X)) # label(succ_plus_5_l) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	48 (all X all Y (leq(succ(X),Y) -> gt(Y,X))) # label(leq_succ_gt) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	49 (all X gt(succ(X),X)) # label(gt_succ) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	50 (all X (leq(n0,X) & leq(X,n3) -> X = n2 | X = n3 | n1 = X | X = n0)) # label(finite_domain_3) # label(axiom) # label(non_clause).  [assumption].
0.31/0.55	51 (all X (leq(X,n2) & leq(n0,X) -> X = n2 | X = n1 | n0 = X)) # label(finite_domain_2) # label(axiom) # label(non_clause).  [assumption].
0.31/0.56	52 (all X (leq(X,n1) & leq(n0,X) -> X = n0 | X = n1)) # label(finite_domain_1) # label(axiom) # label(non_clause).  [assumption].
0.31/0.56	53 (all X (leq(X,n4) & leq(n0,X) -> n1 = X | X = n4 | n3 = X | X = n2 | X = n0)) # label(finite_domain_4) # label(axiom) # label(non_clause).  [assumption].
0.31/0.56	54 (all X (leq(n0,X) & leq(X,n0) -> n0 = X)) # label(finite_domain_0) # label(axiom) # label(non_clause).  [assumption].
0.31/0.56	55 (all X (leq(n0,X) & leq(X,n5) -> X = n1 | X = n2 | n4 = X | n5 = X | X = n3 | n0 = X)) # label(finite_domain_5) # label(axiom) # label(non_clause).  [assumption].
0.31/0.56	56 -(leq(n0,pv10) & leq(n0,pv12) & leq(pv12,n4) & (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(pv10,n135299) & pv70 = 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))))) -> (all C (leq(n0,C) & leq(C,pv12) -> (C != pv12 -> a_select3(q,pv10,C) = 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)))))))))) # label(cl5_nebula_norm_0003) # label(negated_conjecture) # label(non_clause).  [assumption].
5.62/5.92	
5.62/5.92	============================== end of process non-clausal formulas ===
5.62/5.92	
5.62/5.92	============================== PROCESS INITIAL CLAUSES ===============
5.62/5.92	
5.62/5.92	============================== PREDICATE ELIMINATION =================
5.62/5.92	57 lt(A,B) | -gt(B,A) # label(lt_gt) # label(axiom).  [clausify(31)].
5.62/5.92	58 -lt(A,B) | gt(B,A) # label(lt_gt) # label(axiom).  [clausify(31)].
5.62/5.92	59 geq(A,B) | -leq(B,A) # label(leq_geq) # label(axiom).  [clausify(33)].
5.62/5.92	60 -geq(A,B) | leq(B,A) # label(leq_geq) # label(axiom).  [clausify(33)].
5.62/5.92	
5.62/5.92	============================== end predicate elimination =============
5.62/5.92	
5.62/5.92	Auto_denials:  (non-Horn, no changes).
5.62/5.92	
5.62/5.92	Term ordering decisions:
5.62/5.92	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. f1=1. f2=1. f4=1. f5=1. f16=1. f17=1. trans=1. succ=1. inv=1. pred=1. sqrt=1. a_select3=1. sum=1. tptp_update2=1. tptp_const_array2=1. f18=1. f19=1. f20=1. f21=1. f22=1. f23=1. f24=1. f25=1. f26=1. f27=1. tptp_update3=1. f3=1. f6=1. f7=1. f8=1. f9=1. f10=1. f11=1. f12=1. f13=1. f14=1. f15=1.
5.62/5.92	
5.62/5.92	============================== end of process initial clauses ========
5.62/5.92	
5.62/5.92	============================== CLAUSES FOR SEARCH ====================
5.62/5.92	
5.62/5.92	============================== end of clauses for search =============
5.62/5.92	
5.62/5.92	============================== SEARCH ================================
5.62/5.92	
5.62/5.92	% Starting search at 0.20 seconds.
5.62/5.92	
5.62/5.92	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 479 (0.00 of 1.60 sec).
5.62/5.92	
5.62/5.92	Low Water (keep): wt=176.000, iters=3436
5.62/5.92	
5.62/5.92	Low Water (keep): wt=146.000, iters=3375
5.62/5.92	
5.62/5.92	Low Water (keep): wt=116.000, iters=3444
5.62/5.92	
5.62/5.92	Low Water (keep): wt=110.000, iters=3395
5.62/5.92	
5.62/5.92	Low Water (keep): wt=86.000, iters=3459
5.62/5.92	
5.62/5.92	Low Water (keep): wt=83.000, iters=3682
5.62/5.92	
5.62/5.92	Low Water (keep): wt=64.000, iters=3362
5.62/5.92	
5.62/5.92	Low Water (keep): wt=47.000, iters=3341
5.62/5.92	
5.62/5.92	Low Water (keep): wt=46.000, iters=3356
5.62/5.92	
5.62/5.92	Low Water (keep): wt=43.000, iters=3363
5.62/5.92	
5.62/5.92	Low Water (keep): wt=37.000, iters=3412
5.62/5.92	
5.62/5.92	Low Water (keep): wt=34.000, iters=3526
5.62/5.92	
5.62/5.92	Low Water (displace): id=5923, wt=179.000
5.62/5.92	
5.62/5.92	Low Water (displace): id=10924, wt=31.000
5.62/5.92	
5.62/5.92	Low Water (displace): id=10926, wt=28.000
5.62/5.92	
5.62/5.92	Low Water (displace): id=10966, wt=16.000
5.62/5.92	
5.62/5.92	Low Water (displace): id=11268, wt=15.000
5.62/5.92	
5.62/5.92	Low Water (displace): id=11274, wt=13.000
5.62/5.92	
5.62/5.92	Low Water (keep): wt=31.000, iters=3369
5.62/5.92	
5.62/5.92	Low Water (keep): wt=28.000, iters=3335
5.62/5.92	
5.62/5.92	Low Water (displace): id=16577, wt=12.000
5.62/5.92	
5.62/5.92	Low Water (displace): id=16586, wt=11.000
5.62/5.92	
5.62/5.92	Low Water (displace): id=16820, wt=10.000
5.62/5.92	
5.62/5.92	Low Water (displace): id=16827, wt=9.000
5.62/5.92	
5.62/5.92	============================== PROOF =================================
5.62/5.92	% SZS status Theorem
5.62/5.92	% SZS output start Refutation
5.62/5.92	
5.62/5.92	% Proof 1 at 5.33 (+ 0.06) seconds.
5.62/5.92	% Length of proof is 17.
5.62/5.92	% Level of proof is 5.
5.62/5.92	% Maximum clause weight is 52.000.
5.62/5.92	% Given clauses 925.
5.62/5.92	
5.62/5.92	17 (all X all Y (X != Y & leq(X,Y) -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause).  [assumption].
5.62/5.92	40 (all X all Y (gt(Y,X) <-> leq(X,pred(Y)))) # label(leq_gt_pred) # label(axiom) # label(non_clause).  [assumption].
5.62/5.92	56 -(leq(n0,pv10) & leq(n0,pv12) & leq(pv12,n4) & (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(pv10,n135299) & pv70 = 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))))) -> (all C (leq(n0,C) & leq(C,pv12) -> (C != pv12 -> a_select3(q,pv10,C) = 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)))))))))) # label(cl5_nebula_norm_0003) # label(negated_conjecture) # label(non_clause).  [assumption].
5.62/5.92	93 A = B | -leq(B,A) | gt(A,B) # label(leq_gt2) # label(axiom).  [clausify(17)].
5.62/5.92	281 -gt(A,B) | leq(B,pred(A)) # label(leq_gt_pred) # label(axiom).  [clausify(40)].
5.62/5.92	376 -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)].
5.62/5.92	378 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)].
5.62/5.92	379 leq(n0,c1) # label(cl5_nebula_norm_0003) # label(negated_conjecture).  [clausify(56)].
5.62/5.92	380 leq(c1,pv12) # label(cl5_nebula_norm_0003) # label(negated_conjecture).  [clausify(56)].
5.62/5.92	381 pv12 != c1 # label(cl5_nebula_norm_0003) # label(negated_conjecture).  [clausify(56)].
5.62/5.92	382 c1 != pv12.  [copy(381),flip(a)].
5.62/5.92	383 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)].
5.62/5.92	384 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(383),rewrite([378(39)])].
5.62/5.92	848 -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).  [back_rewrite(376),rewrite([378(42)])].
5.62/5.92	4777 gt(pv12,c1).  [resolve(380,a,93,b),flip(a),unit_del(a,382)].
5.62/5.92	12952 leq(c1,pred(pv12)).  [resolve(4777,a,281,a)].
5.62/5.92	18121 $F.  [resolve(12952,a,848,a),unit_del(a,379),unit_del(b,384)].
5.62/5.92	
5.62/5.92	% SZS output end Refutation
5.62/5.92	============================== end of proof ==========================
5.62/5.92	
5.62/5.92	============================== STATISTICS ============================
5.62/5.92	
5.62/5.92	Given=925. Generated=71906. Kept=18037. proofs=1.
5.62/5.92	Usable=916. Sos=9944. Demods=298. Limbo=4, Disabled=7478. Hints=0.
5.62/5.92	Megabytes=32.66.
5.62/5.92	User_CPU=5.33, System_CPU=0.06, Wall_clock=6.
5.62/5.92	
5.62/5.92	============================== end of statistics =====================
5.62/5.92	
5.62/5.92	============================== end of search =========================
5.62/5.92	
5.62/5.92	THEOREM PROVED
5.62/5.92	% SZS status Theorem
5.62/5.92	
5.62/5.92	Exiting with 1 proof.
5.62/5.92	
5.62/5.92	Process 46443 exit (max_proofs) Sat Jul 14 04:20:31 2018
5.62/5.92	Prover9 interrupted
5.62/5.93	EOF