%------------------------------------------------------------------------------
% File     : Leo-III-SAT---1.7.15
% Problem  : SEV408^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d SAT

% Computer : n028.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 : Mon Jun 24 16:00:11 EDT 2024

% Result   : Theorem 2.38s 1.47s
% Output   : Refutation 2.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    6 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :    6 (   0 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   25 (   2   ~;   0   |;   3   &;  14   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   14 (  14   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    3 (   2 usr;   2 con; 0-1 aty)
%            Number of variables   :   13 (   0   ^   7   !;   6   ?;  13   :)

% Comments : 
%------------------------------------------------------------------------------
thf(cF_type,type,
    cF: ( $i > $o ) > $o ).

thf(1,conjecture,
    ? [A: ( $i > $o ) > $o] :
    ! [B: $i > $o] :
      ( ( A @ B )
     => ? [C: $i > $o] :
          ( ( cF @ C )
          & ! [D: $i] :
              ( ( B @ D )
             => ( C @ D ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBLEDSOE2_pme) ).

thf(2,negated_conjecture,
    ~ ? [A: ( $i > $o ) > $o] :
      ! [B: $i > $o] :
        ( ( A @ B )
       => ? [C: $i > $o] :
            ( ( cF @ C )
            & ! [D: $i] :
                ( ( B @ D )
               => ( C @ D ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ? [A: ( $i > $o ) > $o] :
      ! [B: $i > $o] :
        ( ( A @ B )
       => ? [C: $i > $o] :
            ( ( cF @ C )
            & ! [D: $i] :
                ( ( B @ D )
               => ( C @ D ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(6,plain,
    ! [A: ( $i > $o ) > $o] : ( A @ ( sk1 @ A ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(12,plain,
    $false,
    inference(prim_subst,[status(thm)],[6:[bind(A,$thf( ^ [B: $i > $o] : $false ))]]) ).

thf(19,plain,
    $false,
    inference(simp,[status(thm)],[12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SEV408^5 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.12  % Command  : run_Leo-III %s %d SAT
% 0.11/0.32  % Computer : n028.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 300
% 0.11/0.32  % DateTime : Fri Jun 21 19:36:55 EDT 2024
% 0.11/0.32  % CPUTime  : 
% 0.86/0.83  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.20/0.93  % [INFO] 	 Parsing done (98ms). 
% 1.20/0.94  % [INFO] 	 Running in sequential loop mode. 
% 1.46/1.15  % [INFO] 	 nitpick registered as external prover. 
% 1.46/1.15  % [INFO] 	 Scanning for conjecture ... 
% 1.77/1.20  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.77/1.22  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.77/1.23  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.77/1.23  % [INFO] 	 Type checking passed. 
% 1.77/1.23  % [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 ... 
% 2.38/1.47  % [INFO] 	 Killing All external provers ... 
% 2.38/1.47  % Time passed: 954ms (effective reasoning time: 521ms)
% 2.38/1.47  % 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)>
% 2.38/1.47  % Axioms used in derivation (0): 
% 2.38/1.47  % No. of inferences in proof: 6
% 2.38/1.47  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 954 ms resp. 521 ms w/o parsing
% 2.38/1.49  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.38/1.49  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------