TSTP Solution File: PHI022+1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : PHI022+1 : TPTP v8.1.2. Released v7.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -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 : Tue Aug 22 10:53:32 EDT 2023

% Result   : Theorem 3.89s 1.96s
% Output   : CNFRefutation 3.89s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   56
% Syntax   : Number of formulae    :   71 (   6 unt;  49 typ;   0 def)
%            Number of atoms       :   43 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   35 (  14   ~;  11   |;   3   &)
%                                         (   2 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   67 (  48   >;  19   *;   0   +;   0  <<)
%            Number of predicates  :   49 (  48 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   15 (;  15   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ sameKind > objectOf > modification > knowledgeOfEffect > ideateOf > haveNothingInCommon > externalTo > existsIn > effectNecessarilyFollowsFrom > determinedByItselfAlone > determinedByFixedMethod > determinedByDefiniteMethod > correspondWith > conceptionInvolves > conceivedThru > canBeUnderstoodInTermsOf > canBeLimitedBy > attributeOf > actionOf > trueIdea > substance > selfCaused > necessary > natureConcOnlyByExistence > mode > knowledgeOfACause > isMethodExistence > isMethodAction > intPercAsConstEssSub > inItself > hasEssence > god > free > finiteAfterItsKind > expressesInfiniteEssentiality > expressesEternalEssentiality > existsOnlyByNecessityOfOwnNature > exists > existConcFollowFromDefEternal > eternity > essenceInvExistence > definiteCause > constInInfAttributes > conceivedThruItself > canBeConceivedAsNonExisting > being > attribute > absolutelyInfinite > #nlpp > #skF_1

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(being,type,
    being: $i > $o ).

tff(externalTo,type,
    externalTo: ( $i * $i ) > $o ).

tff(isMethodAction,type,
    isMethodAction: $i > $o ).

tff(intPercAsConstEssSub,type,
    intPercAsConstEssSub: $i > $o ).

tff(necessary,type,
    necessary: $i > $o ).

tff(attributeOf,type,
    attributeOf: ( $i * $i ) > $o ).

tff(finiteAfterItsKind,type,
    finiteAfterItsKind: $i > $o ).

tff(existsIn,type,
    existsIn: ( $i * $i ) > $o ).

tff(definiteCause,type,
    definiteCause: $i > $o ).

tff(trueIdea,type,
    trueIdea: $i > $o ).

tff(substance,type,
    substance: $i > $o ).

tff(free,type,
    free: $i > $o ).

tff(knowledgeOfACause,type,
    knowledgeOfACause: $i > $o ).

tff(attribute,type,
    attribute: $i > $o ).

tff(canBeUnderstoodInTermsOf,type,
    canBeUnderstoodInTermsOf: ( $i * $i ) > $o ).

tff(god,type,
    god: $i > $o ).

tff(existsOnlyByNecessityOfOwnNature,type,
    existsOnlyByNecessityOfOwnNature: $i > $o ).

tff(correspondWith,type,
    correspondWith: ( $i * $i ) > $o ).

tff(essenceInvExistence,type,
    essenceInvExistence: $i > $o ).

tff(ideateOf,type,
    ideateOf: ( $i * $i ) > $o ).

tff(mode,type,
    mode: $i > $o ).

tff(haveNothingInCommon,type,
    haveNothingInCommon: ( $i * $i ) > $o ).

tff('#skF_1',type,
    '#skF_1': $i ).

tff(effectNecessarilyFollowsFrom,type,
    effectNecessarilyFollowsFrom: ( $i * $i ) > $o ).

tff(actionOf,type,
    actionOf: ( $i * $i ) > $o ).

tff(isMethodExistence,type,
    isMethodExistence: $i > $o ).

tff(determinedByDefiniteMethod,type,
    determinedByDefiniteMethod: ( $i * $i ) > $o ).

tff(expressesInfiniteEssentiality,type,
    expressesInfiniteEssentiality: $i > $o ).

tff(modification,type,
    modification: ( $i * $i ) > $o ).

tff(eternity,type,
    eternity: $i > $o ).

tff(determinedByFixedMethod,type,
    determinedByFixedMethod: ( $i * $i ) > $o ).

tff(selfCaused,type,
    selfCaused: $i > $o ).

tff(hasEssence,type,
    hasEssence: $i > $o ).

tff(determinedByItselfAlone,type,
    determinedByItselfAlone: ( $i * $i ) > $o ).

tff(inItself,type,
    inItself: $i > $o ).

tff(objectOf,type,
    objectOf: ( $i * $i ) > $o ).

tff(canBeConceivedAsNonExisting,type,
    canBeConceivedAsNonExisting: $i > $o ).

tff(conceivedThru,type,
    conceivedThru: ( $i * $i ) > $o ).

tff(absolutelyInfinite,type,
    absolutelyInfinite: $i > $o ).

tff(conceivedThruItself,type,
    conceivedThruItself: $i > $o ).

tff(canBeLimitedBy,type,
    canBeLimitedBy: ( $i * $i ) > $o ).

tff(conceptionInvolves,type,
    conceptionInvolves: ( $i * $i ) > $o ).

tff(natureConcOnlyByExistence,type,
    natureConcOnlyByExistence: $i > $o ).

tff(knowledgeOfEffect,type,
    knowledgeOfEffect: ( $i * $i ) > $o ).

tff(exists,type,
    exists: $i > $o ).

tff(constInInfAttributes,type,
    constInInfAttributes: $i > $o ).

tff(existConcFollowFromDefEternal,type,
    existConcFollowFromDefEternal: $i > $o ).

tff(expressesEternalEssentiality,type,
    expressesEternalEssentiality: $i > $o ).

tff(sameKind,type,
    sameKind: ( $i * $i ) > $o ).

tff(f_272,negated_conjecture,
    ~ ! [X] :
        ( substance(X)
       => exists(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',has_substance_exists) ).

tff(f_253,axiom,
    ! [X] :
      ( substance(X)
     => being(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',has_substance_being) ).

tff(f_75,axiom,
    ! [X] :
      ( substance(X)
    <=> ( inItself(X)
        & conceivedThruItself(X) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/PHI002+0.ax',substance) ).

tff(f_257,axiom,
    ! [X] :
      ( inItself(X)
     => selfCaused(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',is_in_itself_is_self_caused) ).

tff(f_59,axiom,
    ! [X] :
      ( selfCaused(X)
    <=> ( essenceInvExistence(X)
        & natureConcOnlyByExistence(X) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/PHI002+0.ax',self_caused) ).

tff(f_261,axiom,
    ! [X] :
      ( being(X)
     => hasEssence(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',being_has_essense) ).

tff(f_267,axiom,
    ! [X] :
      ( ( essenceInvExistence(X)
        & hasEssence(X) )
     => exists(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',essence_involves_existence_exists) ).

tff(c_122,plain,
    substance('#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_272]) ).

tff(c_173,plain,
    ! [X_51] :
      ( being(X_51)
      | ~ substance(X_51) ),
    inference(cnfTransformation,[status(thm)],[f_253]) ).

tff(c_181,plain,
    being('#skF_1'),
    inference(resolution,[status(thm)],[c_122,c_173]) ).

tff(c_153,plain,
    ! [X_47] :
      ( inItself(X_47)
      | ~ substance(X_47) ),
    inference(cnfTransformation,[status(thm)],[f_75]) ).

tff(c_161,plain,
    inItself('#skF_1'),
    inference(resolution,[status(thm)],[c_122,c_153]) ).

tff(c_133,plain,
    ! [X_43] :
      ( selfCaused(X_43)
      | ~ inItself(X_43) ),
    inference(cnfTransformation,[status(thm)],[f_257]) ).

tff(c_6,plain,
    ! [X_1] :
      ( essenceInvExistence(X_1)
      | ~ selfCaused(X_1) ),
    inference(cnfTransformation,[status(thm)],[f_59]) ).

tff(c_183,plain,
    ! [X_53] :
      ( essenceInvExistence(X_53)
      | ~ inItself(X_53) ),
    inference(resolution,[status(thm)],[c_133,c_6]) ).

tff(c_191,plain,
    essenceInvExistence('#skF_1'),
    inference(resolution,[status(thm)],[c_161,c_183]) ).

tff(c_116,plain,
    ! [X_32] :
      ( hasEssence(X_32)
      | ~ being(X_32) ),
    inference(cnfTransformation,[status(thm)],[f_261]) ).

tff(c_245,plain,
    ! [X_84] :
      ( exists(X_84)
      | ~ hasEssence(X_84)
      | ~ essenceInvExistence(X_84) ),
    inference(cnfTransformation,[status(thm)],[f_267]) ).

tff(c_266,plain,
    ! [X_92] :
      ( exists(X_92)
      | ~ essenceInvExistence(X_92)
      | ~ being(X_92) ),
    inference(resolution,[status(thm)],[c_116,c_245]) ).

tff(c_120,plain,
    ~ exists('#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_272]) ).

tff(c_269,plain,
    ( ~ essenceInvExistence('#skF_1')
    | ~ being('#skF_1') ),
    inference(resolution,[status(thm)],[c_266,c_120]) ).

tff(c_273,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_181,c_191,c_269]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : PHI022+1 : TPTP v8.1.2. Released v7.4.0.
% 0.00/0.14  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.35  % Computer : n028.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 : Thu Aug  3 18:52:09 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 3.89/1.96  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.89/1.96  
% 3.89/1.96  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.89/1.99  
% 3.89/1.99  Inference rules
% 3.89/1.99  ----------------------
% 3.89/1.99  #Ref     : 0
% 3.89/1.99  #Sup     : 25
% 3.89/1.99  #Fact    : 0
% 3.89/1.99  #Define  : 0
% 3.89/1.99  #Split   : 1
% 3.89/1.99  #Chain   : 0
% 3.89/1.99  #Close   : 0
% 3.89/1.99  
% 3.89/1.99  Ordering : KBO
% 3.89/1.99  
% 3.89/1.99  Simplification rules
% 3.89/1.99  ----------------------
% 3.89/1.99  #Subsume      : 5
% 3.89/1.99  #Demod        : 3
% 3.89/1.99  #Tautology    : 11
% 3.89/1.99  #SimpNegUnit  : 0
% 3.89/1.99  #BackRed      : 0
% 3.89/1.99  
% 3.89/1.99  #Partial instantiations: 0
% 3.89/1.99  #Strategies tried      : 1
% 3.89/1.99  
% 3.89/1.99  Timing (in seconds)
% 3.89/1.99  ----------------------
% 3.89/1.99  Preprocessing        : 0.58
% 3.89/1.99  Parsing              : 0.30
% 3.89/1.99  CNF conversion       : 0.05
% 3.89/1.99  Main loop            : 0.33
% 3.89/1.99  Inferencing          : 0.11
% 3.89/1.99  Reduction            : 0.08
% 3.89/1.99  Demodulation         : 0.06
% 3.89/1.99  BG Simplification    : 0.03
% 3.89/1.99  Subsumption          : 0.08
% 3.89/1.99  Abstraction          : 0.01
% 3.89/1.99  MUC search           : 0.00
% 3.89/1.99  Cooper               : 0.00
% 3.89/1.99  Total                : 0.96
% 3.89/1.99  Index Insertion      : 0.00
% 3.89/1.99  Index Deletion       : 0.00
% 3.89/1.99  Index Matching       : 0.00
% 3.89/1.99  BG Taut test         : 0.00
%------------------------------------------------------------------------------