↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : PHI022+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n004.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun Sep 27 08:19:39 AM UTC 2026

% Result   : Theorem 12.57s 3.30s
% Output   : CNFRefutation 12.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   24 (   9 unt;   0 def)
%            Number of atoms       :   43 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   30 (  11   ~;   8   |;   3   &)
%                                         (   2 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   10 (   9 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   14 (   0 sgn   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(has_substance_being,axiom,
    ! [X0] :
      ( substance(X0)
     => being(X0) ) ).

fof(is_in_itself_is_self_caused,axiom,
    ! [X0] :
      ( inItself(X0)
     => selfCaused(X0) ) ).

fof(being_has_essense,axiom,
    ! [X0] :
      ( being(X0)
     => hasEssence(X0) ) ).

fof(essence_involves_existence_exists,axiom,
    ! [X0] :
      ( ( hasEssence(X0)
        & essenceInvExistence(X0) )
     => exists(X0) ) ).

fof(self_caused,axiom,
    ! [X0] :
      ( selfCaused(X0)
    <=> ( natureConcOnlyByExistence(X0)
        & essenceInvExistence(X0) ) ) ).

fof(substance,axiom,
    ! [X0] :
      ( substance(X0)
    <=> ( conceivedThruItself(X0)
        & inItself(X0) ) ) ).

fof(has_substance_exists,conjecture,
    ! [X0] :
      ( substance(X0)
     => exists(X0) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0] :
        ( substance(X0)
       => exists(X0) ),
    inference(negate_conjecture,[status(cth)],[has_substance_exists]) ).

cnf(c0,plain,
    ( being(X0)
    | ~ substance(X0) ),
    inference(clausification,[status(esa)],[has_substance_being]) ).

cnf(c1,plain,
    ( selfCaused(X0)
    | ~ inItself(X0) ),
    inference(clausification,[status(esa)],[is_in_itself_is_self_caused]) ).

cnf(c2,plain,
    ( hasEssence(X0)
    | ~ being(X0) ),
    inference(clausification,[status(esa)],[being_has_essense]) ).

cnf(c3,plain,
    ( exists(X0)
    | ~ hasEssence(X0)
    | ~ essenceInvExistence(X0) ),
    inference(clausification,[status(esa)],[essence_involves_existence_exists]) ).

cnf(c4,plain,
    ( essenceInvExistence(X0)
    | ~ selfCaused(X0) ),
    inference(clausification,[status(esa)],[self_caused]) ).

cnf(c10,plain,
    ( inItself(X0)
    | ~ substance(X0) ),
    inference(clausification,[status(esa)],[substance]) ).

cnf(c65,plain,
    substance(sK36),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c66,plain,
    ~ exists(sK36),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    inItself(sK36),
    inference(resolution,[status(thm)],[c10,c65]) ).

cnf(d1,plain,
    selfCaused(sK36),
    inference(resolution,[status(thm)],[d0,c1]) ).

cnf(d2,plain,
    essenceInvExistence(sK36),
    inference(resolution,[status(thm)],[d1,c4]) ).

cnf(d3,plain,
    ( exists(sK36)
    | ~ hasEssence(sK36) ),
    inference(resolution,[status(thm)],[d2,c3]) ).

cnf(d4,plain,
    ~ hasEssence(sK36),
    inference(resolution,[status(thm)],[c66,d3]) ).

cnf(d5,plain,
    being(sK36),
    inference(resolution,[status(thm)],[c0,c65]) ).

cnf(d6,plain,
    hasEssence(sK36),
    inference(resolution,[status(thm)],[c2,d5]) ).

cnf(d7,plain,
    $false,
    inference(resolution,[status(thm)],[d6,d4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : PHI022+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.06  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.43  % Computer : n004.cluster.edu
% 0.17/0.43  % Model    : x86_64 x86_64
% 0.17/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43  % Memory   : 8046.5625MB
% 0.17/0.43  % OS       : Linux 6.8.0-71-generic
% 0.17/0.43  % CPULimit : 300
% 0.17/0.43  % WCLimit  : 300
% 0.17/0.43  % DateTime : Sat Sep 26 04:40:09 UTC 2026
% 0.17/0.43  % CPUTime  : 
% 0.17/0.43  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.57/3.30  % SZS status Theorem for theBenchmark.p
% 12.57/3.30  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------