TSTP Solution File: SYO133^5 by Satallax---3.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Satallax---3.5
% Problem  : SYO133^5 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s

% Computer : n012.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  : 600s
% DateTime : Thu Jul 21 19:30:27 EDT 2022

% Result   : Theorem 0.12s 0.35s
% Output   : Proof 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   32
% Syntax   : Number of formulae    :   39 (   9 unt;   6 typ;   3 def)
%            Number of atoms       :   97 (   3 equ;   0 cnn)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  145 (  41   ~;  13   |;   0   &;  45   @)
%                                         (  12 <=>;  34  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    3 (   3   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   21 (  19 usr;  18 con; 0-2 aty)
%            Number of variables   :   10 (   3   ^   7   !;   0   ?;  10   :)

% Comments : 
%------------------------------------------------------------------------------
thf(ty_eigen__2,type,
    eigen__2: $i ).

thf(ty_eigen__1,type,
    eigen__1: $i ).

thf(ty_eigen__0,type,
    eigen__0: $i ).

thf(ty_cP1,type,
    cP1: $i > $o ).

thf(ty_eigen__3,type,
    eigen__3: $i ).

thf(ty_cP2,type,
    cP2: $i > $o ).

thf(h0,assumption,
    ! [X1: $i > $o,X2: $i] :
      ( ( X1 @ X2 )
     => ( X1 @ ( eps__0 @ X1 ) ) ),
    introduced(assumption,[]) ).

thf(eigendef_eigen__3,definition,
    ( eigen__3
    = ( eps__0
      @ ^ [X1: $i] :
          ~ ( ~ ( ( cP1 @ X1 )
               => ~ ( ( cP1 @ eigen__2 )
                   => ( cP2 @ X1 ) ) )
           => ( cP2 @ eigen__2 ) ) ) ),
    introduced(definition,[new_symbols(definition,[eigen__3])]) ).

thf(eigendef_eigen__1,definition,
    ( eigen__1
    = ( eps__0
      @ ^ [X1: $i] :
          ~ ( ~ ( ( cP1 @ X1 )
               => ~ ( ( cP1 @ eigen__0 )
                   => ( cP2 @ X1 ) ) )
           => ( cP2 @ eigen__0 ) ) ) ),
    introduced(definition,[new_symbols(definition,[eigen__1])]) ).

thf(eigendef_eigen__2,definition,
    ( eigen__2
    = ( eps__0
      @ ^ [X1: $i] :
          ~ ( ~ ( ( cP1 @ X1 )
               => ~ ( ( cP1 @ eigen__1 )
                   => ( cP2 @ X1 ) ) )
           => ( cP2 @ eigen__1 ) ) ) ),
    introduced(definition,[new_symbols(definition,[eigen__2])]) ).

thf(sP1,plain,
    ( sP1
  <=> ! [X1: $i] :
        ( ~ ( ( cP1 @ X1 )
           => ~ ( ( cP1 @ eigen__0 )
               => ( cP2 @ X1 ) ) )
       => ( cP2 @ eigen__0 ) ) ),
    introduced(definition,[new_symbols(definition,[sP1])]) ).

thf(sP2,plain,
    ( sP2
  <=> ! [X1: $i] :
        ( ~ ( ( cP1 @ X1 )
           => ~ ( ( cP1 @ eigen__2 )
               => ( cP2 @ X1 ) ) )
       => ( cP2 @ eigen__2 ) ) ),
    introduced(definition,[new_symbols(definition,[sP2])]) ).

thf(sP3,plain,
    ( sP3
  <=> ( cP2 @ eigen__2 ) ),
    introduced(definition,[new_symbols(definition,[sP3])]) ).

thf(sP4,plain,
    ( sP4
  <=> ( cP1 @ eigen__1 ) ),
    introduced(definition,[new_symbols(definition,[sP4])]) ).

thf(sP5,plain,
    ( sP5
  <=> ! [X1: $i] :
        ( ~ ( ( cP1 @ X1 )
           => ~ ( sP4
               => ( cP2 @ X1 ) ) )
       => ( cP2 @ eigen__1 ) ) ),
    introduced(definition,[new_symbols(definition,[sP5])]) ).

thf(sP6,plain,
    ( sP6
  <=> ( ( cP1 @ eigen__2 )
     => ~ ( sP4
         => sP3 ) ) ),
    introduced(definition,[new_symbols(definition,[sP6])]) ).

thf(sP7,plain,
    ( sP7
  <=> ( sP4
     => sP3 ) ),
    introduced(definition,[new_symbols(definition,[sP7])]) ).

thf(sP8,plain,
    ( sP8
  <=> ( ~ ( sP4
         => ~ ( ( cP1 @ eigen__0 )
             => ( cP2 @ eigen__1 ) ) )
     => ( cP2 @ eigen__0 ) ) ),
    introduced(definition,[new_symbols(definition,[sP8])]) ).

thf(sP9,plain,
    ( sP9
  <=> ! [X1: $i] :
        ~ ! [X2: $i] :
            ( ~ ( ( cP1 @ X2 )
               => ~ ( ( cP1 @ X1 )
                   => ( cP2 @ X2 ) ) )
           => ( cP2 @ X1 ) ) ),
    introduced(definition,[new_symbols(definition,[sP9])]) ).

thf(sP10,plain,
    ( sP10
  <=> ( ~ ( ( cP1 @ eigen__3 )
         => ~ ( ( cP1 @ eigen__2 )
             => ( cP2 @ eigen__3 ) ) )
     => sP3 ) ),
    introduced(definition,[new_symbols(definition,[sP10])]) ).

thf(sP11,plain,
    ( sP11
  <=> ( sP4
     => ~ ( ( cP1 @ eigen__0 )
         => ( cP2 @ eigen__1 ) ) ) ),
    introduced(definition,[new_symbols(definition,[sP11])]) ).

thf(sP12,plain,
    ( sP12
  <=> ( ~ sP6
     => ( cP2 @ eigen__1 ) ) ),
    introduced(definition,[new_symbols(definition,[sP12])]) ).

thf(cBAFFLER2,conjecture,
    ~ sP9 ).

thf(h1,negated_conjecture,
    sP9,
    inference(assume_negation,[status(cth)],[cBAFFLER2]) ).

thf(1,plain,
    ( sP10
    | ~ sP3 ),
    inference(prop_rule,[status(thm)],]) ).

thf(2,plain,
    ( sP2
    | ~ sP10 ),
    inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__3]) ).

