↑ Up

Lash---1.13.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Lash---1.13
% Problem  : CSR119^2 : TPTP v9.2.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : lash -P picomus -M modes -p tstp -t %d %s

% Computer : n031.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:22:43 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
thf(ty_lBill_THFTYPE_i,type,
    lBill_THFTYPE_i: $i ).

thf(ty_n2009_THFTYPE_i,type,
    n2009_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_holdsDuring_THFTYPE_IiooI,type,
    holdsDuring_THFTYPE_IiooI: $i > $o > $o ).

thf(ty_lYearFn_THFTYPE_IiiI,type,
    lYearFn_THFTYPE_IiiI: $i > $i ).

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

thf(sP1,plain,
    ( sP1
  <=> ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
      @ ~ ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
         => ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ) ) ),
    introduced(definition,[new_symbols(definition,[sP1])]) ).

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

thf(sP3,plain,
    ( sP3
  <=> ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ sP2 ) ),
    introduced(definition,[new_symbols(definition,[sP3])]) ).

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

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

thf(sP6,plain,
    ( sP6
  <=> ( ( ~ sP4 ) = sP2 ) ),
    introduced(definition,[new_symbols(definition,[sP6])]) ).

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

thf(sP8,plain,
    ( sP8
  <=> ( ( ~ sP4 ) = sP7 ) ),
    introduced(definition,[new_symbols(definition,[sP8])]) ).

thf(sP9,plain,
    ( sP9
  <=> ! [X1: $i] :
        ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ X1 @ lBill_THFTYPE_i ) ) ),
    introduced(definition,[new_symbols(definition,[sP9])]) ).

thf(sP10,plain,
    ( sP10
  <=> ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ sP7 ) ),
    introduced(definition,[new_symbols(definition,[sP10])]) ).

thf(con,conjecture,
    ~ sP9 ).

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

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

thf(2,plain,
    ( ~ sP1
    | sP3
    | ~ sP6
    | sP5 ),
    inference(mating_rule,[status(thm)],[]) ).

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

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

thf(5,plain,
    ( ~ sP1
    | sP10
    | ~ sP8
    | sP5 ),
    inference(mating_rule,[status(thm)],[]) ).

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

thf(7,plain,
    ( sP4
    | sP7 ),
    inference(prop_rule,[status(thm)],[]) ).

thf(8,plain,
    ~ sP5,
    inference(prop_rule,[status(thm)],[]) ).

thf(9,plain,
    ( ~ sP9
    | ~ sP3 ),
    inference(all_rule,[status(thm)],[]) ).

thf(10,plain,
    ( ~ sP9
    | ~ sP10 ),
    inference(all_rule,[status(thm)],[]) ).

thf(ax26,axiom,
    sP1 ).

thf(11,plain,
    $false,
    inference(prop_unsat,[status(thm),assumptions([h0])],[1,2,3,4,5,6,7,8,9,10,h0,ax26]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem  : CSR119^2 : TPTP v9.2.0. Released v4.1.0.
% 0.08/0.13  % Command  : lash -P picomus -M modes -p tstp -t %d %s
% 0.14/0.34  % Computer : n031.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Wed Oct  8 16:56:23 EDT 2025
% 0.14/0.34  % CPUTime  : 
% 1.95/2.12  % SZS status Theorem
% 1.95/2.12  % Mode: cade22sinegrackle2x6978
% 1.95/2.12  % Steps: 21540
% 1.95/2.12  % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------