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

% 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 : Tue May 21 08:55:55 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
thf(cP3_type,type,
    cP3: $i > $o ).

thf(cP2_type,type,
    cP2: $i > $o ).

thf(cP1_type,type,
    cP1: $i > $o ).

thf(1,conjecture,
    ? [A: $i] :
    ! [B: $i] :
      ( ( ( cP1 @ B )
        & ( ( cP1 @ A )
         => ( cP2 @ B ) )
        & ( ( cP2 @ A )
         => ( cP3 @ B ) ) )
     => ( cP3 @ A ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBAFFLER3) ).

thf(2,negated_conjecture,
    ~ ? [A: $i] :
      ! [B: $i] :
        ( ( ( cP1 @ B )
          & ( ( cP1 @ A )
           => ( cP2 @ B ) )
          & ( ( cP2 @ A )
           => ( cP3 @ B ) ) )
       => ( cP3 @ A ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ? [A: $i] :
      ! [B: $i] :
        ( ( ( cP1 @ B )
          & ( ( cP1 @ A )
           => ( cP2 @ B ) )
          & ( ( cP2 @ A )
           => ( cP3 @ B ) ) )
       => ( cP3 @ A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(10,plain,
    $false,
    inference(e,[status(thm)],[3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09  % Problem  : SYO147^5 : TPTP v8.2.0. Released v4.0.0.
% 0.02/0.11  % Command  : run_Leo-III %s %d
% 0.11/0.31  % Computer : n028.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 : Mon May 20 09:11:09 EDT 2024
% 0.11/0.32  % CPUTime  : 
% 0.94/0.92  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.13/1.07  % [INFO] 	 Parsing done (149ms). 
% 1.29/1.08  % [INFO] 	 Running in sequential loop mode. 
% 1.71/1.43  % [INFO] 	 eprover registered as external prover. 
% 1.71/1.43  % [INFO] 	 cvc4 registered as external prover. 
% 1.71/1.44  % [INFO] 	 Scanning for conjecture ... 
% 1.95/1.52  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.99/1.55  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.99/1.55  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.99/1.55  % [INFO] 	 Type checking passed. 
% 1.99/1.56  % [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.66/1.94  % External prover 'e' found a proof!
% 2.66/1.94  % [INFO] 	 Killing All external provers ... 
% 2.66/1.94  % Time passed: 1477ms (effective reasoning time: 849ms)
% 2.66/1.94  % 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.66/1.94  % Axioms used in derivation (0): 
% 2.66/1.94  % No. of inferences in proof: 4
% 2.66/1.94  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1477 ms resp. 849 ms w/o parsing
% 3.00/2.02  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.00/2.02  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------