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

% Computer : n003.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.09s 1.47s
% Output   : Refutation 2.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of formulae    :    7 (   2 unt;   3 typ;   0 def)
%            Number of atoms       :   20 (   0 equ;   0 cnn)
%            Maximal formula atoms :    9 (   5 avg)
%            Number of connectives :   30 (   2   ~;   2   |;   0   &;  12   @)
%                                         (   0 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    2 (   2   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    5 (   3 usr;   3 con; 0-1 aty)
%            Number of variables   :    6 (   0   ^   6   !;   0   ?;   6   :)

% Comments : 
%------------------------------------------------------------------------------
thf(cG_type,type,
    cG: $o ).

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

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

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

thf(2,negated_conjecture,
    ~ ( ( ( ! [A: $i] :
              ( ( cA @ A )
             => ( cB @ A ) )
         => cG )
        | ( ! [A: $i] :
              ( ( cA @ A )
             => ( cB @ A ) )
         => cG ) )
     => ( ! [A: $i] :
            ( ( cA @ A )
           => ( cB @ A ) )
       => cG ) ),
    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.10  % Problem  : SEV412^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.13  % Command  : run_Leo-III %s %d
% 0.13/0.33  % Computer : n003.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  : 300
% 0.13/0.33  % DateTime : Sun May 19 18:35:39 EDT 2024
% 0.13/0.33  % CPUTime  : 
% 0.80/0.85  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.13/0.95  % [INFO] 	 Parsing done (106ms). 
% 1.13/0.96  % [INFO] 	 Running in sequential loop mode. 
% 1.56/1.23  % [INFO] 	 eprover registered as external prover. 
% 1.62/1.24  % [INFO] 	 cvc4 registered as external prover. 
% 1.62/1.24  % [INFO] 	 Scanning for conjecture ... 
% 1.62/1.30  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.82/1.32  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.82/1.33  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.82/1.33  % [INFO] 	 Type checking passed. 
% 1.82/1.33  % [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.09/1.47  % [INFO] 	 Killing All external provers ... 
% 2.09/1.47  % Time passed: 989ms (effective reasoning time: 500ms)
% 2.09/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.09/1.47  % Axioms used in derivation (0): 
% 2.09/1.47  % No. of inferences in proof: 4
% 2.09/1.47  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 989 ms resp. 500 ms w/o parsing
% 2.12/1.50  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.12/1.50  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------