↑ Up

Satallax---3.5.THM-Prf.s

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

% Computer : n014.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:07 PM UTC 2025

% Result   : Theorem 0.14s 0.38s
% Output   : Proof 0.14s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
thf(ty_lChris_THFTYPE_i,type,
    lChris_THFTYPE_i: $i ).

thf(ty_likes_THFTYPE_IiioI,type,
    likes_THFTYPE_IiioI: $i > $i > $o ).

thf(ty_lMary_THFTYPE_i,type,
    lMary_THFTYPE_i: $i ).

thf(ty_lSue_THFTYPE_i,type,
    lSue_THFTYPE_i: $i ).

thf(ty_lBill_THFTYPE_i,type,
    lBill_THFTYPE_i: $i ).

thf(sP1,plain,
    ( sP1
  <=> ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i
      @ ! [X1: $i] :
          ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 )
         => ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ) ) ) ),
    introduced(definition,[new_symbols(definition,[sP1])]) ).

thf(sP2,plain,
    ( sP2
  <=> ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
     => ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
    introduced(definition,[new_symbols(definition,[sP2])]) ).

thf(sP3,plain,
    ( sP3
  <=> ( ( lChris_THFTYPE_i = lChris_THFTYPE_i )
      = ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
    introduced(definition,[new_symbols(definition,[sP3])]) ).

thf(sP4,plain,
    ( sP4
  <=> ( lChris_THFTYPE_i = lChris_THFTYPE_i ) ),
    introduced(definition,[new_symbols(definition,[sP4])]) ).

thf(sP5,plain,
    ( sP5
  <=> ( ( ! [X1: $i] :
            ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 )
           => ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ) ) )
      = ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
    introduced(definition,[new_symbols(definition,[sP5])]) ).

thf(sP6,plain,
    ( sP6
  <=> ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ),
    introduced(definition,[new_symbols(definition,[sP6])]) ).

thf(sP7,plain,
    ( sP7
  <=> ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
    introduced(definition,[new_symbols(definition,[sP7])]) ).

thf(sP8,plain,
    ( sP8
  <=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
    introduced(definition,[new_symbols(definition,[sP8])]) ).

thf(sP9,plain,
    ( sP9
  <=> ! [X1: $i] :
        ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 )
       => ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ) ) ),
    introduced(definition,[new_symbols(definition,[sP9])]) ).

thf(sP10,plain,
    ( sP10
  <=> ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ sP4 ) ),
    introduced(definition,[new_symbols(definition,[sP10])]) ).

thf(con,conjecture,
    sP7 ).

thf(h0,negated_conjecture,
    ~ sP7,
    inference(assume_negation,[status(cth)],[con]) ).

thf(1,plain,
    ( ~ sP9
    | sP2 ),
    inference(all_rule,[status(thm)],[]) ).

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

thf(3,plain,
    ( sP3
    | ~ sP4
    | ~ sP8 ),
    inference(prop_rule,[status(thm)],[]) ).

thf(4,plain,
    ( sP5
    | sP9
    | sP8 ),
    inference(prop_rule,[status(thm)],[]) ).

thf(5,plain,
    sP4,
    inference(prop_rule,[status(thm)],[]) ).

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

thf(7,plain,
    ( ~ sP1
    | sP7
    | ~ sP4
    | ~ sP5 ),
    inference(mating_rule,[status(thm)],[]) ).

thf(ax,axiom,
    sP10 ).

thf(ax_001,axiom,
    sP6 ).

thf(ax_002,axiom,
    sP1 ).

thf(8,plain,
    $false,
    inference(prop_unsat,[status(thm),assumptions([h0])],[1,2,3,4,5,6,7,ax,ax_001,ax_002,h0]) ).

thf(0,theorem,
    sP7,
    inference(contra,[status(thm),contra(discharge,[h0])],[8,h0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : CSR152^1 : TPTP v9.2.0. Released v4.1.0.
% 0.12/0.14  % Command  : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.14/0.35  % Computer : n014.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Wed Oct  8 17:02:08 EDT 2025
% 0.14/0.35  % CPUTime  : 
% 0.14/0.38  % SZS status Theorem
% 0.14/0.38  % Mode: mode213
% 0.14/0.38  % Inferences: 11
% 0.14/0.38  % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------