0.09/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.09/0.10	% Command    : tptp2X_and_run_prover9 %d %s
0.09/0.30	% Computer   : n011.cluster.edu
0.09/0.30	% Model      : x86_64 x86_64
0.09/0.30	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.30	% Memory     : 8042.1875MB
0.09/0.30	% OS         : Linux 3.10.0-693.el7.x86_64
0.09/0.30	% CPULimit   : 960
0.09/0.30	% DateTime   : Thu Jul  2 06:51:46 EDT 2020
0.09/0.30	% CPUTime    : 
0.82/1.14	============================== Prover9 ===============================
0.82/1.14	Prover9 (32) version 2009-11A, November 2009.
0.82/1.14	Process 24428 was started by sandbox2 on n011.cluster.edu,
0.82/1.14	Thu Jul  2 06:51:47 2020
0.82/1.14	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_24274_n011.cluster.edu".
0.82/1.14	============================== end of head ===========================
0.82/1.14	
0.82/1.14	============================== INPUT =================================
0.82/1.14	
0.82/1.14	% Reading from file /tmp/Prover9_24274_n011.cluster.edu
0.82/1.14	
0.82/1.14	set(prolog_style_variables).
0.82/1.14	set(auto2).
0.82/1.14	    % set(auto2) -> set(auto).
0.82/1.14	    % set(auto) -> set(auto_inference).
0.82/1.14	    % set(auto) -> set(auto_setup).
0.82/1.14	    % set(auto_setup) -> set(predicate_elim).
0.82/1.14	    % set(auto_setup) -> assign(eq_defs, unfold).
0.82/1.14	    % set(auto) -> set(auto_limits).
0.82/1.14	    % set(auto_limits) -> assign(max_weight, "100.000").
0.82/1.14	    % set(auto_limits) -> assign(sos_limit, 20000).
0.82/1.14	    % set(auto) -> set(auto_denials).
0.82/1.14	    % set(auto) -> set(auto_process).
0.82/1.14	    % set(auto2) -> assign(new_constants, 1).
0.82/1.14	    % set(auto2) -> assign(fold_denial_max, 3).
0.82/1.14	    % set(auto2) -> assign(max_weight, "200.000").
0.82/1.14	    % set(auto2) -> assign(max_hours, 1).
0.82/1.14	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.82/1.14	    % set(auto2) -> assign(max_seconds, 0).
0.82/1.14	    % set(auto2) -> assign(max_minutes, 5).
0.82/1.14	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.82/1.14	    % set(auto2) -> set(sort_initial_sos).
0.82/1.14	    % set(auto2) -> assign(sos_limit, -1).
0.82/1.14	    % set(auto2) -> assign(lrs_ticks, 3000).
0.82/1.14	    % set(auto2) -> assign(max_megs, 400).
0.82/1.14	    % set(auto2) -> assign(stats, some).
0.82/1.14	    % set(auto2) -> clear(echo_input).
0.82/1.14	    % set(auto2) -> set(quiet).
0.82/1.14	    % set(auto2) -> clear(print_initial_clauses).
0.82/1.14	    % set(auto2) -> clear(print_given).
0.82/1.14	assign(lrs_ticks,-1).
0.82/1.14	assign(sos_limit,10000).
0.82/1.14	assign(order,kbo).
0.82/1.14	set(lex_order_vars).
0.82/1.14	clear(print_given).
0.82/1.14	
0.82/1.14	% formulas(sos).  % not echoed (92 formulas)
0.82/1.14	
0.82/1.14	============================== end of input ==========================
0.82/1.14	
0.82/1.14	% From the command line: assign(max_seconds, 960).
0.82/1.14	
0.82/1.14	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.82/1.14	
0.82/1.14	% Formulas that are not ordinary clauses:
0.82/1.14	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.82/1.14	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.82/1.14	3 (all X all Y (leq(X,Y) <-> gt(succ(Y),X))) # label(leq_succ_gt_equiv) # label(axiom) # label(non_clause).  [assumption].
0.82/1.14	4 (all X all Y (leq(X,Y) & X != Y -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause).  [assumption].
0.82/1.14	5 (all X succ(succ(succ(succ(succ(X))))) = plus(X,n5)) # label(succ_plus_5_r) # label(axiom) # label(non_clause).  [assumption].
0.82/1.14	6 (all X minus(X,n1) = pred(X)) # label(pred_minus_1) # label(axiom) # label(non_clause).  [assumption].
0.82/1.14	7 (all X succ(succ(succ(succ(X)))) = plus(X,n4)) # label(succ_plus_4_r) # label(axiom) # label(non_clause).  [assumption].
0.82/1.14	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.82/1.14	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.82/1.14	10 (all X X = pred(succ(X))) # label(pred_succ) # label(axiom) # label(non_clause).  [assumption].
0.82/1.14	11 (all X succ(succ(succ(succ(X)))) = plus(n4,X)) # label(succ_plus_4_l) # label(axiom) # label(non_clause).  [assumption].
0.82/1.14	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.82/1.14	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.82/1.15	14 (all X succ(succ(succ(X))) = plus(n3,X)) # label(succ_plus_3_l) # label(axiom) # label(non_clause).  [assumption].
0.82/1.15	15 (all X plus(X,n1) = succ(X)) # label(succ_plus_1_r) # label(axiom) # label(non_clause).  [assumption].
0.82/1.15	16 (all X succ(X) = plus(n1,X)) # label(succ_plus_1_l) # label(axiom) # label(non_clause).  [assumption].
0.82/1.15	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.82/1.15	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.82/1.15	19 (all X -gt(X,X)) # label(irreflexivity_gt) # label(axiom) # label(non_clause).  [assumption].
0.82/1.15	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.82/1.15	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.82/1.15	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.82/1.15	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.82/1.15	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.82/1.15	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.82/1.15	26 (all X plus(n5,X) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_l) # label(axiom) # label(non_clause).  [assumption].
0.82/1.15	27 (all X succ(succ(X)) = plus(n2,X)) # label(succ_plus_2_l) # label(axiom) # label(non_clause).  [assumption].
0.82/1.15	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.82/1.15	29 (all X succ(succ(succ(X))) = plus(X,n3)) # label(succ_plus_3_r) # label(axiom) # label(non_clause).  [assumption].
0.82/1.15	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.82/1.15	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.82/1.15	32 (all X all Y (leq(succ(X),Y) -> gt(Y,X))) # label(leq_succ_gt) # label(axiom) # label(non_clause).  [assumption].
0.82/1.15	33 (all X all Y (gt(Y,X) -> leq(X,Y))) # label(leq_gt1) # label(axiom) # label(non_clause).  [assumption].
0.82/1.15	34 (all Body n0 = sum(n0,tptp_minus_1,Body)) # label(sum_plus_base) # label(axiom) # label(non_clause).  [assumption].
0.82/1.15	35 (all X all Y (leq(X,Y) <-> leq(succ(X),succ(Y)))) # label(leq_succ_succ) # label(axiom) # label(non_clause).  [assumption].
0.82/1.15	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.82/1.15	37 (all X all Y (geq(X,Y) <-> leq(Y,X))) # label(leq_geq) # label(axiom) # label(non_clause).  [assumption].
0.82/1.15	38 (all X all Y (gt(Y,X) <-> leq(X,pred(Y)))) # label(leq_gt_pred) # label(axiom) # label(non_clause).  [assumption].
0.82/1.15	39 (all X all Y (lt(X,Y) <-> gt(Y,X))) # label(lt_gt) # label(axiom) # label(non_clause).  [assumption].
0.82/1.15	40 (all X leq(X,X)) # label(reflexivity_leq) # label(axiom) # label(non_clause).  [assumption].
0.82/1.15	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.82/1.15	42 (all X gt(succ(X),X)) # label(gt_succ) # label(axiom) # label(non_clause).  [assumption].
0.82/1.15	43 (all X all Y (gt(X,Y) | X = Y | gt(Y,X))) # label(totality) # label(axiom) # label(non_clause).  [assumption].
0.82/1.15	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.82/1.15	45 (all X succ(pred(X)) = X) # label(succ_pred) # label(axiom) # label(non_clause).  [assumption].
0.82/1.15	46 (all X succ(succ(X)) = plus(X,n2)) # label(succ_plus_2_r) # label(axiom) # label(non_clause).  [assumption].
0.82/1.15	47 (all X all Y (leq(X,Y) -> leq(X,succ(Y)))) # label(leq_succ) # label(axiom) # label(non_clause).  [assumption].
0.82/1.15	48 (all X all Y (leq(minus(X,Y),X) -> leq(n0,Y))) # label(leq_minus) # label(axiom) # label(non_clause).  [assumption].
0.82/1.15	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.82/1.15	50 (all X (leq(n0,X) & leq(X,n2) -> n0 = X | X = n2 | n1 = X)) # label(finite_domain_2) # label(axiom) # label(non_clause).  [assumption].
0.82/1.15	51 (all X (leq(X,n5) & leq(n0,X) -> X = n0 | X = n1 | X = n4 | n5 = X | X = n3 | n2 = X)) # label(finite_domain_5) # label(axiom) # label(non_clause).  [assumption].
0.82/1.15	52 (all X (leq(X,n1) & leq(n0,X) -> X = n0 | X = n1)) # label(finite_domain_1) # label(axiom) # label(non_clause).  [assumption].
0.82/1.15	53 (all X (leq(n0,X) & leq(X,n0) -> n0 = X)) # label(finite_domain_0) # label(axiom) # label(non_clause).  [assumption].
0.82/1.15	54 (all X (leq(n0,X) & leq(X,n4) -> X = n2 | X = n3 | n4 = X | n1 = X | X = n0)) # label(finite_domain_4) # label(axiom) # label(non_clause).  [assumption].
0.82/1.15	55 (all X (leq(X,n3) & leq(n0,X) -> X = n0 | X = n2 | n3 = X | n1 = X)) # label(finite_domain_3) # label(axiom) # label(non_clause).  [assumption].
0.82/1.15	56 -(leq(n0,pv40) & (all D (leq(n0,D) & leq(D,pred(pv40)) -> a_select2(mu_init,D) = init)) & (all E (leq(E,pred(pv40)) & leq(n0,E) -> a_select2(sigma_init,E) = init)) & (all F (leq(F,n4) & leq(n0,F) -> init = a_select3(center_init,F,n0))) & (gt(loopcounter,n1) -> (all G (leq(G,n4) & leq(n0,G) -> init = a_select2(muold_init,G)))) & (gt(loopcounter,n1) -> (all H (leq(H,n4) & leq(n0,H) -> init = a_select2(rhoold_init,H)))) & (gt(loopcounter,n1) -> (all I (leq(I,n4) & leq(n0,I) -> init = a_select2(sigmaold_init,I)))) & (all C (leq(C,n4) & leq(n0,C) -> a_select2(rho_init,C) = init)) & (all A (leq(n0,A) & leq(A,n135299) -> (all B (leq(n0,B) & leq(B,n4) -> init = a_select3(q_init,A,B))))) & leq(pv40,n4) & a_select2(sigma_init,pv40) = init & init = a_select2(mu_init,pv40) -> (all J (leq(n0,J) & leq(J,pv40) -> init = a_select2(mu_init,J)))) # label(cl5_nebula_init_0011) # label(negated_conjecture) # label(non_clause).  [assumption].
45.54/45.87	
45.54/45.87	============================== end of process non-clausal formulas ===
45.54/45.87	
45.54/45.87	============================== PROCESS INITIAL CLAUSES ===============
45.54/45.87	
45.54/45.87	============================== PREDICATE ELIMINATION =================
45.54/45.87	57 geq(A,B) | -leq(B,A) # label(leq_geq) # label(axiom).  [clausify(37)].
45.54/45.87	58 -geq(A,B) | leq(B,A) # label(leq_geq) # label(axiom).  [clausify(37)].
45.54/45.87	59 lt(A,B) | -gt(B,A) # label(lt_gt) # label(axiom).  [clausify(39)].
45.54/45.87	60 -lt(A,B) | gt(B,A) # label(lt_gt) # label(axiom).  [clausify(39)].
45.54/45.87	
45.54/45.87	============================== end predicate elimination =============
45.54/45.87	
45.54/45.87	Auto_denials:  (non-Horn, no changes).
45.54/45.87	
45.54/45.87	Term ordering decisions:
45.54/45.87	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. f4=1. f5=1. f6=1. f7=1. f22=1. f23=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. 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.
45.54/45.87	
45.54/45.87	============================== end of process initial clauses ========
45.54/45.87	
45.54/45.87	============================== CLAUSES FOR SEARCH ====================
45.54/45.87	
45.54/45.87	============================== end of clauses for search =============
45.54/45.87	
45.54/45.87	============================== SEARCH ================================
45.54/45.87	
45.54/45.87	% Starting search at 0.24 seconds.
45.54/45.87	
45.54/45.87	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 662 (0.00 of 1.34 sec).
45.54/45.87	
45.54/45.87	Low Water (keep): wt=173.000, iters=3448
45.54/45.87	
45.54/45.87	Low Water (keep): wt=143.000, iters=3340
45.54/45.87	
45.54/45.87	Low Water (keep): wt=116.000, iters=3360
45.54/45.87	
45.54/45.87	Low Water (keep): wt=113.000, iters=3463
45.54/45.87	
45.54/45.87	Low Water (keep): wt=110.000, iters=3343
45.54/45.87	
45.54/45.87	Low Water (keep): wt=86.000, iters=3372
45.54/45.87	
45.54/45.87	Low Water (keep): wt=64.000, iters=3391
45.54/45.87	
45.54/45.87	Low Water (keep): wt=53.000, iters=3346
45.54/45.87	
45.54/45.87	Low Water (keep): wt=49.000, iters=3444
45.54/45.87	
45.54/45.87	Low Water (keep): wt=43.000, iters=3416
45.54/45.87	
45.54/45.87	Low Water (keep): wt=40.000, iters=3530
45.54/45.87	
45.54/45.87	Low Water (keep): wt=34.000, iters=3372
45.54/45.87	
45.54/45.87	Low Water (displace): id=5665, wt=179.000
45.54/45.87	
45.54/45.87	Low Water (displace): id=10950, wt=22.000
45.54/45.87	
45.54/45.87	Low Water (displace): id=11089, wt=19.000
45.54/45.87	
45.54/45.87	Low Water (keep): wt=32.000, iters=3355
45.54/45.87	
45.54/45.87	Low Water (displace): id=12695, wt=17.000
45.54/45.87	
45.54/45.87	Low Water (keep): wt=31.000, iters=3336
45.54/45.87	
45.54/45.87	Low Water (displace): id=12724, wt=16.000
45.54/45.87	
45.54/45.87	Low Water (keep): wt=30.000, iters=3336
45.54/45.87	
45.54/45.87	Low Water (keep): wt=29.000, iters=3343
45.54/45.87	
45.54/45.87	Low Water (keep): wt=28.000, iters=3339
45.54/45.87	
45.54/45.87	Low Water (keep): wt=27.000, iters=3396
45.54/45.87	
45.54/45.87	Low Water (keep): wt=25.000, iters=3333
45.54/45.87	
45.54/45.87	Low Water (displace): id=18785, wt=14.000
45.54/45.87	
45.54/45.87	Low Water (displace): id=18813, wt=8.000
45.54/45.87	
45.54/45.87	Low Water (displace): id=18819, wt=6.000
45.54/45.87	
45.54/45.87	Low Water (keep): wt=24.000, iters=3340
45.54/45.87	
45.54/45.87	Low Water (keep): wt=23.000, iters=3349
45.54/45.87	
45.54/45.87	Low Water (keep): wt=22.000, iters=3338
45.54/45.87	
45.54/45.87	Low Water (keep): wt=21.000, iters=3361
45.54/45.87	
45.54/45.87	Low Water (keep): wt=20.000, iters=3339
45.54/45.87	
45.54/45.87	Low Water (keep): wt=19.000, iters=3375
45.54/45.87	
45.54/45.87	Low Water (keep): wt=18.000, iters=3338
45.54/45.87	
45.54/45.87	Low Water (keep): wt=17.000, iters=3386
45.54/45.87	
45.54/45.87	Low Water (keep): wt=16.000, iters=3348
45.54/45.87	
45.54/45.87	Low Water (keep): wt=15.000, iters=3337
45.54/45.87	
45.54/45.87	Low Water (keep): wt=14.000, iters=3374
45.54/45.87	
45.54/45.87	============================== PROOF =================================
45.54/45.87	% SZS status Theorem
45.54/45.87	% SZS output start Refutation
45.54/45.87	
45.54/45.87	% Proof 1 at 43.59 (+ 1.13) seconds.
45.54/45.87	% Length of proof is 21.
45.54/45.87	% Level of proof is 8.
45.54/45.87	% Maximum clause weight is 14.000.
45.54/45.87	% Given clauses 3294.
45.54/45.87	
45.54/45.87	4 (all X all Y (leq(X,Y) & X != Y -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause).  [assumption].
45.54/45.87	38 (all X all Y (gt(Y,X) <-> leq(X,pred(Y)))) # label(leq_gt_pred) # label(axiom) # label(non_clause).  [assumption].
45.54/45.87	56 -(leq(n0,pv40) & (all D (leq(n0,D) & leq(D,pred(pv40)) -> a_select2(mu_init,D) = init)) & (all E (leq(E,pred(pv40)) & leq(n0,E) -> a_select2(sigma_init,E) = init)) & (all F (leq(F,n4) & leq(n0,F) -> init = a_select3(center_init,F,n0))) & (gt(loopcounter,n1) -> (all G (leq(G,n4) & leq(n0,G) -> init = a_select2(muold_init,G)))) & (gt(loopcounter,n1) -> (all H (leq(H,n4) & leq(n0,H) -> init = a_select2(rhoold_init,H)))) & (gt(loopcounter,n1) -> (all I (leq(I,n4) & leq(n0,I) -> init = a_select2(sigmaold_init,I)))) & (all C (leq(C,n4) & leq(n0,C) -> a_select2(rho_init,C) = init)) & (all A (leq(n0,A) & leq(A,n135299) -> (all B (leq(n0,B) & leq(B,n4) -> init = a_select3(q_init,A,B))))) & leq(pv40,n4) & a_select2(sigma_init,pv40) = init & init = a_select2(mu_init,pv40) -> (all J (leq(n0,J) & leq(J,pv40) -> init = a_select2(mu_init,J)))) # label(cl5_nebula_init_0011) # label(negated_conjecture) # label(non_clause).  [assumption].
45.54/45.87	65 -leq(A,B) | B = A | gt(B,A) # label(leq_gt2) # label(axiom).  [clausify(4)].
45.54/45.87	306 -gt(A,B) | leq(B,pred(A)) # label(leq_gt_pred) # label(axiom).  [clausify(38)].
45.54/45.87	369 -leq(n0,A) | -leq(A,pred(pv40)) | a_select2(mu_init,A) = init # label(cl5_nebula_init_0011) # label(negated_conjecture).  [clausify(56)].
45.54/45.87	378 a_select2(sigma_init,pv40) = init # label(cl5_nebula_init_0011) # label(negated_conjecture).  [clausify(56)].
45.54/45.87	379 init = a_select2(sigma_init,pv40).  [copy(378),flip(a)].
45.54/45.87	380 a_select2(mu_init,pv40) = init # label(cl5_nebula_init_0011) # label(negated_conjecture).  [clausify(56)].
45.54/45.87	381 a_select2(sigma_init,pv40) = a_select2(mu_init,pv40).  [copy(380),rewrite([379(4)]),flip(a)].
45.54/45.87	382 leq(n0,c1) # label(cl5_nebula_init_0011) # label(negated_conjecture).  [clausify(56)].
45.54/45.87	383 leq(c1,pv40) # label(cl5_nebula_init_0011) # label(negated_conjecture).  [clausify(56)].
45.54/45.87	384 a_select2(mu_init,c1) != init # label(cl5_nebula_init_0011) # label(negated_conjecture).  [clausify(56)].
45.54/45.87	385 a_select2(mu_init,c1) != a_select2(mu_init,pv40).  [copy(384),rewrite([379(4),381(6)])].
45.54/45.87	865 -leq(n0,A) | -leq(A,pred(pv40)) | a_select2(mu_init,pv40) = a_select2(mu_init,A).  [back_rewrite(369),rewrite([379(8),381(10)]),flip(c)].
45.54/45.87	867 a_select2(mu_init,c1) = c_0.  [new_symbol(385)].
45.54/45.87	908 a_select2(mu_init,pv40) != c_0.  [back_rewrite(385),rewrite([867(3)]),flip(a)].
45.54/45.87	3773 c1 = pv40 | gt(pv40,c1).  [resolve(383,a,65,a),flip(a)].
45.54/45.87	28069 c1 = pv40 | leq(c1,pred(pv40)).  [resolve(3773,b,306,a)].
45.54/45.87	46499 c1 = pv40.  [resolve(28069,b,865,b),rewrite([867(12)]),unit_del(b,382),unit_del(c,908)].
45.54/45.87	46942 $F.  [back_rewrite(867),rewrite([46499(2)]),unit_del(a,908)].
45.54/45.87	
45.54/45.87	% SZS output end Refutation
45.54/45.87	============================== end of proof ==========================
45.54/45.87	
45.54/45.87	============================== STATISTICS ============================
45.54/45.87	
45.54/45.87	Given=3294. Generated=1063384. Kept=46861. proofs=1.
45.54/45.87	Usable=2682. Sos=7928. Demods=1430. Limbo=443, Disabled=36117. Hints=0.
45.54/45.87	Megabytes=47.70.
45.54/45.87	User_CPU=43.60, System_CPU=1.13, Wall_clock=45.
45.54/45.87	
45.54/45.87	============================== end of statistics =====================
45.54/45.87	
45.54/45.87	============================== end of search =========================
45.54/45.87	
45.54/45.87	THEOREM PROVED
45.54/45.87	% SZS status Theorem
45.54/45.87	
45.54/45.87	Exiting with 1 proof.
45.54/45.87	
45.54/45.87	Process 24428 exit (max_proofs) Thu Jul  2 06:52:32 2020
45.54/45.87	Prover9 interrupted
45.54/45.88	EOF