0.03/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.13	% Command  : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer : n019.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit : 960
0.13/0.34	% WCLimit  : 120
0.13/0.34	% DateTime : Tue Aug  9 06:38:36 EDT 2022
0.13/0.34	% CPUTime  : 
0.83/1.12	============================== Prover9 ===============================
0.83/1.12	Prover9 (32) version 2009-11A, November 2009.
0.83/1.12	Process 26932 was started by sandbox on n019.cluster.edu,
0.83/1.12	Tue Aug  9 06:38:36 2022
0.83/1.12	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_26767_n019.cluster.edu".
0.83/1.12	============================== end of head ===========================
0.83/1.12	
0.83/1.12	============================== INPUT =================================
0.83/1.12	
0.83/1.12	% Reading from file /tmp/Prover9_26767_n019.cluster.edu
0.83/1.12	
0.83/1.12	set(prolog_style_variables).
0.83/1.12	set(auto2).
0.83/1.12	    % set(auto2) -> set(auto).
0.83/1.12	    % set(auto) -> set(auto_inference).
0.83/1.12	    % set(auto) -> set(auto_setup).
0.83/1.12	    % set(auto_setup) -> set(predicate_elim).
0.83/1.12	    % set(auto_setup) -> assign(eq_defs, unfold).
0.83/1.12	    % set(auto) -> set(auto_limits).
0.83/1.12	    % set(auto_limits) -> assign(max_weight, "100.000").
0.83/1.12	    % set(auto_limits) -> assign(sos_limit, 20000).
0.83/1.12	    % set(auto) -> set(auto_denials).
0.83/1.12	    % set(auto) -> set(auto_process).
0.83/1.12	    % set(auto2) -> assign(new_constants, 1).
0.83/1.12	    % set(auto2) -> assign(fold_denial_max, 3).
0.83/1.12	    % set(auto2) -> assign(max_weight, "200.000").
0.83/1.12	    % set(auto2) -> assign(max_hours, 1).
0.83/1.12	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.83/1.12	    % set(auto2) -> assign(max_seconds, 0).
0.83/1.12	    % set(auto2) -> assign(max_minutes, 5).
0.83/1.12	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.83/1.12	    % set(auto2) -> set(sort_initial_sos).
0.83/1.12	    % set(auto2) -> assign(sos_limit, -1).
0.83/1.12	    % set(auto2) -> assign(lrs_ticks, 3000).
0.83/1.12	    % set(auto2) -> assign(max_megs, 400).
0.83/1.12	    % set(auto2) -> assign(stats, some).
0.83/1.12	    % set(auto2) -> clear(echo_input).
0.83/1.12	    % set(auto2) -> set(quiet).
0.83/1.12	    % set(auto2) -> clear(print_initial_clauses).
0.83/1.12	    % set(auto2) -> clear(print_given).
0.83/1.12	assign(lrs_ticks,-1).
0.83/1.12	assign(sos_limit,10000).
0.83/1.12	assign(order,kbo).
0.83/1.12	set(lex_order_vars).
0.83/1.12	clear(print_given).
0.83/1.12	
0.83/1.12	% formulas(sos).  % not echoed (100 formulas)
0.83/1.12	
0.83/1.12	============================== end of input ==========================
0.83/1.12	
0.83/1.12	% From the command line: assign(max_seconds, 960).
0.83/1.12	
0.83/1.12	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.83/1.13	
0.83/1.13	% Formulas that are not ordinary clauses:
0.83/1.13	1 (all A all B all C all D all E all F all N all M ((all I all J (leq(n0,I) & leq(I,N) & leq(J,N) & leq(n0,J) -> a_select3(A,I,J) = a_select3(A,J,I))) & (all I all J (leq(n0,I) & leq(n0,J) & leq(J,N) & leq(I,N) -> a_select3(F,J,I) = a_select3(F,I,J))) & (all I all J (leq(n0,I) & leq(I,M) & leq(n0,J) & leq(J,M) -> a_select3(D,J,I) = a_select3(D,I,J))) -> (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.83/1.13	2 (all A all N ((all I all J (leq(n0,I) & leq(I,N) & leq(J,N) & leq(n0,J) -> 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(K,N) & leq(n0,K) & 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.83/1.13	3 (all X all Y (gt(Y,X) -> leq(X,Y))) # label(leq_gt1) # label(axiom) # label(non_clause).  [assumption].
0.83/1.13	4 (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.83/1.13	5 (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.83/1.13	6 (all X minus(X,n1) = pred(X)) # label(pred_minus_1) # label(axiom) # label(non_clause).  [assumption].
0.83/1.13	7 (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.83/1.13	8 (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.83/1.13	9 (all X pred(succ(X)) = X) # label(pred_succ) # label(axiom) # label(non_clause).  [assumption].
0.83/1.13	10 (all X succ(succ(X)) = plus(X,n2)) # label(succ_plus_2_r) # label(axiom) # label(non_clause).  [assumption].
0.83/1.13	11 (all X all Y (leq(X,Y) <-> leq(succ(X),succ(Y)))) # label(leq_succ_succ) # label(axiom) # label(non_clause).  [assumption].
0.83/1.13	12 (all A all N ((all I all J (leq(I,N) & leq(J,N) & leq(n0,J) & leq(n0,I) -> a_select3(A,I,J) = a_select3(A,J,I))) -> (all I all J (leq(n0,I) & leq(n0,J) & leq(J,N) & leq(I,N) -> a_select3(trans(A),I,J) = a_select3(trans(A),J,I))))) # label(matrix_symm_trans) # label(axiom) # label(non_clause).  [assumption].
0.83/1.13	13 (all A all N ((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(inv(A),I,J) = a_select3(inv(A),J,I))))) # label(matrix_symm_inv) # label(axiom) # label(non_clause).  [assumption].
0.83/1.13	14 (all I all J all U all V all X all VAL all VAL2 (I != U & a_select3(X,U,V) = VAL & V = J -> VAL = a_select3(tptp_update3(X,I,J,VAL2),U,V))) # label(sel3_update_2) # label(axiom) # label(non_clause).  [assumption].
0.83/1.13	15 (all X leq(X,X)) # label(reflexivity_leq) # label(axiom) # label(non_clause).  [assumption].
0.83/1.13	16 (all Body n0 = sum(n0,tptp_minus_1,Body)) # label(sum_plus_base) # label(axiom) # label(non_clause).  [assumption].
0.83/1.13	17 (all X -gt(X,X)) # label(irreflexivity_gt) # label(axiom) # label(non_clause).  [assumption].
0.83/1.13	18 (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.83/1.13	19 (all X all Y (leq(succ(X),Y) -> gt(Y,X))) # label(leq_succ_gt) # label(axiom) # label(non_clause).  [assumption].
0.83/1.13	20 (all X all Y (gt(Y,X) | X = Y | gt(X,Y))) # label(totality) # label(axiom) # label(non_clause).  [assumption].
0.83/1.13	21 (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.83/1.13	22 (all X succ(X) = plus(n1,X)) # label(succ_plus_1_l) # label(axiom) # label(non_clause).  [assumption].
0.83/1.13	23 (all I all L1 all U1 all J all L2 all U2 all Val (leq(L1,I) & leq(I,U1) & leq(J,U2) & leq(L2,J) -> 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.83/1.13	24 (all X gt(succ(X),X)) # label(gt_succ) # label(axiom) # label(non_clause).  [assumption].
0.83/1.13	25 (all X all Y (leq(X,Y) -> leq(X,succ(Y)))) # label(leq_succ) # label(axiom) # label(non_clause).  [assumption].
0.83/1.13	26 (all X succ(succ(succ(succ(succ(X))))) = plus(X,n5)) # label(succ_plus_5_r) # label(axiom) # label(non_clause).  [assumption].
0.83/1.13	27 (all X plus(n3,X) = succ(succ(succ(X)))) # label(succ_plus_3_l) # label(axiom) # label(non_clause).  [assumption].
0.83/1.13	28 (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(I,N) & leq(n0,I) -> a_select3(B,I,J) = a_select3(B,J,I))) -> (all I all J (leq(n0,I) & leq(n0,J) & leq(J,N) & leq(I,N) -> a_select3(tptp_msub(A,B),I,J) = a_select3(tptp_msub(A,B),J,I))))) # label(matrix_symm_sub) # label(axiom) # label(non_clause).  [assumption].
0.83/1.13	29 (all X succ(succ(succ(succ(succ(X))))) = plus(n5,X)) # label(succ_plus_5_l) # label(axiom) # label(non_clause).  [assumption].
0.83/1.13	30 (all X all Y (gt(succ(Y),X) <-> leq(X,Y))) # label(leq_succ_gt_equiv) # label(axiom) # label(non_clause).  [assumption].
0.83/1.13	31 (all X succ(succ(X)) = plus(n2,X)) # label(succ_plus_2_l) # label(axiom) # label(non_clause).  [assumption].
0.83/1.13	32 (all X all Y (leq(minus(X,Y),X) -> leq(n0,Y))) # label(leq_minus) # label(axiom) # label(non_clause).  [assumption].
0.83/1.13	33 (all X all Y (lt(X,Y) <-> gt(Y,X))) # label(lt_gt) # label(axiom) # label(non_clause).  [assumption].
0.83/1.13	34 (all I all U all X all VAL all VAL2 (I != U & VAL = a_select2(X,U) -> VAL = a_select2(tptp_update2(X,I,VAL2),U))) # label(sel2_Alarm clock 
119.81/120.11	Prover9 interrupted
119.81/120.12	EOF