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

% Computer : n025.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:59:48 EDT 2024

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

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

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

thf(sk1_type,type,
    sk1: ( $i > $i > $o ) > $i ).

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

thf(2,negated_conjecture,
    ~ ? [A: $i > $i > $o] :
      ! [B: $i] :
        ( ( A @ B @ c0 )
        = ( ( cA @ B )
          | ( cB @ B @ B ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ? [A: $i > $i > $o] :
      ! [B: $i] :
        ( ( A @ B @ c0 )
        = ( ( cA @ B )
          | ( cB @ B @ B ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(4,plain,
    ! [A: $i > $i > $o] :
      ( ( A @ ( sk1 @ A ) @ c0 )
     != ( ( cA @ ( sk1 @ A ) )
        | ( cB @ ( sk1 @ A ) @ ( sk1 @ A ) ) ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(5,plain,
    ! [A: $i > $i > $o] :
      ( ( A @ ( sk1 @ A ) @ c0 )
     != ( ( cA @ ( sk1 @ A ) )
        | ( cB @ ( sk1 @ A ) @ ( sk1 @ A ) ) ) ),
    inference(lifteq,[status(thm)],[4]) ).

thf(6,plain,
    $false,
    inference(pre_uni,[status(thm)],[5:[bind(A,$thf( ^ [B: $i] : ^ [C: $i] : ( ( cA @ B ) | ( cB @ B @ B ) ) ))]]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SYO287^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.14  % Command  : run_Leo-III %s %d
% 0.14/0.35  % Computer : n025.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Mon May 20 10:40:39 EDT 2024
% 0.14/0.35  % CPUTime  : 
% 0.94/0.86  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.19/0.95  % [INFO] 	 Parsing done (94ms). 
% 1.19/0.96  % [INFO] 	 Running in sequential loop mode. 
% 1.50/1.15  % [INFO] 	 nitpick registered as external prover. 
% 1.50/1.15  % [INFO] 	 Scanning for conjecture ... 
% 1.62/1.20  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.62/1.22  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.62/1.22  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.62/1.22  % [INFO] 	 Type checking passed. 
% 1.62/1.22  % [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.51  % [INFO] 	 Killing All external provers ... 
% 2.42/1.51  % Time passed: 986ms (effective reasoning time: 548ms)
% 2.42/1.51  % 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.42/1.51  % Axioms used in derivation (0): 
% 2.42/1.51  % No. of inferences in proof: 6
% 2.42/1.51  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 986 ms resp. 548 ms w/o parsing
% 2.64/1.57  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.64/1.57  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------