↑ Up

Satallax---3.5.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Satallax---3.5
% Problem  : SYO885^1.055.005 : TPTP v9.2.0. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s

% Computer : n016.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 03:26:25 PM UTC 2025

% Result   : Theorem 18.60s 18.90s
% Output   : Proof 18.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   14 (   5 unt;   0 typ;   0 def)
%            Number of atoms       :  389 (  30 equ;   0 cnn)
%            Maximal formula atoms :    6 (  27 avg)
%            Number of connectives :  376 (  46   ~;  13   |;   0   &; 300   @)
%                                         (   0 <=>;  17  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :   15 (  15   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   16 (  14 usr;  15 con; 0-2 aty)
%            Number of variables   :    3 (   0   ^;   3   !;   0   ?;   3   :)

% Comments : 
%------------------------------------------------------------------------------
thf(goal,conjecture,
    ~ ! [X1: $i > $i > $i > $i > $i > $i] :
        ( ~ ( ~ ( ~ ( ( ( X1 @ a2 @ a4 @ a3 @ a0 @ a1 )
                      = ( f @ a0 @ a4 @ a3 @ a3 @ a1 ) )
                   => ( ( X1 @ a2 @ a3 @ a1 @ a0 @ a4 )
                     != ( f @ a0 @ a3 @ a3 @ a1 @ a4 ) ) )
               => ( ( X1 @ a2 @ a1 @ a0 @ a4 @ a3 )
                 != ( f @ a0 @ a1 @ a3 @ a0 @ a3 ) ) )
           => ( ( X1 @ a1 @ a4 @ a0 @ a3 @ a2 )
             != ( f @ a0 @ a4 @ a3 @ a0 @ a2 ) ) )
       => ( ( X1 @ a1 @ a2 @ a4 @ a3 @ a0 )
         != ( f @ a0 @ a2 @ a3 @ a4 @ a0 ) ) ) ).

thf(h0,negated_conjecture,
    ! [X1: $i > $i > $i > $i > $i > $i] :
      ( ~ ( ~ ( ~ ( ( ( X1 @ a2 @ a4 @ a3 @ a0 @ a1 )
                    = ( f @ a0 @ a4 @ a3 @ a3 @ a1 ) )
                 => ( ( X1 @ a2 @ a3 @ a1 @ a0 @ a4 )
                   != ( f @ a0 @ a3 @ a3 @ a1 @ a4 ) ) )
             => ( ( X1 @ a2 @ a1 @ a0 @ a4 @ a3 )
               != ( f @ a0 @ a1 @ a3 @ a0 @ a3 ) ) )
         => ( ( X1 @ a1 @ a4 @ a0 @ a3 @ a2 )
           != ( f @ a0 @ a4 @ a3 @ a0 @ a2 ) ) )
     => ( ( X1 @ a1 @ a2 @ a4 @ a3 @ a0 )
       != ( f @ a0 @ a2 @ a3 @ a4 @ a0 ) ) ),
    inference(assume_negation,[status(cth)],[goal]) ).

thf(pax11,axiom,
    ( p11
   => ( ~ ( ~ ( ~ ( ( ( ff @ fa0 @ fa4 @ fa3 @ fa3 @ fa1 )
                    = ( ff @ fa0 @ fa4 @ fa3 @ fa3 @ fa1 ) )
                 => ( ( ff @ fa0 @ fa3 @ fa3 @ fa1 @ fa4 )
                   != ( ff @ fa0 @ fa3 @ fa3 @ fa1 @ fa4 ) ) )
             => ( ( ff @ fa0 @ fa1 @ fa3 @ fa0 @ fa3 )
               != ( ff @ fa0 @ fa1 @ fa3 @ fa0 @ fa3 ) ) )
         => ( ( ff @ fa0 @ fa4 @ fa3 @ fa0 @ fa2 )
           != ( ff @ fa0 @ fa4 @ fa3 @ fa0 @ fa2 ) ) )
     => ( ( ff @ fa0 @ fa2 @ fa3 @ fa4 @ fa0 )
       != ( ff @ fa0 @ fa2 @ fa3 @ fa4 @ fa0 ) ) ) ),
    file('<stdin>',pax11) ).

thf(ax1017,axiom,
    ( ~ p1
    | p11 ),
    file('<stdin>',ax1017) ).

thf(ax1027,axiom,
    p1,
    file('<stdin>',ax1027) ).

thf(c_0_3,plain,
    ( ~ p11
    | ( ( ff @ fa0 @ fa4 @ fa3 @ fa3 @ fa1 )
     != ( ff @ fa0 @ fa4 @ fa3 @ fa3 @ fa1 ) )
    | ( ( ff @ fa0 @ fa3 @ fa3 @ fa1 @ fa4 )
     != ( ff @ fa0 @ fa3 @ fa3 @ fa1 @ fa4 ) )
    | ( ( ff @ fa0 @ fa1 @ fa3 @ fa0 @ fa3 )
     != ( ff @ fa0 @ fa1 @ fa3 @ fa0 @ fa3 ) )
    | ( ( ff @ fa0 @ fa4 @ fa3 @ fa0 @ fa2 )
     != ( ff @ fa0 @ fa4 @ fa3 @ fa0 @ fa2 ) )
    | ( ( ff @ fa0 @ fa2 @ fa3 @ fa4 @ fa0 )
     != ( ff @ fa0 @ fa2 @ fa3 @ fa4 @ fa0 ) ) ),
    inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[pax11])]) ).

