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

% Computer : n032.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:27 EDT 2023

% Result   : Theorem 1.84s 1.35s
% Output   : Refutation 2.12s
% 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       :   19 (   0 equ;   0 cnn)
%            Maximal formula atoms :    6 (   4 avg)
%            Number of connectives :   53 (   2   ~;   3   |;   6   &;  36   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (  10 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   :   17 (   0   ^;  11   !;   6   ?;  17   :)

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.08  % Problem  : SYN346+1 : TPTP v8.1.2. Released v2.0.0.
% 0.08/0.09  % Command  : run_Leo-III %s %d
% 0.09/0.28  % Computer : n032.cluster.edu
% 0.09/0.28  % Model    : x86_64 x86_64
% 0.09/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28  % Memory   : 8042.1875MB
% 0.09/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28  % CPULimit : 300
% 0.09/0.28  % WCLimit  : 300
% 0.09/0.28  % DateTime : Thu May 18 19:45:20 EDT 2023
% 0.09/0.28  % CPUTime  : 
% 0.59/0.67  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 0.83/0.78  % [INFO] 	 Parsing done (105ms). 
% 0.88/0.78  % [INFO] 	 Running in sequential loop mode. 
% 1.19/0.99  % [INFO] 	 eprover registered as external prover. 
% 1.19/0.99  % [INFO] 	 cvc4 registered as external prover. 
% 1.19/0.99  % [INFO] 	 Scanning for conjecture ... 
% 1.19/1.04  % [INFO] 	 Found a conjecture and 0 axioms. Running axiom selection ... 
% 1.38/1.07  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.38/1.07  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 1.38/1.08  % [INFO] 	 Type checking passed. 
% 1.38/1.08  % [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 ... 
% 1.84/1.35  % External prover 'e' found a proof!
% 1.84/1.35  % [INFO] 	 Killing All external provers ... 
% 1.84/1.35  % Time passed: 971ms (effective reasoning time: 561ms)
% 1.84/1.35  % 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)>
% 1.84/1.35  % Axioms used in derivation (0): 
% 1.84/1.35  % No. of inferences in proof: 4
% 1.84/1.35  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 971 ms resp. 561 ms w/o parsing
% 2.12/1.37  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.12/1.37  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------