0.08/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/0.14	% Command    : tptp2X_and_run_prover9 %d %s
0.13/0.35	% Computer   : n026.cluster.edu
0.13/0.35	% Model      : x86_64 x86_64
0.13/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.35	% Memory     : 8042.1875MB
0.13/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.35	% CPULimit   : 960
0.13/0.35	% DateTime   : Thu Jul  2 13:13:30 EDT 2020
0.13/0.35	% CPUTime    : 
0.48/1.06	============================== Prover9 ===============================
0.48/1.06	Prover9 (32) version 2009-11A, November 2009.
0.48/1.06	Process 29912 was started by sandbox2 on n026.cluster.edu,
0.48/1.06	Thu Jul  2 13:13:31 2020
0.48/1.06	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_29758_n026.cluster.edu".
0.48/1.06	============================== end of head ===========================
0.48/1.06	
0.48/1.06	============================== INPUT =================================
0.48/1.06	
0.48/1.06	% Reading from file /tmp/Prover9_29758_n026.cluster.edu
0.48/1.06	
0.48/1.06	set(prolog_style_variables).
0.48/1.06	set(auto2).
0.48/1.06	    % set(auto2) -> set(auto).
0.48/1.06	    % set(auto) -> set(auto_inference).
0.48/1.06	    % set(auto) -> set(auto_setup).
0.48/1.06	    % set(auto_setup) -> set(predicate_elim).
0.48/1.06	    % set(auto_setup) -> assign(eq_defs, unfold).
0.48/1.06	    % set(auto) -> set(auto_limits).
0.48/1.06	    % set(auto_limits) -> assign(max_weight, "100.000").
0.48/1.06	    % set(auto_limits) -> assign(sos_limit, 20000).
0.48/1.06	    % set(auto) -> set(auto_denials).
0.48/1.06	    % set(auto) -> set(auto_process).
0.48/1.06	    % set(auto2) -> assign(new_constants, 1).
0.48/1.06	    % set(auto2) -> assign(fold_denial_max, 3).
0.48/1.06	    % set(auto2) -> assign(max_weight, "200.000").
0.48/1.06	    % set(auto2) -> assign(max_hours, 1).
0.48/1.06	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.48/1.06	    % set(auto2) -> assign(max_seconds, 0).
0.48/1.06	    % set(auto2) -> assign(max_minutes, 5).
0.48/1.06	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.48/1.06	    % set(auto2) -> set(sort_initial_sos).
0.48/1.06	    % set(auto2) -> assign(sos_limit, -1).
0.48/1.06	    % set(auto2) -> assign(lrs_ticks, 3000).
0.48/1.06	    % set(auto2) -> assign(max_megs, 400).
0.48/1.06	    % set(auto2) -> assign(stats, some).
0.48/1.06	    % set(auto2) -> clear(echo_input).
0.48/1.06	    % set(auto2) -> set(quiet).
0.48/1.06	    % set(auto2) -> clear(print_initial_clauses).
0.48/1.06	    % set(auto2) -> clear(print_given).
0.48/1.06	assign(lrs_ticks,-1).
0.48/1.06	assign(sos_limit,10000).
0.48/1.06	assign(order,kbo).
0.48/1.06	set(lex_order_vars).
0.48/1.06	clear(print_given).
0.48/1.06	
0.48/1.06	% formulas(sos).  % not echoed (13 formulas)
0.48/1.06	
0.48/1.06	============================== end of input ==========================
0.48/1.06	
0.48/1.06	% From the command line: assign(max_seconds, 960).
0.48/1.06	
0.48/1.06	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.48/1.06	
0.48/1.06	% Formulas that are not ordinary clauses:
0.48/1.06	1 (all I I = plus(I,int_zero)) # label(plus_zero) # label(axiom) # label(non_clause).  [assumption].
0.48/1.06	2 (all I all J ((exists K (int_less(int_zero,K) & plus(I,K) = J)) <-> int_less(I,J))) # label(plus_and_inverse) # label(axiom) # label(non_clause).  [assumption].
0.48/1.06	3 (all I all J all K (int_less(I,J) & int_less(J,K) -> int_less(I,K))) # label(int_less_transitive) # label(axiom) # label(non_clause).  [assumption].
0.48/1.06	4 (all I all J (int_leq(J,n) & int_leq(int_one,J) & int_leq(I,n) & int_leq(int_one,I) -> (all C (int_less(int_zero,C) & I = plus(J,C) -> (all K (int_leq(int_one,K) & int_leq(K,J) -> real_zero = a(plus(K,C),K))))) & (all K (int_leq(int_one,K) & int_leq(K,J) -> a(K,K) = real_one)) & (all C (J = plus(I,C) & int_less(int_zero,C) -> (all K (int_leq(K,I) & int_leq(int_one,K) -> a(K,plus(K,C)) = real_zero)))))) # label(qii) # label(hypothesis) # label(non_clause).  [assumption].
0.48/1.06	5 (all I all J (int_less(I,J) -> J != I)) # label(int_less_irreflexive) # label(axiom) # label(non_clause).  [assumption].
0.48/1.06	6 (all I all J (int_less(I,J) | I = J <-> int_leq(I,J))) # label(int_leq) # label(axiom) # label(non_clause).  [assumption].
0.48/1.06	7 (all I all J plus(J,I) = plus(I,J)) # label(plus_commutative) # label(axiom) # label(non_clause).  [assumption].
0.48/1.06	8 (all I1 all J1 all I2 all J2 (int_less(I1,J1) & int_leq(I2,J2) -> int_leq(plus(I1,I2),plus(J1,J2)))) # label(plus_and_order1) # label(axiom) # label(non_clause).  [assumption].
0.48/1.06	9 (all I (int_leq(int_one,I) <-> int_less(int_zero,I))) # label(one_successor_of_zero) # label(axiom) # label(non_clause).  [assumption].
0.48/1.06	10 (all I all J (int_less(I,J) | int_leq(J,I))) # label(int_less_total) # label(axiom) # label(non_clause).  [assumption].
0.48/1.06	11 -(all I all J (int_leq(int_one,J) & int_leq(J,n) & int_leq(I,n) & int_leq(int_one,I) -> (I = J -> a(I,J) = real_one) & (J != I -> a(I,J) = real_zero))) # label(id) # label(negated_conjecture) # label(non_clause).  [assumption].
0.48/1.06	
0.48/1.06	============================== enAlarm clock 
119.78/120.05	Prover9 interrupted
119.78/120.05	EOF