%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PHI016+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n025.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:48:55 EDT 2022
% Result : CounterSatisfiable 0.19s 0.45s
% Output : Saturation 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named 52)
% Comments :
%------------------------------------------------------------------------------
cnf(53,axiom,
( ~ isMethodAction(u)
| ~ determinedByDefiniteMethod(v,u)
| ~ determinedByFixedMethod(v,u)
| ~ externalTo(u,v)
| necessary(v) ),
file('PHI016+1.p',unknown),
[] ).
cnf(54,axiom,
( ~ isMethodExistence(u)
| ~ determinedByDefiniteMethod(v,u)
| ~ determinedByFixedMethod(v,u)
| ~ externalTo(u,v)
| necessary(v) ),
file('PHI016+1.p',unknown),
[] ).
cnf(83,plain,
( ~ exists__dfg(u)
| mode(u) ),
inference(res,[status(thm),theory(equality)],[22,81]),
[iquote('0:Res:22.1,81.0')] ).
cnf(81,plain,
( ~ existsIn(u,u)
| mode(u) ),
inference(res,[status(thm),theory(equality)],[3,49]),
[iquote('0:Res:3.0,49.0')] ).
cnf(64,plain,
( ~ constInInfAttributes(u)
| ~ expressesInfiniteEssentiality(v)
| ~ expressesEternalEssentiality(v)
| absolutelyInfinite(u) ),
inference(mrr,[status(thm)],[52,59]),
[iquote('1:MRR:52.0,59.0')] ).
cnf(49,axiom,
( ~ conceivedThru(u,v)
| ~ existsIn(u,v)
| mode(u) ),
file('PHI016+1.p',unknown),
[] ).
cnf(48,axiom,
( ~ sameKind(u,v)
| ~ canBeLimitedBy(u,v)
| finiteAfterItsKind(u) ),
file('PHI016+1.p',unknown),
[] ).
cnf(75,plain,
( ~ mode(u)
| modification(u,v)
| exists__dfg(u) ),
inference(res,[status(thm),theory(equality)],[41,23]),
[iquote('0:Res:41.2,23.0')] ).
cnf(74,plain,
( ~ mode(skc1)
| modification(skc1,u) ),
inference(res,[status(thm),theory(equality)],[41,58]),
[iquote('0:Res:41.2,58.0')] ).
cnf(50,axiom,
( ~ free(u)
| ~ actionOf(v,u)
| determinedByItselfAlone(v,u) ),
file('PHI016+1.p',unknown),
[] ).
cnf(41,axiom,
( ~ mode(u)
| modification(u,v)
| existsIn(u,w) ),
file('PHI016+1.p',unknown),
[] ).
cnf(40,axiom,
( ~ mode(u)
| modification(u,v)
| conceivedThru(u,w) ),
file('PHI016+1.p',unknown),
[] ).
cnf(46,axiom,
( ~ existsIn(u,v)
| exists__dfg(u)
| equal(u,v) ),
file('PHI016+1.p',unknown),
[] ).
cnf(47,axiom,
( ~ trueIdea(u)
| objectOf(v,u)
| ideateOf(v,u) ),
file('PHI016+1.p',unknown),
[] ).
cnf(45,axiom,
( ~ existsOnlyByNecessityOfOwnNature(u)
| ~ determinedByItselfAlone(v,u)
| free(u) ),
file('PHI016+1.p',unknown),
[] ).
cnf(43,axiom,
( ~ absolutelyInfinite(u)
| ~ attributeOf(v,u)
| expressesEternalEssentiality(v) ),
file('PHI016+1.p',unknown),
[] ).
cnf(44,axiom,
( ~ absolutelyInfinite(u)
| ~ attributeOf(v,u)
| expressesInfiniteEssentiality(v) ),
file('PHI016+1.p',unknown),
[] ).
cnf(63,plain,
( ~ constInInfAttributes(u)
| absolutelyInfinite(u)
| attributeOf(v,u) ),
inference(mrr,[status(thm)],[51,59]),
[iquote('1:MRR:51.0,59.0')] ).
cnf(36,axiom,
( ~ haveNothingInCommon(u,v)
| ~ canBeUnderstoodInTermsOf(u,v) ),
file('PHI016+1.p',unknown),
[] ).
cnf(37,axiom,
( ~ haveNothingInCommon(u,v)
| ~ canBeUnderstoodInTermsOf(v,u) ),
file('PHI016+1.p',unknown),
[] ).
cnf(38,axiom,
( ~ haveNothingInCommon(u,v)
| ~ conceptionInvolves(u,v) ),
file('PHI016+1.p',unknown),
[] ).
cnf(39,axiom,
( ~ haveNothingInCommon(u,v)
| ~ conceptionInvolves(v,u) ),
file('PHI016+1.p',unknown),
[] ).
cnf(35,axiom,
( ~ existsOnlyByNecessityOfOwnNature(u)
| free(u)
| actionOf(v,u) ),
file('PHI016+1.p',unknown),
[] ).
cnf(34,axiom,
( ~ absolutelyInfinite(u)
| ~ being(u)
| god(u) ),
file('PHI016+1.p',unknown),
[] ).
cnf(30,axiom,
( ~ natureConcOnlyByExistence(u)
| ~ essenceInvExistence(u)
| selfCaused(u) ),
file('PHI016+1.p',unknown),
[] ).
cnf(29,axiom,
( ~ necessary(u)
| isMethodExistence(v)
| isMethodAction(v) ),
file('PHI016+1.p',unknown),
[] ).
cnf(57,plain,
( ~ existsIn(skc1,u)
| equal(skc1,u) ),
inference(res,[status(thm),theory(equality)],[46,2]),
[iquote('0:Res:46.2,2.0')] ).
cnf(62,plain,
( ~ modification(u,v)
| mode(u) ),
inference(mrr,[status(thm)],[42,59]),
[iquote('1:MRR:42.0,59.0')] ).
cnf(25,axiom,
( ~ knowledgeOfEffect(u,v)
| knowledgeOfACause(u) ),
file('PHI016+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ necessary(u)
| externalTo(v,u) ),
file('PHI016+1.p',unknown),
[] ).
cnf(20,axiom,
( ~ necessary(u)
| determinedByFixedMethod(u,v) ),
file('PHI016+1.p',unknown),
[] ).
cnf(21,axiom,
( ~ necessary(u)
| determinedByDefiniteMethod(u,v) ),
file('PHI016+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ finiteAfterItsKind(u)
| canBeLimitedBy(u,v) ),
file('PHI016+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ finiteAfterItsKind(u)
| sameKind(u,v) ),
file('PHI016+1.p',unknown),
[] ).
cnf(26,axiom,
( ~ knowledgeOfACause(u)
| knowledgeOfEffect(u,v) ),
file('PHI016+1.p',unknown),
[] ).
cnf(27,axiom,
( ~ trueIdea(u)
| correspondWith(u,v) ),
file('PHI016+1.p',unknown),
[] ).
cnf(24,axiom,
( ~ definiteCause(u)
| effectNecessarilyFollowsFrom(v,u) ),
file('PHI016+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ existsIn(u,u)
| exists__dfg(u) ),
file('PHI016+1.p',unknown),
[] ).
cnf(65,plain,
~ exists__dfg(skc1),
inference(res,[status(thm),theory(equality)],[22,58]),
[iquote('0:Res:22.1,58.0')] ).
cnf(22,axiom,
( ~ exists__dfg(u)
| existsIn(u,u) ),
file('PHI016+1.p',unknown),
[] ).
cnf(28,axiom,
( ~ essenceInvExistence(u)
| ~ canBeConceivedAsNonExisting(u) ),
file('PHI016+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ god(u)
| absolutelyInfinite(u) ),
file('PHI016+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ absolutelyInfinite(u)
| constInInfAttributes(u) ),
file('PHI016+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ god(u)
| being(u) ),
file('PHI016+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ free(u)
| existsOnlyByNecessityOfOwnNature(u) ),
file('PHI016+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ selfCaused(u)
| essenceInvExistence(u) ),
file('PHI016+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ selfCaused(u)
| natureConcOnlyByExistence(u) ),
file('PHI016+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ attribute(u)
| intPercAsConstEssSub(u) ),
file('PHI016+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ intPercAsConstEssSub(u)
| attribute(u) ),
file('PHI016+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ eternity(u)
| existConcFollowFromDefEternal(u) ),
file('PHI016+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ existConcFollowFromDefEternal(u)
| eternity(u) ),
file('PHI016+1.p',unknown),
[] ).
cnf(58,plain,
~ existsIn(skc1,skc1),
inference(res,[status(thm),theory(equality)],[23,2]),
[iquote('0:Res:23.1,2.0')] ).
cnf(3,axiom,
conceivedThru(u,u),
file('PHI016+1.p',unknown),
[] ).
cnf(2,axiom,
~ exists__dfg(skc1),
file('PHI016+1.p',unknown),
[] ).
cnf(61,plain,
inItself(u),
inference(mrr,[status(thm)],[6,59]),
[iquote('1:MRR:6.0,59.0')] ).
cnf(60,plain,
conceivedThruItself(u),
inference(mrr,[status(thm)],[7,59]),
[iquote('1:MRR:7.0,59.0')] ).
cnf(56,plain,
absolutelyInfinite(skc1),
inference(res,[status(thm),theory(equality)],[1,11]),
[iquote('0:Res:1.0,11.0')] ).
cnf(55,plain,
being(skc1),
inference(res,[status(thm),theory(equality)],[1,10]),
[iquote('0:Res:1.0,10.0')] ).
cnf(1,axiom,
god(skc1),
file('PHI016+1.p',unknown),
[] ).
cnf(59,plain,
substance(u),
inference(spt,[],[33]),
[iquote('1:Spt:33.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PHI016+1 : TPTP v8.1.0. Released v7.4.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 2 02:10:29 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45
% 0.19/0.45 SPASS V 3.9
% 0.19/0.45 SPASS beiseite: Completion found.
% 0.19/0.45 % SZS status CounterSatisfiable
% 0.19/0.45 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 SPASS derived 33 clauses, backtracked 0 clauses, performed 1 splits and kept 69 clauses.
% 0.19/0.45 SPASS allocated 97705 KBytes.
% 0.19/0.45 SPASS spent 0:00:00.10 on the problem.
% 0.19/0.45 0:00:00.04 for the input.
% 0.19/0.45 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.45 0:00:00.00 for inferences.
% 0.19/0.45 0:00:00.00 for the backtracking.
% 0.19/0.45 0:00:00.00 for the reduction.
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 The saturated set of worked-off clauses is :
% 0.19/0.45 % SZS output start Saturation
% See solution above
%------------------------------------------------------------------------------