%------------------------------------------------------------------------------
% File     : Leo-III-SAT---1.7.12
% Problem  : SYO551^1 : TPTP v8.2.0. Released v5.2.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 09:00:54 EDT 2024

% Result   : Theorem 2.57s 1.59s
% Output   : Refutation 2.90s
% 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       :    6 (   5 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   13 (   4   ~;   0   |;   0   &;   9   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :   23 (  23   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    3 (   1 usr;   1 con; 0-2 aty)
%            Number of variables   :    8 (   0   ^   5   !;   3   ?;   8   :)

% Comments : 
%------------------------------------------------------------------------------
thf(sk1_type,type,
    sk1: ( ( $i > $i ) > $i > $i ) > $i > $i ).

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

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYO551^1 : TPTP v8.2.0. Released v5.2.0.
% 0.11/0.15  % Command  : run_Leo-III %s %d
% 0.14/0.36  % Computer : n025.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Mon May 20 10:38:39 EDT 2024
% 0.14/0.36  % CPUTime  : 
% 0.99/0.87  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.16/0.96  % [INFO] 	 Parsing done (97ms). 
% 1.16/0.97  % [INFO] 	 Running in sequential loop mode. 
% 1.65/1.19  % [INFO] 	 nitpick registered as external prover. 
% 1.65/1.20  % [INFO] 	 Scanning for conjecture ... 
% 1.79/1.24  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.79/1.26  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.79/1.26  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.79/1.27  % [INFO] 	 Type checking passed. 
% 1.79/1.27  % [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.57/1.58  % [INFO] 	 Killing All external provers ... 
% 2.57/1.59  % Time passed: 1056ms (effective reasoning time: 610ms)
% 2.57/1.59  % 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.57/1.59  % Axioms used in derivation (0): 
% 2.57/1.59  % No. of inferences in proof: 6
% 2.57/1.59  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1056 ms resp. 610 ms w/o parsing
% 2.90/1.61  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.90/1.61  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------