0.03/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.14	% Command    : tptp2X_and_run_prover9 %d %s
0.15/0.35	% Computer   : n017.cluster.edu
0.15/0.35	% Model      : x86_64 x86_64
0.15/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.15/0.35	% Memory     : 8042.1875MB
0.15/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.15/0.35	% CPULimit   : 180
0.15/0.35	% DateTime   : Thu Aug 29 14:35:04 EDT 2019
0.15/0.35	% CPUTime    : 
0.48/1.03	============================== Prover9 ===============================
0.48/1.03	Prover9 (32) version 2009-11A, November 2009.
0.48/1.03	Process 15694 was started by sandbox2 on n017.cluster.edu,
0.48/1.03	Thu Aug 29 14:35:04 2019
0.48/1.03	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 180 -f /tmp/Prover9_15541_n017.cluster.edu".
0.48/1.03	============================== end of head ===========================
0.48/1.03	
0.48/1.03	============================== INPUT =================================
0.48/1.03	
0.48/1.03	% Reading from file /tmp/Prover9_15541_n017.cluster.edu
0.48/1.03	
0.48/1.03	set(prolog_style_variables).
0.48/1.03	set(auto2).
0.48/1.03	    % set(auto2) -> set(auto).
0.48/1.03	    % set(auto) -> set(auto_inference).
0.48/1.03	    % set(auto) -> set(auto_setup).
0.48/1.03	    % set(auto_setup) -> set(predicate_elim).
0.48/1.03	    % set(auto_setup) -> assign(eq_defs, unfold).
0.48/1.03	    % set(auto) -> set(auto_limits).
0.48/1.03	    % set(auto_limits) -> assign(max_weight, "100.000").
0.48/1.03	    % set(auto_limits) -> assign(sos_limit, 20000).
0.48/1.03	    % set(auto) -> set(auto_denials).
0.48/1.03	    % set(auto) -> set(auto_process).
0.48/1.03	    % set(auto2) -> assign(new_constants, 1).
0.48/1.03	    % set(auto2) -> assign(fold_denial_max, 3).
0.48/1.03	    % set(auto2) -> assign(max_weight, "200.000").
0.48/1.03	    % set(auto2) -> assign(max_hours, 1).
0.48/1.03	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.48/1.03	    % set(auto2) -> assign(max_seconds, 0).
0.48/1.03	    % set(auto2) -> assign(max_minutes, 5).
0.48/1.03	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.48/1.03	    % set(auto2) -> set(sort_initial_sos).
0.48/1.03	    % set(auto2) -> assign(sos_limit, -1).
0.48/1.03	    % set(auto2) -> assign(lrs_ticks, 3000).
0.48/1.03	    % set(auto2) -> assign(max_megs, 400).
0.48/1.03	    % set(auto2) -> assign(stats, some).
0.48/1.03	    % set(auto2) -> clear(echo_input).
0.48/1.03	    % set(auto2) -> set(quiet).
0.48/1.03	    % set(auto2) -> clear(print_initial_clauses).
0.48/1.03	    % set(auto2) -> clear(print_given).
0.48/1.03	assign(lrs_ticks,-1).
0.48/1.03	assign(sos_limit,10000).
0.48/1.03	assign(order,kbo).
0.48/1.03	set(lex_order_vars).
0.48/1.03	clear(print_given).
0.48/1.03	
0.48/1.03	% formulas(sos).  % not echoed (14 formulas)
0.48/1.03	
0.48/1.03	============================== end of input ==========================
0.48/1.03	
0.48/1.03	% From the command line: assign(max_seconds, 180).
0.48/1.03	
0.48/1.03	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.48/1.03	
0.48/1.03	% Formulas that are not ordinary clauses:
0.48/1.03	1 (all X all Y (max(X,Y) = Y | -lesseq(X,Y))) # label(max_2) # label(axiom) # label(non_clause).  [assumption].
0.48/1.03	2 (all X all Y all Z (lesseq(X,Y) & lesseq(Y,Z) -> lesseq(X,Z))) # label(lesseq_trans) # label(axiom) # label(non_clause).  [assumption].
0.48/1.03	3 (all X all Y all Z (lesseq(Y,Z) & lesseq(X,Z) <-> ub(X,Y,Z))) # label(ub) # label(axiom) # label(non_clause).  [assumption].
0.48/1.03	4 (all X all Y (lesseq(X,Y) | lesseq(Y,X))) # label(lesseq_total) # label(axiom) # label(non_clause).  [assumption].
0.48/1.03	5 (all X all Y all N (minsol_model_max(X,Y,N) <-> model_max(X,Y,N) & (all Z (model_max(X,Y,Z) -> lesseq(N,Z))))) # label(minsol_model_max) # label(axiom) # label(non_clause).  [assumption].
0.48/1.03	6 (all X all Y all Z (lesseq(sum(Z,X),sum(Z,Y)) <-> lesseq(X,Y))) # label(sum_monotone_1) # label(axiom) # label(non_clause).  [assumption].
0.48/1.03	7 (all X lesseq(X,X)) # label(lesseq_ref) # label(axiom) # label(non_clause).  [assumption].
0.48/1.03	8 (all X all Y (lesseq(summation(X),summation(Y)) <-> lesseq(X,Y))) # label(summation_monotone) # label(axiom) # label(non_clause).  [assumption].
0.48/1.03	9 (all X all Y (lesseq(Y,X) & lesseq(X,Y) -> Y = X)) # label(lesseq_antisymmetric) # label(axiom) # label(non_clause).  [assumption].
0.48/1.03	10 (all X all Y all N (minsol_model_ub(X,Y,N) <-> model_ub(X,Y,N) & (all Z (model_ub(X,Y,Z) -> lesseq(N,Z))))) # label(minsol_model_ub) # label(axiom) # label(non_clause).  [assumption].
0.48/1.03	11 (all X all Y all N ((exists Z (ub(X,Y,Z) & lesseq(summation(Z),N))) <-> model_ub(X,Y,N))) # label(model_ub_3) # label(axiom) # label(non_clause).  [assumption].
0.48/1.03	12 (all X all Y (max(X,Y) = X | -lesseq(Y,X))) # label(max_1) # label(axiom) # label(non_clause).  [assumption].
0.48/1.03	13 (all X all Y all N (lesseq(summation(max(X,Y)),N) <-> model_max(X,Y,N))) # label(model_max_3) # label(axiom) # label(non_clause).  [assumption].
0.48/1.03	14 -(all X all Y all Z (minsol_model_max(X,Y,Z) <-> minsol_model_ub(X,Y,Z))) # label(max_is_ub_1) # label(negated_conjecture) # label(non_clause).  [Cputime limit exceeded (core dumped)
180.08/180.37	EOF