↑ Up

Satallax---3.5.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Satallax---3.5
% Problem  : CSR153^3 : TPTP v9.2.0. Released v5.3.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  : 300s
% DateTime : Thu Oct  9 01:24:08 PM UTC 2025

% Result   : Theorem 23.46s 23.65s
% Output   : Proof 23.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   21 (   9 unt;   0 typ;   0 def)
%            Number of atoms       :   48 (   3 equ;   0 cnn)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   62 (  23   ~;  11   |;   0   &;  18   @)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    6 (   6   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (   8 usr;  10 con; 0-2 aty)
%                                         (   3  !!;   0  ??;   0 @@+;   0 @@-)
%            Number of variables   :   10 (   0   ^;  10   !;   0   ?;  10   :)

% Comments : 
%------------------------------------------------------------------------------
thf(con,conjecture,
    ~ ! [X1: $i > $i > $o] :
        ( ~ ( ( X1 @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
           => ~ ( X1 @ lSue_THFTYPE_i @ lBob_THFTYPE_i ) )
       => ! [X2: $i] : ( !! @ ( X1 @ X2 ) ) ) ).

thf(h0,negated_conjecture,
    ! [X1: $i > $i > $o] :
      ( ~ ( ( X1 @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
         => ~ ( X1 @ lSue_THFTYPE_i @ lBob_THFTYPE_i ) )
     => ! [X2: $i] : ( !! @ ( X1 @ X2 ) ) ),
    inference(assume_negation,[status(cth)],[con]) ).

thf(ax1199,axiom,
    ( ~ p1
    | p21 ),
    file('<stdin>',ax1199) ).

thf(pax66,axiom,
    ( p66
   => ! [X1: $i,X2: $i] : ( flSue_THFTYPE_i != X2 ) ),
    file('<stdin>',pax66) ).

thf(ax1162,axiom,
    ( ~ p21
    | p2
    | p66 ),
    file('<stdin>',ax1162) ).

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

thf(ax1219,axiom,
    ~ p2,
    file('<stdin>',ax1219) ).

thf(c_0_5,plain,
    ( ~ p1
    | p21 ),
    inference(fof_simplification,[status(thm)],[ax1199]) ).

thf(c_0_6,plain,
    ! [X2498: $i] :
      ( ~ p66
      | ( flSue_THFTYPE_i != X2498 ) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[pax66])])])]) ).

thf(c_0_7,plain,
    ( ~ p21
    | p2
    | p66 ),
    inference(fof_simplification,[status(thm)],[ax1162]) ).

thf(c_0_8,plain,
    ( p21
    | ~ p1 ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_9,plain,
    p1,
    inference(split_conjunct,[status(thm)],[ax1220]) ).

thf(c_0_10,plain,
    ~ p2,
    inference(fof_simplification,[status(thm)],[ax1219]) ).

thf(c_0_11,plain,
    ! [X1: $i] :
      ( ~ p66
      | ( flSue_THFTYPE_i != X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_12,plain,
    ( p2
    | p66
    | ~ p21 ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_13,plain,
    p21,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).

thf(c_0_14,plain,
    ~ p2,
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

thf(c_0_15,plain,
    ~ p66,
    inference(er,[status(thm)],[c_0_11]) ).

thf(c_0_16,plain,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]),c_0_14]),c_0_15]),
    [proof] ).

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

thf(0,theorem,
    ~ ! [X1: $i > $i > $o] :
        ( ~ ( ( X1 @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
           => ~ ( X1 @ lSue_THFTYPE_i @ lBob_THFTYPE_i ) )
       => ! [X2: $i] : ( !! @ ( X1 @ X2 ) ) ),
    inference(contra,[status(thm),contra(discharge,[h0])],[1,h0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : CSR153^3 : TPTP v9.2.0. Released v5.3.0.
% 0.12/0.13  % Command  : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.12/0.34  % Computer : n006.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 16:54:53 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 23.46/23.65  % SZS status Theorem
% 23.46/23.65  % Mode: mode485:USE_SINE=true:SINE_TOLERANCE=1.2:SINE_GENERALITY_THRESHOLD=4:SINE_RANK_LIMIT=4.:SINE_DEPTH=0
% 23.46/23.65  % Inferences: 47
% 23.46/23.65  % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------