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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Satallax---3.5
% Problem  : SYO219^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 : n008.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:56 EDT 2022

% Result   : Theorem 157.47s 150.24s
% Output   : Proof 157.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   30
% Syntax   : Number of formulae    :   37 (  11 unt;   3 typ;   2 def)
%            Number of atoms       :   66 (  17 equ;   0 cnn)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   99 (  25   ~;  12   |;   0   &;  44   @)
%                                         (  12 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   19 (  19   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   19 (  17 usr;  16 con; 0-2 aty)
%            Number of variables   :   24 (   7   ^  17   !;   0   ?;  24   :)

% Comments : 
%------------------------------------------------------------------------------
thf(ty_cS,type,
    cS: $i > $i ).

thf(ty_eigen__47,type,
    eigen__47: $i ).

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

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

thf(eigendef_eigen__47,definition,
    ( eigen__47
    = ( eps__0
      @ ^ [X1: $i] :
          ~ ( ( ( eigen__0 @ X1 )
             != ( ^ [X2: $i] : ( cS @ ( eigen__0 @ X2 @ X2 ) ) ) ) ) ) ),
    introduced(definition,[new_symbols(definition,[eigen__47])]) ).

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

thf(eigendef_eigen__0,definition,
    ( eigen__0
    = ( eps__1
      @ ^ [X1: $i > $i > $i] :
          ~ ~ ! [X2: $i > $i] :
                ~ ! [X3: $i] :
                    ( ( X1 @ X3 )
                   != X2 ) ) ),
    introduced(definition,[new_symbols(definition,[eigen__0])]) ).

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

thf(sP2,plain,
    ( sP2
  <=> ! [X1: $i] :
        ( ( eigen__0 @ X1 )
       != ( ^ [X2: $i] : ( cS @ ( eigen__0 @ X2 @ X2 ) ) ) ) ),
    introduced(definition,[new_symbols(definition,[sP2])]) ).

thf(sP3,plain,
    ( sP3
  <=> ( ( cS @ ( eigen__0 @ eigen__47 @ eigen__47 ) )
      = ( eigen__0 @ eigen__47 @ eigen__47 ) ) ),
    introduced(definition,[new_symbols(definition,[sP3])]) ).

thf(sP4,plain,
    ( sP4
  <=> ! [X1: $i > $i] :
        ( ( ( eigen__0 @ eigen__47 )
          = X1 )
       => ( X1
          = ( eigen__0 @ eigen__47 ) ) ) ),
    introduced(definition,[new_symbols(definition,[sP4])]) ).

thf(sP5,plain,
    ( sP5
  <=> ( ( eigen__0 @ eigen__47 )
      = ( ^ [X1: $i] : ( cS @ ( eigen__0 @ X1 @ X1 ) ) ) ) ),
    introduced(definition,[new_symbols(definition,[sP5])]) ).

thf(sP6,plain,
    ( sP6
  <=> ! [X1: $i] :
        ( ( cS @ ( eigen__0 @ X1 @ X1 ) )
        = ( eigen__0 @ eigen__47 @ X1 ) ) ),
    introduced(definition,[new_symbols(definition,[sP6])]) ).

thf(sP7,plain,
    ( sP7
  <=> ( sP5
     => ( ( ^ [X1: $i] : ( cS @ ( eigen__0 @ X1 @ X1 ) ) )
        = ( eigen__0 @ eigen__47 ) ) ) ),
    introduced(definition,[new_symbols(definition,[sP7])]) ).

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

thf(sP9,plain,
    ( sP9
  <=> ( sP1
     => sP8 ) ),
    introduced(definition,[new_symbols(definition,[sP9])]) ).

thf(sP10,plain,
    ( sP10
  <=> ! [X1: $i > $i,X2: $i > $i] :
        ( ( X1 = X2 )
       => ( X2 = X1 ) ) ),
    introduced(definition,[new_symbols(definition,[sP10])]) ).

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

thf(sP12,plain,
    ( sP12
  <=> ( ( ^ [X1: $i] : ( cS @ ( eigen__0 @ X1 @ X1 ) ) )
      = ( eigen__0 @ eigen__47 ) ) ),
    introduced(definition,[new_symbols(definition,[sP12])]) ).

thf(cTHM6,conjecture,
    sP9 ).

thf(h2,negated_conjecture,
    ~ sP9,
    inference(assume_negation,[status(cth)],[cTHM6]) ).

thf(1,plain,
    ( ~ sP6
    | sP3 ),
    inference(all_rule,[status(thm)],]) ).

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

thf(3,plain,
    ( ~ sP1
    | ~ sP3 ),
    inference(all_rule,[status(thm)],]) ).

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

thf(5,plain,
    ( ~ sP4
    | sP7 ),
    inference(all_rule,[status(thm)],]) ).

thf(6,plain,
    ( ~ sP10
    | sP4 ),
    inference(all_rule,[status(thm)],]) ).

thf(7,plain,
    ( sP2
    | sP5 ),
    inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__47]) ).

thf(8,plain,
    ( ~ sP11
    | ~ sP2 ),
    inference(all_rule,[status(thm)],]) ).

thf(9,plain,
    sP10,
    inference(eq_sym,[status(thm)],]) ).

thf(10,plain,
    ( sP8
    | sP11 ),
    inference(eigen_choice_rule,[status(thm),assumptions([h1])],[h1,eigendef_eigen__0]) ).

thf(11,plain,
    ( sP9
    | ~ sP8 ),
    inference(prop_rule,[status(thm)],]) ).

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYO219^5 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.12/0.33  % Computer : n008.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 01:51:23 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 157.47/150.24  % SZS status Theorem
% 157.47/150.24  % Mode: mode446
% 157.47/150.24  % Inferences: 1308
% 157.47/150.24  % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------