%------------------------------------------------------------------------------
% File     : Leo-III---1.7.7
% Problem  : SYN318+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n021.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:28:20 EDT 2023

% Result   : Theorem 2.77s 1.63s
% Output   : Refutation 2.77s
% 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 :   32 (   2   ~;   0   |;   0   &;  15   @)
%                                         (   0 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    2 (   2   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    4 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :    9 (   0   ^;   6   !;   3   ?;   9   :)

% Comments : 
%------------------------------------------------------------------------------
thf(big_f_type,type,
    big_f: $i > $o ).

thf(big_g_type,type,
    big_g: $i > $o ).

thf(p_type,type,
    p: $o ).

thf(1,conjecture,
    ? [A: $i] :
      ( ! [B: $i] :
          ( ( big_f @ B )
         => ( ( big_f @ A )
           => ( big_g @ B ) ) )
     => ( p
       => ! [B: $i] :
            ( ( big_f @ B )
           => ( big_g @ A ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_2_4) ).

thf(2,negated_conjecture,
    ~ ? [A: $i] :
        ( ! [B: $i] :
            ( ( big_f @ B )
           => ( ( big_f @ A )
             => ( big_g @ B ) ) )
       => ( p
         => ! [B: $i] :
              ( ( big_f @ B )
             => ( big_g @ A ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ? [A: $i] :
        ( ! [B: $i] :
            ( ( big_f @ B )
           => ( ( big_f @ A )
             => ( big_g @ B ) ) )
       => ( p
         => ! [B: $i] :
              ( ( big_f @ B )
             => ( big_g @ A ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SYN318+1 : TPTP v8.1.2. Released v2.0.0.
% 0.10/0.15  % Command  : run_Leo-III %s %d
% 0.15/0.36  % Computer : n021.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Thu May 18 19:37:13 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 1.00/0.89  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.07/1.01  % [INFO] 	 Parsing done (115ms). 
% 1.28/1.02  % [INFO] 	 Running in sequential loop mode. 
% 1.62/1.22  % [INFO] 	 eprover registered as external prover. 
% 1.62/1.23  % [INFO] 	 cvc4 registered as external prover. 
% 1.71/1.23  % [INFO] 	 Scanning for conjecture ... 
% 1.71/1.28  % [INFO] 	 Found a conjecture and 0 axioms. Running axiom selection ... 
% 1.71/1.30  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.71/1.30  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 1.71/1.30  % [INFO] 	 Type checking passed. 
% 1.71/1.30  % [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.42/1.59  % External prover 'e' found a proof!
% 2.77/1.63  % [INFO] 	 Killing All external provers ... 
% 2.77/1.63  % Time passed: 1115ms (effective reasoning time: 613ms)
% 2.77/1.63  % 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.77/1.63  % Axioms used in derivation (0): 
% 2.77/1.63  % No. of inferences in proof: 4
% 2.77/1.63  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1115 ms resp. 613 ms w/o parsing
% 2.77/1.65  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.77/1.65  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------