0.03/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.12	% Command  : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer : n017.cluster.edu
0.12/0.33	% Model    : x86_64 x86_64
0.12/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory   : 8042.1875MB
0.12/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit : 960
0.12/0.34	% WCLimit  : 120
0.12/0.34	% DateTime : Tue Aug  9 06:19:15 EDT 2022
0.12/0.34	% CPUTime  : 
0.43/1.00	============================== Prover9 ===============================
0.43/1.00	Prover9 (32) version 2009-11A, November 2009.
0.43/1.00	Process 2334 was started by sandbox on n017.cluster.edu,
0.43/1.00	Tue Aug  9 06:19:15 2022
0.43/1.00	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_2180_n017.cluster.edu".
0.43/1.00	============================== end of head ===========================
0.43/1.00	
0.43/1.00	============================== INPUT =================================
0.43/1.00	
0.43/1.00	% Reading from file /tmp/Prover9_2180_n017.cluster.edu
0.43/1.00	
0.43/1.00	set(prolog_style_variables).
0.43/1.00	set(auto2).
0.43/1.00	    % set(auto2) -> set(auto).
0.43/1.00	    % set(auto) -> set(auto_inference).
0.43/1.00	    % set(auto) -> set(auto_setup).
0.43/1.00	    % set(auto_setup) -> set(predicate_elim).
0.43/1.00	    % set(auto_setup) -> assign(eq_defs, unfold).
0.43/1.00	    % set(auto) -> set(auto_limits).
0.43/1.00	    % set(auto_limits) -> assign(max_weight, "100.000").
0.43/1.00	    % set(auto_limits) -> assign(sos_limit, 20000).
0.43/1.00	    % set(auto) -> set(auto_denials).
0.43/1.00	    % set(auto) -> set(auto_process).
0.43/1.00	    % set(auto2) -> assign(new_constants, 1).
0.43/1.00	    % set(auto2) -> assign(fold_denial_max, 3).
0.43/1.00	    % set(auto2) -> assign(max_weight, "200.000").
0.43/1.00	    % set(auto2) -> assign(max_hours, 1).
0.43/1.00	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.43/1.00	    % set(auto2) -> assign(max_seconds, 0).
0.43/1.00	    % set(auto2) -> assign(max_minutes, 5).
0.43/1.00	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.43/1.00	    % set(auto2) -> set(sort_initial_sos).
0.43/1.00	    % set(auto2) -> assign(sos_limit, -1).
0.43/1.00	    % set(auto2) -> assign(lrs_ticks, 3000).
0.43/1.00	    % set(auto2) -> assign(max_megs, 400).
0.43/1.00	    % set(auto2) -> assign(stats, some).
0.43/1.00	    % set(auto2) -> clear(echo_input).
0.43/1.00	    % set(auto2) -> set(quiet).
0.43/1.00	    % set(auto2) -> clear(print_initial_clauses).
0.43/1.00	    % set(auto2) -> clear(print_given).
0.43/1.00	assign(lrs_ticks,-1).
0.43/1.00	assign(sos_limit,10000).
0.43/1.00	assign(order,kbo).
0.43/1.00	set(lex_order_vars).
0.43/1.00	clear(print_given).
0.43/1.00	
0.43/1.00	% formulas(sos).  % not echoed (19 formulas)
0.43/1.00	
0.43/1.00	============================== end of input ==========================
0.43/1.00	
0.43/1.00	% From the command line: assign(max_seconds, 960).
0.43/1.00	
0.43/1.00	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.43/1.00	
0.43/1.00	% Formulas that are not ordinary clauses:
0.43/1.00	1 (all A star(A) = addition(one,multiplication(A,star(A)))) # label(star_unfold1) # label(axiom) # label(non_clause).  [assumption].
0.43/1.00	2 (all C all B all A addition(addition(A,B),C) = addition(A,addition(B,C))) # label(additive_associativity) # label(axiom) # label(non_clause).  [assumption].
0.43/1.00	3 (all A addition(A,A) = A) # label(idempotence) # label(axiom) # label(non_clause).  [assumption].
0.43/1.00	4 (all A all B addition(B,A) = addition(A,B)) # label(additive_commutativity) # label(axiom) # label(non_clause).  [assumption].
0.43/1.00	5 (all A all B all C (leq(C,addition(multiplication(A,C),B)) -> leq(C,multiplication(strong_iteration(A),B)))) # label(infty_coinduction) # label(axiom) # label(non_clause).  [assumption].
0.43/1.00	6 (all A all B all C (leq(addition(multiplication(C,A),B),C) -> leq(multiplication(B,star(A)),C))) # label(star_induction2) # label(axiom) # label(non_clause).  [assumption].
0.43/1.00	7 (all A addition(star(A),multiplication(strong_iteration(A),zero)) = strong_iteration(A)) # label(isolation) # label(axiom) # label(non_clause).  [assumption].
0.43/1.00	8 (all A all B all C (leq(addition(multiplication(A,C),B),C) -> leq(multiplication(star(A),B),C))) # label(star_induction1) # label(axiom) # label(non_clause).  [assumption].
0.43/1.00	9 (all A all B (addition(A,B) = B <-> leq(A,B))) # label(order) # label(axiom) # label(non_clause).  [assumption].
0.43/1.00	10 (all A A = multiplication(A,one)) # label(multiplicative_right_identity) # label(axiom) # label(non_clause).  [assumption].
0.43/1.00	11 (all A zero = multiplication(zero,A)) # label(left_annihilation) # label(axiom) # label(non_clause).  [assumption].
0.43/1.00	12 (all A A = addition(A,zero)) # label(additive_identity) # label(axiom) # label(non_clause).  [assumption].
0.43/1.00	13 (all A all B all C multiplication(multiplication(A,B),C) = multiplication(A,multiplication(B,C))) # label(multiplicative_associativity) # label(axiom) # label(non_clause).  [assumption].
0.43/1.00	14 (all A addition(multiplication(A,strong_iteration(A)),one) = strong_iteration(A)Alarm clock 
119.66/120.04	Prover9 interrupted
119.66/120.04	EOF