TSTP Solution File: SYO023^1 by Satallax---3.5

View Problem - Process Solution

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

% Computer : n006.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:29:36 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
thf(conj,conjecture,
    ( ( ^ [X1: $o,X2: $o] :
          ~ ( X1
           => ~ X2 ) )
    = ( ^ [X1: $o,X2: $o] :
          ~ ( X1
           => ~ X2 ) ) ) ).

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

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

thf(0,theorem,
    ( ( ^ [X1: $o,X2: $o] :
          ~ ( X1
           => ~ X2 ) )
    = ( ^ [X1: $o,X2: $o] :
          ~ ( X1
           => ~ X2 ) ) ),
    inference(contra,[status(thm),contra(discharge,[h0])],[1,h0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : SYO023^1 : TPTP v8.1.0. Released v3.7.0.
% 0.03/0.13  % Command  : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.13/0.35  % Computer : n006.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  : 600
% 0.13/0.35  % DateTime : Fri Jul  8 18:37:51 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.13/0.37  % SZS status Theorem
% 0.13/0.37  % Mode: mode213
% 0.13/0.37  % Inferences: 0
% 0.13/0.37  % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------