TSTP Solution File: PHI026+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PHI026+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n019.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:56 EDT 2022
% Result : CounterSatisfiable 0.19s 0.44s
% Output : Saturation 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named 55)
% Comments :
%------------------------------------------------------------------------------
cnf(56,axiom,
( ~ isMethodAction(u)
| ~ determinedByDefiniteMethod(v,u)
| ~ determinedByFixedMethod(v,u)
| ~ externalTo(u,v)
| necessary(v) ),
file('PHI026+1.p',unknown),
[] ).
cnf(57,axiom,
( ~ isMethodExistence(u)
| ~ determinedByDefiniteMethod(v,u)
| ~ determinedByFixedMethod(v,u)
| ~ externalTo(u,v)
| necessary(v) ),
file('PHI026+1.p',unknown),
[] ).
cnf(64,plain,
( ~ constInInfAttributes(u)
| ~ expressesInfiniteEssentiality(v)
| ~ expressesEternalEssentiality(v)
| absolutelyInfinite(u) ),
inference(mrr,[status(thm)],[55,58]),
[iquote('1:MRR:55.0,58.0')] ).
cnf(82,plain,
( ~ existsIn(u,u)
| mode(u) ),
inference(res,[status(thm),theory(equality)],[1,52]),
[iquote('0:Res:1.0,52.0')] ).
cnf(52,axiom,
( ~ conceivedThru(u,v)
| ~ existsIn(u,v)
| mode(u) ),
file('PHI026+1.p',unknown),
[] ).
cnf(51,axiom,
( ~ sameKind(u,v)
| ~ canBeLimitedBy(u,v)
| finiteAfterItsKind(u) ),
file('PHI026+1.p',unknown),
[] ).
cnf(53,axiom,
( ~ free(u)
| ~ actionOf(v,u)
| determinedByItselfAlone(v,u) ),
file('PHI026+1.p',unknown),
[] ).
cnf(45,axiom,
( ~ mode(u)
| modification(u,v)
| existsIn(u,w) ),
file('PHI026+1.p',unknown),
[] ).
cnf(44,axiom,
( ~ mode(u)
| modification(u,v)
| conceivedThru(u,w) ),
file('PHI026+1.p',unknown),
[] ).
cnf(43,axiom,
( ~ trueIdea(u)
| objectOf(v,u)
| ideateOf(v,u) ),
file('PHI026+1.p',unknown),
[] ).
cnf(49,axiom,
( ~ existsOnlyByNecessityOfOwnNature(u)
| ~ determinedByItselfAlone(v,u)
| free(u) ),
file('PHI026+1.p',unknown),
[] ).
cnf(47,axiom,
( ~ absolutelyInfinite(u)
| ~ attributeOf(v,u)
| expressesEternalEssentiality(v) ),
file('PHI026+1.p',unknown),
[] ).
cnf(48,axiom,
( ~ absolutelyInfinite(u)
| ~ attributeOf(v,u)
| expressesInfiniteEssentiality(v) ),
file('PHI026+1.p',unknown),
[] ).
cnf(63,plain,
( ~ constInInfAttributes(u)
| absolutelyInfinite(u)
| attributeOf(v,u) ),
inference(mrr,[status(thm)],[54,58]),
[iquote('1:MRR:54.0,58.0')] ).
cnf(31,axiom,
( ~ haveNothingInCommon(u,v)
| ~ canBeUnderstoodInTermsOf(u,v) ),
file('PHI026+1.p',unknown),
[] ).
cnf(32,axiom,
( ~ haveNothingInCommon(u,v)
| ~ canBeUnderstoodInTermsOf(v,u) ),
file('PHI026+1.p',unknown),
[] ).
cnf(33,axiom,
( ~ haveNothingInCommon(u,v)
| ~ conceptionInvolves(u,v) ),
file('PHI026+1.p',unknown),
[] ).
cnf(34,axiom,
( ~ haveNothingInCommon(u,v)
| ~ conceptionInvolves(v,u) ),
file('PHI026+1.p',unknown),
[] ).
cnf(41,axiom,
( ~ existsOnlyByNecessityOfOwnNature(u)
| free(u)
| actionOf(v,u) ),
file('PHI026+1.p',unknown),
[] ).
cnf(29,axiom,
( ~ necessary(u)
| isMethodExistence(v)
| isMethodAction(v) ),
file('PHI026+1.p',unknown),
[] ).
cnf(74,plain,
( ~ existsIn(skc2,skc3)
| equal(skc3,skc2) ),
inference(mrr,[status(thm)],[50,72]),
[iquote('1:MRR:50.0,72.0')] ).
cnf(62,plain,
( ~ modification(u,v)
| mode(u) ),
inference(mrr,[status(thm)],[46,58]),
[iquote('1:MRR:46.0,58.0')] ).
cnf(19,axiom,
( ~ knowledgeOfEffect(u,v)
| knowledgeOfACause(u) ),
file('PHI026+1.p',unknown),
[] ).
cnf(25,axiom,
( ~ necessary(u)
| externalTo(v,u) ),
file('PHI026+1.p',unknown),
[] ).
cnf(26,axiom,
( ~ necessary(u)
| determinedByFixedMethod(u,v) ),
file('PHI026+1.p',unknown),
[] ).
cnf(27,axiom,
( ~ necessary(u)
| determinedByDefiniteMethod(u,v) ),
file('PHI026+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ finiteAfterItsKind(u)
| canBeLimitedBy(u,v) ),
file('PHI026+1.p',unknown),
[] ).
cnf(24,axiom,
( ~ finiteAfterItsKind(u)
| sameKind(u,v) ),
file('PHI026+1.p',unknown),
[] ).
cnf(20,axiom,
( ~ knowledgeOfACause(u)
| knowledgeOfEffect(u,v) ),
file('PHI026+1.p',unknown),
[] ).
cnf(21,axiom,
( ~ trueIdea(u)
| correspondWith(u,v) ),
file('PHI026+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ definiteCause(u)
| effectNecessarilyFollowsFrom(v,u) ),
file('PHI026+1.p',unknown),
[] ).
cnf(67,plain,
( ~ absolutelyInfinite(u)
| god(u) ),
inference(mrr,[status(thm)],[40,61]),
[iquote('1:MRR:40.1,61.0')] ).
cnf(12,axiom,
( ~ god(u)
| absolutelyInfinite(u) ),
file('PHI026+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ absolutelyInfinite(u)
| constInInfAttributes(u) ),
file('PHI026+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ free(u)
| existsOnlyByNecessityOfOwnNature(u) ),
file('PHI026+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ attribute(u)
| intPercAsConstEssSub(u) ),
file('PHI026+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ intPercAsConstEssSub(u)
| attribute(u) ),
file('PHI026+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ eternity(u)
| existConcFollowFromDefEternal(u) ),
file('PHI026+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ existConcFollowFromDefEternal(u)
| eternity(u) ),
file('PHI026+1.p',unknown),
[] ).
cnf(73,plain,
~ existsIn(skc2,skc2),
inference(mrr,[status(thm)],[28,72]),
[iquote('1:MRR:28.0,72.0')] ).
cnf(1,axiom,
conceivedThru(u,u),
file('PHI026+1.p',unknown),
[] ).
cnf(71,plain,
~ canBeConceivedAsNonExisting(u),
inference(mrr,[status(thm)],[22,69]),
[iquote('1:MRR:22.0,69.0')] ).
cnf(72,plain,
exists__dfg(u),
inference(mrr,[status(thm)],[70,69]),
[iquote('1:MRR:70.0,69.0')] ).
cnf(69,plain,
essenceInvExistence(u),
inference(mrr,[status(thm)],[5,65]),
[iquote('1:MRR:5.0,65.0')] ).
cnf(68,plain,
natureConcOnlyByExistence(u),
inference(mrr,[status(thm)],[6,65]),
[iquote('1:MRR:6.0,65.0')] ).
cnf(66,plain,
hasEssence(u),
inference(mrr,[status(thm)],[4,61]),
[iquote('1:MRR:4.0,61.0')] ).
cnf(65,plain,
selfCaused(u),
inference(mrr,[status(thm)],[3,60]),
[iquote('1:MRR:3.0,60.0')] ).
cnf(61,plain,
being(u),
inference(mrr,[status(thm)],[2,58]),
[iquote('1:MRR:2.0,58.0')] ).
cnf(60,plain,
inItself(u),
inference(mrr,[status(thm)],[7,58]),
[iquote('1:MRR:7.0,58.0')] ).
cnf(59,plain,
conceivedThruItself(u),
inference(mrr,[status(thm)],[8,58]),
[iquote('1:MRR:8.0,58.0')] ).
cnf(58,plain,
substance(u),
inference(spt,[],[39]),
[iquote('1:Spt:39.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : PHI026+1 : TPTP v8.1.0. Released v7.4.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n019.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:25:25 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.44
% 0.19/0.44 SPASS V 3.9
% 0.19/0.44 SPASS beiseite: Completion found.
% 0.19/0.44 % SZS status CounterSatisfiable
% 0.19/0.44 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.44 SPASS derived 28 clauses, backtracked 0 clauses, performed 1 splits and kept 74 clauses.
% 0.19/0.44 SPASS allocated 97679 KBytes.
% 0.19/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.19/0.44 0:00:00.04 for the input.
% 0.19/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.44 0:00:00.00 for inferences.
% 0.19/0.44 0:00:00.00 for the backtracking.
% 0.19/0.44 0:00:00.00 for the reduction.
% 0.19/0.44
% 0.19/0.44
% 0.19/0.44 The saturated set of worked-off clauses is :
% 0.19/0.44 % SZS output start Saturation
% See solution above
%------------------------------------------------------------------------------