↑ Up

Satallax---3.5.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Satallax---3.5
% Problem  : SET162^5 : TPTP v9.2.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 : n001.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 : Thu Oct  9 02:25:28 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
thf(ty_a,type,
    a: $tType ).

thf(ty_eigen__0,type,
    eigen__0: a > $o ).

thf(cBOOL_PROP_60_pme,conjecture,
    ! [X1: a > $o] : ( X1 = X1 ) ).

thf(h0,negated_conjecture,
    ~ ! [X1: a > $o] : ( X1 = X1 ),
    inference(assume_negation,[status(cth)],[cBOOL_PROP_60_pme]) ).

thf(h1,assumption,
    eigen__0 != eigen__0,
    introduced(assumption,[]) ).

thf(1,plain,
    $false,
    inference(tab_negrefl,[status(thm),assumptions([h1,h0])],[h1]) ).

thf(2,plain,
    $false,
    inference(tab_negall,[status(thm),assumptions([h0]),tab_negall(discharge,[h1]),tab_negall(eigenvar,eigen__0)],[h0,1,h1]) ).

thf(0,theorem,
    ! [X1: a > $o] : ( X1 = X1 ),
    inference(contra,[status(thm),contra(discharge,[h0])],[2,h0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET162^5 : TPTP v9.2.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.34  % Computer : n001.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Wed Oct  8 14:54:08 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 0.12/0.35  % SZS status Theorem
% 0.12/0.35  % Mode: mode213
% 0.12/0.35  % Inferences: 0
% 0.12/0.35  % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------