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

% Computer : n014.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:22 EDT 2023

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

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

thf(1,conjecture,
    ! [A: $i] :
    ? [B: $i] :
    ! [C: $i] :
      ( ( big_f @ B @ A )
     => ( ( ( big_f @ A @ C )
         => ( big_f @ A @ B ) )
        & ( ( big_f @ A @ B )
         => ( ~ ( big_f @ A @ C )
           => ( ( big_f @ B @ A )
              & ( big_f @ C @ B ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_12_2) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN327+1 : TPTP v8.1.2. Released v2.0.0.
% 0.15/0.15  % Command  : run_Leo-III %s %d
% 0.15/0.36  % Computer : n014.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:45:28 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 0.94/0.85  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.18/0.96  % [INFO] 	 Parsing done (105ms). 
% 1.18/0.96  % [INFO] 	 Running in sequential loop mode. 
% 1.62/1.15  % [INFO] 	 eprover registered as external prover. 
% 1.62/1.15  % [INFO] 	 cvc4 registered as external prover. 
% 1.62/1.16  % [INFO] 	 Scanning for conjecture ... 
% 1.70/1.20  % [INFO] 	 Found a conjecture and 0 axioms. Running axiom selection ... 
% 1.70/1.22  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.70/1.22  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 1.70/1.22  % [INFO] 	 Type checking passed. 
% 1.70/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.82/1.55  % External prover 'e' found a proof!
% 2.82/1.55  % [INFO] 	 Killing All external provers ... 
% 2.82/1.55  % Time passed: 1024ms (effective reasoning time: 584ms)
% 2.82/1.55  % 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.82/1.55  % Axioms used in derivation (0): 
% 2.82/1.55  % No. of inferences in proof: 4
% 2.82/1.55  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1024 ms resp. 584 ms w/o parsing
% 2.82/1.56  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.82/1.56  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------