0.00/0.03	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.04	% Command    : tptp2X_and_run_prover9 %d %s
0.03/0.23	% Computer   : n025.star.cs.uiowa.edu
0.03/0.23	% Model      : x86_64 x86_64
0.03/0.23	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.03/0.23	% Memory     : 32218.625MB
0.03/0.23	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.03/0.23	% CPULimit   : 300
0.03/0.23	% DateTime   : Sat Jul 14 04:21:11 CDT 2018
0.03/0.23	% CPUTime    : 
0.06/0.53	============================== Prover9 ===============================
0.06/0.53	Prover9 (32) version 2009-11A, November 2009.
0.06/0.53	Process 14688 was started by sandbox on n025.star.cs.uiowa.edu,
0.06/0.53	Sat Jul 14 04:21:11 2018
0.06/0.53	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_14656_n025.star.cs.uiowa.edu".
0.06/0.53	============================== end of head ===========================
0.06/0.53	
0.06/0.53	============================== INPUT =================================
0.06/0.53	
0.06/0.53	% Reading from file /tmp/Prover9_14656_n025.star.cs.uiowa.edu
0.06/0.53	
0.06/0.53	set(prolog_style_variables).
0.06/0.53	set(auto2).
0.06/0.53	    % set(auto2) -> set(auto).
0.06/0.53	    % set(auto) -> set(auto_inference).
0.06/0.53	    % set(auto) -> set(auto_setup).
0.06/0.53	    % set(auto_setup) -> set(predicate_elim).
0.06/0.53	    % set(auto_setup) -> assign(eq_defs, unfold).
0.06/0.53	    % set(auto) -> set(auto_limits).
0.06/0.53	    % set(auto_limits) -> assign(max_weight, "100.000").
0.06/0.53	    % set(auto_limits) -> assign(sos_limit, 20000).
0.06/0.53	    % set(auto) -> set(auto_denials).
0.06/0.53	    % set(auto) -> set(auto_process).
0.06/0.53	    % set(auto2) -> assign(new_constants, 1).
0.06/0.53	    % set(auto2) -> assign(fold_denial_max, 3).
0.06/0.53	    % set(auto2) -> assign(max_weight, "200.000").
0.06/0.53	    % set(auto2) -> assign(max_hours, 1).
0.06/0.53	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.06/0.53	    % set(auto2) -> assign(max_seconds, 0).
0.06/0.53	    % set(auto2) -> assign(max_minutes, 5).
0.06/0.53	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.06/0.53	    % set(auto2) -> set(sort_initial_sos).
0.06/0.53	    % set(auto2) -> assign(sos_limit, -1).
0.06/0.53	    % set(auto2) -> assign(lrs_ticks, 3000).
0.06/0.53	    % set(auto2) -> assign(max_megs, 400).
0.06/0.53	    % set(auto2) -> assign(stats, some).
0.06/0.53	    % set(auto2) -> clear(echo_input).
0.06/0.53	    % set(auto2) -> set(quiet).
0.06/0.53	    % set(auto2) -> clear(print_initial_clauses).
0.06/0.53	    % set(auto2) -> clear(print_given).
0.06/0.53	assign(lrs_ticks,-1).
0.06/0.53	assign(sos_limit,10000).
0.06/0.53	assign(order,kbo).
0.06/0.53	set(lex_order_vars).
0.06/0.53	clear(print_given).
0.06/0.53	
0.06/0.53	% formulas(sos).  % not echoed (92 formulas)
0.06/0.53	
0.06/0.53	============================== end of input ==========================
0.06/0.53	
0.06/0.53	% From the command line: assign(max_seconds, 300).
0.06/0.53	
0.06/0.53	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.06/0.53	
0.06/0.53	% Formulas that are not ordinary clauses:
0.06/0.53	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.06/0.53	2 (all X plus(n4,X) = succ(succ(succ(succ(X))))) # label(succ_plus_4_l) # label(axiom) # label(non_clause).  [assumption].
0.06/0.53	3 (all X succ(X) = plus(n1,X)) # label(succ_plus_1_l) # label(axiom) # label(non_clause).  [assumption].
0.06/0.53	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.06/0.53	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.06/0.53	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.06/0.53	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.06/0.53	8 (all Body sum(n0,tptp_minus_1,Body) = n0) # label(sum_plus_base) # label(axiom) # label(non_clause).  [assumption].
0.06/0.53	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.06/0.53	10 (all X all Y (leq(succ(X),succ(Y)) <-> leq(X,Y))) # label(leq_succ_succ) # label(axiom) # label(non_clause).  [assumption].
0.06/0.53	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.06/0.53	12 (all X succ(pred(X)) = X) # label(succ_pred) # label(axiom) # label(non_clause).  [assumption].
0.06/0.54	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.06/0.54	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.06/0.54	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.06/0.54	16 (all X all Y (gt(Y,X) -> leq(X,Y))) # label(leq_gt1) # label(axiom) # label(non_clause).  [assumption].
0.06/0.54	17 (all X all Y (X != Y & leq(X,Y) -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause).  [assumption].
0.06/0.54	18 (all X all Y (X = Y | gt(Y,X) | gt(X,Y))) # label(totality) # label(axiom) # label(non_clause).  [assumption].
0.06/0.54	19 (all X plus(X,n4) = succ(succ(succ(succ(X))))) # label(succ_plus_4_r) # label(axiom) # label(non_clause).  [assumption].
0.06/0.54	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.06/0.54	21 (all X plus(X,n1) = succ(X)) # label(succ_plus_1_r) # label(axiom) # label(non_clause).  [assumption].
0.06/0.54	22 (all X all Y (leq(X,Y) -> leq(X,succ(Y)))) # label(leq_succ) # label(axiom) # label(non_clause).  [assumption].
0.06/0.54	23 (all X plus(X,n5) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_r) # label(axiom) # label(non_clause).  [assumption].
0.06/0.54	24 (all X all Y (leq(minus(X,Y),X) -> leq(n0,Y))) # label(leq_minus) # label(axiom) # label(non_clause).  [assumption].
0.06/0.54	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.06/0.54	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.06/0.54	27 (all X minus(X,n1) = pred(X)) # label(pred_minus_1) # label(axiom) # label(non_clause).  [assumption].
0.06/0.54	28 (all X -gt(X,X)) # label(irreflexivity_gt) # label(axiom) # label(non_clause).  [assumption].
0.06/0.54	29 (all X all Y (gt(succ(Y),X) <-> leq(X,Y))) # label(leq_succ_gt_equiv) # label(axiom) # label(non_clause).  [assumption].
0.06/0.54	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.06/0.54	31 (all X all Y (lt(X,Y) <-> gt(Y,X))) # label(lt_gt) # label(axiom) # label(non_clause).  [assumption].
0.06/0.54	32 (all X succ(succ(X)) = plus(X,n2)) # label(succ_plus_2_r) # label(axiom) # label(non_clause).  [assumption].
0.06/0.54	33 (all X all Y (geq(X,Y) <-> leq(Y,X))) # label(leq_geq) # label(axiom) # label(non_clause).  [assumption].
0.06/0.54	34 (all X plus(n2,X) = succ(succ(X))) # label(succ_plus_2_l) # label(axiom) # label(non_clause).  [assumption].
0.06/0.54	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.06/0.54	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.06/0.54	37 (all X pred(succ(X)) = X) # label(pred_succ) # label(axiom) # label(non_clause).  [assumption].
0.06/0.54	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.06/0.54	39 (all X succ(succ(succ(X))) = plus(X,n3)) # label(succ_plus_3_r) # label(axiom) # label(non_clause).  [assumption].
0.06/0.54	40 (all X all Y (gt(Y,X) <-> leq(X,pred(Y)))) # label(leq_gt_pred) # label(axiom) # label(non_clause).  [assumption].
0.06/0.54	41 (all X leq(X,X)) # label(reflexivity_leq) # label(axiom) # label(non_clause).  [assumption].
0.06/0.54	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.06/0.54	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.06/0.54	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.06/0.54	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.06/0.54	46 (all X succ(succ(succ(X))) = plus(n3,X)) # label(succ_plus_3_l) # label(axiom) # label(non_clause).  [assumption].
0.06/0.54	47 (all X succ(succ(succ(succ(succ(X))))) = plus(n5,X)) # label(succ_plus_5_l) # label(axiom) # label(non_clause).  [assumption].
0.06/0.54	48 (all X all Y (leq(succ(X),Y) -> gt(Y,X))) # label(leq_succ_gt) # label(axiom) # label(non_clause).  [assumption].
0.06/0.54	49 (all X gt(succ(X),X)) # label(gt_succ) # label(axiom) # label(non_clause).  [assumption].
0.06/0.54	50 (all X (leq(n0,X) & leq(X,n0) -> n0 = X)) # label(finite_domain_0) # label(axiom) # label(non_clause).  [assumption].
0.06/0.54	51 (all X (leq(X,n5) & leq(n0,X) -> X = n1 | n3 = X | X = n5 | X = n4 | X = n2 | n0 = X)) # label(finite_domain_5) # label(axiom) # label(non_clause).  [assumption].
0.06/0.54	52 (all X (leq(n0,X) & leq(X,n1) -> X = n1 | n0 = X)) # label(finite_domain_1) # label(axiom) # label(non_clause).  [assumption].
0.06/0.54	53 (all X (leq(X,n2) & leq(n0,X) -> X = n0 | n1 = X | X = n2)) # label(finite_domain_2) # label(axiom) # label(non_clause).  [assumption].
0.06/0.54	54 (all X (leq(X,n3) & leq(n0,X) -> n3 = X | n2 = X | X = n1 | X = n0)) # label(finite_domain_3) # label(axiom) # label(non_clause).  [assumption].
0.06/0.54	55 (all X (leq(X,n4) & leq(n0,X) -> X = n0 | X = n1 | n2 = X | X = n3 | n4 = X)) # label(finite_domain_4) # label(axiom) # label(non_clause).  [assumption].
0.06/0.54	56 -(leq(n0,pv40) & (all D (leq(n0,D) & leq(D,pred(pv40)) -> init = a_select2(mu_init,D))) & (all E (leq(n0,E) & leq(E,pred(pv40)) -> init = a_select2(sigma_init,E))) & (gt(loopcounter,n1) -> (all G (leq(n0,G) & leq(G,n4) -> init = a_select2(muold_init,G)))) & (gt(loopcounter,n1) -> (all I (leq(n0,I) & leq(I,n4) -> init = a_select2(sigmaold_init,I)))) & (gt(loopcounter,n1) -> (all H (leq(H,n4) & leq(n0,H) -> a_select2(rhoold_init,H) = init))) & (all F (leq(F,n4) & leq(n0,F) -> init = a_select3(center_init,F,n0))) & (all C (leq(n0,C) & leq(C,n4) -> init = a_select2(rho_init,C))) & (all A (leq(n0,A) & leq(A,n135299) -> (all B (leq(B,n4) & leq(n0,B) -> a_select3(q_init,A,B) = init)))) & leq(pv40,n4) & a_select2(sigma_init,pv40) = init & init = a_select2(mu_init,pv40) -> (all J (leq(J,pv40) & leq(n0,J) -> init = a_select2(mu_init,J)))) # label(cl5_nebula_init_0011) # label(negated_conjecture) # label(non_clause).  [assumption].
23.23/23.54	
23.23/23.54	============================== end of process non-clausal formulas ===
23.23/23.54	
23.23/23.54	============================== PROCESS INITIAL CLAUSES ===============
23.23/23.54	
23.23/23.54	============================== PREDICATE ELIMINATION =================
23.23/23.54	57 lt(A,B) | -gt(B,A) # label(lt_gt) # label(axiom).  [clausify(31)].
23.23/23.54	58 -lt(A,B) | gt(B,A) # label(lt_gt) # label(axiom).  [clausify(31)].
23.23/23.54	59 geq(A,B) | -leq(B,A) # label(leq_geq) # label(axiom).  [clausify(33)].
23.23/23.54	60 -geq(A,B) | leq(B,A) # label(leq_geq) # label(axiom).  [clausify(33)].
23.23/23.54	
23.23/23.54	============================== end predicate elimination =============
23.23/23.54	
23.23/23.54	Auto_denials:  (non-Horn, no changes).
23.23/23.54	
23.23/23.54	Term ordering decisions:
23.23/23.54	Function symbol KB weights:  n0=1. n1=1. n4=1. n2=1. n3=1. n5=1. init=1. tptp_minus_1=1. n135299=1. pv40=1. loopcounter=1. mu_init=1. sigma_init=1. center_init=1. muold_init=1. q_init=1. rho_init=1. rhoold_init=1. sigmaold_init=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. dim=1. minus=1. uniform_int_rnd=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. a_select3=1. tptp_update2=1. sum=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.
23.23/23.54	
23.23/23.54	============================== end of process initial clauses ========
23.23/23.54	
23.23/23.54	============================== CLAUSES FOR SEARCH ====================
23.23/23.54	
23.23/23.54	============================== end of clauses for search =============
23.23/23.54	
23.23/23.54	============================== SEARCH ================================
23.23/23.54	
23.23/23.54	% Starting search at 0.21 seconds.
23.23/23.54	
23.23/23.54	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 411 (0.00 of 1.28 sec).
23.23/23.54	
23.23/23.54	Low Water (keep): wt=173.000, iters=3481
23.23/23.54	
23.23/23.54	Low Water (keep): wt=143.000, iters=3386
23.23/23.54	
23.23/23.54	Low Water (keep): wt=140.000, iters=3736
23.23/23.54	
23.23/23.54	Low Water (keep): wt=119.000, iters=3706
23.23/23.54	
23.23/23.54	Low Water (keep): wt=116.000, iters=3496
23.23/23.54	
23.23/23.54	Low Water (keep): wt=110.000, iters=3641
23.23/23.54	
23.23/23.54	Low Water (keep): wt=89.000, iters=3491
23.23/23.54	
23.23/23.54	Low Water (keep): wt=86.000, iters=3851
23.23/23.54	
23.23/23.54	Low Water (keep): wt=83.000, iters=3568
23.23/23.54	
23.23/23.54	Low Water (keep): wt=64.000, iters=3369
23.23/23.54	
23.23/23.54	Low Water (keep): wt=58.000, iters=3457
23.23/23.54	
23.23/23.54	Low Water (keep): wt=55.000, iters=3448
23.23/23.54	
23.23/23.54	Low Water (keep): wt=49.000, iters=3425
23.23/23.54	
23.23/23.54	Low Water (keep): wt=43.000, iters=3405
23.23/23.54	
23.23/23.54	Low Water (keep): wt=40.000, iters=3388
23.23/23.54	
23.23/23.54	Low Water (displace): id=6502, wt=179.000
23.23/23.54	
23.23/23.54	Low Water (displace): id=10942, wt=22.000
23.23/23.54	
23.23/23.54	Low Water (displace): id=10944, wt=19.000
23.23/23.54	
23.23/23.54	Low Water (displace): id=10978, wt=16.000
23.23/23.54	
23.23/23.54	Low Water (keep): wt=34.000, iters=3380
23.23/23.54	
23.23/23.54	Low Water (displace): id=11414, wt=15.000
23.23/23.54	
23.23/23.54	Low Water (displace): id=13290, wt=13.000
23.23/23.54	
23.23/23.54	Low Water (keep): wt=31.000, iters=3337
23.23/23.54	
23.23/23.54	Low Water (keep): wt=30.000, iters=3343
23.23/23.54	
23.23/23.54	Low Water (keep): wt=29.000, iters=3338
23.23/23.54	
23.23/23.54	Low Water (keep): wt=28.000, iters=3336
23.23/23.54	
23.23/23.54	Low Water (displace): id=16671, wt=12.000
23.23/23.54	
23.23/23.54	Low Water (displace): id=16925, wt=11.000
23.23/23.54	
23.23/23.54	Low Water (displace): id=17042, wt=10.000
23.23/23.54	
23.23/23.54	Low Water (keep): wt=27.000, iters=3333
23.23/23.54	
23.23/23.54	Low Water (keep): wt=26.000, iters=3348
23.23/23.54	
23.23/23.54	Low Water (keep): wt=25.000, iters=3346
23.23/23.54	
23.23/23.54	Low Water (displace): id=19590, wt=6.000
23.23/23.54	
23.23/23.54	Low Water (displace): id=20070, wt=5.000
23.23/23.54	
23.23/23.54	Low Water (keep): wt=24.000, iters=3351
23.23/23.54	
23.23/23.54	Low Water (keep): wt=23.000, iters=3336
23.23/23.54	
23.23/23.54	Low Water (keep): wt=22.000, iters=3344
23.23/23.54	
23.23/23.54	Low Water (keep): wt=21.000, iters=3615
23.23/23.54	
23.23/23.54	Low Water (keep): wt=20.000, iters=3445
23.23/23.54	
23.23/23.54	Low Water (keep): wt=19.000, iters=3335
23.23/23.54	
23.23/23.54	Low Water (keep): wt=18.000, iters=3333
23.23/23.54	
23.23/23.54	Low Water (keep): wt=17.000, iters=3335
23.23/23.54	
23.23/23.54	Low Water (keep): wt=16.000, iters=3334
31.88/32.11	
31.88/32.11	Low Water (keep): wt=15.000, iters=3358
31.88/32.11	
31.88/32.11	Low Water (keep): wt=14.000, iters=3334
31.88/32.11	
31.88/32.11	============================== PROOF =================================
31.88/32.11	% SZS status Theorem
31.88/32.11	% SZS output start Refutation
31.88/32.11	
31.88/32.11	% Proof 1 at 31.09 (+ 0.50) seconds.
31.88/32.11	% Length of proof is 21.
31.88/32.11	% Level of proof is 8.
31.88/32.11	% Maximum clause weight is 14.000.
31.88/32.11	% Given clauses 3157.
31.88/32.11	
31.88/32.11	17 (all X all Y (X != Y & leq(X,Y) -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause).  [assumption].
31.88/32.11	40 (all X all Y (gt(Y,X) <-> leq(X,pred(Y)))) # label(leq_gt_pred) # label(axiom) # label(non_clause).  [assumption].
31.88/32.11	56 -(leq(n0,pv40) & (all D (leq(n0,D) & leq(D,pred(pv40)) -> init = a_select2(mu_init,D))) & (all E (leq(n0,E) & leq(E,pred(pv40)) -> init = a_select2(sigma_init,E))) & (gt(loopcounter,n1) -> (all G (leq(n0,G) & leq(G,n4) -> init = a_select2(muold_init,G)))) & (gt(loopcounter,n1) -> (all I (leq(n0,I) & leq(I,n4) -> init = a_select2(sigmaold_init,I)))) & (gt(loopcounter,n1) -> (all H (leq(H,n4) & leq(n0,H) -> a_select2(rhoold_init,H) = init))) & (all F (leq(F,n4) & leq(n0,F) -> init = a_select3(center_init,F,n0))) & (all C (leq(n0,C) & leq(C,n4) -> init = a_select2(rho_init,C))) & (all A (leq(n0,A) & leq(A,n135299) -> (all B (leq(B,n4) & leq(n0,B) -> a_select3(q_init,A,B) = init)))) & leq(pv40,n4) & a_select2(sigma_init,pv40) = init & init = a_select2(mu_init,pv40) -> (all J (leq(J,pv40) & leq(n0,J) -> init = a_select2(mu_init,J)))) # label(cl5_nebula_init_0011) # label(negated_conjecture) # label(non_clause).  [assumption].
31.88/32.11	93 A = B | -leq(B,A) | gt(A,B) # label(leq_gt2) # label(axiom).  [clausify(17)].
31.88/32.11	281 -gt(A,B) | leq(B,pred(A)) # label(leq_gt_pred) # label(axiom).  [clausify(40)].
31.88/32.11	372 -leq(n0,A) | -leq(A,pred(pv40)) | a_select2(mu_init,A) = init # label(cl5_nebula_init_0011) # label(negated_conjecture).  [clausify(56)].
31.88/32.11	381 a_select2(sigma_init,pv40) = init # label(cl5_nebula_init_0011) # label(negated_conjecture).  [clausify(56)].
31.88/32.11	382 init = a_select2(sigma_init,pv40).  [copy(381),flip(a)].
31.88/32.11	383 a_select2(mu_init,pv40) = init # label(cl5_nebula_init_0011) # label(negated_conjecture).  [clausify(56)].
31.88/32.11	384 a_select2(sigma_init,pv40) = a_select2(mu_init,pv40).  [copy(383),rewrite([382(4)]),flip(a)].
31.88/32.11	385 leq(c1,pv40) # label(cl5_nebula_init_0011) # label(negated_conjecture).  [clausify(56)].
31.88/32.11	386 leq(n0,c1) # label(cl5_nebula_init_0011) # label(negated_conjecture).  [clausify(56)].
31.88/32.11	387 a_select2(mu_init,c1) != init # label(cl5_nebula_init_0011) # label(negated_conjecture).  [clausify(56)].
31.88/32.11	388 a_select2(mu_init,c1) != a_select2(mu_init,pv40).  [copy(387),rewrite([382(4),384(6)])].
31.88/32.11	862 -leq(n0,A) | -leq(A,pred(pv40)) | a_select2(mu_init,pv40) = a_select2(mu_init,A).  [back_rewrite(372),rewrite([382(8),384(10)]),flip(c)].
31.88/32.11	864 a_select2(mu_init,c1) = c_0.  [new_symbol(388)].
31.88/32.11	902 a_select2(mu_init,pv40) != c_0.  [back_rewrite(388),rewrite([864(3)]),flip(a)].
31.88/32.11	3020 c1 = pv40 | gt(pv40,c1).  [resolve(385,a,93,b),flip(a)].
31.88/32.11	26424 c1 = pv40 | leq(c1,pred(pv40)).  [resolve(3020,b,281,a)].
31.88/32.11	45898 c1 = pv40.  [resolve(26424,b,862,b),rewrite([864(12)]),unit_del(b,386),unit_del(c,902)].
31.88/32.11	46318 $F.  [back_rewrite(864),rewrite([45898(2)]),unit_del(a,902)].
31.88/32.11	
31.88/32.11	% SZS output end Refutation
31.88/32.11	============================== end of proof ==========================
31.88/32.11	
31.88/32.11	============================== STATISTICS ============================
31.88/32.11	
31.88/32.11	Given=3157. Generated=928757. Kept=46234. proofs=1.
31.88/32.11	Usable=2611. Sos=7907. Demods=1641. Limbo=420, Disabled=35605. Hints=0.
31.88/32.11	Megabytes=47.70.
31.88/32.11	User_CPU=31.09, System_CPU=0.50, Wall_clock=32.
31.88/32.11	
31.88/32.11	============================== end of statistics =====================
31.88/32.11	
31.88/32.11	============================== end of search =========================
31.88/32.11	
31.88/32.11	THEOREM PROVED
31.88/32.11	% SZS status Theorem
31.88/32.11	
31.88/32.11	Exiting with 1 proof.
31.88/32.11	
31.88/32.11	Process 14688 exit (max_proofs) Sat Jul 14 04:21:43 2018
31.88/32.11	Prover9 interrupted
31.88/32.12	EOF