↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : PHI023+1 : TPTP v9.0.0. Released v7.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n009.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 : Wed Apr  9 08:22:26 PM UTC 2025

% Result   : Theorem 4.18s 2.53s
% Output   : CNFRefutation 4.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   28 (   7 unt;   0 typ;   0 def)
%            Number of atoms       :   59 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   51 (  20   ~;  15   |;   7   &)
%                                         (   4 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   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   :   21 (  21   !;   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_268,negated_conjecture,
    ~ ! [X] :
        ( god(X)
       => exists(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',if_god_then_exists) ).

tff(f_101,axiom,
    ! [X] :
      ( god(X)
    <=> ( being(X)
        & absolutelyInfinite(X) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/PHI002+0.ax',god) ).

tff(f_116,axiom,
    ! [X,Y] :
      ( absolutelyInfinite(X)
    <=> ( substance(X)
        & constInInfAttributes(X)
        & ( attributeOf(Y,X)
         => ( expressesEternalEssentiality(Y)
            & expressesInfiniteEssentiality(Y) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/PHI002+0.ax',absolutely_infinite) ).

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

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

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

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

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

tff(c_120,plain,
    god('#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_268]) ).

tff(c_159,plain,
    ! [X_46] :
      ( absolutelyInfinite(X_46)
      | ~ god(X_46) ),
    inference(cnfTransformation,[status(thm)],[f_101]) ).

tff(c_163,plain,
    absolutelyInfinite('#skF_1'),
    inference(resolution,[status(thm)],[c_120,c_159]) ).

tff(c_44,plain,
    ! [X_10] :
      ( substance(X_10)
      | ~ absolutelyInfinite(X_10) ),
    inference(cnfTransformation,[status(thm)],[f_116]) ).

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

tff(c_174,plain,
    ! [X_53] :
      ( inItself(X_53)
      | ~ absolutelyInfinite(X_53) ),
    inference(resolution,[status(thm)],[c_44,c_148]) ).

tff(c_139,plain,
    ! [X_42] :
      ( selfCaused(X_42)
      | ~ inItself(X_42) ),
    inference(cnfTransformation,[status(thm)],[f_253]) ).

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

tff(c_146,plain,
    ! [X_42] :
      ( essenceInvExistence(X_42)
      | ~ inItself(X_42) ),
    inference(resolution,[status(thm)],[c_139,c_6]) ).

tff(c_178,plain,
    ! [X_53] :
      ( essenceInvExistence(X_53)
      | ~ absolutelyInfinite(X_53) ),
    inference(resolution,[status(thm)],[c_174,c_146]) ).

tff(c_134,plain,
    ! [X_41] :
      ( being(X_41)
      | ~ god(X_41) ),
    inference(cnfTransformation,[status(thm)],[f_101]) ).

tff(c_138,plain,
    being('#skF_1'),
    inference(resolution,[status(thm)],[c_120,c_134]) ).

tff(c_114,plain,
    ! [X_31] :
      ( hasEssence(X_31)
      | ~ being(X_31) ),
    inference(cnfTransformation,[status(thm)],[f_257]) ).

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

tff(c_242,plain,
    ! [X_89] :
      ( exists(X_89)
      | ~ essenceInvExistence(X_89)
      | ~ being(X_89) ),
    inference(resolution,[status(thm)],[c_114,c_225]) ).

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

tff(c_245,plain,
    ( ~ essenceInvExistence('#skF_1')
    | ~ being('#skF_1') ),
    inference(resolution,[status(thm)],[c_242,c_118]) ).

tff(c_248,plain,
    ~ essenceInvExistence('#skF_1'),
    inference(demodulation,[status(thm),theory(equality)],[c_138,c_245]) ).

tff(c_251,plain,
    ~ absolutelyInfinite('#skF_1'),
    inference(resolution,[status(thm)],[c_178,c_248]) ).

tff(c_255,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_163,c_251]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.14  % Problem  : PHI023+1 : TPTP v9.0.0. Released v7.4.0.
% 0.05/0.15  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.37  % Computer : n009.cluster.edu
% 0.13/0.37  % Model    : x86_64 x86_64
% 0.13/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37  % Memory   : 8042.1875MB
% 0.13/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.37  % CPULimit : 300
% 0.13/0.37  % WCLimit  : 300
% 0.13/0.37  % DateTime : Tue Apr  8 16:28:56 EDT 2025
% 0.13/0.37  % CPUTime  : 
% 4.18/2.53  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.52/2.54  
% 4.52/2.54  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------