TSTP Solution File: MGT066-1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : MGT066-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n018.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 : Sun Jul 17 22:23:12 EDT 2022

% Result   : Timeout 300.07s 300.34s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : MGT066-1 : TPTP v8.1.0. Released v2.5.0.
% 0.12/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.33  % Computer : n018.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Thu Jun  9 07:45:08 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.44/0.99  ============================== Prover9 ===============================
% 0.44/0.99  Prover9 (32) version 2009-11A, November 2009.
% 0.44/0.99  Process 27532 was started by sandbox2 on n018.cluster.edu,
% 0.44/0.99  Thu Jun  9 07:45:08 2022
% 0.44/0.99  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_27216_n018.cluster.edu".
% 0.44/0.99  ============================== end of head ===========================
% 0.44/0.99  
% 0.44/0.99  ============================== INPUT =================================
% 0.44/0.99  
% 0.44/0.99  % Reading from file /tmp/Prover9_27216_n018.cluster.edu
% 0.44/0.99  
% 0.44/0.99  set(prolog_style_variables).
% 0.44/0.99  set(auto2).
% 0.44/0.99      % set(auto2) -> set(auto).
% 0.44/0.99      % set(auto) -> set(auto_inference).
% 0.44/0.99      % set(auto) -> set(auto_setup).
% 0.44/0.99      % set(auto_setup) -> set(predicate_elim).
% 0.44/0.99      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/0.99      % set(auto) -> set(auto_limits).
% 0.44/0.99      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/0.99      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/0.99      % set(auto) -> set(auto_denials).
% 0.44/0.99      % set(auto) -> set(auto_process).
% 0.44/0.99      % set(auto2) -> assign(new_constants, 1).
% 0.44/0.99      % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/0.99      % set(auto2) -> assign(max_weight, "200.000").
% 0.44/0.99      % set(auto2) -> assign(max_hours, 1).
% 0.44/0.99      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/0.99      % set(auto2) -> assign(max_seconds, 0).
% 0.44/0.99      % set(auto2) -> assign(max_minutes, 5).
% 0.44/0.99      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/0.99      % set(auto2) -> set(sort_initial_sos).
% 0.44/0.99      % set(auto2) -> assign(sos_limit, -1).
% 0.44/0.99      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/0.99      % set(auto2) -> assign(max_megs, 400).
% 0.44/0.99      % set(auto2) -> assign(stats, some).
% 0.44/0.99      % set(auto2) -> clear(echo_input).
% 0.44/0.99      % set(auto2) -> set(quiet).
% 0.44/0.99      % set(auto2) -> clear(print_initial_clauses).
% 0.44/0.99      % set(auto2) -> clear(print_given).
% 0.44/0.99  assign(lrs_ticks,-1).
% 0.44/0.99  assign(sos_limit,10000).
% 0.44/0.99  assign(order,kbo).
% 0.44/0.99  set(lex_order_vars).
% 0.44/0.99  clear(print_given).
% 0.44/0.99  
% 0.44/0.99  % formulas(sos).  % not echoed (11 formulas)
% 0.44/0.99  
% 0.44/0.99  ============================== end of input ==========================
% 0.44/0.99  
% 0.44/0.99  % From the command line: assign(max_seconds, 300).
% 0.44/0.99  
% 0.44/0.99  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/0.99  
% 0.44/0.99  % Formulas that are not ordinary clauses:
% 0.44/0.99  
% 0.44/0.99  ============================== end of process non-clausal formulas ===
% 0.44/0.99  
% 0.44/0.99  ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/0.99  
% 0.44/0.99  ============================== PREDICATE ELIMINATION =================
% 0.44/0.99  1 -smaller(A,B) | smaller_or_equal(A,B) # label(definition_smaller_or_equal_2) # label(axiom).  [assumption].
% 0.44/0.99  2 smaller(A,B) | A = B | greater(A,B) # label(meaning_postulate_greater_comparable_11) # label(axiom).  [assumption].
% 0.44/0.99  Derived: smaller_or_equal(A,B) | A = B | greater(A,B).  [resolve(1,a,2,a)].
% 0.44/0.99  3 -smaller(A,B) | greater(B,A) # label(definition_smaller_7) # label(axiom).  [assumption].
% 0.44/0.99  Derived: greater(A,B) | B = A | greater(B,A).  [resolve(3,a,2,a)].
% 0.44/0.99  4 -greater(A,B) | smaller(B,A) # label(definition_smaller_8) # label(axiom).  [assumption].
% 0.44/0.99  Derived: -greater(A,B) | smaller_or_equal(B,A).  [resolve(4,b,1,a)].
% 0.44/0.99  5 -smaller_or_equal(A,B) | smaller(A,B) | A = B # label(definition_smaller_or_equal_1) # label(axiom).  [assumption].
% 0.44/0.99  Derived: -smaller_or_equal(A,B) | A = B | greater(B,A).  [resolve(5,b,3,a)].
% 0.44/0.99  6 -smaller_or_equal(A,B) | A = B | greater(B,A).  [resolve(5,b,3,a)].
% 0.44/0.99  7 A != B | smaller_or_equal(A,B) # label(definition_smaller_or_equal_3) # label(axiom).  [assumption].
% 0.44/0.99  8 smaller_or_equal(A,B) | A = B | greater(A,B).  [resolve(1,a,2,a)].
% 0.44/0.99  9 -greater(A,B) | smaller_or_equal(B,A).  [resolve(4,b,1,a)].
% 0.44/0.99  Derived: A = B | greater(B,A) | A = B | greater(A,B).  [resolve(6,a,8,a)].
% 0.44/0.99  10 -greater_or_equal(A,B) | greater(A,B) | A = B # label(definition_greater_or_equal_4) # label(axiom).  [assumption].
% 0.44/0.99  11 -greater(A,B) | greater_or_equal(A,B) # label(definition_greater_or_equal_5) # label(axiom).  [assumption].
% 0.44/0.99  12 A != B | greater_or_equal(A,B) # label(definition_greater_or_equal_6) # label(axiom).  [assumption].
% 0.44/0.99  
% 0.44/0.99  ============================== end predicate elimination =============
% 0.44/0.99  
% 0.44/0.99  Auto_denials:  (non-Horn, no changes).
% 0.44/0.99  
% 0.44/0.99  Term ordering decisions:
% 0.44/0.99  Function symbol KB weights: 
% 0.44/0.99  
% 0.44/0.99  ============================== end of procesCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------