↑ Up

Satallax---3.5.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Satallax---3.5
% Problem  : CSR139^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 : n028.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:02 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
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(ty_lAnna_THFTYPE_i,type,
    lAnna_THFTYPE_i: $i ).

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

thf(sP2,plain,
    ( sP2
  <=> ( ( ^ [X1: $i,X2: $i] : ( X1 != X2 ) )
      = ( ^ [X1: $i,X2: $i] :
          @+[X3: $o] : X3 ) ) ),
    introduced(definition,[new_symbols(definition,[sP2])]) ).

thf(sP3,plain,
    ( sP3
  <=> ! [X1: $i > $i > $o,X2: $i] :
        ( ~ ( ( X1 @ X2 @ lBill_THFTYPE_i )
           => ~ @+[X3: $o] : X3 )
       => ( X1
          = ( ^ [X3: $i,X4: $i] :
              @+[X5: $o] : X5 ) ) ) ),
    introduced(definition,[new_symbols(definition,[sP3])]) ).

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

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

thf(sP6,plain,
    ( sP6
  <=> ( ~ ( ~ sP5
         => ~ @+[X1: $o] : X1 )
     => sP2 ) ),
    introduced(definition,[new_symbols(definition,[sP6])]) ).

thf(sP7,plain,
    ( sP7
  <=> ( ~ sP5
     => ~ @+[X1: $o] : X1 ) ),
    introduced(definition,[new_symbols(definition,[sP7])]) ).

thf(sP8,plain,
    ( sP8
  <=> ( lMary_THFTYPE_i = lMary_THFTYPE_i ) ),
    introduced(definition,[new_symbols(definition,[sP8])]) ).

thf(sP9,plain,
    ( sP9
  <=> ( ( ~ sP8 )
      = ( @+[X1: $o] : X1 ) ) ),
    introduced(definition,[new_symbols(definition,[sP9])]) ).

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

thf(sP11,plain,
    ( sP11
  <=> $false ),
    introduced(definition,[new_symbols(definition,[sP11])]) ).

thf(sP12,plain,
    ( sP12
  <=> ! [X1: $i > $i > $o,X2: $i > $i > $o,X3: $i] :
        ( ~ ( ( X2 @ X3 @ lBill_THFTYPE_i )
           => ~ ( X1 @ X3 @ lAnna_THFTYPE_i ) )
       => ( X2 = X1 ) ) ),
    introduced(definition,[new_symbols(definition,[sP12])]) ).

thf(sP13,plain,
    ( sP13
  <=> ( sP5
     => sP10 ) ),
    introduced(definition,[new_symbols(definition,[sP13])]) ).

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

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

thf(sP16,plain,
    ( sP16
  <=> ! [X1: $i] :
        ( ~ ( ( X1 != lBill_THFTYPE_i )
           => ~ @+[X2: $o] : X2 )
       => sP2 ) ),
    introduced(definition,[new_symbols(definition,[sP16])]) ).

thf(sP17,plain,
    ( sP17
  <=> ! [X1: $i] :
        ( ( lMary_THFTYPE_i != X1 )
        = ( @+[X2: $o] : X2 ) ) ),
    introduced(definition,[new_symbols(definition,[sP17])]) ).

thf(sP18,plain,
    ( sP18
  <=> ( ( ^ [X1: $i] : ( lMary_THFTYPE_i != X1 ) )
      = ( ^ [X1: $i] :
          @+[X2: $o] : X2 ) ) ),
    introduced(definition,[new_symbols(definition,[sP18])]) ).

thf(sP19,plain,
    ( sP19
  <=> ! [X1: $i,X2: $i] :
        ( ( X1 = X2 )
       => ( X2 = X1 ) ) ),
    introduced(definition,[new_symbols(definition,[sP19])]) ).

thf(sP20,plain,
    ( sP20
  <=> @+[X1: $o] : X1 ),
    introduced(definition,[new_symbols(definition,[sP20])]) ).

thf(sP21,plain,
    ( sP21
  <=> ! [X1: $i] :
        ( ( ^ [X2: $i] : ( X1 != X2 ) )
        = ( ^ [X2: $i] : sP20 ) ) ),
    introduced(definition,[new_symbols(definition,[sP21])]) ).

thf(sP22,plain,
    ( sP22
  <=> ! [X1: $o] : ~ X1 ),
    introduced(definition,[new_symbols(definition,[sP22])]) ).

thf(con,conjecture,
    ~ sP12 ).

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

thf(1,plain,
    ( ~ sP7
    | sP5
    | ~ sP20 ),
    inference(prop_rule,[status(thm)],[]) ).

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

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

thf(4,plain,
    ( ~ sP17
    | sP9 ),
    inference(all_rule,[status(thm)],[]) ).

thf(5,plain,
    ( ~ sP18
    | sP17 ),
    inference(prop_rule,[status(thm)],[]) ).

thf(6,plain,
    ( ~ sP21
    | sP18 ),
    inference(all_rule,[status(thm)],[]) ).

thf(7,plain,
    ( ~ sP2
    | sP21 ),
    inference(prop_rule,[status(thm)],[]) ).

thf(8,plain,
    ( ~ sP16
    | sP6 ),
    inference(all_rule,[status(thm)],[]) ).

thf(9,plain,
    sP8,
    inference(prop_rule,[status(thm)],[]) ).

thf(10,plain,
    ( ~ sP3
    | sP16 ),
    inference(all_rule,[status(thm)],[]) ).

thf(11,plain,
    ~ sP11,
    inference(prop_rule,[status(thm)],[]) ).

thf(12,plain,
    ( ~ sP22
    | sP11 ),
    inference(all_rule,[status(thm)],[]) ).

thf(13,plain,
    ( sP20
    | sP22 ),
    inference(choice_rule,[status(thm)],[]) ).

thf(14,plain,
    ( ~ sP12
    | sP3 ),
    inference(all_rule,[status(thm)],[]) ).

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

thf(16,plain,
    ( ~ sP15
    | sP1
    | ~ sP4
    | ~ sP10 ),
    inference(mating_rule,[status(thm)],[]) ).

thf(17,plain,
    ( ~ sP13
    | ~ sP5
    | sP10 ),
    inference(prop_rule,[status(thm)],[]) ).

thf(18,plain,
    ( ~ sP14
    | sP13 ),
    inference(all_rule,[status(thm)],[]) ).

thf(19,plain,
    ( ~ sP19
    | sP14 ),
    inference(all_rule,[status(thm)],[]) ).

thf(20,plain,
    sP19,
    inference(eq_sym,[status(thm)],[]) ).

thf(ax_001,axiom,
    ~ sP1 ).

thf(ax,axiom,
    sP15 ).

thf(21,plain,
    $false,
    inference(prop_unsat,[status(thm),assumptions([h0])],[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,h0,ax_001,ax]) ).

thf(0,theorem,
    ~ sP12,
    inference(contra,[status(thm),contra(discharge,[h0])],[21,h0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : CSR139^1 : TPTP v9.2.0. Released v4.1.0.
% 0.07/0.13  % Command  : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.13/0.35  % Computer : n028.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  : 300
% 0.13/0.35  % DateTime : Wed Oct  8 16:59:38 EDT 2025
% 0.13/0.35  % CPUTime  : 
% 16.78/17.09  % SZS status Theorem
% 16.78/17.09  % Mode: mode473
% 16.78/17.09  % Inferences: 809
% 16.78/17.09  % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------