0.00/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.10	% Command    : tptp2X_and_run_prover9 %d %s
0.10/0.30	% Computer   : n016.cluster.edu
0.10/0.30	% Model      : x86_64 x86_64
0.10/0.30	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.30	% Memory     : 8042.1875MB
0.10/0.30	% OS         : Linux 3.10.0-693.el7.x86_64
0.10/0.30	% CPULimit   : 180
0.10/0.31	% DateTime   : Thu Aug 29 14:26:23 EDT 2019
0.10/0.31	% CPUTime    : 
0.70/1.02	============================== Prover9 ===============================
0.70/1.02	Prover9 (32) version 2009-11A, November 2009.
0.70/1.02	Process 26276 was started by sandbox2 on n016.cluster.edu,
0.70/1.02	Thu Aug 29 14:26:24 2019
0.70/1.02	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 180 -f /tmp/Prover9_26123_n016.cluster.edu".
0.70/1.02	============================== end of head ===========================
0.70/1.02	
0.70/1.02	============================== INPUT =================================
0.70/1.02	
0.70/1.02	% Reading from file /tmp/Prover9_26123_n016.cluster.edu
0.70/1.02	
0.70/1.02	set(prolog_style_variables).
0.70/1.02	set(auto2).
0.70/1.02	    % set(auto2) -> set(auto).
0.70/1.02	    % set(auto) -> set(auto_inference).
0.70/1.02	    % set(auto) -> set(auto_setup).
0.70/1.02	    % set(auto_setup) -> set(predicate_elim).
0.70/1.02	    % set(auto_setup) -> assign(eq_defs, unfold).
0.70/1.02	    % set(auto) -> set(auto_limits).
0.70/1.02	    % set(auto_limits) -> assign(max_weight, "100.000").
0.70/1.02	    % set(auto_limits) -> assign(sos_limit, 20000).
0.70/1.02	    % set(auto) -> set(auto_denials).
0.70/1.02	    % set(auto) -> set(auto_process).
0.70/1.02	    % set(auto2) -> assign(new_constants, 1).
0.70/1.02	    % set(auto2) -> assign(fold_denial_max, 3).
0.70/1.02	    % set(auto2) -> assign(max_weight, "200.000").
0.70/1.02	    % set(auto2) -> assign(max_hours, 1).
0.70/1.02	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.70/1.02	    % set(auto2) -> assign(max_seconds, 0).
0.70/1.02	    % set(auto2) -> assign(max_minutes, 5).
0.70/1.02	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.70/1.02	    % set(auto2) -> set(sort_initial_sos).
0.70/1.02	    % set(auto2) -> assign(sos_limit, -1).
0.70/1.02	    % set(auto2) -> assign(lrs_ticks, 3000).
0.70/1.02	    % set(auto2) -> assign(max_megs, 400).
0.70/1.02	    % set(auto2) -> assign(stats, some).
0.70/1.02	    % set(auto2) -> clear(echo_input).
0.70/1.02	    % set(auto2) -> set(quiet).
0.70/1.02	    % set(auto2) -> clear(print_initial_clauses).
0.70/1.02	    % set(auto2) -> clear(print_given).
0.70/1.02	assign(lrs_ticks,-1).
0.70/1.02	assign(sos_limit,10000).
0.70/1.02	assign(order,kbo).
0.70/1.02	set(lex_order_vars).
0.70/1.02	clear(print_given).
0.70/1.02	
0.70/1.02	% formulas(sos).  % not echoed (18 formulas)
0.70/1.02	
0.70/1.02	============================== end of input ==========================
0.70/1.02	
0.70/1.02	% From the command line: assign(max_seconds, 180).
0.70/1.02	
0.70/1.02	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.70/1.02	
0.70/1.02	% Formulas that are not ordinary clauses:
0.70/1.02	1 (all A all B all C (leq(addition(multiplication(A,B),C),B) -> leq(multiplication(star(A),C),B))) # label(star_induction_left) # label(axiom) # label(non_clause).  [assumption].
0.70/1.02	2 (all A all B all C addition(multiplication(A,B),multiplication(A,C)) = multiplication(A,addition(B,C))) # label(right_distributivity) # label(axiom) # label(non_clause).  [assumption].
0.70/1.02	3 (all A multiplication(zero,A) = zero) # label(left_annihilation) # label(axiom) # label(non_clause).  [assumption].
0.70/1.02	4 (all A A = multiplication(one,A)) # label(multiplicative_left_identity) # label(axiom) # label(non_clause).  [assumption].
0.70/1.02	5 (all A A = addition(A,A)) # label(additive_idempotence) # label(axiom) # label(non_clause).  [assumption].
0.70/1.02	6 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom) # label(non_clause).  [assumption].
0.70/1.02	7 (all A all B all C addition(multiplication(A,C),multiplication(B,C)) = multiplication(addition(A,B),C)) # label(left_distributivity) # label(axiom) # label(non_clause).  [assumption].
0.70/1.02	8 (all C all B all A addition(A,addition(B,C)) = addition(addition(A,B),C)) # label(additive_associativity) # label(axiom) # label(non_clause).  [assumption].
0.70/1.02	9 (all A leq(addition(one,multiplication(A,star(A))),star(A))) # label(star_unfold_right) # label(axiom) # label(non_clause).  [assumption].
0.70/1.02	10 (all A leq(addition(one,multiplication(star(A),A)),star(A))) # label(star_unfold_left) # label(axiom) # label(non_clause).  [assumption].
0.70/1.02	11 (all A multiplication(A,zero) = zero) # label(right_annihilation) # label(axiom) # label(non_clause).  [assumption].
0.70/1.02	12 (all A all B (B = addition(A,B) <-> leq(A,B))) # label(order) # label(axiom) # label(non_clause).  [assumption].
0.70/1.02	13 (all A all B all C multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C)) # label(multiplicative_associativity) # label(axiom) # label(non_clause).  [assumption].
0.70/1.02	14 (all A addition(A,zero) = A) # label(additive_identity) #Cputime limit exceeded (core dumped)
180.03/180.74	EOF