thf(c_0_4,plain,
    ( ~ p1
    | p11 ),
    inference(fof_simplification,[status(thm)],[ax1017]) ).

thf(c_0_5,plain,
    ( ~ p11
    | ( ( ff @ fa0 @ fa4 @ fa3 @ fa3 @ fa1 )
     != ( ff @ fa0 @ fa4 @ fa3 @ fa3 @ fa1 ) )
    | ( ( ff @ fa0 @ fa3 @ fa3 @ fa1 @ fa4 )
     != ( ff @ fa0 @ fa3 @ fa3 @ fa1 @ fa4 ) )
    | ( ( ff @ fa0 @ fa1 @ fa3 @ fa0 @ fa3 )
     != ( ff @ fa0 @ fa1 @ fa3 @ fa0 @ fa3 ) )
    | ( ( ff @ fa0 @ fa4 @ fa3 @ fa0 @ fa2 )
     != ( ff @ fa0 @ fa4 @ fa3 @ fa0 @ fa2 ) )
    | ( ( ff @ fa0 @ fa2 @ fa3 @ fa4 @ fa0 )
     != ( ff @ fa0 @ fa2 @ fa3 @ fa4 @ fa0 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_6,plain,
    ( p11
    | ~ p1 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_7,plain,
    p1,
    inference(split_conjunct,[status(thm)],[ax1027]) ).

thf(c_0_8,plain,
    ~ p11,
    inference(cn,[status(thm)],[c_0_5]) ).

thf(c_0_9,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]),c_0_8]),
    [proof] ).

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

thf(0,theorem,
    ~ ! [X1: $i > $i > $i > $i > $i > $i] :
        ( ~ ( ~ ( ~ ( ( ( X1 @ a2 @ a4 @ a3 @ a0 @ a1 )
                      = ( f @ a0 @ a4 @ a3 @ a3 @ a1 ) )
                   => ( ( X1 @ a2 @ a3 @ a1 @ a0 @ a4 )
                     != ( f @ a0 @ a3 @ a3 @ a1 @ a4 ) ) )
               => ( ( X1 @ a2 @ a1 @ a0 @ a4 @ a3 )
                 != ( f @ a0 @ a1 @ a3 @ a0 @ a3 ) ) )
           => ( ( X1 @ a1 @ a4 @ a0 @ a3 @ a2 )
             != ( f @ a0 @ a4 @ a3 @ a0 @ a2 ) ) )
       => ( ( X1 @ a1 @ a2 @ a4 @ a3 @ a0 )
         != ( f @ a0 @ a2 @ a3 @ a4 @ a0 ) ) ),
    inference(contra,[status(thm),contra(discharge,[h0])],[1,h0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYO885^1.055.005 : TPTP v9.2.0. Released v7.5.0.
% 0.11/0.12  % Command  : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.12/0.33  % Computer : n016.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  : 300
% 0.12/0.33  % DateTime : Thu Oct  9 01:07:23 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 18.60/18.90  % SZS status Theorem
% 18.60/18.90  % Mode: mode485
% 18.60/18.90  % Inferences: 535
% 18.60/18.90  % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------