%------------------------------------------------------------------------------
% File     : Leo-III-SAT---1.7.12
% Problem  : SYO553^1 : TPTP v8.2.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n009.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 09:00:54 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
thf(sk2_type,type,
    sk2: ( $i > $i > $i ) > $i ).

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

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

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

thf(4,plain,
    ! [A: $i > $i > $i] :
      ( ( A @ ( sk1 @ A ) @ ( sk2 @ A ) )
     != ( sk2 @ A ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(5,plain,
    ! [A: $i > $i > $i] :
      ( ( A @ ( sk1 @ A ) @ ( sk2 @ A ) )
     != ( sk2 @ A ) ),
    inference(lifteq,[status(thm)],[4]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYO553^1 : TPTP v8.2.0. Released v5.2.0.
% 0.11/0.15  % Command  : run_Leo-III %s %d
% 0.15/0.35  % Computer : n009.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Mon May 20 09:53:54 EDT 2024
% 0.15/0.36  % CPUTime  : 
% 1.00/0.88  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.07/0.98  % [INFO] 	 Parsing done (108ms). 
% 1.07/0.99  % [INFO] 	 Running in sequential loop mode. 
% 1.64/1.21  % [INFO] 	 nitpick registered as external prover. 
% 1.64/1.21  % [INFO] 	 Scanning for conjecture ... 
% 1.64/1.26  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.64/1.28  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.64/1.28  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.64/1.28  % [INFO] 	 Type checking passed. 
% 1.64/1.28  % [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.84/1.63  % [INFO] 	 Killing All external provers ... 
% 2.84/1.63  % Time passed: 1119ms (effective reasoning time: 636ms)
% 2.84/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.84/1.64  % Axioms used in derivation (0): 
% 2.84/1.64  % No. of inferences in proof: 6
% 2.84/1.64  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1119 ms resp. 636 ms w/o parsing
% 2.84/1.66  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.84/1.66  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------