thf(3,plain,
    ( ~ sP9
    | ~ sP2 ),
    inference(all_rule,[status(thm)],]) ).

thf(4,plain,
    ( ~ sP7
    | ~ sP4
    | sP3 ),
    inference(prop_rule,[status(thm)],]) ).

thf(5,plain,
    ( sP6
    | sP7 ),
    inference(prop_rule,[status(thm)],]) ).

thf(6,plain,
    ( sP12
    | ~ sP6 ),
    inference(prop_rule,[status(thm)],]) ).

thf(7,plain,
    ( sP5
    | ~ sP12 ),
    inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__2]) ).

thf(8,plain,
    ( ~ sP9
    | ~ sP5 ),
    inference(all_rule,[status(thm)],]) ).

thf(9,plain,
    ( sP11
    | sP4 ),
    inference(prop_rule,[status(thm)],]) ).

thf(10,plain,
    ( sP8
    | ~ sP11 ),
    inference(prop_rule,[status(thm)],]) ).

thf(11,plain,
    ( sP1
    | ~ sP8 ),
    inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__1]) ).

thf(12,plain,
    ( ~ sP9
    | ~ sP1 ),
    inference(all_rule,[status(thm)],]) ).

thf(13,plain,
    $false,
    inference(prop_unsat,[status(thm),assumptions([h1,h0])],[1,2,3,4,5,6,7,8,9,10,11,12,h1]) ).

thf(14,plain,
    $false,
    inference(eigenvar_choice,[status(thm),assumptions([h1]),eigenvar_choice(discharge,[h0])],[13,h0]) ).

thf(0,theorem,
    ~ sP9,
    inference(contra,[status(thm),contra(discharge,[h1])],[13,h1]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : SYO133^5 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12  % Command  : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.12/0.33  % Computer : n012.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  : 600
% 0.12/0.33  % DateTime : Sat Jul  9 02:35:29 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.35  % SZS status Theorem
% 0.12/0.35  % Mode: mode213
% 0.12/0.35  % Inferences: 30
% 0.12/0.35  % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------