%------------------------------------------------------------------------------
% File     : Leo-III-SAT---1.7.15
% Problem  : SYO006^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d SAT

% Computer : n024.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 : Mon Jun 24 20:53:52 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
thf(leibeq_type,type,
    leibeq: $o > $o > $o ).

thf(leibeq_def,definition,
    ( leibeq
    = ( ^ [A: $o,B: $o] :
        ! [C: $o > $o] :
          ( ( C @ A )
         => ( C @ B ) ) ) ) ).

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

thf(sk2_type,type,
    sk2: $o ).

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

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

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

thf(5,plain,
    ! [A: $o > $o] :
      ( ~ ( A @ sk1 )
      | ( A @ sk2 ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(6,plain,
    ( ( sk1 != sk1 )
    | ( sk1 = sk2 ) ),
    inference(replace_leibeq,[status(thm)],[5:[bind(A,$thf( (=) @ $o @ sk1 ))]]) ).

thf(8,plain,
    ( ( sk1 != sk1 )
    | ( sk2 = sk1 ) ),
    inference(lifteq,[status(thm)],[6]) ).

thf(9,plain,
    sk2 = sk1,
    inference(simp,[status(thm)],[8]) ).

thf(4,plain,
    sk1 != sk2,
    inference(cnf,[status(esa)],[3]) ).

thf(7,plain,
    sk2 != sk1,
    inference(lifteq,[status(thm)],[4]) ).

thf(12,plain,
    $false,
    inference(simplifyReflect,[status(thm)],[9,7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYO006^1 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.12  % Command  : run_Leo-III %s %d SAT
% 0.12/0.33  % Computer : n024.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Sun Jun 23 11:03:25 EDT 2024
% 0.12/0.33  % CPUTime  : 
% 0.97/0.85  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.17/0.94  % [INFO] 	 Parsing done (98ms). 
% 1.17/0.95  % [INFO] 	 Running in sequential loop mode. 
% 1.60/1.16  % [INFO] 	 nitpick registered as external prover. 
% 1.60/1.17  % [INFO] 	 Scanning for conjecture ... 
% 1.60/1.22  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.78/1.24  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.78/1.24  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.78/1.24  % [INFO] 	 Type checking passed. 
% 1.78/1.24  % [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.24/1.43  % [INFO] 	 Killing All external provers ... 
% 2.24/1.43  % Time passed: 918ms (effective reasoning time: 474ms)
% 2.24/1.43  % 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.24/1.43  % Axioms used in derivation (0): 
% 2.24/1.43  % No. of inferences in proof: 10
% 2.24/1.43  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 918 ms resp. 474 ms w/o parsing
% 2.24/1.46  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.24/1.46  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------