↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : PHI023+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300

% Computer : n013.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 : Fri Sep 25 02:30:19 PM UTC 2026

% Result   : Theorem 4.64s 6.09s
% Output   : Proof 4.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   45 (  11 unt;   0 def)
%            Number of atoms       :  134 (   0 equ)
%            Maximal formula atoms :   12 (   2 avg)
%            Number of connectives :  141 (  52   ~;  48   |;  31   &)
%                                         (   4 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   16 (  15 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   35 (   0 sgn  26   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f19,axiom,
    ! [X] :
      ( ( hasEssence(X)
        & essenceInvExistence(X) )
     => exists(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',essence_involves_existence_exists) ).

fof(f19_nnf,plain,
    ! [X] :
      ( exists(X)
      | ~ hasEssence(X)
      | ~ essenceInvExistence(X) ),
    inference(nnf_transformation,[status(thm)],[f19]) ).

fof(f19_sk,plain,
    ! [X] :
      ( exists(X)
      | ~ hasEssence(X)
      | ~ essenceInvExistence(X) ),
    inference(skolemisation,[status(esa)],[f19_nnf]) ).

cnf(c57,plain,
    ( exists(X0)
    | ~ hasEssence(X0)
    | ~ essenceInvExistence(X0) ),
    inference(cnf_transformation,[status(esa)],[f19_sk]) ).

fof(f17,axiom,
    ! [X] :
      ( inItself(X)
     => selfCaused(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',is_in_itself_is_self_caused) ).

fof(f17_nnf,plain,
    ! [X] :
      ( selfCaused(X)
      | ~ inItself(X) ),
    inference(nnf_transformation,[status(thm)],[f17]) ).

fof(f17_sk,plain,
    ! [X] :
      ( selfCaused(X)
      | ~ inItself(X) ),
    inference(skolemisation,[status(esa)],[f17_nnf]) ).

cnf(c55,plain,
    ( selfCaused(X0)
    | ~ inItself(X0) ),
    inference(cnf_transformation,[status(esa)],[f17_sk]) ).

fof(f6,axiom,
    ! [X,Y] :
      ( absolutelyInfinite(X)
    <=> ( ( attributeOf(Y,X)
         => ( expressesInfiniteEssentiality(Y)
            & expressesEternalEssentiality(Y) ) )
        & constInInfAttributes(X)
        & substance(X) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',absolutely_infinite) ).

fof(f6_nnf,plain,
    ! [X,Y] :
      ( ( ( ( ~ expressesInfiniteEssentiality(Y)
            | ~ expressesEternalEssentiality(Y) )
          & attributeOf(Y,X) )
        | ~ constInInfAttributes(X)
        | ~ substance(X)
        | absolutelyInfinite(X) )
      & ( ( ( ( expressesInfiniteEssentiality(Y)
              & expressesEternalEssentiality(Y) )
            | ~ attributeOf(Y,X) )
          & constInInfAttributes(X)
          & substance(X) )
        | ~ absolutelyInfinite(X) ) ),
    inference(nnf_transformation,[status(thm)],[f6]) ).

fof(f6_sk,plain,
    ! [X,Y] :
      ( ( ( ( ~ expressesInfiniteEssentiality(Y)
            | ~ expressesEternalEssentiality(Y) )
          & attributeOf(Y,X) )
        | ~ constInInfAttributes(X)
        | ~ substance(X)
        | absolutelyInfinite(X) )
      & ( ( ( ( expressesInfiniteEssentiality(Y)
              & expressesEternalEssentiality(Y) )
            | ~ attributeOf(Y,X) )
          & constInInfAttributes(X)
          & substance(X) )
        | ~ absolutelyInfinite(X) ) ),
    inference(skolemisation,[status(esa)],[f6_nnf]) ).

cnf(c20,plain,
    ( substance(X0)
    | ~ absolutelyInfinite(X0) ),
    inference(cnf_transformation,[status(esa)],[f6_sk]) ).

fof(f5,axiom,
    ! [X] :
      ( god(X)
    <=> ( absolutelyInfinite(X)
        & being(X) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',god) ).

fof(f5_nnf,plain,
    ! [X] :
      ( ( ~ absolutelyInfinite(X)
        | ~ being(X)
        | god(X) )
      & ( ( absolutelyInfinite(X)
          & being(X) )
        | ~ god(X) ) ),
    inference(nnf_transformation,[status(thm)],[f5]) ).

fof(f5_sk,plain,
    ! [X] :
      ( ( ~ absolutelyInfinite(X)
        | ~ being(X)
        | god(X) )
      & ( ( absolutelyInfinite(X)
          & being(X) )
        | ~ god(X) ) ),
    inference(skolemisation,[status(esa)],[f5_nnf]) ).

cnf(c18,plain,
    ( absolutelyInfinite(X0)
    | ~ god(X0) ),
    inference(cnf_transformation,[status(esa)],[f5_sk]) ).

fof(f20,conjecture,
    ! [X] :
      ( god(X)
     => exists(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',if_god_then_exists) ).

fof(f20_neg,negated_conjecture,
    ~ ! [X] :
        ( god(X)
       => exists(X) ),
    inference(negated_conjecture,[status(cth)],[f20]) ).

fof(f20_nnf,plain,
    ? [X] :
      ( ~ exists(X)
      & god(X) ),
    inference(nnf_transformation,[status(thm)],[f20_neg]) ).

fof(f20_sk,plain,
    ( ~ exists(sk0)
    & god(sk0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f20_nnf]) ).

cnf(c58,plain,
    god(sk0),
    inference(cnf_transformation,[status(esa)],[f20_sk]) ).

cnf(p61,plain,
    absolutelyInfinite(sk0),
    inference(resolution,[status(thm)],[c18,c58]) ).

cnf(p62,plain,
    substance(sk0),
    inference(resolution,[status(thm)],[c20,p61]) ).

fof(f2,axiom,
    ! [X] :
      ( substance(X)
    <=> ( conceivedThruItself(X)
        & inItself(X) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',substance) ).

fof(f2_nnf,plain,
    ! [X] :
      ( ( ~ conceivedThruItself(X)
        | ~ inItself(X)
        | substance(X) )
      & ( ( conceivedThruItself(X)
          & inItself(X) )
        | ~ substance(X) ) ),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [X] :
      ( ( ~ conceivedThruItself(X)
        | ~ inItself(X)
        | substance(X) )
      & ( ( conceivedThruItself(X)
          & inItself(X) )
        | ~ substance(X) ) ),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c6,plain,
    ( inItself(X0)
    | ~ substance(X0) ),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(p63,plain,
    inItself(sk0),
    inference(resolution,[status(thm)],[p62,c6]) ).

cnf(p66,plain,
    selfCaused(sk0),
    inference(resolution,[status(thm)],[c55,p63]) ).

fof(f0,axiom,
    ! [X] :
      ( selfCaused(X)
    <=> ( natureConcOnlyByExistence(X)
        & essenceInvExistence(X) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',self_caused) ).

fof(f0_nnf,plain,
    ! [X] :
      ( ( ~ natureConcOnlyByExistence(X)
        | ~ essenceInvExistence(X)
        | selfCaused(X) )
      & ( ( natureConcOnlyByExistence(X)
          & essenceInvExistence(X) )
        | ~ selfCaused(X) ) ),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [X] :
      ( ( ~ natureConcOnlyByExistence(X)
        | ~ essenceInvExistence(X)
        | selfCaused(X) )
      & ( ( natureConcOnlyByExistence(X)
          & essenceInvExistence(X) )
        | ~ selfCaused(X) ) ),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c0,plain,
    ( essenceInvExistence(X0)
    | ~ selfCaused(X0) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p67,plain,
    essenceInvExistence(sk0),
    inference(resolution,[status(thm)],[p66,c0]) ).

cnf(p71,plain,
    ( exists(sk0)
    | ~ hasEssence(sk0) ),
    inference(resolution,[status(thm)],[c57,p67]) ).

fof(f18,axiom,
    ! [X] :
      ( being(X)
     => hasEssence(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',being_has_essense) ).

fof(f18_nnf,plain,
    ! [X] :
      ( hasEssence(X)
      | ~ being(X) ),
    inference(nnf_transformation,[status(thm)],[f18]) ).

fof(f18_sk,plain,
    ! [X] :
      ( hasEssence(X)
      | ~ being(X) ),
    inference(skolemisation,[status(esa)],[f18_nnf]) ).

cnf(c56,plain,
    ( hasEssence(X0)
    | ~ being(X0) ),
    inference(cnf_transformation,[status(esa)],[f18_sk]) ).

cnf(c17,plain,
    ( being(X0)
    | ~ god(X0) ),
    inference(cnf_transformation,[status(esa)],[f5_sk]) ).

cnf(p60,plain,
    being(sk0),
    inference(resolution,[status(thm)],[c17,c58]) ).

cnf(p69,plain,
    hasEssence(sk0),
    inference(resolution,[status(thm)],[c56,p60]) ).

cnf(p72,plain,
    exists(sk0),
    inference(resolution,[status(thm)],[p71,p69]) ).

cnf(c59,plain,
    ~ exists(sk0),
    inference(cnf_transformation,[status(esa)],[f20_sk]) ).

cnf(p73,plain,
    $false,
    inference(resolution,[status(thm)],[p72,c59]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : PHI023+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/5.38  % Computer : n013.cluster.edu
% 0.10/5.38  % Model    : x86_64 x86_64
% 0.10/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38  % Memory   : 8046.5625MB
% 0.10/5.38  % OS       : Linux 6.8.0-71-generic
% 0.10/5.38  % CPULimit : 300
% 0.10/5.38  % WCLimit  : 300
% 0.10/5.38  % DateTime : Thu Sep 24 06:05:57 UTC 2026
% 0.10/5.38  % CPUTime  : 
% 0.10/5.38  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.64/6.09  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.64/6.09  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------