TSTP Solution File: PHI035+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : PHI035+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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 : 600s
% DateTime : Mon Jul 18 16:45:08 EDT 2022
% Result : CounterSatisfiable 7.43s 2.31s
% Output : Saturation 7.43s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(substance,conjecture,
! [X1] :
( substance(X1)
<=> ( inItself(X1)
& conceivedThruItself(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',substance) ).
fof(is_in_itself_is_self_caused,axiom,
! [X1] :
( inItself(X1)
=> selfCaused(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',is_in_itself_is_self_caused) ).
fof(conceived_through,axiom,
! [X1,X2] :
( ~ conceivedThru(X1,X1)
=> ( conceivedThru(X1,X2)
& X1 != X2 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PHI002+1.ax',conceived_through) ).
fof(self_caused,axiom,
! [X1] :
( selfCaused(X1)
<=> ( essenceInvExistence(X1)
& natureConcOnlyByExistence(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',self_caused) ).
fof(mode,axiom,
! [X1,X2,X3] :
( mode(X1)
<=> ( ( modification(X1,X2)
& substance(X2) )
| ( existsIn(X1,X3)
& conceivedThru(X1,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mode) ).
fof(exists,axiom,
! [X1,X2] :
( exists(X1)
<=> ( existsIn(X1,X1)
| ( existsIn(X1,X2)
& X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PHI002+1.ax',exists) ).
fof(can_be_conceived_as_non_existing,axiom,
! [X1] :
( canBeConceivedAsNonExisting(X1)
=> ~ essenceInvExistence(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PHI002+1.ax',can_be_conceived_as_non_existing) ).
fof(absolutely_infinite,axiom,
! [X1,X2] :
( absolutelyInfinite(X1)
<=> ( substance(X1)
& constInInfAttributes(X1)
& ( attributeOf(X2,X1)
=> ( expressesEternalEssentiality(X2)
& expressesInfiniteEssentiality(X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',absolutely_infinite) ).
fof(true_idea,axiom,
! [X1,X2] :
( trueIdea(X1)
=> ( correspondWith(X1,X2)
& ( ideateOf(X2,X1)
| objectOf(X2,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PHI002+1.ax',true_idea) ).
fof(necessary,axiom,
! [X1,X2] :
( necessary(X1)
<=> ( externalTo(X2,X1)
& determinedByFixedMethod(X1,X2)
& determinedByDefiniteMethod(X1,X2)
& ( isMethodAction(X2)
| isMethodExistence(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',necessary) ).
fof(free,axiom,
! [X1,X2] :
( free(X1)
<=> ( existsOnlyByNecessityOfOwnNature(X1)
& ( actionOf(X2,X1)
=> determinedByItselfAlone(X2,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',free) ).
fof(finite_after_its_kind,axiom,
! [X1,X2] :
( finiteAfterItsKind(X1)
<=> ( canBeLimitedBy(X1,X2)
& sameKind(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',finite_after_its_kind) ).
fof(knowledge_of_effect,axiom,
! [X1,X2] :
( knowledgeOfEffect(X1,X2)
<=> knowledgeOfACause(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PHI002+1.ax',knowledge_of_effect) ).
fof(god,axiom,
! [X1] :
( god(X1)
<=> ( being(X1)
& absolutelyInfinite(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',god) ).
fof(definite_cause,axiom,
! [X1,X2] :
( definiteCause(X1)
=> ( effectNecessarilyFollowsFrom(X2,X1)
& ( ~ definiteCause(X1)
=> ~ effectNecessarilyFollowsFrom(X2,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PHI002+1.ax',definite_cause) ).
fof(essence_involves_existence_exists,axiom,
! [X1] :
( ( essenceInvExistence(X1)
& hasEssence(X1) )
=> exists(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',essence_involves_existence_exists) ).
fof(have_nothing_in_common,axiom,
! [X1,X2] :
( haveNothingInCommon(X1,X2)
=> ( ~ canBeUnderstoodInTermsOf(X1,X2)
& ~ canBeUnderstoodInTermsOf(X2,X1)
& ~ conceptionInvolves(X1,X2)
& ~ conceptionInvolves(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/PHI002+1.ax',have_nothing_in_common) ).
fof(being_has_essense,axiom,
! [X1] :
( being(X1)
=> hasEssence(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',being_has_essense) ).
fof(eternity,axiom,
! [X1] :
( eternity(X1)
<=> existConcFollowFromDefEternal(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',eternity) ).
fof(attribute,axiom,
! [X1] :
( attribute(X1)
<=> intPercAsConstEssSub(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',attribute) ).
fof(has_substance_being,axiom,
! [X1] :
( substance(X1)
=> being(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',has_substance_being) ).
fof(c_0_21,negated_conjecture,
~ ! [X1] :
( substance(X1)
<=> ( inItself(X1)
& conceivedThruItself(X1) ) ),
inference(assume_negation,[status(cth)],[substance]) ).
fof(c_0_22,plain,
! [X34] :
( ~ inItself(X34)
| selfCaused(X34) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[is_in_itself_is_self_caused])]) ).
fof(c_0_23,negated_conjecture,
( ( ~ substance(esk1_0)
| ~ inItself(esk1_0)
| ~ conceivedThruItself(esk1_0) )
& ( inItself(esk1_0)
| substance(esk1_0) )
& ( conceivedThruItself(esk1_0)
| substance(esk1_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])]) ).
fof(c_0_24,plain,
! [X6,X7] :
( ( conceivedThru(X6,X7)
| conceivedThru(X6,X6) )
& ( X6 != X7
| conceivedThru(X6,X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[conceived_through])])])]) ).
fof(c_0_25,plain,
! [X17] :
( ( essenceInvExistence(X17)
| ~ selfCaused(X17) )
& ( natureConcOnlyByExistence(X17)
| ~ selfCaused(X17) )
& ( ~ essenceInvExistence(X17)
| ~ natureConcOnlyByExistence(X17)
| selfCaused(X17) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[self_caused])])]) ).
cnf(c_0_26,plain,
( selfCaused(X1)
| ~ inItself(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]),
[final] ).
cnf(c_0_27,negated_conjecture,
( inItself(esk1_0)
| substance(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_23]),
[final] ).
fof(c_0_28,plain,
! [X22,X23,X24] :
( ( existsIn(X22,X24)
| modification(X22,X23)
| ~ mode(X22) )
& ( conceivedThru(X22,X24)
| modification(X22,X23)
| ~ mode(X22) )
& ( existsIn(X22,X24)
| substance(X23)
| ~ mode(X22) )
& ( conceivedThru(X22,X24)
| substance(X23)
| ~ mode(X22) )
& ( ~ modification(X22,X23)
| ~ substance(X23)
| mode(X22) )
& ( ~ existsIn(X22,X24)
| ~ conceivedThru(X22,X24)
| mode(X22) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mode])])]) ).
cnf(c_0_29,plain,
( conceivedThru(X1,X1)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_30,plain,
! [X4,X5] :
( ( existsIn(X4,X5)
| existsIn(X4,X4)
| ~ exists(X4) )
& ( X4 != X5
| existsIn(X4,X4)
| ~ exists(X4) )
& ( ~ existsIn(X4,X4)
| exists(X4) )
& ( ~ existsIn(X4,X5)
| X4 = X5
| exists(X4) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[exists])])]) ).
fof(c_0_31,plain,
! [X16] :
( ~ canBeConceivedAsNonExisting(X16)
| ~ essenceInvExistence(X16) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[can_be_conceived_as_non_existing])])]) ).
cnf(c_0_32,plain,
( essenceInvExistence(X1)
| ~ selfCaused(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]),
[final] ).
cnf(c_0_33,negated_conjecture,
( substance(esk1_0)
| selfCaused(esk1_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]),
[final] ).
fof(c_0_34,plain,
! [X26,X27] :
( ( substance(X26)
| ~ absolutelyInfinite(X26) )
& ( constInInfAttributes(X26)
| ~ absolutelyInfinite(X26) )
& ( expressesEternalEssentiality(X27)
| ~ attributeOf(X27,X26)
| ~ absolutelyInfinite(X26) )
& ( expressesInfiniteEssentiality(X27)
| ~ attributeOf(X27,X26)
| ~ absolutelyInfinite(X26) )
& ( attributeOf(X27,X26)
| ~ substance(X26)
| ~ constInInfAttributes(X26)
| absolutelyInfinite(X26) )
& ( ~ expressesEternalEssentiality(X27)
| ~ expressesInfiniteEssentiality(X27)
| ~ substance(X26)
| ~ constInInfAttributes(X26)
| absolutelyInfinite(X26) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[absolutely_infinite])])]) ).
fof(c_0_35,plain,
! [X14,X15] :
( ( correspondWith(X14,X15)
| ~ trueIdea(X14) )
& ( ideateOf(X15,X14)
| objectOf(X15,X14)
| ~ trueIdea(X14) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[true_idea])])]) ).
fof(c_0_36,plain,
! [X30,X31] :
( ( externalTo(X31,X30)
| ~ necessary(X30) )
& ( determinedByFixedMethod(X30,X31)
| ~ necessary(X30) )
& ( determinedByDefiniteMethod(X30,X31)
| ~ necessary(X30) )
& ( isMethodAction(X31)
| isMethodExistence(X31)
| ~ necessary(X30) )
& ( ~ isMethodAction(X31)
| ~ externalTo(X31,X30)
| ~ determinedByFixedMethod(X30,X31)
| ~ determinedByDefiniteMethod(X30,X31)
| necessary(X30) )
& ( ~ isMethodExistence(X31)
| ~ externalTo(X31,X30)
| ~ determinedByFixedMethod(X30,X31)
| ~ determinedByDefiniteMethod(X30,X31)
| necessary(X30) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[necessary])])]) ).
fof(c_0_37,plain,
! [X28,X29] :
( ( existsOnlyByNecessityOfOwnNature(X28)
| ~ free(X28) )
& ( ~ actionOf(X29,X28)
| determinedByItselfAlone(X29,X28)
| ~ free(X28) )
& ( actionOf(X29,X28)
| ~ existsOnlyByNecessityOfOwnNature(X28)
| free(X28) )
& ( ~ determinedByItselfAlone(X29,X28)
| ~ existsOnlyByNecessityOfOwnNature(X28)
| free(X28) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[free])])]) ).
cnf(c_0_38,plain,
( mode(X1)
| ~ existsIn(X1,X2)
| ~ conceivedThru(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]),
[final] ).
cnf(c_0_39,plain,
conceivedThru(X1,X1),
inference(er,[status(thm)],[c_0_29]),
[final] ).
fof(c_0_40,plain,
! [X18,X19] :
( ( canBeLimitedBy(X18,X19)
| ~ finiteAfterItsKind(X18) )
& ( sameKind(X18,X19)
| ~ finiteAfterItsKind(X18) )
& ( ~ canBeLimitedBy(X18,X19)
| ~ sameKind(X18,X19)
| finiteAfterItsKind(X18) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[finite_after_its_kind])])]) ).
fof(c_0_41,plain,
! [X10,X11] :
( ( ~ knowledgeOfEffect(X10,X11)
| knowledgeOfACause(X10) )
& ( ~ knowledgeOfACause(X10)
| knowledgeOfEffect(X10,X11) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[knowledge_of_effect])]) ).
fof(c_0_42,plain,
! [X25] :
( ( being(X25)
| ~ god(X25) )
& ( absolutelyInfinite(X25)
| ~ god(X25) )
& ( ~ being(X25)
| ~ absolutelyInfinite(X25)
| god(X25) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[god])])]) ).
fof(c_0_43,plain,
! [X8,X9] :
( ( effectNecessarilyFollowsFrom(X9,X8)
| ~ definiteCause(X8) )
& ( definiteCause(X8)
| ~ effectNecessarilyFollowsFrom(X9,X8)
| ~ definiteCause(X8) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[definite_cause])])])]) ).
fof(c_0_44,plain,
! [X36] :
( ~ essenceInvExistence(X36)
| ~ hasEssence(X36)
| exists(X36) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[essence_involves_existence_exists])]) ).
cnf(c_0_45,plain,
( existsIn(X1,X1)
| X1 != X2
| ~ exists(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_46,plain,
! [X12,X13] :
( ( ~ canBeUnderstoodInTermsOf(X12,X13)
| ~ haveNothingInCommon(X12,X13) )
& ( ~ canBeUnderstoodInTermsOf(X13,X12)
| ~ haveNothingInCommon(X12,X13) )
& ( ~ conceptionInvolves(X12,X13)
| ~ haveNothingInCommon(X12,X13) )
& ( ~ conceptionInvolves(X13,X12)
| ~ haveNothingInCommon(X12,X13) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[have_nothing_in_common])])])]) ).
fof(c_0_47,plain,
! [X35] :
( ~ being(X35)
| hasEssence(X35) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[being_has_essense])]) ).
fof(c_0_48,plain,
! [X32] :
( ( ~ eternity(X32)
| existConcFollowFromDefEternal(X32) )
& ( ~ existConcFollowFromDefEternal(X32)
| eternity(X32) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[eternity])]) ).
fof(c_0_49,plain,
! [X21] :
( ( ~ attribute(X21)
| intPercAsConstEssSub(X21) )
& ( ~ intPercAsConstEssSub(X21)
| attribute(X21) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[attribute])]) ).
cnf(c_0_50,plain,
( natureConcOnlyByExistence(X1)
| ~ selfCaused(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]),
[final] ).
fof(c_0_51,plain,
! [X33] :
( ~ substance(X33)
| being(X33) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[has_substance_being])]) ).
cnf(c_0_52,plain,
( ~ canBeConceivedAsNonExisting(X1)
| ~ essenceInvExistence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]),
[final] ).
cnf(c_0_53,negated_conjecture,
( substance(esk1_0)
| essenceInvExistence(esk1_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]),
[final] ).
cnf(c_0_54,plain,
( attributeOf(X1,X2)
| absolutelyInfinite(X2)
| ~ substance(X2)
| ~ constInInfAttributes(X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]),
[final] ).
cnf(c_0_55,plain,
( ideateOf(X1,X2)
| objectOf(X1,X2)
| ~ trueIdea(X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]),
[final] ).
cnf(c_0_56,plain,
( conceivedThru(X1,X2)
| modification(X1,X3)
| ~ mode(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]),
[final] ).
cnf(c_0_57,plain,
( necessary(X2)
| ~ isMethodExistence(X1)
| ~ externalTo(X1,X2)
| ~ determinedByFixedMethod(X2,X1)
| ~ determinedByDefiniteMethod(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]),
[final] ).
cnf(c_0_58,plain,
( necessary(X2)
| ~ isMethodAction(X1)
| ~ externalTo(X1,X2)
| ~ determinedByFixedMethod(X2,X1)
| ~ determinedByDefiniteMethod(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]),
[final] ).
cnf(c_0_59,plain,
( existsIn(X1,X2)
| modification(X1,X3)
| ~ mode(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]),
[final] ).
cnf(c_0_60,plain,
( actionOf(X1,X2)
| free(X2)
| ~ existsOnlyByNecessityOfOwnNature(X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]),
[final] ).
cnf(c_0_61,plain,
( determinedByItselfAlone(X1,X2)
| ~ actionOf(X1,X2)
| ~ free(X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]),
[final] ).
cnf(c_0_62,plain,
( absolutelyInfinite(X2)
| ~ expressesEternalEssentiality(X1)
| ~ expressesInfiniteEssentiality(X1)
| ~ substance(X2)
| ~ constInInfAttributes(X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]),
[final] ).
cnf(c_0_63,plain,
( conceivedThru(X1,X2)
| substance(X3)
| ~ mode(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]),
[final] ).
cnf(c_0_64,plain,
( mode(X1)
| ~ existsIn(X1,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]),
[final] ).
cnf(c_0_65,plain,
( X1 = X2
| exists(X1)
| ~ existsIn(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]),
[final] ).
cnf(c_0_66,plain,
( finiteAfterItsKind(X1)
| ~ canBeLimitedBy(X1,X2)
| ~ sameKind(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_40]),
[final] ).
cnf(c_0_67,plain,
( expressesInfiniteEssentiality(X1)
| ~ attributeOf(X1,X2)
| ~ absolutelyInfinite(X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]),
[final] ).
cnf(c_0_68,plain,
( expressesEternalEssentiality(X1)
| ~ attributeOf(X1,X2)
| ~ absolutelyInfinite(X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]),
[final] ).
cnf(c_0_69,plain,
( existsIn(X1,X2)
| substance(X3)
| ~ mode(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]),
[final] ).
cnf(c_0_70,plain,
( determinedByDefiniteMethod(X1,X2)
| ~ necessary(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]),
[final] ).
cnf(c_0_71,plain,
( determinedByFixedMethod(X1,X2)
| ~ necessary(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]),
[final] ).
cnf(c_0_72,plain,
( externalTo(X1,X2)
| ~ necessary(X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]),
[final] ).
cnf(c_0_73,plain,
( sameKind(X1,X2)
| ~ finiteAfterItsKind(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]),
[final] ).
cnf(c_0_74,plain,
( canBeLimitedBy(X1,X2)
| ~ finiteAfterItsKind(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]),
[final] ).
cnf(c_0_75,plain,
( correspondWith(X1,X2)
| ~ trueIdea(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]),
[final] ).
cnf(c_0_76,plain,
( knowledgeOfEffect(X1,X2)
| ~ knowledgeOfACause(X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]),
[final] ).
cnf(c_0_77,plain,
( free(X2)
| ~ determinedByItselfAlone(X1,X2)
| ~ existsOnlyByNecessityOfOwnNature(X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]),
[final] ).
cnf(c_0_78,plain,
( mode(X1)
| ~ modification(X1,X2)
| ~ substance(X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]),
[final] ).
cnf(c_0_79,plain,
( god(X1)
| ~ being(X1)
| ~ absolutelyInfinite(X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]),
[final] ).
cnf(c_0_80,plain,
( effectNecessarilyFollowsFrom(X1,X2)
| ~ definiteCause(X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]),
[final] ).
cnf(c_0_81,plain,
( isMethodAction(X1)
| isMethodExistence(X1)
| ~ necessary(X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]),
[final] ).
cnf(c_0_82,plain,
( selfCaused(X1)
| ~ essenceInvExistence(X1)
| ~ natureConcOnlyByExistence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]),
[final] ).
cnf(c_0_83,plain,
( exists(X1)
| ~ essenceInvExistence(X1)
| ~ hasEssence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]),
[final] ).
cnf(c_0_84,plain,
( existsIn(X1,X1)
| ~ exists(X1) ),
inference(er,[status(thm)],[c_0_45]),
[final] ).
cnf(c_0_85,plain,
( exists(X1)
| ~ existsIn(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]),
[final] ).
cnf(c_0_86,plain,
( knowledgeOfACause(X1)
| ~ knowledgeOfEffect(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]),
[final] ).
cnf(c_0_87,plain,
( ~ conceptionInvolves(X1,X2)
| ~ haveNothingInCommon(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_46]),
[final] ).
cnf(c_0_88,plain,
( ~ canBeUnderstoodInTermsOf(X1,X2)
| ~ haveNothingInCommon(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_46]),
[final] ).
cnf(c_0_89,plain,
( ~ conceptionInvolves(X1,X2)
| ~ haveNothingInCommon(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]),
[final] ).
cnf(c_0_90,plain,
( hasEssence(X1)
| ~ being(X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]),
[final] ).
cnf(c_0_91,plain,
( existConcFollowFromDefEternal(X1)
| ~ eternity(X1) ),
inference(split_conjunct,[status(thm)],[c_0_48]),
[final] ).
cnf(c_0_92,plain,
( existsOnlyByNecessityOfOwnNature(X1)
| ~ free(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]),
[final] ).
cnf(c_0_93,plain,
( constInInfAttributes(X1)
| ~ absolutelyInfinite(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]),
[final] ).
cnf(c_0_94,plain,
( intPercAsConstEssSub(X1)
| ~ attribute(X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]),
[final] ).
cnf(c_0_95,negated_conjecture,
( substance(esk1_0)
| natureConcOnlyByExistence(esk1_0) ),
inference(spm,[status(thm)],[c_0_50,c_0_33]),
[final] ).
cnf(c_0_96,plain,
( ~ canBeUnderstoodInTermsOf(X1,X2)
| ~ haveNothingInCommon(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]),
[final] ).
cnf(c_0_97,plain,
( eternity(X1)
| ~ existConcFollowFromDefEternal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_48]),
[final] ).
cnf(c_0_98,plain,
( absolutelyInfinite(X1)
| ~ god(X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]),
[final] ).
cnf(c_0_99,plain,
( being(X1)
| ~ god(X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]),
[final] ).
cnf(c_0_100,plain,
( attribute(X1)
| ~ intPercAsConstEssSub(X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]),
[final] ).
cnf(c_0_101,plain,
( being(X1)
| ~ substance(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]),
[final] ).
cnf(c_0_102,negated_conjecture,
( substance(esk1_0)
| ~ canBeConceivedAsNonExisting(esk1_0) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]),
[final] ).
cnf(c_0_103,negated_conjecture,
( ~ substance(esk1_0)
| ~ inItself(esk1_0)
| ~ conceivedThruItself(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_23]),
[final] ).
cnf(c_0_104,negated_conjecture,
( conceivedThruItself(esk1_0)
| substance(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_23]),
[final] ).
cnf(c_0_105,plain,
( substance(X1)
| ~ absolutelyInfinite(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PHI035+1 : TPTP v8.1.0. Released v7.4.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 2 02:02:46 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.44 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.43/2.31 # ENIGMATIC: Solved by autoschedule:
% 7.43/2.31 # No SInE strategy applied
% 7.43/2.31 # Trying AutoSched0 for 150 seconds
% 7.43/2.31 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S030A
% 7.43/2.31 # and selection function SelectStrongRRNonRROptimalLit.
% 7.43/2.31 #
% 7.43/2.31 # Preprocessing time : 0.026 s
% 7.43/2.31 # Presaturation interreduction done
% 7.43/2.31
% 7.43/2.31 # No proof found!
% 7.43/2.31 # SZS status CounterSatisfiable
% 7.43/2.31 # SZS output start Saturation
% See solution above
% 7.43/2.31
% 7.43/2.31 # -------------------------------------------------
% 7.43/2.31 # User time : 0.028 s
% 7.43/2.31 # System time : 0.008 s
% 7.43/2.31 # Total time : 0.036 s
% 7.43/2.31 # Maximum resident set size: 7116 pages
% 7.43/2.31
%------------------------------------------------------------------------------