TSTP Solution File: SEV179^5 by Leo-III---1.7.15

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.15
% Problem  : SEV179^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d THM

% Computer : n026.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 15:58:26 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
thf(cD_FOR_X5309_type,type,
    cD_FOR_X5309: ( ( $i > $o ) > $i ) > $i > $o ).

thf(cD_FOR_X5309_def,definition,
    ( cD_FOR_X5309
    = ( ^ [A: ( $i > $o ) > $i,B: $i] :
        ? [C: $i > $o] :
          ( ~ ( C @ ( A @ C ) )
          & ( B
            = ( A @ C ) ) ) ) ) ).

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

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

thf(1,conjecture,
    ! [A: ( $i > $o ) > $i] : ( cD_FOR_X5309 @ A @ ( A @ ( cD_FOR_X5309 @ A ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM144C_pme) ).

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

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

thf(4,plain,
    ! [A: $i > $o] :
      ( ( A @ ( sk1 @ A ) )
      | ( ( sk1
          @ ^ [B: $i] :
            ? [C: $i > $o] :
              ( ~ ( C @ ( sk1 @ C ) )
              & ( B
                = ( sk1 @ C ) ) ) )
       != ( sk1 @ A ) ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(5,plain,
    ! [A: $i > $o] :
      ( ( ( sk1
          @ ^ [B: $i] :
            ? [C: $i > $o] :
              ( ~ ( C @ ( sk1 @ C ) )
              & ( B
                = ( sk1 @ C ) ) ) )
       != ( sk1 @ A ) )
      | ( A @ ( sk1 @ A ) ) ),
    inference(lifteq,[status(thm)],[4]) ).

thf(7,plain,
    ? [A: $i > $o] :
      ( ~ ( A @ ( sk1 @ A ) )
      & ( ( sk1
          @ ^ [B: $i] :
            ? [C: $i > $o] :
              ( ~ ( C @ ( sk1 @ C ) )
              & ( B
                = ( sk1 @ C ) ) ) )
        = ( sk1 @ A ) ) ),
    inference(pattern_uni,[status(thm)],[5:[bind(A,$thf( ^ [B: $i] : ? [C: $i > $o] : ( ~ ( C @ ( sk1 @ C ) ) & ( B = ( sk1 @ C ) ) ) ))]]) ).

thf(13,plain,
    ( ( sk1
      @ ^ [A: $i] :
        ? [B: $i > $o] :
          ( ~ ( B @ ( sk1 @ B ) )
          & ( A
            = ( sk1 @ B ) ) ) )
    = ( sk1 @ sk2 ) ),
    inference(cnf,[status(esa)],[7]) ).

thf(15,plain,
    ( ( sk1
      @ ^ [A: $i] :
        ? [B: $i > $o] :
          ( ~ ( B @ ( sk1 @ B ) )
          & ( A
            = ( sk1 @ B ) ) ) )
    = ( sk1 @ sk2 ) ),
    inference(lifteq,[status(thm)],[13]) ).

thf(29,plain,
    ! [A: $i > $o] :
      ( ( A @ ( sk1 @ A ) )
      | ( ( sk1 @ sk2 )
       != ( sk1 @ A ) ) ),
    inference(paramod_ordered,[status(thm)],[15,5]) ).

thf(30,plain,
    sk2 @ ( sk1 @ sk2 ),
    inference(pattern_uni,[status(thm)],[29:[bind(A,$thf( sk2 ))]]) ).

thf(14,plain,
    ~ ( sk2 @ ( sk1 @ sk2 ) ),
    inference(cnf,[status(esa)],[7]) ).

thf(64,plain,
    $false,
    inference(rewrite,[status(thm)],[30,14]) ).

thf(65,plain,
    $false,
    inference(simp,[status(thm)],[64]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SEV179^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% 0.12/0.13  % Command  : run_Leo-III %s %d THM
% 0.13/0.35  % Computer : n026.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Fri Jun 21 18:53:55 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 0.97/0.89  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.29/1.00  % [INFO] 	 Parsing done (105ms). 
% 1.29/1.01  % [INFO] 	 Running in sequential loop mode. 
% 1.68/1.23  % [INFO] 	 eprover registered as external prover. 
% 1.68/1.23  % [INFO] 	 Scanning for conjecture ... 
% 1.75/1.29  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.75/1.31  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.75/1.31  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.75/1.31  % [INFO] 	 Type checking passed. 
% 1.75/1.32  % [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 ... 
% 4.35/1.99  % [INFO] 	 Killing All external provers ... 
% 4.35/1.99  % Time passed: 1448ms (effective reasoning time: 976ms)
% 4.35/1.99  % 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)>
% 4.35/1.99  % Axioms used in derivation (0): 
% 4.35/1.99  % No. of inferences in proof: 13
% 4.35/1.99  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1448 ms resp. 976 ms w/o parsing
% 4.35/2.02  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.35/2.02  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------