%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : PHI034+1 : TPTP v9.2.1. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n015.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 May 5 05:01:12 PM UTC 2026
% Result : CounterSatisfiable 1.26s 1.72s
% Output : Saturation 1.26s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(is_in_itself_is_self_caused,axiom,
! [X1] :
( inItself(X1)
=> selfCaused(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',is_in_itself_is_self_caused) ).
fof(substance,axiom,
! [X1] :
( substance(X1)
<=> ( inItself(X1)
& conceivedThruItself(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',substance) ).
fof(conceived_through,axiom,
! [X1,X2] :
( ~ conceivedThru(X1,X1)
=> ( conceivedThru(X1,X2)
& X1 != X2 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/PHI002+1.ax',conceived_through) ).
fof(essence_involves_existence_exists,axiom,
! [X1] :
( ( essenceInvExistence(X1)
& hasEssence(X1) )
=> exists(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',essence_involves_existence_exists) ).
fof(being_has_essense,axiom,
! [X1] :
( being(X1)
=> hasEssence(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',being_has_essense) ).
fof(self_caused,axiom,
! [X1] :
( selfCaused(X1)
<=> ( essenceInvExistence(X1)
& natureConcOnlyByExistence(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',self_caused) ).
fof(exists,axiom,
! [X1,X2] :
( exists(X1)
<=> ( existsIn(X1,X1)
| ( existsIn(X1,X2)
& X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/PHI002+1.ax',exists) ).
fof(has_substance_being,axiom,
! [X1] :
( substance(X1)
=> being(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',has_substance_being) ).
fof(mode,axiom,
! [X1,X2,X3] :
( mode(X1)
<=> ( ( modification(X1,X2)
& substance(X2) )
| ( existsIn(X1,X3)
& conceivedThru(X1,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mode) ).
fof(definite_cause,axiom,
! [X1,X2] :
( definiteCause(X1)
=> ( effectNecessarilyFollowsFrom(X2,X1)
& ( ~ definiteCause(X1)
=> ~ effectNecessarilyFollowsFrom(X2,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/PHI002+1.ax',definite_cause) ).
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/sandbox/benchmark/Axioms/PHI002+1.ax',have_nothing_in_common) ).
fof(finite_after_its_kind,conjecture,
! [X1,X2] :
( finiteAfterItsKind(X1)
<=> ( canBeLimitedBy(X1,X2)
& sameKind(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',finite_after_its_kind) ).
fof(can_be_conceived_as_non_existing,axiom,
! [X1] :
( canBeConceivedAsNonExisting(X1)
=> ~ essenceInvExistence(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/PHI002+1.ax',can_be_conceived_as_non_existing) ).
fof(necessary,axiom,
! [X1,X2] :
( necessary(X1)
<=> ( externalTo(X2,X1)
& determinedByFixedMethod(X1,X2)
& determinedByDefiniteMethod(X1,X2)
& ( isMethodAction(X2)
| isMethodExistence(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',necessary) ).
fof(absolutely_infinite,axiom,
! [X1,X2] :
( absolutelyInfinite(X1)
<=> ( substance(X1)
& constInInfAttributes(X1)
& ( attributeOf(X2,X1)
=> ( expressesEternalEssentiality(X2)
& expressesInfiniteEssentiality(X2) ) ) ) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/PHI002+1.ax',true_idea) ).
fof(free,axiom,
! [X1,X2] :
( free(X1)
<=> ( existsOnlyByNecessityOfOwnNature(X1)
& ( actionOf(X2,X1)
=> determinedByItselfAlone(X2,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',free) ).
fof(god,axiom,
! [X1] :
( god(X1)
<=> ( being(X1)
& absolutelyInfinite(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',god) ).
fof(knowledge_of_effect,axiom,
! [X1,X2] :
( knowledgeOfEffect(X1,X2)
<=> knowledgeOfACause(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/PHI002+1.ax',knowledge_of_effect) ).
fof(eternity,axiom,
! [X1] :
( eternity(X1)
<=> existConcFollowFromDefEternal(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',eternity) ).
fof(attribute,axiom,
! [X1] :
( attribute(X1)
<=> intPercAsConstEssSub(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',attribute) ).
fof(c_0_21,plain,
! [X67] :
( ~ inItself(X67)
| selfCaused(X67) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[is_in_itself_is_self_caused])]) ).
fof(c_0_22,plain,
! [X53] :
( ( inItself(X53)
| ~ substance(X53) )
& ( conceivedThruItself(X53)
| ~ substance(X53) )
& ( ~ inItself(X53)
| ~ conceivedThruItself(X53)
| substance(X53) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[substance])])]) ).
fof(c_0_23,plain,
! [X1,X2] :
( ~ conceivedThru(X1,X1)
=> ( conceivedThru(X1,X2)
& X1 != X2 ) ),
inference(fof_simplification,[status(thm)],[conceived_through]) ).
fof(c_0_24,plain,
! [X69] :
( ~ essenceInvExistence(X69)
| ~ hasEssence(X69)
| exists(X69) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[essence_involves_existence_exists])]) ).
fof(c_0_25,plain,
! [X68] :
( ~ being(X68)
| hasEssence(X68) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[being_has_essense])]) ).
fof(c_0_26,plain,
! [X50] :
( ( essenceInvExistence(X50)
| ~ selfCaused(X50) )
& ( natureConcOnlyByExistence(X50)
| ~ selfCaused(X50) )
& ( ~ essenceInvExistence(X50)
| ~ natureConcOnlyByExistence(X50)
| selfCaused(X50) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[self_caused])])]) ).
cnf(c_0_27,plain,
( selfCaused(X1)
| ~ inItself(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]),
[final] ).
cnf(c_0_28,plain,
( inItself(X1)
| ~ substance(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]),
[final] ).
fof(c_0_29,plain,
! [X39,X40] :
( ( conceivedThru(X39,X40)
| conceivedThru(X39,X39) )
& ( X39 != X40
| conceivedThru(X39,X39) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])]) ).
fof(c_0_30,plain,
! [X37,X38] :
( ( existsIn(X37,X38)
| existsIn(X37,X37)
| ~ exists(X37) )
& ( X37 != X38
| existsIn(X37,X37)
| ~ exists(X37) )
& ( ~ existsIn(X37,X37)
| exists(X37) )
& ( ~ existsIn(X37,X38)
| X37 = X38
| exists(X37) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[exists])])]) ).
cnf(c_0_31,plain,
( exists(X1)
| ~ essenceInvExistence(X1)
| ~ hasEssence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]),
[final] ).
cnf(c_0_32,plain,
( hasEssence(X1)
| ~ being(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]),
[final] ).
fof(c_0_33,plain,
! [X66] :
( ~ substance(X66)
| being(X66) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[has_substance_being])]) ).
cnf(c_0_34,plain,
( essenceInvExistence(X1)
| ~ selfCaused(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]),
[final] ).
cnf(c_0_35,plain,
( selfCaused(X1)
| ~ substance(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]),
[final] ).
fof(c_0_36,plain,
! [X55,X56,X57] :
( ( existsIn(X55,X57)
| modification(X55,X56)
| ~ mode(X55) )
& ( conceivedThru(X55,X57)
| modification(X55,X56)
| ~ mode(X55) )
& ( existsIn(X55,X57)
| substance(X56)
| ~ mode(X55) )
& ( conceivedThru(X55,X57)
| substance(X56)
| ~ mode(X55) )
& ( ~ modification(X55,X56)
| ~ substance(X56)
| mode(X55) )
& ( ~ existsIn(X55,X57)
| ~ conceivedThru(X55,X57)
| mode(X55) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mode])])]) ).
cnf(c_0_37,plain,
( conceivedThru(X1,X1)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_38,plain,
( existsIn(X1,X1)
| X1 != X2
| ~ exists(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_39,plain,
( exists(X1)
| ~ being(X1)
| ~ essenceInvExistence(X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]),
[final] ).
cnf(c_0_40,plain,
( being(X1)
| ~ substance(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]),
[final] ).
cnf(c_0_41,plain,
( essenceInvExistence(X1)
| ~ substance(X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]),
[final] ).
cnf(c_0_42,plain,
( mode(X1)
| ~ existsIn(X1,X2)
| ~ conceivedThru(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]),
[final] ).
cnf(c_0_43,plain,
conceivedThru(X1,X1),
inference(er,[status(thm)],[c_0_37]),
[final] ).
cnf(c_0_44,plain,
( existsIn(X1,X1)
| ~ exists(X1) ),
inference(er,[status(thm)],[c_0_38]),
[final] ).
cnf(c_0_45,plain,
( exists(X1)
| ~ substance(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),
[final] ).
cnf(c_0_46,plain,
( mode(X1)
| ~ existsIn(X1,X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]),
[final] ).
cnf(c_0_47,plain,
( existsIn(X1,X1)
| ~ substance(X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]),
[final] ).
fof(c_0_48,plain,
! [X1,X2] :
( definiteCause(X1)
=> ( effectNecessarilyFollowsFrom(X2,X1)
& ( ~ definiteCause(X1)
=> ~ effectNecessarilyFollowsFrom(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[definite_cause]) ).
fof(c_0_49,plain,
! [X1,X2] :
( haveNothingInCommon(X1,X2)
=> ( ~ canBeUnderstoodInTermsOf(X1,X2)
& ~ canBeUnderstoodInTermsOf(X2,X1)
& ~ conceptionInvolves(X1,X2)
& ~ conceptionInvolves(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[have_nothing_in_common]) ).
fof(c_0_50,negated_conjecture,
~ ! [X1,X2] :
( finiteAfterItsKind(X1)
<=> ( canBeLimitedBy(X1,X2)
& sameKind(X1,X2) ) ),
inference(assume_negation,[status(cth)],[finite_after_its_kind]) ).
fof(c_0_51,plain,
! [X1] :
( canBeConceivedAsNonExisting(X1)
=> ~ essenceInvExistence(X1) ),
inference(fof_simplification,[status(thm)],[can_be_conceived_as_non_existing]) ).
fof(c_0_52,plain,
! [X63,X64] :
( ( externalTo(X64,X63)
| ~ necessary(X63) )
& ( determinedByFixedMethod(X63,X64)
| ~ necessary(X63) )
& ( determinedByDefiniteMethod(X63,X64)
| ~ necessary(X63) )
& ( isMethodAction(X64)
| isMethodExistence(X64)
| ~ necessary(X63) )
& ( ~ isMethodAction(X64)
| ~ externalTo(X64,X63)
| ~ determinedByFixedMethod(X63,X64)
| ~ determinedByDefiniteMethod(X63,X64)
| necessary(X63) )
& ( ~ isMethodExistence(X64)
| ~ externalTo(X64,X63)
| ~ determinedByFixedMethod(X63,X64)
| ~ determinedByDefiniteMethod(X63,X64)
| necessary(X63) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[necessary])])]) ).
cnf(c_0_53,plain,
( conceivedThru(X1,X2)
| modification(X1,X3)
| ~ mode(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]),
[final] ).
cnf(c_0_54,plain,
( mode(X1)
| ~ substance(X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]),
[final] ).
cnf(c_0_55,plain,
( existsIn(X1,X2)
| modification(X1,X3)
| ~ mode(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]),
[final] ).
cnf(c_0_56,plain,
( conceivedThru(X1,X2)
| substance(X3)
| ~ mode(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]),
[final] ).
fof(c_0_57,plain,
! [X59,X60] :
( ( substance(X59)
| ~ absolutelyInfinite(X59) )
& ( constInInfAttributes(X59)
| ~ absolutelyInfinite(X59) )
& ( expressesEternalEssentiality(X60)
| ~ attributeOf(X60,X59)
| ~ absolutelyInfinite(X59) )
& ( expressesInfiniteEssentiality(X60)
| ~ attributeOf(X60,X59)
| ~ absolutelyInfinite(X59) )
& ( attributeOf(X60,X59)
| ~ substance(X59)
| ~ constInInfAttributes(X59)
| absolutelyInfinite(X59) )
& ( ~ expressesEternalEssentiality(X60)
| ~ expressesInfiniteEssentiality(X60)
| ~ substance(X59)
| ~ constInInfAttributes(X59)
| absolutelyInfinite(X59) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[absolutely_infinite])])]) ).
fof(c_0_58,plain,
! [X47,X48] :
( ( correspondWith(X47,X48)
| ~ trueIdea(X47) )
& ( ideateOf(X48,X47)
| objectOf(X48,X47)
| ~ trueIdea(X47) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[true_idea])])]) ).
cnf(c_0_59,plain,
( existsIn(X1,X2)
| substance(X3)
| ~ mode(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]),
[final] ).
fof(c_0_60,plain,
! [X61,X62] :
( ( existsOnlyByNecessityOfOwnNature(X61)
| ~ free(X61) )
& ( ~ actionOf(X62,X61)
| determinedByItselfAlone(X62,X61)
| ~ free(X61) )
& ( actionOf(X62,X61)
| ~ existsOnlyByNecessityOfOwnNature(X61)
| free(X61) )
& ( ~ determinedByItselfAlone(X62,X61)
| ~ existsOnlyByNecessityOfOwnNature(X61)
| free(X61) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[free])])]) ).
fof(c_0_61,plain,
! [X58] :
( ( being(X58)
| ~ god(X58) )
& ( absolutelyInfinite(X58)
| ~ god(X58) )
& ( ~ being(X58)
| ~ absolutelyInfinite(X58)
| god(X58) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[god])])]) ).
fof(c_0_62,plain,
! [X43,X44] :
( ( ~ knowledgeOfEffect(X43,X44)
| knowledgeOfACause(X43) )
& ( ~ knowledgeOfACause(X43)
| knowledgeOfEffect(X43,X44) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[knowledge_of_effect])]) ).
fof(c_0_63,plain,
! [X41,X42] :
( ( effectNecessarilyFollowsFrom(X42,X41)
| ~ definiteCause(X41) )
& ( definiteCause(X41)
| ~ effectNecessarilyFollowsFrom(X42,X41)
| ~ definiteCause(X41) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_48])])]) ).
fof(c_0_64,plain,
! [X65] :
( ( ~ eternity(X65)
| existConcFollowFromDefEternal(X65) )
& ( ~ existConcFollowFromDefEternal(X65)
| eternity(X65) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[eternity])]) ).
fof(c_0_65,plain,
! [X45,X46] :
( ( ~ canBeUnderstoodInTermsOf(X45,X46)
| ~ haveNothingInCommon(X45,X46) )
& ( ~ canBeUnderstoodInTermsOf(X46,X45)
| ~ haveNothingInCommon(X45,X46) )
& ( ~ conceptionInvolves(X45,X46)
| ~ haveNothingInCommon(X45,X46) )
& ( ~ conceptionInvolves(X46,X45)
| ~ haveNothingInCommon(X45,X46) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_49])])]) ).
fof(c_0_66,plain,
! [X54] :
( ( ~ attribute(X54)
| intPercAsConstEssSub(X54) )
& ( ~ intPercAsConstEssSub(X54)
| attribute(X54) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[attribute])]) ).
fof(c_0_67,negated_conjecture,
( ( ~ finiteAfterItsKind(esk1_0)
| ~ canBeLimitedBy(esk1_0,esk2_0)
| ~ sameKind(esk1_0,esk2_0) )
& ( canBeLimitedBy(esk1_0,esk2_0)
| finiteAfterItsKind(esk1_0) )
& ( sameKind(esk1_0,esk2_0)
| finiteAfterItsKind(esk1_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_50])])])]) ).
fof(c_0_68,plain,
! [X49] :
( ~ canBeConceivedAsNonExisting(X49)
| ~ essenceInvExistence(X49) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_51])]) ).
cnf(c_0_69,plain,
( necessary(X2)
| ~ isMethodExistence(X1)
| ~ externalTo(X1,X2)
| ~ determinedByFixedMethod(X2,X1)
| ~ determinedByDefiniteMethod(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_52]),
[final] ).
cnf(c_0_70,plain,
( necessary(X2)
| ~ isMethodAction(X1)
| ~ externalTo(X1,X2)
| ~ determinedByFixedMethod(X2,X1)
| ~ determinedByDefiniteMethod(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_52]),
[final] ).
cnf(c_0_71,plain,
( modification(X1,X2)
| conceivedThru(X1,X3)
| ~ substance(X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]),
[final] ).
cnf(c_0_72,plain,
( modification(X1,X2)
| existsIn(X1,X3)
| ~ substance(X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_54]),
[final] ).
cnf(c_0_73,plain,
( substance(X1)
| conceivedThru(X2,X3)
| ~ substance(X2) ),
inference(spm,[status(thm)],[c_0_56,c_0_54]),
[final] ).
cnf(c_0_74,plain,
( attributeOf(X1,X2)
| absolutelyInfinite(X2)
| ~ substance(X2)
| ~ constInInfAttributes(X2) ),
inference(split_conjunct,[status(thm)],[c_0_57]),
[final] ).
cnf(c_0_75,plain,
( ideateOf(X1,X2)
| objectOf(X1,X2)
| ~ trueIdea(X2) ),
inference(split_conjunct,[status(thm)],[c_0_58]),
[final] ).
cnf(c_0_76,plain,
( absolutelyInfinite(X2)
| ~ expressesEternalEssentiality(X1)
| ~ expressesInfiniteEssentiality(X1)
| ~ substance(X2)
| ~ constInInfAttributes(X2) ),
inference(split_conjunct,[status(thm)],[c_0_57]),
[final] ).
cnf(c_0_77,plain,
( substance(X1)
| existsIn(X2,X3)
| ~ substance(X2) ),
inference(spm,[status(thm)],[c_0_59,c_0_54]),
[final] ).
cnf(c_0_78,plain,
( X1 = X2
| exists(X1)
| ~ existsIn(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]),
[final] ).
cnf(c_0_79,plain,
( actionOf(X1,X2)
| free(X2)
| ~ existsOnlyByNecessityOfOwnNature(X2) ),
inference(split_conjunct,[status(thm)],[c_0_60]),
[final] ).
cnf(c_0_80,plain,
( determinedByItselfAlone(X1,X2)
| ~ actionOf(X1,X2)
| ~ free(X2) ),
inference(split_conjunct,[status(thm)],[c_0_60]),
[final] ).
cnf(c_0_81,plain,
( expressesInfiniteEssentiality(X1)
| ~ attributeOf(X1,X2)
| ~ absolutelyInfinite(X2) ),
inference(split_conjunct,[status(thm)],[c_0_57]),
[final] ).
cnf(c_0_82,plain,
( expressesEternalEssentiality(X1)
| ~ attributeOf(X1,X2)
| ~ absolutelyInfinite(X2) ),
inference(split_conjunct,[status(thm)],[c_0_57]),
[final] ).
cnf(c_0_83,plain,
( determinedByDefiniteMethod(X1,X2)
| ~ necessary(X1) ),
inference(split_conjunct,[status(thm)],[c_0_52]),
[final] ).
cnf(c_0_84,plain,
( determinedByFixedMethod(X1,X2)
| ~ necessary(X1) ),
inference(split_conjunct,[status(thm)],[c_0_52]),
[final] ).
cnf(c_0_85,plain,
( externalTo(X1,X2)
| ~ necessary(X2) ),
inference(split_conjunct,[status(thm)],[c_0_52]),
[final] ).
cnf(c_0_86,plain,
( correspondWith(X1,X2)
| ~ trueIdea(X1) ),
inference(split_conjunct,[status(thm)],[c_0_58]),
[final] ).
cnf(c_0_87,plain,
( free(X2)
| ~ determinedByItselfAlone(X1,X2)
| ~ existsOnlyByNecessityOfOwnNature(X2) ),
inference(split_conjunct,[status(thm)],[c_0_60]),
[final] ).
cnf(c_0_88,plain,
( mode(X1)
| ~ modification(X1,X2)
| ~ substance(X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]),
[final] ).
cnf(c_0_89,plain,
( exists(X1)
| ~ existsIn(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]),
[final] ).
cnf(c_0_90,plain,
( god(X1)
| ~ being(X1)
| ~ absolutelyInfinite(X1) ),
inference(split_conjunct,[status(thm)],[c_0_61]),
[final] ).
cnf(c_0_91,plain,
( knowledgeOfEffect(X1,X2)
| ~ knowledgeOfACause(X1) ),
inference(split_conjunct,[status(thm)],[c_0_62]),
[final] ).
cnf(c_0_92,plain,
( isMethodAction(X1)
| isMethodExistence(X1)
| ~ necessary(X2) ),
inference(split_conjunct,[status(thm)],[c_0_52]),
[final] ).
cnf(c_0_93,plain,
( substance(X1)
| ~ inItself(X1)
| ~ conceivedThruItself(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]),
[final] ).
cnf(c_0_94,plain,
( effectNecessarilyFollowsFrom(X1,X2)
| ~ definiteCause(X2) ),
inference(split_conjunct,[status(thm)],[c_0_63]),
[final] ).
cnf(c_0_95,plain,
( selfCaused(X1)
| ~ essenceInvExistence(X1)
| ~ natureConcOnlyByExistence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]),
[final] ).
cnf(c_0_96,plain,
( knowledgeOfACause(X1)
| ~ knowledgeOfEffect(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_62]),
[final] ).
cnf(c_0_97,plain,
( existConcFollowFromDefEternal(X1)
| ~ eternity(X1) ),
inference(split_conjunct,[status(thm)],[c_0_64]),
[final] ).
cnf(c_0_98,plain,
( ~ conceptionInvolves(X1,X2)
| ~ haveNothingInCommon(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_65]),
[final] ).
cnf(c_0_99,plain,
( existsOnlyByNecessityOfOwnNature(X1)
| ~ free(X1) ),
inference(split_conjunct,[status(thm)],[c_0_60]),
[final] ).
cnf(c_0_100,plain,
( constInInfAttributes(X1)
| ~ absolutelyInfinite(X1) ),
inference(split_conjunct,[status(thm)],[c_0_57]),
[final] ).
cnf(c_0_101,plain,
( intPercAsConstEssSub(X1)
| ~ attribute(X1) ),
inference(split_conjunct,[status(thm)],[c_0_66]),
[final] ).
cnf(c_0_102,plain,
( conceivedThruItself(X1)
| ~ substance(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]),
[final] ).
cnf(c_0_103,plain,
( ~ canBeUnderstoodInTermsOf(X1,X2)
| ~ haveNothingInCommon(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_65]),
[final] ).
cnf(c_0_104,plain,
( ~ conceptionInvolves(X1,X2)
| ~ haveNothingInCommon(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_65]),
[final] ).
cnf(c_0_105,plain,
( ~ canBeUnderstoodInTermsOf(X1,X2)
| ~ haveNothingInCommon(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_65]),
[final] ).
cnf(c_0_106,plain,
( eternity(X1)
| ~ existConcFollowFromDefEternal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_64]),
[final] ).
cnf(c_0_107,plain,
( natureConcOnlyByExistence(X1)
| ~ selfCaused(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]),
[final] ).
cnf(c_0_108,plain,
( absolutelyInfinite(X1)
| ~ god(X1) ),
inference(split_conjunct,[status(thm)],[c_0_61]),
[final] ).
cnf(c_0_109,plain,
( being(X1)
| ~ god(X1) ),
inference(split_conjunct,[status(thm)],[c_0_61]),
[final] ).
cnf(c_0_110,plain,
( attribute(X1)
| ~ intPercAsConstEssSub(X1) ),
inference(split_conjunct,[status(thm)],[c_0_66]),
[final] ).
cnf(c_0_111,negated_conjecture,
( ~ finiteAfterItsKind(esk1_0)
| ~ canBeLimitedBy(esk1_0,esk2_0)
| ~ sameKind(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_67]),
[final] ).
cnf(c_0_112,negated_conjecture,
( sameKind(esk1_0,esk2_0)
| finiteAfterItsKind(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_67]),
[final] ).
cnf(c_0_113,plain,
( substance(X1)
| ~ absolutelyInfinite(X1) ),
inference(split_conjunct,[status(thm)],[c_0_57]),
[final] ).
cnf(c_0_114,plain,
( ~ canBeConceivedAsNonExisting(X1)
| ~ essenceInvExistence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_68]),
[final] ).
cnf(c_0_115,negated_conjecture,
( canBeLimitedBy(esk1_0,esk2_0)
| finiteAfterItsKind(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_67]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PHI034+1 : TPTP v9.2.1. Released v7.4.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n015.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 01:25:47 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 1.26/1.72 % Version : CSE_E---1.7
% 1.26/1.72 % Problem : theBenchmark.p
% 1.26/1.72 % SZS status CounterSatisfiable for theBenchmark.p
% 1.26/1.72 % SZS output start Saturation
% See solution above
% 1.26/1.72 % Total time : 1.368s
%------------------------------------------------------------------------------