0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer   : n004.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   : 180
0.13/0.34	% DateTime   : Thu Aug 29 12:53:08 EDT 2019
0.13/0.35	% CPUTime    : 
0.47/1.04	============================== Prover9 ===============================
0.47/1.04	Prover9 (32) version 2009-11A, November 2009.
0.47/1.04	Process 5684 was started by sandbox2 on n004.cluster.edu,
0.47/1.04	Thu Aug 29 12:53:09 2019
0.47/1.04	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 180 -f /tmp/Prover9_5371_n004.cluster.edu".
0.47/1.04	============================== end of head ===========================
0.47/1.04	
0.47/1.04	============================== INPUT =================================
0.47/1.04	
0.47/1.04	% Reading from file /tmp/Prover9_5371_n004.cluster.edu
0.47/1.04	
0.47/1.04	set(prolog_style_variables).
0.47/1.04	set(auto2).
0.47/1.04	    % set(auto2) -> set(auto).
0.47/1.04	    % set(auto) -> set(auto_inference).
0.47/1.04	    % set(auto) -> set(auto_setup).
0.47/1.04	    % set(auto_setup) -> set(predicate_elim).
0.47/1.04	    % set(auto_setup) -> assign(eq_defs, unfold).
0.47/1.04	    % set(auto) -> set(auto_limits).
0.47/1.04	    % set(auto_limits) -> assign(max_weight, "100.000").
0.47/1.04	    % set(auto_limits) -> assign(sos_limit, 20000).
0.47/1.04	    % set(auto) -> set(auto_denials).
0.47/1.04	    % set(auto) -> set(auto_process).
0.47/1.04	    % set(auto2) -> assign(new_constants, 1).
0.47/1.04	    % set(auto2) -> assign(fold_denial_max, 3).
0.47/1.04	    % set(auto2) -> assign(max_weight, "200.000").
0.47/1.04	    % set(auto2) -> assign(max_hours, 1).
0.47/1.04	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.47/1.04	    % set(auto2) -> assign(max_seconds, 0).
0.47/1.04	    % set(auto2) -> assign(max_minutes, 5).
0.47/1.04	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.47/1.04	    % set(auto2) -> set(sort_initial_sos).
0.47/1.04	    % set(auto2) -> assign(sos_limit, -1).
0.47/1.04	    % set(auto2) -> assign(lrs_ticks, 3000).
0.47/1.04	    % set(auto2) -> assign(max_megs, 400).
0.47/1.04	    % set(auto2) -> assign(stats, some).
0.47/1.04	    % set(auto2) -> clear(echo_input).
0.47/1.04	    % set(auto2) -> set(quiet).
0.47/1.04	    % set(auto2) -> clear(print_initial_clauses).
0.47/1.04	    % set(auto2) -> clear(print_given).
0.47/1.04	assign(lrs_ticks,-1).
0.47/1.04	assign(sos_limit,10000).
0.47/1.04	assign(order,kbo).
0.47/1.04	set(lex_order_vars).
0.47/1.04	clear(print_given).
0.47/1.04	
0.47/1.04	% formulas(sos).  % not echoed (13 formulas)
0.47/1.04	
0.47/1.04	============================== end of input ==========================
0.47/1.04	
0.47/1.04	% From the command line: assign(max_seconds, 180).
0.47/1.04	
0.47/1.04	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.47/1.04	
0.47/1.04	% Formulas that are not ordinary clauses:
0.47/1.04	1 (all I plus(I,int_zero) = I) # label(plus_zero) # label(axiom) # label(non_clause).  [assumption].
0.47/1.04	2 (all I all J (int_leq(J,n) & int_leq(int_one,J) & int_leq(I,n) & int_leq(int_one,I) -> (all C (plus(I,C) = J & int_less(int_zero,C) -> (all K (int_leq(int_one,K) & int_leq(K,I) -> real_zero = a(K,plus(K,C)))))) & (all K (int_leq(int_one,K) & int_leq(K,J) -> real_one = a(K,K))) & (all C (I = plus(J,C) & int_less(int_zero,C) -> (all K (int_leq(K,J) & int_leq(int_one,K) -> a(plus(K,C),K) = lu(plus(K,C),K))))))) # label(qil) # label(hypothesis) # label(non_clause).  [assumption].
0.47/1.04	3 (all I all J (int_less(I,J) <-> (exists K (int_less(int_zero,K) & plus(I,K) = J)))) # label(plus_and_inverse) # label(axiom) # label(non_clause).  [assumption].
0.47/1.04	4 (all I all J (int_less(I,J) | int_leq(J,I))) # label(int_less_total) # label(axiom) # label(non_clause).  [assumption].
0.47/1.04	5 (all I (int_leq(int_one,I) <-> int_less(int_zero,I))) # label(one_successor_of_zero) # label(axiom) # label(non_clause).  [assumption].
0.47/1.04	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.47/1.04	7 (all I all J (int_less(I,J) -> J != I)) # label(int_less_irreflexive) # label(axiom) # label(non_clause).  [assumption].
0.47/1.04	8 (all I all J all K (int_less(J,K) & int_less(I,J) -> int_less(I,K))) # label(int_less_transitive) # label(axiom) # label(non_clause).  [assumption].
0.47/1.04	9 (all I all J plus(I,J) = plus(J,I)) # label(plus_commutative) # label(axiom) # label(non_clause).  [assumption].
0.47/1.04	10 (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.47/1.04	11 -(all I all J (int_leq(int_one,I) & int_less(I,J) & int_leq(J,n) -> a(I,J) = real_zero)) # label(lt) # label(negated_conjecture) # label(non_clause).  [assumption].
0.47/1.04	
0.47/1.04	============================== end of process non-clausal formulas ===
0.47/1.04	
0.47/1.04	=====================Cputime limit exceeded (core dumped)
180.03/180.31	EOF