%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PHI021+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n028.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.20s 0.45s
% Output : Saturation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named 56)
% Comments :
%------------------------------------------------------------------------------
cnf(57,axiom,
( ~ isMethodAction(u)
| ~ determinedByDefiniteMethod(v,u)
| ~ determinedByFixedMethod(v,u)
| ~ externalTo(u,v)
| necessary(v) ),
file('PHI021+1.p',unknown),
[] ).
cnf(58,axiom,
( ~ isMethodExistence(u)
| ~ determinedByDefiniteMethod(v,u)
| ~ determinedByFixedMethod(v,u)
| ~ externalTo(u,v)
| necessary(v) ),
file('PHI021+1.p',unknown),
[] ).
cnf(69,plain,
( ~ constInInfAttributes(u)
| ~ expressesInfiniteEssentiality(v)
| ~ expressesEternalEssentiality(v)
| absolutelyInfinite(u) ),
inference(mrr,[status(thm)],[56,63]),
[iquote('1:MRR:56.0,63.0')] ).
cnf(94,plain,
( ~ exists__dfg(u)
| mode(u) ),
inference(res,[status(thm),theory(equality)],[26,92]),
[iquote('0:Res:26.1,92.0')] ).
cnf(92,plain,
( ~ existsIn(u,u)
| mode(u) ),
inference(res,[status(thm),theory(equality)],[4,53]),
[iquote('0:Res:4.0,53.0')] ).
cnf(53,axiom,
( ~ conceivedThru(u,v)
| ~ existsIn(u,v)
| mode(u) ),
file('PHI021+1.p',unknown),
[] ).
cnf(52,axiom,
( ~ sameKind(u,v)
| ~ canBeLimitedBy(u,v)
| finiteAfterItsKind(u) ),
file('PHI021+1.p',unknown),
[] ).
cnf(54,axiom,
( ~ free(u)
| ~ actionOf(v,u)
| determinedByItselfAlone(v,u) ),
file('PHI021+1.p',unknown),
[] ).
cnf(86,plain,
( ~ mode(u)
| modification(u,v)
| exists__dfg(u) ),
inference(res,[status(thm),theory(equality)],[45,27]),
[iquote('0:Res:45.2,27.0')] ).
cnf(85,plain,
( ~ mode(skc1)
| modification(skc1,u) ),
inference(res,[status(thm),theory(equality)],[45,62]),
[iquote('0:Res:45.2,62.0')] ).
cnf(45,axiom,
( ~ mode(u)
| modification(u,v)
| existsIn(u,w) ),
file('PHI021+1.p',unknown),
[] ).
cnf(44,axiom,
( ~ mode(u)
| modification(u,v)
| conceivedThru(u,w) ),
file('PHI021+1.p',unknown),
[] ).
cnf(50,axiom,
( ~ existsIn(u,v)
| exists__dfg(u)
| equal(u,v) ),
file('PHI021+1.p',unknown),
[] ).
cnf(51,axiom,
( ~ trueIdea(u)
| objectOf(v,u)
| ideateOf(v,u) ),
file('PHI021+1.p',unknown),
[] ).
cnf(49,axiom,
( ~ existsOnlyByNecessityOfOwnNature(u)
| ~ determinedByItselfAlone(v,u)
| free(u) ),
file('PHI021+1.p',unknown),
[] ).
cnf(47,axiom,
( ~ absolutelyInfinite(u)
| ~ attributeOf(v,u)
| expressesEternalEssentiality(v) ),
file('PHI021+1.p',unknown),
[] ).
cnf(48,axiom,
( ~ absolutelyInfinite(u)
| ~ attributeOf(v,u)
| expressesInfiniteEssentiality(v) ),
file('PHI021+1.p',unknown),
[] ).
cnf(68,plain,
( ~ constInInfAttributes(u)
| absolutelyInfinite(u)
| attributeOf(v,u) ),
inference(mrr,[status(thm)],[55,63]),
[iquote('1:MRR:55.0,63.0')] ).
cnf(40,axiom,
( ~ haveNothingInCommon(u,v)
| ~ canBeUnderstoodInTermsOf(u,v) ),
file('PHI021+1.p',unknown),
[] ).
cnf(41,axiom,
( ~ haveNothingInCommon(u,v)
| ~ canBeUnderstoodInTermsOf(v,u) ),
file('PHI021+1.p',unknown),
[] ).
cnf(42,axiom,
( ~ haveNothingInCommon(u,v)
| ~ conceptionInvolves(u,v) ),
file('PHI021+1.p',unknown),
[] ).
cnf(43,axiom,
( ~ haveNothingInCommon(u,v)
| ~ conceptionInvolves(v,u) ),
file('PHI021+1.p',unknown),
[] ).
cnf(39,axiom,
( ~ existsOnlyByNecessityOfOwnNature(u)
| free(u)
| actionOf(v,u) ),
file('PHI021+1.p',unknown),
[] ).
cnf(33,axiom,
( ~ necessary(u)
| isMethodExistence(v)
| isMethodAction(v) ),
file('PHI021+1.p',unknown),
[] ).
cnf(61,plain,
( ~ existsIn(skc1,u)
| equal(skc1,u) ),
inference(res,[status(thm),theory(equality)],[50,3]),
[iquote('0:Res:50.2,3.0')] ).
cnf(67,plain,
( ~ modification(u,v)
| mode(u) ),
inference(mrr,[status(thm)],[46,63]),
[iquote('1:MRR:46.0,63.0')] ).
cnf(29,axiom,
( ~ knowledgeOfEffect(u,v)
| knowledgeOfACause(u) ),
file('PHI021+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ necessary(u)
| externalTo(v,u) ),
file('PHI021+1.p',unknown),
[] ).
cnf(24,axiom,
( ~ necessary(u)
| determinedByFixedMethod(u,v) ),
file('PHI021+1.p',unknown),
[] ).
cnf(25,axiom,
( ~ necessary(u)
| determinedByDefiniteMethod(u,v) ),
file('PHI021+1.p',unknown),
[] ).
cnf(21,axiom,
( ~ finiteAfterItsKind(u)
| canBeLimitedBy(u,v) ),
file('PHI021+1.p',unknown),
[] ).
cnf(22,axiom,
( ~ finiteAfterItsKind(u)
| sameKind(u,v) ),
file('PHI021+1.p',unknown),
[] ).
cnf(30,axiom,
( ~ knowledgeOfACause(u)
| knowledgeOfEffect(u,v) ),
file('PHI021+1.p',unknown),
[] ).
cnf(31,axiom,
( ~ trueIdea(u)
| correspondWith(u,v) ),
file('PHI021+1.p',unknown),
[] ).
cnf(28,axiom,
( ~ definiteCause(u)
| effectNecessarilyFollowsFrom(v,u) ),
file('PHI021+1.p',unknown),
[] ).
cnf(27,axiom,
( ~ existsIn(u,u)
| exists__dfg(u) ),
file('PHI021+1.p',unknown),
[] ).
cnf(76,plain,
~ exists__dfg(skc1),
inference(res,[status(thm),theory(equality)],[26,62]),
[iquote('0:Res:26.1,62.0')] ).
cnf(26,axiom,
( ~ exists__dfg(u)
| existsIn(u,u) ),
file('PHI021+1.p',unknown),
[] ).
cnf(72,plain,
( ~ absolutelyInfinite(u)
| god(u) ),
inference(mrr,[status(thm)],[38,66]),
[iquote('1:MRR:38.1,66.0')] ).
cnf(15,axiom,
( ~ god(u)
| absolutelyInfinite(u) ),
file('PHI021+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ absolutelyInfinite(u)
| constInInfAttributes(u) ),
file('PHI021+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ free(u)
| existsOnlyByNecessityOfOwnNature(u) ),
file('PHI021+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ attribute(u)
| intPercAsConstEssSub(u) ),
file('PHI021+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ intPercAsConstEssSub(u)
| attribute(u) ),
file('PHI021+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ eternity(u)
| existConcFollowFromDefEternal(u) ),
file('PHI021+1.p',unknown),
[] ).
cnf(20,axiom,
( ~ existConcFollowFromDefEternal(u)
| eternity(u) ),
file('PHI021+1.p',unknown),
[] ).
cnf(62,plain,
~ existsIn(skc1,skc1),
inference(res,[status(thm),theory(equality)],[27,3]),
[iquote('0:Res:27.1,3.0')] ).
cnf(4,axiom,
conceivedThru(u,u),
file('PHI021+1.p',unknown),
[] ).
cnf(75,plain,
~ canBeConceivedAsNonExisting(u),
inference(mrr,[status(thm)],[32,74]),
[iquote('1:MRR:32.0,74.0')] ).
cnf(3,axiom,
~ exists__dfg(skc1),
file('PHI021+1.p',unknown),
[] ).
cnf(74,plain,
essenceInvExistence(u),
inference(mrr,[status(thm)],[8,70]),
[iquote('1:MRR:8.0,70.0')] ).
cnf(73,plain,
natureConcOnlyByExistence(u),
inference(mrr,[status(thm)],[9,70]),
[iquote('1:MRR:9.0,70.0')] ).
cnf(71,plain,
hasEssence(u),
inference(mrr,[status(thm)],[7,66]),
[iquote('1:MRR:7.0,66.0')] ).
cnf(70,plain,
selfCaused(u),
inference(mrr,[status(thm)],[6,65]),
[iquote('1:MRR:6.0,65.0')] ).
cnf(66,plain,
being(u),
inference(mrr,[status(thm)],[5,63]),
[iquote('1:MRR:5.0,63.0')] ).
cnf(65,plain,
inItself(u),
inference(mrr,[status(thm)],[10,63]),
[iquote('1:MRR:10.0,63.0')] ).
cnf(64,plain,
conceivedThruItself(u),
inference(mrr,[status(thm)],[11,63]),
[iquote('1:MRR:11.0,63.0')] ).
cnf(63,plain,
substance(u),
inference(spt,[],[37]),
[iquote('1:Spt:37.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PHI021+1 : TPTP v8.1.0. Released v7.4.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n028.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 01:39:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45
% 0.20/0.45 SPASS V 3.9
% 0.20/0.45 SPASS beiseite: Completion found.
% 0.20/0.45 % SZS status CounterSatisfiable
% 0.20/0.45 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.45 SPASS derived 40 clauses, backtracked 0 clauses, performed 1 splits and kept 80 clauses.
% 0.20/0.45 SPASS allocated 97711 KBytes.
% 0.20/0.45 SPASS spent 0:00:00.09 on the problem.
% 0.20/0.45 0:00:00.04 for the input.
% 0.20/0.45 0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.45 0:00:00.00 for inferences.
% 0.20/0.45 0:00:00.00 for the backtracking.
% 0.20/0.45 0:00:00.00 for the reduction.
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 The saturated set of worked-off clauses is :
% 0.20/0.45 % SZS output start Saturation
% See solution above
%------------------------------------------------------------------------------