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

% 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  : 300s
% DateTime : Tue May 21 04:10:29 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
thf(cB_type,type,
    cB: $i > $o ).

thf(cA_type,type,
    cA: $i > $o ).

thf(1,conjecture,
    ( ( ! [A: $i] :
          ( ( cA @ A )
         => ( cB @ A ) )
      | ! [A: $i] :
          ( ( cA @ A )
         => ( cB @ A ) ) )
   => ( ! [A: $i] :
          ( ( cA @ A )
         => ( cB @ A ) )
      & ! [A: $i] :
          ( ( cA @ A )
         => ( cB @ A ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cDUAL_EG5_pme) ).

thf(2,negated_conjecture,
    ~ ( ( ! [A: $i] :
            ( ( cA @ A )
           => ( cB @ A ) )
        | ! [A: $i] :
            ( ( cA @ A )
           => ( cB @ A ) ) )
     => ( ! [A: $i] :
            ( ( cA @ A )
           => ( cB @ A ) )
        & ! [A: $i] :
            ( ( cA @ A )
           => ( cB @ A ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

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

thf(4,plain,
    $false,
    inference(simp,[status(thm)],[3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09  % Problem  : SEV413^5 : TPTP v8.2.0. Released v4.0.0.
% 0.02/0.11  % Command  : run_Leo-III %s %d
% 0.11/0.31  % Computer : n004.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit : 300
% 0.11/0.31  % WCLimit  : 300
% 0.11/0.31  % DateTime : Sun May 19 19:20:24 EDT 2024
% 0.16/0.31  % CPUTime  : 
% 0.93/0.92  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.16/1.07  % [INFO] 	 Parsing done (148ms). 
% 1.27/1.08  % [INFO] 	 Running in sequential loop mode. 
% 1.74/1.43  % [INFO] 	 eprover registered as external prover. 
% 1.74/1.43  % [INFO] 	 cvc4 registered as external prover. 
% 1.74/1.44  % [INFO] 	 Scanning for conjecture ... 
% 1.95/1.51  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.95/1.53  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.01/1.54  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.01/1.54  % [INFO] 	 Type checking passed. 
% 2.01/1.55  % [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.19/1.68  % [INFO] 	 Killing All external provers ... 
% 2.19/1.68  % Time passed: 1214ms (effective reasoning time: 593ms)
% 2.19/1.68  % 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.19/1.68  % Axioms used in derivation (0): 
% 2.19/1.68  % No. of inferences in proof: 4
% 2.19/1.68  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1214 ms resp. 593 ms w/o parsing
% 2.33/1.72  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.33/1.72  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------