0.11/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.12	% Command  : tptp2X_and_run_prover9 %d %s
0.13/0.33	% Computer : n010.cluster.edu
0.13/0.33	% Model    : x86_64 x86_64
0.13/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.33	% Memory   : 8042.1875MB
0.13/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.33	% CPULimit : 1440
0.13/0.33	% WCLimit  : 180
0.13/0.33	% DateTime : Mon Jul  3 05:06:09 EDT 2023
0.13/0.33	% CPUTime  : 
0.44/1.04	============================== Prover9 ===============================
0.44/1.04	Prover9 (32) version 2009-11A, November 2009.
0.44/1.04	Process 11639 was started by sandbox on n010.cluster.edu,
0.44/1.04	Mon Jul  3 05:06:10 2023
0.44/1.04	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_11486_n010.cluster.edu".
0.44/1.04	============================== end of head ===========================
0.44/1.04	
0.44/1.04	============================== INPUT =================================
0.44/1.04	
0.44/1.04	% Reading from file /tmp/Prover9_11486_n010.cluster.edu
0.44/1.04	
0.44/1.04	set(prolog_style_variables).
0.44/1.04	set(auto2).
0.44/1.04	    % set(auto2) -> set(auto).
0.44/1.04	    % set(auto) -> set(auto_inference).
0.44/1.04	    % set(auto) -> set(auto_setup).
0.44/1.04	    % set(auto_setup) -> set(predicate_elim).
0.44/1.04	    % set(auto_setup) -> assign(eq_defs, unfold).
0.44/1.04	    % set(auto) -> set(auto_limits).
0.44/1.04	    % set(auto_limits) -> assign(max_weight, "100.000").
0.44/1.04	    % set(auto_limits) -> assign(sos_limit, 20000).
0.44/1.04	    % set(auto) -> set(auto_denials).
0.44/1.04	    % set(auto) -> set(auto_process).
0.44/1.04	    % set(auto2) -> assign(new_constants, 1).
0.44/1.04	    % set(auto2) -> assign(fold_denial_max, 3).
0.44/1.04	    % set(auto2) -> assign(max_weight, "200.000").
0.44/1.04	    % set(auto2) -> assign(max_hours, 1).
0.44/1.04	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.44/1.04	    % set(auto2) -> assign(max_seconds, 0).
0.44/1.04	    % set(auto2) -> assign(max_minutes, 5).
0.44/1.04	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.44/1.04	    % set(auto2) -> set(sort_initial_sos).
0.44/1.04	    % set(auto2) -> assign(sos_limit, -1).
0.44/1.04	    % set(auto2) -> assign(lrs_ticks, 3000).
0.44/1.04	    % set(auto2) -> assign(max_megs, 400).
0.44/1.04	    % set(auto2) -> assign(stats, some).
0.44/1.04	    % set(auto2) -> clear(echo_input).
0.44/1.04	    % set(auto2) -> set(quiet).
0.44/1.04	    % set(auto2) -> clear(print_initial_clauses).
0.44/1.04	    % set(auto2) -> clear(print_given).
0.44/1.04	assign(lrs_ticks,-1).
0.44/1.04	assign(sos_limit,10000).
0.44/1.04	assign(order,kbo).
0.44/1.04	set(lex_order_vars).
0.44/1.04	clear(print_given).
0.44/1.04	
0.44/1.04	% formulas(sos).  % not echoed (85 formulas)
0.44/1.04	
0.44/1.04	============================== end of input ==========================
0.44/1.04	
0.44/1.04	% From the command line: assign(max_seconds, 1440).
0.44/1.04	
0.44/1.04	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.44/1.04	
0.44/1.04	% Formulas that are not ordinary clauses:
0.44/1.04	1 (all A all N ((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(n0,J) & leq(J,N) & leq(n0,I) -> a_select3(inv(A),I,J) = a_select3(inv(A),J,I))))) # label(matrix_symm_inv) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	2 (all X plus(n5,X) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_l) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	3 (all X succ(succ(succ(X))) = plus(n3,X)) # label(succ_plus_3_l) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	4 (all I all J all U all V all X all VAL ((all I0 all J0 (leq(J0,V) & leq(I0,U) & leq(n0,J0) & leq(n0,I0) -> a_select3(X,I0,J0) = VAL)) & leq(n0,I) & leq(I,U) & leq(J,V) & leq(n0,J) -> a_select3(tptp_update3(X,U,V,VAL),I,J) = VAL)) # label(sel3_update_3) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	5 (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.44/1.04	6 (all X all Y (leq(minus(X,Y),X) -> leq(n0,Y))) # label(leq_minus) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	7 (all X succ(succ(succ(succ(X)))) = plus(X,n4)) # label(succ_plus_4_r) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	8 (all X all Y (gt(Y,X) <-> lt(X,Y))) # label(lt_gt) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	9 (all X pred(succ(X)) = X) # label(pred_succ) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	10 (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.44/1.04	11 (all X succ(succ(X)) = plus(n2,X)) # label(succ_plus_2_l) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	12 (all Body sum(n0,tptp_minus_1,Body) = n0) # label(sum_plus_base) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	13 (all I all J all U all V all X all VAL all VAL2 (U != I & 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.44/1.04	14 (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,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(A,I,J) = a_select3(A,J,I))) -> (all I all J (leq(I,N) & leq(n0,J) & leq(J,N) & leq(n0,I) -> a_select3(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.44/1.04	15 (all A all B all N all M ((all I all J (leq(J,M) & leq(n0,J) & leq(I,M) & leq(n0,I) -> 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_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.44/1.04	16 (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 all K all VAL (leq(n0,I) & leq(n0,K) & leq(K,N) & leq(J,N) & leq(n0,J) & 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.44/1.04	17 (all I all L1 all U1 all J all L2 all U2 all Val (leq(L1,I) & leq(J,U2) & leq(L2,J) & leq(I,U1) -> 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.44/1.04	18 (all X succ(X) = plus(X,n1)) # label(succ_plus_1_r) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	19 (all X leq(X,X)) # label(reflexivity_leq) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	20 (all I all L all U all Val (leq(L,I) & leq(I,U) -> a_select2(tptp_const_array1(dim(L,U),Val),I) = Val)) # label(const_array1_select) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	21 (all X all Y (gt(succ(Y),X) <-> leq(X,Y))) # label(leq_succ_gt_equiv) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	22 (all X all Y (geq(X,Y) <-> leq(Y,X))) # label(leq_geq) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	23 (all X all Y (gt(Y,X) <-> leq(X,pred(Y)))) # label(leq_gt_pred) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	24 (all X all Y (gt(Y,X) | Y = X | gt(X,Y))) # label(totality) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	25 (all A all B all N ((all I all J (leq(n0,I) & leq(J,N) & leq(n0,J) & 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(A,J,I) = a_select3(A,I,J))) -> (all I all J (leq(J,N) & leq(n0,J) & leq(I,N) & leq(n0,I) -> a_select3(tptp_madd(A,B),I,J) = a_select3(tptp_madd(A,B),J,I))))) # label(matrix_symm_add) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	26 (all A all B all N ((all I all J (leq(n0,I) & leq(I,N) & leq(J,N) & leq(n0,J) -> 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.44/1.04	27 (all X all Y (gt(Y,X) -> leq(X,Y))) # label(leq_gt1) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	28 (all I all U all X all VAL all VAL2 (I != U & VAL = a_select2(X,U) -> a_select2(tptp_update2(X,I,VAL2),U) = VAL)) # label(sel2_update_2) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	29 (all X pred(X) = minus(X,n1)) # label(pred_minus_1) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	30 (all X plus(n4,X) = succ(succ(succ(succ(X))))) # label(succ_plus_4_l) # label(axiom) # label(non_clause).  [assumption].
0.44/1.04	31 (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.44/1.04	32 (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.44/1.04	33 (all X succ(succ(succ(X))) = plus(X,n3)) # label(succ_plus_3_r) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	34 (all X succ(X) = plus(n1,X)) # label(succ_plus_1_l) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	35 (all X all Y (leq(X,Y) -> leq(X,succ(Y)))) # label(leq_succ) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	36 (all X gt(succ(X),X)) # label(gt_succ) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	37 (all I all U all X all VAL (leq(n0,I) & leq(I,U) & (all I0 (leq(n0,I0) & leq(I0,U) -> a_select2(X,I0) = VAL)) -> a_select2(tptp_update2(X,U,VAL),I) = VAL)) # label(sel2_update_3) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	38 (all X X = succ(pred(X))) # label(succ_pred) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	39 (all X all Y (leq(succ(X),Y) -> gt(Y,X))) # label(leq_succ_gt) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	40 (all A all B all C all D all E all F all N all M ((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,I) & leq(I,N) & leq(n0,J) & leq(J,N) -> a_select3(F,I,J) = a_select3(F,J,I))) & (all I all J (leq(I,M) & leq(n0,J) & leq(J,M) & leq(n0,I) -> a_select3(D,J,I) = a_select3(D,I,J))) -> (all I all J (leq(I,N) & leq(n0,J) & leq(J,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)))),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.44/1.05	41 (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.44/1.05	42 (all Body sum(n0,tptp_minus_1,Body) = tptp_float_0_0) # label(sum_plus_base_float) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	43 (all X all Y (leq(succ(X),succ(Y)) <-> leq(X,Y))) # label(leq_succ_succ) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	44 (all X all Y (X != Y & leq(X,Y) -> gt(Y,X))) # label(leq_gt2) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	45 (all X -gt(X,X)) # label(irreflexivity_gt) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	46 (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.44/1.05	47 (all X plus(X,n2) = succ(succ(X))) # label(succ_plus_2_r) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	48 (all X plus(X,n5) = succ(succ(succ(succ(succ(X)))))) # label(succ_plus_5_r) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	49 (all A 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(I,N) & leq(J,N) & leq(n0,J) & leq(n0,I) -> a_select3(trans(A),J,I) = a_select3(trans(A),I,J))))) # label(matrix_symm_trans) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	50 (all X (leq(n0,X) & leq(X,n3) -> X = n1 | n2 = X | X = n3 | n0 = X)) # label(finite_domain_3) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	51 (all X (leq(n0,X) & leq(X,n4) -> n0 = X | n4 = X | X = n3 | n2 = X | X = n1)) # label(finite_domain_4) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	52 (all X (leq(n0,X) & leq(X,n1) -> X = n1 | X = n0)) # label(finite_domain_1) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	53 (all X (leq(n0,X) & leq(X,n0) -> n0 = X)) # label(finite_domain_0) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	54 (all X (leq(n0,X) & leq(X,n2) -> X = n1 | X = n2 | n0 = X)) # label(finite_domain_2) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	55 (all X (leq(X,n5) & leq(n0,X) -> n3 = X | X = n5 | n4 = X | X = n2 | X = n1 | X = n0)) # label(finite_domain_5) # label(axiom) # label(non_clause).  [assumption].
0.44/1.05	56 -(pv88 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))) & sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87))))) = pv86 -> sum(n0,minus(n0,n1),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91))))) = n0 & sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87))))) = pv86 & sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))) = pv88) # label(cl5_nebula_norm_0022) # label(negated_conjecture) # label(non_clause).  [assumption].
0.97/1.31	
0.97/1.31	============================== end of process non-clausal formulas ===
0.97/1.31	
0.97/1.31	============================== PROCESS INITIAL CLAUSES ===============
0.97/1.31	
0.97/1.31	============================== PREDICATE ELIMINATION =================
0.97/1.31	57 gt(A,B) | -lt(B,A) # label(lt_gt) # label(axiom).  [clausify(8)].
0.97/1.31	58 -gt(A,B) | lt(B,A) # label(lt_gt) # label(axiom).  [clausify(8)].
0.97/1.31	59 geq(A,B) | -leq(B,A) # label(leq_geq) # label(axiom).  [clausify(22)].
0.97/1.31	60 -geq(A,B) | leq(B,A) # label(leq_geq) # label(axiom).  [clausify(22)].
0.97/1.31	
0.97/1.31	============================== end predicate elimination =============
0.97/1.31	
0.97/1.31	Auto_denials:  (non-Horn, no changes).
0.97/1.31	
0.97/1.31	Term ordering decisions:
0.97/1.31	Function symbol KB weights:  n0=1. n1=1. n2=1. n3=1. n5=1. n4=1. tptp_minus_1=1. pv87=1. pv89=1. mu=1. muold=1. rho=1. rhoold=1. pv86=1. pv88=1. tptp_float_0_0=1. def=1. pv91=1. sigma=1. sigmaold=1. use=1. tptp_mmul=1. tptp_madd=1. tptp_msub=1. a_select2=1. plus=1. minus=1. dim=1. divide=1. uniform_int_rnd=1. tptp_const_array1=1. f1=1. f2=1. f11=1. f12=1. f26=1. f27=1. trans=1. succ=1. inv=1. abs=1. pred=1. a_select3=1. tptp_update2=1. sum=1. tptp_const_array2=1. f5=1. f6=1. f7=1. f8=1. f13=1. f14=1. f15=1. f16=1. f17=1. f18=1. tptp_update3=1. f9=1. f10=1. f19=1. f3=1. f4=1. f20=1. f21=1. f22=1. f23=1. f24=1. f25=1.
0.97/1.31	
0.97/1.31	============================== end of process initial clauses ========
0.97/1.31	
0.97/1.31	============================== CLAUSES FOR SEARCH ====================
0.97/1.31	
0.97/1.31	============================== end of clauses for search =============
0.97/1.31	
0.97/1.31	============================== SEARCH ================================
0.97/1.31	
0.97/1.31	% Starting search at 0.27 seconds.
0.97/1.31	
0.97/1.31	============================== PROOF =================================
0.97/1.31	% SZS status Theorem
0.97/1.31	% SZS output start Refutation
0.97/1.31	
0.97/1.31	% Proof 1 at 0.27 (+ 0.00) seconds.
0.97/1.31	% Length of proof is 17.
0.97/1.31	% Level of proof is 5.
0.97/1.31	% Maximum clause weight is 24.000.
0.97/1.31	% Given clauses 16.
0.97/1.31	
0.97/1.31	9 (all X pred(succ(X)) = X) # label(pred_succ) # label(axiom) # label(non_clause).  [assumption].
0.97/1.31	12 (all Body sum(n0,tptp_minus_1,Body) = n0) # label(sum_plus_base) # label(axiom) # label(non_clause).  [assumption].
0.97/1.31	29 (all X pred(X) = minus(X,n1)) # label(pred_minus_1) # label(axiom) # label(non_clause).  [assumption].
0.97/1.31	56 -(pv88 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))) & sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87))))) = pv86 -> sum(n0,minus(n0,n1),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91))))) = n0 & sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87))))) = pv86 & sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))) = pv88) # label(cl5_nebula_norm_0022) # label(negated_conjecture) # label(non_clause).  [assumption].
0.97/1.31	79 pred(succ(A)) = A # label(pred_succ) # label(axiom).  [clausify(9)].
0.97/1.31	83 sum(n0,tptp_minus_1,A) = n0 # label(sum_plus_base) # label(axiom).  [clausify(12)].
0.97/1.31	84 succ(tptp_minus_1) = n0 # label(succ_tptp_minus_1) # label(axiom).  [assumption].
0.97/1.31	163 pred(A) = minus(A,n1) # label(pred_minus_1) # label(axiom).  [clausify(29)].
0.97/1.31	164 minus(A,n1) = pred(A).  [copy(163),flip(a)].
0.97/1.31	364 sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))) = pv88 # label(cl5_nebula_norm_0022) # label(negated_conjecture).  [clausify(56)].
0.97/1.31	365 sum(n0,pred(n5),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))) = pv88.  [copy(364),rewrite([164(4)])].
0.97/1.31	366 sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87))))) = pv86 # label(cl5_nebula_norm_0022) # label(negated_conjecture).  [clausify(56)].
0.97/1.31	367 sum(n0,pred(n5),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87))))) = pv86.  [copy(366),rewrite([164(4)])].
0.97/1.31	368 sum(n0,minus(n0,n1),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91))))) != n0 | sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87))))) != pv86 | sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))) != pv88 # label(cl5_nebula_norm_0022) # label(negated_conjecture).  [clausify(56)].
0.97/1.31	369 sum(n0,pred(n0),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91))))) != n0.  [copy(368),rewrite([164(4),164(28),367(46),164(31),365(49)]),xx(b),xx(c)].
0.97/1.31	877 pred(n0) = tptp_minus_1.  [para(84(a,1),79(a,1,1))].
0.97/1.31	878 $F.  [back_rewrite(369),rewrite([877(3),83(21)]),xx(a)].
0.97/1.31	
0.97/1.31	% SZS output end Refutation
0.97/1.31	============================== end of proof ==========================
0.97/1.31	
0.97/1.31	============================== STATISTICS ============================
0.97/1.31	
0.97/1.31	Given=16. Generated=2000. Kept=794. proofs=1.
0.97/1.31	Usable=16. Sos=768. Demods=28. Limbo=1, Disabled=299. Hints=0.
0.97/1.31	Megabytes=2.86.
0.97/1.31	User_CPU=0.27, System_CPU=0.00, Wall_clock=0.
0.97/1.31	
0.97/1.31	============================== end of statistics =====================
0.97/1.31	
0.97/1.31	============================== end of search =========================
0.97/1.31	
0.97/1.31	THEOREM PROVED
0.97/1.31	% SZS status Theorem
0.97/1.31	
0.97/1.31	Exiting with 1 proof.
0.97/1.31	
0.97/1.31	Process 11639 exit (max_proofs) Mon Jul  3 05:06:10 2023
0.97/1.31	Prover9 interrupted
0.97/1.31	EOF