%------------------------------------------------------------------------------
% File     : Leo-III---1.7.7
% Problem  : SWV075+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n014.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  : 300s
% DateTime : Fri May 19 12:13:47 EDT 2023

% Result   : Theorem 4.50s 2.04s
% Output   : Refutation 4.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   12 (   2 unt;   8 typ;   0 def)
%            Number of atoms       :   18 (   0 equ;   0 cnn)
%            Maximal formula atoms :    8 (   4 avg)
%            Number of connectives :   64 (   2   ~;   0   |;  12   &;  48   @)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    4 (   4   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   8 usr;   8 con; 0-2 aty)
%            Number of variables   :    0 (   0   ^;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
thf(leq_type,type,
    leq: $i > $i > $o ).

thf(n0_type,type,
    n0: $i ).

thf(pv31_type,type,
    pv31: $i ).

thf(pv37_type,type,
    pv37: $i ).

thf(minus_type,type,
    minus: $i > $i > $i ).

thf(n5_type,type,
    n5: $i ).

thf(n1_type,type,
    n1: $i ).

thf(n135300_type,type,
    n135300: $i ).

thf(1,conjecture,
    ( ( ( leq @ n0 @ pv31 )
      & ( leq @ n0 @ pv37 )
      & ( leq @ pv31 @ ( minus @ n5 @ n1 ) )
      & ( leq @ pv37 @ ( minus @ n135300 @ n1 ) ) )
   => ( ( leq @ n0 @ pv31 )
      & ( leq @ n0 @ pv37 )
      & ( leq @ pv31 @ ( minus @ n5 @ n1 ) )
      & ( leq @ pv37 @ ( minus @ n135300 @ n1 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_array_0016) ).

thf(2,negated_conjecture,
    ~ ( ( ( leq @ n0 @ pv31 )
        & ( leq @ n0 @ pv37 )
        & ( leq @ pv31 @ ( minus @ n5 @ n1 ) )
        & ( leq @ pv37 @ ( minus @ n135300 @ n1 ) ) )
     => ( ( leq @ n0 @ pv31 )
        & ( leq @ n0 @ pv37 )
        & ( leq @ pv31 @ ( minus @ n5 @ n1 ) )
        & ( leq @ pv37 @ ( minus @ n135300 @ n1 ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(92,plain,
    ~ $true,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(93,plain,
    $false,
    inference(simp,[status(thm)],[92]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWV075+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.15/0.16  % Command  : run_Leo-III %s %d
% 0.16/0.37  % Computer : n014.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.22/0.37  % CPULimit : 300
% 0.22/0.37  % WCLimit  : 300
% 0.22/0.37  % DateTime : Fri May 19 02:47:14 EDT 2023
% 0.22/0.37  % CPUTime  : 
% 0.93/0.85  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.28/1.01  % [INFO] 	 Parsing done (151ms). 
% 1.28/1.01  % [INFO] 	 Running in sequential loop mode. 
% 1.82/1.21  % [INFO] 	 eprover registered as external prover. 
% 1.82/1.21  % [INFO] 	 cvc4 registered as external prover. 
% 1.82/1.21  % [INFO] 	 Scanning for conjecture ... 
% 2.04/1.28  % [INFO] 	 Found a conjecture and 91 axioms. Running axiom selection ... 
% 2.21/1.33  % [INFO] 	 Axiom selection finished. Selected 89 axioms (removed 2 axioms). 
% 2.40/1.42  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 2.40/1.43  % [INFO] 	 Type checking passed. 
% 2.40/1.43  % [CONFIG] 	 Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>.  Searching for refutation ... 
% 4.50/2.03  % [INFO] 	 Killing All external provers ... 
% 4.50/2.03  % Time passed: 1499ms (effective reasoning time: 1015ms)
% 4.50/2.03  % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 4.50/2.03  % Axioms used in derivation (0): 
% 4.50/2.03  % No. of inferences in proof: 4
% 4.50/2.04  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1499 ms resp. 1015 ms w/o parsing
% 4.50/2.05  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.50/2.05  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------