%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : PHI032+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n009.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 : Thu Sep 24 01:58:11 PM UTC 2026
% Result : CounterSatisfiable 0.09s 0.38s
% Output : Saturation 0.09s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X] :
( selfCaused(X)
<=> ( natureConcOnlyByExistence(X)
& essenceInvExistence(X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [X,Y] :
( finiteAfterItsKind(X)
<=> ( sameKind(X,Y)
& canBeLimitedBy(X,Y) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [X] :
( substance(X)
<=> ( conceivedThruItself(X)
& inItself(X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [X] :
( attribute(X)
<=> intPercAsConstEssSub(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [X,Y,Z] :
( mode(X)
<=> ( ( conceivedThru(X,Z)
& existsIn(X,Z) )
| ( substance(Y)
& modification(X,Y) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [X] :
( god(X)
<=> ( absolutelyInfinite(X)
& being(X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [X,Y] :
( absolutelyInfinite(X)
<=> ( ( attributeOf(Y,X)
=> ( expressesInfiniteEssentiality(Y)
& expressesEternalEssentiality(Y) ) )
& constInInfAttributes(X)
& substance(X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [X,Y] :
( free(X)
<=> ( ( actionOf(Y,X)
=> determinedByItselfAlone(Y,X) )
& existsOnlyByNecessityOfOwnNature(X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,axiom,
! [X,Y] :
( necessary(X)
<=> ( ( isMethodExistence(Y)
| isMethodAction(Y) )
& determinedByDefiniteMethod(X,Y)
& determinedByFixedMethod(X,Y)
& externalTo(Y,X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [X] :
( eternity(X)
<=> existConcFollowFromDefEternal(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f11,axiom,
! [X,Y] :
( exists(X)
<=> ( ( X != Y
& existsIn(X,Y) )
| existsIn(X,X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f12,axiom,
! [X,Y] :
( ~ conceivedThru(X,X)
=> ( X != Y
& conceivedThru(X,Y) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f13,axiom,
! [X,Y] :
( definiteCause(X)
=> ( ( ~ definiteCause(X)
=> ~ effectNecessarilyFollowsFrom(Y,X) )
& effectNecessarilyFollowsFrom(Y,X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f14,axiom,
! [X,Y] :
( knowledgeOfEffect(X,Y)
<=> knowledgeOfACause(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f15,axiom,
! [X,Y] :
( haveNothingInCommon(X,Y)
=> ( ~ conceptionInvolves(Y,X)
& ~ conceptionInvolves(X,Y)
& ~ canBeUnderstoodInTermsOf(Y,X)
& ~ canBeUnderstoodInTermsOf(X,Y) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f16,axiom,
! [X,Y] :
( trueIdea(X)
=> ( ( objectOf(Y,X)
| ideateOf(Y,X) )
& correspondWith(X,Y) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,conjecture,
! [X] :
( canBeConceivedAsNonExisting(X)
=> ~ essenceInvExistence(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f18,negated_conjecture,
~ ! [X] :
( canBeConceivedAsNonExisting(X)
=> ~ essenceInvExistence(X) ),
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f19,axiom,
! [X] :
( substance(X)
=> being(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f20,axiom,
! [X] :
( inItself(X)
=> selfCaused(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f21,axiom,
! [X] :
( being(X)
=> hasEssence(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f22,axiom,
! [X] :
( ( hasEssence(X)
& essenceInvExistence(X) )
=> exists(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f23,plain,
! [X] :
( ( ~ natureConcOnlyByExistence(X)
| ~ essenceInvExistence(X)
| selfCaused(X) )
& ( ( natureConcOnlyByExistence(X)
& essenceInvExistence(X) )
| ~ selfCaused(X) ) ),
inference(NNF_transformation,[status(thm)],[f1]) ).
fof(f24,plain,
( ! [X] :
( ~ natureConcOnlyByExistence(X)
| ~ essenceInvExistence(X)
| selfCaused(X) )
& ! [X] :
( ( natureConcOnlyByExistence(X)
& essenceInvExistence(X) )
| ~ selfCaused(X) ) ),
inference(miniscoping,[status(thm)],[f23]) ).
fof(f25,plain,
! [X0] :
( essenceInvExistence(X0)
| ~ selfCaused(X0) ),
inference(cnf_transformation,[status(thm)],[f24]) ).
fof(f26,plain,
! [X0] :
( natureConcOnlyByExistence(X0)
| ~ selfCaused(X0) ),
inference(cnf_transformation,[status(thm)],[f24]) ).
fof(f27,plain,
! [X0] :
( ~ natureConcOnlyByExistence(X0)
| ~ essenceInvExistence(X0)
| selfCaused(X0) ),
inference(cnf_transformation,[status(thm)],[f24]) ).
fof(f28,plain,
! [X,Y] :
( ( ~ sameKind(X,Y)
| ~ canBeLimitedBy(X,Y)
| finiteAfterItsKind(X) )
& ( ( sameKind(X,Y)
& canBeLimitedBy(X,Y) )
| ~ finiteAfterItsKind(X) ) ),
inference(NNF_transformation,[status(thm)],[f2]) ).
fof(f29,plain,
( ! [X] :
( ! [Y] :
( ~ sameKind(X,Y)
| ~ canBeLimitedBy(X,Y) )
| finiteAfterItsKind(X) )
& ! [X] :
( ( ! [Y] : sameKind(X,Y)
& ! [Y] : canBeLimitedBy(X,Y) )
| ~ finiteAfterItsKind(X) ) ),
inference(miniscoping,[status(thm)],[f28]) ).
fof(f30,plain,
! [X0,X1] :
( canBeLimitedBy(X0,X1)
| ~ finiteAfterItsKind(X0) ),
inference(cnf_transformation,[status(thm)],[f29]) ).
fof(f31,plain,
! [X0,X1] :
( sameKind(X0,X1)
| ~ finiteAfterItsKind(X0) ),
inference(cnf_transformation,[status(thm)],[f29]) ).
fof(f32,plain,
! [X0,X1] :
( ~ sameKind(X0,X1)
| ~ canBeLimitedBy(X0,X1)
| finiteAfterItsKind(X0) ),
inference(cnf_transformation,[status(thm)],[f29]) ).
fof(f33,plain,
! [X] :
( ( ~ conceivedThruItself(X)
| ~ inItself(X)
| substance(X) )
& ( ( conceivedThruItself(X)
& inItself(X) )
| ~ substance(X) ) ),
inference(NNF_transformation,[status(thm)],[f3]) ).
fof(f34,plain,
( ! [X] :
( ~ conceivedThruItself(X)
| ~ inItself(X)
| substance(X) )
& ! [X] :
( ( conceivedThruItself(X)
& inItself(X) )
| ~ substance(X) ) ),
inference(miniscoping,[status(thm)],[f33]) ).
fof(f35,plain,
! [X0] :
( inItself(X0)
| ~ substance(X0) ),
inference(cnf_transformation,[status(thm)],[f34]) ).
fof(f36,plain,
! [X0] :
( conceivedThruItself(X0)
| ~ substance(X0) ),
inference(cnf_transformation,[status(thm)],[f34]) ).
fof(f37,plain,
! [X0] :
( ~ conceivedThruItself(X0)
| ~ inItself(X0)
| substance(X0) ),
inference(cnf_transformation,[status(thm)],[f34]) ).
fof(f38,plain,
! [X] :
( ( ~ intPercAsConstEssSub(X)
| attribute(X) )
& ( intPercAsConstEssSub(X)
| ~ attribute(X) ) ),
inference(NNF_transformation,[status(thm)],[f4]) ).
fof(f39,plain,
( ! [X] :
( ~ intPercAsConstEssSub(X)
| attribute(X) )
& ! [X] :
( intPercAsConstEssSub(X)
| ~ attribute(X) ) ),
inference(miniscoping,[status(thm)],[f38]) ).
fof(f40,plain,
! [X0] :
( intPercAsConstEssSub(X0)
| ~ attribute(X0) ),
inference(cnf_transformation,[status(thm)],[f39]) ).
fof(f41,plain,
! [X0] :
( ~ intPercAsConstEssSub(X0)
| attribute(X0) ),
inference(cnf_transformation,[status(thm)],[f39]) ).
fof(f42,plain,
! [X,Y,Z] :
( ( ( ( ~ conceivedThru(X,Z)
| ~ existsIn(X,Z) )
& ( ~ substance(Y)
| ~ modification(X,Y) ) )
| mode(X) )
& ( ( conceivedThru(X,Z)
& existsIn(X,Z) )
| ( substance(Y)
& modification(X,Y) )
| ~ mode(X) ) ),
inference(NNF_transformation,[status(thm)],[f5]) ).
fof(f43,plain,
( ! [X] :
( ( ! [Z] :
( ~ conceivedThru(X,Z)
| ~ existsIn(X,Z) )
& ! [Y] :
( ~ substance(Y)
| ~ modification(X,Y) ) )
| mode(X) )
& ! [X] :
( ( ! [Z] : conceivedThru(X,Z)
& ! [Z] : existsIn(X,Z) )
| ( ! [Y] : substance(Y)
& ! [Y] : modification(X,Y) )
| ~ mode(X) ) ),
inference(miniscoping,[status(thm)],[f42]) ).
fof(f44,plain,
! [X0,X1,X2] :
( existsIn(X0,X2)
| modification(X0,X1)
| ~ mode(X0) ),
inference(cnf_transformation,[status(thm)],[f43]) ).
fof(f45,plain,
! [X0,X1,X2] :
( conceivedThru(X0,X2)
| modification(X0,X1)
| ~ mode(X0) ),
inference(cnf_transformation,[status(thm)],[f43]) ).
fof(f46,plain,
! [X0,X1,X2] :
( existsIn(X0,X2)
| substance(X1)
| ~ mode(X0) ),
inference(cnf_transformation,[status(thm)],[f43]) ).
fof(f47,plain,
! [X0,X1,X2] :
( conceivedThru(X0,X2)
| substance(X1)
| ~ mode(X0) ),
inference(cnf_transformation,[status(thm)],[f43]) ).
fof(f48,plain,
! [X0,X1] :
( ~ substance(X1)
| ~ modification(X0,X1)
| mode(X0) ),
inference(cnf_transformation,[status(thm)],[f43]) ).
fof(f49,plain,
! [X0,X1] :
( ~ conceivedThru(X0,X1)
| ~ existsIn(X0,X1)
| mode(X0) ),
inference(cnf_transformation,[status(thm)],[f43]) ).
fof(f50,plain,
! [X] :
( ( ~ absolutelyInfinite(X)
| ~ being(X)
| god(X) )
& ( ( absolutelyInfinite(X)
& being(X) )
| ~ god(X) ) ),
inference(NNF_transformation,[status(thm)],[f6]) ).
fof(f51,plain,
( ! [X] :
( ~ absolutelyInfinite(X)
| ~ being(X)
| god(X) )
& ! [X] :
( ( absolutelyInfinite(X)
& being(X) )
| ~ god(X) ) ),
inference(miniscoping,[status(thm)],[f50]) ).
fof(f52,plain,
! [X0] :
( being(X0)
| ~ god(X0) ),
inference(cnf_transformation,[status(thm)],[f51]) ).
fof(f53,plain,
! [X0] :
( absolutelyInfinite(X0)
| ~ god(X0) ),
inference(cnf_transformation,[status(thm)],[f51]) ).
fof(f54,plain,
! [X0] :
( ~ absolutelyInfinite(X0)
| ~ being(X0)
| god(X0) ),
inference(cnf_transformation,[status(thm)],[f51]) ).
fof(f55,plain,
! [X,Y] :
( absolutelyInfinite(X)
<=> ( ( ( expressesInfiniteEssentiality(Y)
& expressesEternalEssentiality(Y) )
| ~ attributeOf(Y,X) )
& constInInfAttributes(X)
& substance(X) ) ),
inference(pre_NNF_transformation,[status(thm)],[f7]) ).
fof(f56,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)],[f55]) ).
fof(f57,plain,
( ! [X] :
( ( ! [Y] :
( ~ expressesInfiniteEssentiality(Y)
| ~ expressesEternalEssentiality(Y) )
& ! [Y] : attributeOf(Y,X) )
| ~ constInInfAttributes(X)
| ~ substance(X)
| absolutelyInfinite(X) )
& ! [X] :
( ( ! [Y] :
( ( expressesInfiniteEssentiality(Y)
& expressesEternalEssentiality(Y) )
| ~ attributeOf(Y,X) )
& constInInfAttributes(X)
& substance(X) )
| ~ absolutelyInfinite(X) ) ),
inference(miniscoping,[status(thm)],[f56]) ).
fof(f58,plain,
! [X0] :
( substance(X0)
| ~ absolutelyInfinite(X0) ),
inference(cnf_transformation,[status(thm)],[f57]) ).
fof(f59,plain,
! [X0] :
( constInInfAttributes(X0)
| ~ absolutelyInfinite(X0) ),
inference(cnf_transformation,[status(thm)],[f57]) ).
fof(f60,plain,
! [X0,X1] :
( expressesEternalEssentiality(X1)
| ~ attributeOf(X1,X0)
| ~ absolutelyInfinite(X0) ),
inference(cnf_transformation,[status(thm)],[f57]) ).
fof(f61,plain,
! [X0,X1] :
( expressesInfiniteEssentiality(X1)
| ~ attributeOf(X1,X0)
| ~ absolutelyInfinite(X0) ),
inference(cnf_transformation,[status(thm)],[f57]) ).
fof(f62,plain,
! [X0,X1] :
( attributeOf(X1,X0)
| ~ constInInfAttributes(X0)
| ~ substance(X0)
| absolutelyInfinite(X0) ),
inference(cnf_transformation,[status(thm)],[f57]) ).
fof(f63,plain,
! [X0,X1] :
( ~ expressesInfiniteEssentiality(X1)
| ~ expressesEternalEssentiality(X1)
| ~ constInInfAttributes(X0)
| ~ substance(X0)
| absolutelyInfinite(X0) ),
inference(cnf_transformation,[status(thm)],[f57]) ).
fof(f64,plain,
! [X,Y] :
( free(X)
<=> ( ( determinedByItselfAlone(Y,X)
| ~ actionOf(Y,X) )
& existsOnlyByNecessityOfOwnNature(X) ) ),
inference(pre_NNF_transformation,[status(thm)],[f8]) ).
fof(f65,plain,
! [X,Y] :
( ( ( ~ determinedByItselfAlone(Y,X)
& actionOf(Y,X) )
| ~ existsOnlyByNecessityOfOwnNature(X)
| free(X) )
& ( ( ( determinedByItselfAlone(Y,X)
| ~ actionOf(Y,X) )
& existsOnlyByNecessityOfOwnNature(X) )
| ~ free(X) ) ),
inference(NNF_transformation,[status(thm)],[f64]) ).
fof(f66,plain,
( ! [X] :
( ( ! [Y] : ~ determinedByItselfAlone(Y,X)
& ! [Y] : actionOf(Y,X) )
| ~ existsOnlyByNecessityOfOwnNature(X)
| free(X) )
& ! [X] :
( ( ! [Y] :
( determinedByItselfAlone(Y,X)
| ~ actionOf(Y,X) )
& existsOnlyByNecessityOfOwnNature(X) )
| ~ free(X) ) ),
inference(miniscoping,[status(thm)],[f65]) ).
fof(f67,plain,
! [X0] :
( existsOnlyByNecessityOfOwnNature(X0)
| ~ free(X0) ),
inference(cnf_transformation,[status(thm)],[f66]) ).
fof(f68,plain,
! [X0,X1] :
( determinedByItselfAlone(X1,X0)
| ~ actionOf(X1,X0)
| ~ free(X0) ),
inference(cnf_transformation,[status(thm)],[f66]) ).
fof(f69,plain,
! [X0,X1] :
( actionOf(X1,X0)
| ~ existsOnlyByNecessityOfOwnNature(X0)
| free(X0) ),
inference(cnf_transformation,[status(thm)],[f66]) ).
fof(f70,plain,
! [X0,X1] :
( ~ determinedByItselfAlone(X1,X0)
| ~ existsOnlyByNecessityOfOwnNature(X0)
| free(X0) ),
inference(cnf_transformation,[status(thm)],[f66]) ).
fof(f71,plain,
! [X,Y] :
( ( ( ~ isMethodExistence(Y)
& ~ isMethodAction(Y) )
| ~ determinedByDefiniteMethod(X,Y)
| ~ determinedByFixedMethod(X,Y)
| ~ externalTo(Y,X)
| necessary(X) )
& ( ( ( isMethodExistence(Y)
| isMethodAction(Y) )
& determinedByDefiniteMethod(X,Y)
& determinedByFixedMethod(X,Y)
& externalTo(Y,X) )
| ~ necessary(X) ) ),
inference(NNF_transformation,[status(thm)],[f9]) ).
fof(f72,plain,
( ! [X] :
( ! [Y] :
( ( ~ isMethodExistence(Y)
& ~ isMethodAction(Y) )
| ~ determinedByDefiniteMethod(X,Y)
| ~ determinedByFixedMethod(X,Y)
| ~ externalTo(Y,X) )
| necessary(X) )
& ! [X] :
( ( ! [Y] :
( isMethodExistence(Y)
| isMethodAction(Y) )
& ! [Y] : determinedByDefiniteMethod(X,Y)
& ! [Y] : determinedByFixedMethod(X,Y)
& ! [Y] : externalTo(Y,X) )
| ~ necessary(X) ) ),
inference(miniscoping,[status(thm)],[f71]) ).
fof(f73,plain,
! [X0,X1] :
( externalTo(X1,X0)
| ~ necessary(X0) ),
inference(cnf_transformation,[status(thm)],[f72]) ).
fof(f74,plain,
! [X0,X1] :
( determinedByFixedMethod(X0,X1)
| ~ necessary(X0) ),
inference(cnf_transformation,[status(thm)],[f72]) ).
fof(f75,plain,
! [X0,X1] :
( determinedByDefiniteMethod(X0,X1)
| ~ necessary(X0) ),
inference(cnf_transformation,[status(thm)],[f72]) ).
fof(f76,plain,
! [X0,X1] :
( isMethodExistence(X1)
| isMethodAction(X1)
| ~ necessary(X0) ),
inference(cnf_transformation,[status(thm)],[f72]) ).
fof(f77,plain,
! [X0,X1] :
( ~ isMethodAction(X1)
| ~ determinedByDefiniteMethod(X0,X1)
| ~ determinedByFixedMethod(X0,X1)
| ~ externalTo(X1,X0)
| necessary(X0) ),
inference(cnf_transformation,[status(thm)],[f72]) ).
fof(f78,plain,
! [X0,X1] :
( ~ isMethodExistence(X1)
| ~ determinedByDefiniteMethod(X0,X1)
| ~ determinedByFixedMethod(X0,X1)
| ~ externalTo(X1,X0)
| necessary(X0) ),
inference(cnf_transformation,[status(thm)],[f72]) ).
fof(f79,plain,
! [X] :
( ( ~ existConcFollowFromDefEternal(X)
| eternity(X) )
& ( existConcFollowFromDefEternal(X)
| ~ eternity(X) ) ),
inference(NNF_transformation,[status(thm)],[f10]) ).
fof(f80,plain,
( ! [X] :
( ~ existConcFollowFromDefEternal(X)
| eternity(X) )
& ! [X] :
( existConcFollowFromDefEternal(X)
| ~ eternity(X) ) ),
inference(miniscoping,[status(thm)],[f79]) ).
fof(f81,plain,
! [X0] :
( existConcFollowFromDefEternal(X0)
| ~ eternity(X0) ),
inference(cnf_transformation,[status(thm)],[f80]) ).
fof(f82,plain,
! [X0] :
( ~ existConcFollowFromDefEternal(X0)
| eternity(X0) ),
inference(cnf_transformation,[status(thm)],[f80]) ).
fof(f83,plain,
! [X,Y] :
( ( ( ( X = Y
| ~ existsIn(X,Y) )
& ~ existsIn(X,X) )
| exists(X) )
& ( ( X != Y
& existsIn(X,Y) )
| existsIn(X,X)
| ~ exists(X) ) ),
inference(NNF_transformation,[status(thm)],[f11]) ).
fof(f84,plain,
( ! [X] :
( ( ! [Y] :
( X = Y
| ~ existsIn(X,Y) )
& ~ existsIn(X,X) )
| exists(X) )
& ! [X] :
( ( ! [Y] : X != Y
& ! [Y] : existsIn(X,Y) )
| existsIn(X,X)
| ~ exists(X) ) ),
inference(miniscoping,[status(thm)],[f83]) ).
fof(f86,plain,
! [X0,X1] :
( X0 != X1
| existsIn(X0,X0)
| ~ exists(X0) ),
inference(cnf_transformation,[status(thm)],[f84]) ).
fof(f87,plain,
! [X0] :
( ~ existsIn(X0,X0)
| exists(X0) ),
inference(cnf_transformation,[status(thm)],[f84]) ).
fof(f88,plain,
! [X0,X1] :
( X0 = X1
| ~ existsIn(X0,X1)
| exists(X0) ),
inference(cnf_transformation,[status(thm)],[f84]) ).
fof(f89,plain,
! [X,Y] :
( ( X != Y
& conceivedThru(X,Y) )
| conceivedThru(X,X) ),
inference(pre_NNF_transformation,[status(thm)],[f12]) ).
fof(f90,plain,
! [X] :
( ( ! [Y] : X != Y
& ! [Y] : conceivedThru(X,Y) )
| conceivedThru(X,X) ),
inference(miniscoping,[status(thm)],[f89]) ).
fof(f92,plain,
! [X0,X1] :
( X0 != X1
| conceivedThru(X0,X0) ),
inference(cnf_transformation,[status(thm)],[f90]) ).
fof(f93,plain,
! [X,Y] :
( ( ( ~ effectNecessarilyFollowsFrom(Y,X)
| definiteCause(X) )
& effectNecessarilyFollowsFrom(Y,X) )
| ~ definiteCause(X) ),
inference(pre_NNF_transformation,[status(thm)],[f13]) ).
fof(f94,plain,
! [X] :
( ( ( ! [Y] : ~ effectNecessarilyFollowsFrom(Y,X)
| definiteCause(X) )
& ! [Y] : effectNecessarilyFollowsFrom(Y,X) )
| ~ definiteCause(X) ),
inference(miniscoping,[status(thm)],[f93]) ).
fof(f95,plain,
! [X0,X1] :
( effectNecessarilyFollowsFrom(X1,X0)
| ~ definiteCause(X0) ),
inference(cnf_transformation,[status(thm)],[f94]) ).
fof(f97,plain,
! [X,Y] :
( ( ~ knowledgeOfACause(X)
| knowledgeOfEffect(X,Y) )
& ( knowledgeOfACause(X)
| ~ knowledgeOfEffect(X,Y) ) ),
inference(NNF_transformation,[status(thm)],[f14]) ).
fof(f98,plain,
( ! [X] :
( ~ knowledgeOfACause(X)
| ! [Y] : knowledgeOfEffect(X,Y) )
& ! [X] :
( knowledgeOfACause(X)
| ! [Y] : ~ knowledgeOfEffect(X,Y) ) ),
inference(miniscoping,[status(thm)],[f97]) ).
fof(f99,plain,
! [X0,X1] :
( knowledgeOfACause(X0)
| ~ knowledgeOfEffect(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f98]) ).
fof(f100,plain,
! [X0,X1] :
( ~ knowledgeOfACause(X0)
| knowledgeOfEffect(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f98]) ).
fof(f101,plain,
! [X,Y] :
( ( ~ conceptionInvolves(Y,X)
& ~ conceptionInvolves(X,Y)
& ~ canBeUnderstoodInTermsOf(Y,X)
& ~ canBeUnderstoodInTermsOf(X,Y) )
| ~ haveNothingInCommon(X,Y) ),
inference(pre_NNF_transformation,[status(thm)],[f15]) ).
fof(f102,plain,
! [X0,X1] :
( ~ canBeUnderstoodInTermsOf(X0,X1)
| ~ haveNothingInCommon(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f101]) ).
fof(f103,plain,
! [X0,X1] :
( ~ canBeUnderstoodInTermsOf(X1,X0)
| ~ haveNothingInCommon(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f101]) ).
fof(f104,plain,
! [X0,X1] :
( ~ conceptionInvolves(X0,X1)
| ~ haveNothingInCommon(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f101]) ).
fof(f105,plain,
! [X0,X1] :
( ~ conceptionInvolves(X1,X0)
| ~ haveNothingInCommon(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f101]) ).
fof(f106,plain,
! [X,Y] :
( ( ( objectOf(Y,X)
| ideateOf(Y,X) )
& correspondWith(X,Y) )
| ~ trueIdea(X) ),
inference(pre_NNF_transformation,[status(thm)],[f16]) ).
fof(f107,plain,
! [X] :
( ( ! [Y] :
( objectOf(Y,X)
| ideateOf(Y,X) )
& ! [Y] : correspondWith(X,Y) )
| ~ trueIdea(X) ),
inference(miniscoping,[status(thm)],[f106]) ).
fof(f108,plain,
! [X0,X1] :
( correspondWith(X0,X1)
| ~ trueIdea(X0) ),
inference(cnf_transformation,[status(thm)],[f107]) ).
fof(f109,plain,
! [X0,X1] :
( objectOf(X1,X0)
| ideateOf(X1,X0)
| ~ trueIdea(X0) ),
inference(cnf_transformation,[status(thm)],[f107]) ).
fof(f110,plain,
? [X] :
( essenceInvExistence(X)
& canBeConceivedAsNonExisting(X) ),
inference(pre_NNF_transformation,[status(thm)],[f18]) ).
fof(f111,plain,
( essenceInvExistence(sK0_skl)
& canBeConceivedAsNonExisting(sK0_skl) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(X,sK0_skl)],[f110]) ).
fof(f112,plain,
canBeConceivedAsNonExisting(sK0_skl),
inference(cnf_transformation,[status(thm)],[f111]) ).
fof(f113,plain,
essenceInvExistence(sK0_skl),
inference(cnf_transformation,[status(thm)],[f111]) ).
fof(f114,plain,
! [X] :
( being(X)
| ~ substance(X) ),
inference(pre_NNF_transformation,[status(thm)],[f19]) ).
fof(f115,plain,
! [X0] :
( being(X0)
| ~ substance(X0) ),
inference(cnf_transformation,[status(thm)],[f114]) ).
fof(f116,plain,
! [X] :
( selfCaused(X)
| ~ inItself(X) ),
inference(pre_NNF_transformation,[status(thm)],[f20]) ).
fof(f117,plain,
! [X0] :
( selfCaused(X0)
| ~ inItself(X0) ),
inference(cnf_transformation,[status(thm)],[f116]) ).
fof(f118,plain,
! [X] :
( hasEssence(X)
| ~ being(X) ),
inference(pre_NNF_transformation,[status(thm)],[f21]) ).
fof(f119,plain,
! [X0] :
( hasEssence(X0)
| ~ being(X0) ),
inference(cnf_transformation,[status(thm)],[f118]) ).
fof(f120,plain,
! [X] :
( exists(X)
| ~ hasEssence(X)
| ~ essenceInvExistence(X) ),
inference(pre_NNF_transformation,[status(thm)],[f22]) ).
fof(f121,plain,
! [X0] :
( exists(X0)
| ~ hasEssence(X0)
| ~ essenceInvExistence(X0) ),
inference(cnf_transformation,[status(thm)],[f120]) ).
fof(f122,plain,
! [X0] :
( existsIn(X0,X0)
| ~ exists(X0) ),
inference(destructive_equality_resolution,[status(thm)],[f86]) ).
fof(f123,plain,
! [X0] : conceivedThru(X0,X0),
inference(destructive_equality_resolution,[status(thm)],[f92]) ).
fof(f124,plain,
( ~ natureConcOnlyByExistence(sK0_skl)
| selfCaused(sK0_skl) ),
inference(resolution,[status(thm)],[f27,f113]) ).
fof(f125,plain,
! [X0] :
( ~ existsIn(X0,X0)
| mode(X0) ),
inference(resolution,[status(thm)],[f49,f123]) ).
fof(f126,plain,
! [X0] :
( existsIn(X0,X0)
| ~ hasEssence(X0)
| ~ essenceInvExistence(X0) ),
inference(resolution,[status(thm)],[f121,f122]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PHI032+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.03 % Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n009.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 03:30:44 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.38 % Drodi V4.1.1
% 0.09/0.38 % SZS status CounterSatisfiable for theBenchmark: Theorem is counter-satisfiable, conjecture is false
% 0.09/0.38 % SZS output start Saturation for theBenchmark
% See solution above
% 0.09/0.42 % Elapsed time: 0.044820 seconds
% 0.09/0.42 % CPU time: 0.080132 seconds
% 0.09/0.42 % Total memory used: 10.239 MB
% 0.09/0.42 % Net memory used: 10.235 MB
%------------------------------------------------------------------------------