0.06/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.10	% Command    : tptp2X_and_run_prover9 %d %s
0.09/0.30	% Computer   : n018.cluster.edu
0.09/0.30	% Model      : x86_64 x86_64
0.09/0.30	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.30	% Memory     : 8042.1875MB
0.09/0.30	% OS         : Linux 3.10.0-693.el7.x86_64
0.09/0.30	% CPULimit   : 1200
0.09/0.30	% DateTime   : Tue Jul 13 16:19:08 EDT 2021
0.09/0.30	% CPUTime    : 
0.69/1.02	============================== Prover9 ===============================
0.69/1.02	Prover9 (32) version 2009-11A, November 2009.
0.69/1.02	Process 15698 was started by sandbox2 on n018.cluster.edu,
0.69/1.02	Tue Jul 13 16:19:09 2021
0.69/1.02	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_15538_n018.cluster.edu".
0.69/1.02	============================== end of head ===========================
0.69/1.02	
0.69/1.02	============================== INPUT =================================
0.69/1.02	
0.69/1.02	% Reading from file /tmp/Prover9_15538_n018.cluster.edu
0.69/1.02	
0.69/1.02	set(prolog_style_variables).
0.69/1.02	set(auto2).
0.69/1.02	    % set(auto2) -> set(auto).
0.69/1.02	    % set(auto) -> set(auto_inference).
0.69/1.02	    % set(auto) -> set(auto_setup).
0.69/1.02	    % set(auto_setup) -> set(predicate_elim).
0.69/1.02	    % set(auto_setup) -> assign(eq_defs, unfold).
0.69/1.02	    % set(auto) -> set(auto_limits).
0.69/1.02	    % set(auto_limits) -> assign(max_weight, "100.000").
0.69/1.02	    % set(auto_limits) -> assign(sos_limit, 20000).
0.69/1.02	    % set(auto) -> set(auto_denials).
0.69/1.02	    % set(auto) -> set(auto_process).
0.69/1.02	    % set(auto2) -> assign(new_constants, 1).
0.69/1.02	    % set(auto2) -> assign(fold_denial_max, 3).
0.69/1.02	    % set(auto2) -> assign(max_weight, "200.000").
0.69/1.02	    % set(auto2) -> assign(max_hours, 1).
0.69/1.02	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.69/1.02	    % set(auto2) -> assign(max_seconds, 0).
0.69/1.02	    % set(auto2) -> assign(max_minutes, 5).
0.69/1.02	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.69/1.02	    % set(auto2) -> set(sort_initial_sos).
0.69/1.02	    % set(auto2) -> assign(sos_limit, -1).
0.69/1.02	    % set(auto2) -> assign(lrs_ticks, 3000).
0.69/1.02	    % set(auto2) -> assign(max_megs, 400).
0.69/1.02	    % set(auto2) -> assign(stats, some).
0.69/1.02	    % set(auto2) -> clear(echo_input).
0.69/1.02	    % set(auto2) -> set(quiet).
0.69/1.02	    % set(auto2) -> clear(print_initial_clauses).
0.69/1.02	    % set(auto2) -> clear(print_given).
0.69/1.02	assign(lrs_ticks,-1).
0.69/1.02	assign(sos_limit,10000).
0.69/1.02	assign(order,kbo).
0.69/1.02	set(lex_order_vars).
0.69/1.02	clear(print_given).
0.69/1.02	
0.69/1.02	% formulas(sos).  % not echoed (19 formulas)
0.69/1.02	
0.69/1.02	============================== end of input ==========================
0.69/1.02	
0.69/1.02	% From the command line: assign(max_seconds, 1200).
0.69/1.02	
0.69/1.02	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.69/1.02	
0.69/1.02	% Formulas that are not ordinary clauses:
0.69/1.02	1 (all A multiplication(zero,A) = zero) # label(left_annihilation) # label(axiom) # label(non_clause).  [assumption].
0.69/1.02	2 (all A addition(star(A),multiplication(strong_iteration(A),zero)) = strong_iteration(A)) # label(isolation) # label(axiom) # label(non_clause).  [assumption].
0.69/1.02	3 (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.69/1.02	4 (all A star(A) = addition(one,multiplication(star(A),A))) # label(star_unfold2) # label(axiom) # label(non_clause).  [assumption].
0.69/1.02	5 (all A strong_iteration(A) = addition(multiplication(A,strong_iteration(A)),one)) # label(infty_unfold1) # label(axiom) # label(non_clause).  [assumption].
0.69/1.02	6 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom) # label(non_clause).  [assumption].
0.69/1.02	7 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause).  [assumption].
0.69/1.02	8 (all A addition(one,multiplication(A,star(A))) = star(A)) # label(star_unfold1) # label(axiom) # label(non_clause).  [assumption].
0.69/1.02	9 (all A all B all C multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C))) # label(distributivity2) # label(axiom) # label(non_clause).  [assumption].
0.69/1.02	10 (all A addition(A,A) = A) # label(idempotence) # label(axiom) # label(non_clause).  [assumption].
0.69/1.02	11 (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.69/1.02	12 (all A all B all C addition(multiplication(A,B),multiplication(A,C)) = multiplication(A,addition(B,C))) # label(distributivity1) # label(axiom) # label(non_clause).  [assumption].
0.69/1.02	13 (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.69/1.02	14 (all A all B (B = addition(A,B) <-> leq(AAlarm clock 
119.59/120.09	Prover9 interrupted
119.59/120.09	EOF