TSTP Solution File: NUM858+1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : NUM858+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n004.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Mon Jul 18 13:32:45 EDT 2022

% Result   : Timeout 300.06s 300.32s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM858+1 : TPTP v8.1.0. Released v4.1.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 : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Wed Jul  6 14:19:22 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.45/1.01  ============================== Prover9 ===============================
% 0.45/1.01  Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.01  Process 19002 was started by sandbox2 on n004.cluster.edu,
% 0.45/1.01  Wed Jul  6 14:19:23 2022
% 0.45/1.01  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_18847_n004.cluster.edu".
% 0.45/1.01  ============================== end of head ===========================
% 0.45/1.01  
% 0.45/1.01  ============================== INPUT =================================
% 0.45/1.01  
% 0.45/1.01  % Reading from file /tmp/Prover9_18847_n004.cluster.edu
% 0.45/1.01  
% 0.45/1.01  set(prolog_style_variables).
% 0.45/1.01  set(auto2).
% 0.45/1.01      % set(auto2) -> set(auto).
% 0.45/1.01      % set(auto) -> set(auto_inference).
% 0.45/1.01      % set(auto) -> set(auto_setup).
% 0.45/1.01      % set(auto_setup) -> set(predicate_elim).
% 0.45/1.01      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.01      % set(auto) -> set(auto_limits).
% 0.45/1.01      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.01      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.01      % set(auto) -> set(auto_denials).
% 0.45/1.01      % set(auto) -> set(auto_process).
% 0.45/1.01      % set(auto2) -> assign(new_constants, 1).
% 0.45/1.01      % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.01      % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.01      % set(auto2) -> assign(max_hours, 1).
% 0.45/1.01      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.01      % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.01      % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.01      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.01      % set(auto2) -> set(sort_initial_sos).
% 0.45/1.01      % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.01      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.01      % set(auto2) -> assign(max_megs, 400).
% 0.45/1.01      % set(auto2) -> assign(stats, some).
% 0.45/1.01      % set(auto2) -> clear(echo_input).
% 0.45/1.01      % set(auto2) -> set(quiet).
% 0.45/1.01      % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.01      % set(auto2) -> clear(print_given).
% 0.45/1.01  assign(lrs_ticks,-1).
% 0.45/1.01  assign(sos_limit,10000).
% 0.45/1.01  assign(order,kbo).
% 0.45/1.01  set(lex_order_vars).
% 0.45/1.01  clear(print_given).
% 0.45/1.01  
% 0.45/1.01  % formulas(sos).  % not echoed (14 formulas)
% 0.45/1.01  
% 0.45/1.01  ============================== end of input ==========================
% 0.45/1.01  
% 0.45/1.01  % From the command line: assign(max_seconds, 300).
% 0.45/1.01  
% 0.45/1.01  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.01  
% 0.45/1.01  % Formulas that are not ordinary clauses:
% 0.45/1.01  1 (all X lesseq(X,X)) # label(lesseq_ref) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.01  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.45/1.01  3 (all X all Y (lesseq(X,Y) & lesseq(Y,X) -> X = Y)) # label(lesseq_antisymmetric) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.01  4 (all X all Y (lesseq(X,Y) | lesseq(Y,X))) # label(lesseq_total) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.01  5 (all X all Y all Z (lesseq(X,Y) <-> lesseq(sum(Z,X),sum(Z,Y)))) # label(sum_monotone_1) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.01  6 (all X all Y (lesseq(X,Y) <-> lesseq(summation(X),summation(Y)))) # label(summation_monotone) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.01  7 (all X all Y (max(X,Y) = X | -lesseq(Y,X))) # label(max_1) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.01  8 (all X all Y (max(X,Y) = Y | -lesseq(X,Y))) # label(max_2) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.01  9 (all X all Y all Z (ub(X,Y,Z) <-> lesseq(X,Z) & lesseq(Y,Z))) # label(ub) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.01  10 (all X all Y all N (model_max(X,Y,N) <-> N = max(X,Y))) # label(model_max_1) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.01  11 (all X all Y all N (model_ub(X,Y,N) <-> ub(X,Y,N))) # label(model_ub_1) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.01  12 (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.45/1.01  13 (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.45/1.01  14 -(all X all Y all Z (minsol_model_ub(X,Y,Z) <-> minsol_model_max(X,Y,Z))) # label(max_is_ub_1) # label(negated_conjecture) # label(non_clause).  [assumption].
% 0.45/1.01  
% 0.45/1.01  ============================== end of proCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------