TSTP Solution File: PHI040+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : PHI040+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %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 : 300s
% DateTime : Wed Jul 27 13:10:43 EDT 2022
% Result : Timeout 299.85s 300.03s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : PHI040+1 : TPTP v8.1.0. Released v7.4.0.
% 0.10/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n019.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 02:36:07 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.77/1.98 ----- Otter 3.3f, August 2004 -----
% 1.77/1.98 The process was started by sandbox on n019.cluster.edu,
% 1.77/1.98 Wed Jul 27 02:36:07 2022
% 1.77/1.98 The command was "./otter". The process ID is 22427.
% 1.77/1.98
% 1.77/1.98 set(prolog_style_variables).
% 1.77/1.98 set(auto).
% 1.77/1.98 dependent: set(auto1).
% 1.77/1.98 dependent: set(process_input).
% 1.77/1.98 dependent: clear(print_kept).
% 1.77/1.98 dependent: clear(print_new_demod).
% 1.77/1.98 dependent: clear(print_back_demod).
% 1.77/1.98 dependent: clear(print_back_sub).
% 1.77/1.98 dependent: set(control_memory).
% 1.77/1.98 dependent: assign(max_mem, 12000).
% 1.77/1.98 dependent: assign(pick_given_ratio, 4).
% 1.77/1.98 dependent: assign(stats_level, 1).
% 1.77/1.98 dependent: assign(max_seconds, 10800).
% 1.77/1.98 clear(print_given).
% 1.77/1.98
% 1.77/1.98 formula_list(usable).
% 1.77/1.98 all A (A=A).
% 1.77/1.98 all X Y (exists(X)<->existsIn(X,X)|existsIn(X,Y)&X!=Y).
% 1.77/1.98 all X Y (-conceivedThru(X,X)->conceivedThru(X,Y)&X!=Y).
% 1.77/1.98 all X Y (definiteCause(X)->effectNecessarilyFollowsFrom(Y,X)& (-definiteCause(X)-> -effectNecessarilyFollowsFrom(Y,X))).
% 1.77/1.98 all X Y (knowledgeOfEffect(X,Y)<->knowledgeOfACause(X)).
% 1.77/1.98 all X Y (haveNothingInCommon(X,Y)-> -canBeUnderstoodInTermsOf(X,Y)& -canBeUnderstoodInTermsOf(Y,X)& -conceptionInvolves(X,Y)& -conceptionInvolves(Y,X)).
% 1.77/1.98 all X Y (trueIdea(X)->correspondWith(X,Y)& (ideateOf(Y,X)|objectOf(Y,X))).
% 1.77/1.98 all X (canBeConceivedAsNonExisting(X)-> -essenceInvExistence(X)).
% 1.77/1.98 all X (selfCaused(X)<->essenceInvExistence(X)&natureConcOnlyByExistence(X)).
% 1.77/1.98 all X Y (finiteAfterItsKind(X)<->canBeLimitedBy(X,Y)&sameKind(X,Y)).
% 1.77/1.98 all X (substance(X)<->inItself(X)&conceivedThruItself(X)).
% 1.77/1.98 all X (attribute(X)<->intPercAsConstEssSub(X)).
% 1.77/1.98 all X Y Z (mode(X)<->modification(X,Y)&substance(Y)|existsIn(X,Z)&conceivedThru(X,Z)).
% 1.77/1.98 all X (god(X)<->being(X)&absolutelyInfinite(X)).
% 1.77/1.98 all X Y (absolutelyInfinite(X)<->substance(X)&constInInfAttributes(X)& (attributeOf(Y,X)->expressesEternalEssentiality(Y)&expressesInfiniteEssentiality(Y))).
% 1.77/1.98 -(all X Y (free(X)<->existsOnlyByNecessityOfOwnNature(X)& (actionOf(Y,X)->determinedByItselfAlone(Y,X)))).
% 1.77/1.98 all X Y (necessary(X)<->externalTo(Y,X)&determinedByFixedMethod(X,Y)&determinedByDefiniteMethod(X,Y)& (isMethodAction(Y)|isMethodExistence(Y))).
% 1.77/1.98 all X (eternity(X)<->existConcFollowFromDefEternal(X)).
% 1.77/1.98 all X (substance(X)->being(X)).
% 1.77/1.98 all X (inItself(X)->selfCaused(X)).
% 1.77/1.98 all X (being(X)->hasEssence(X)).
% 1.77/1.98 all X (essenceInvExistence(X)&hasEssence(X)->exists(X)).
% 1.77/1.98 end_of_list.
% 1.77/1.98
% 1.77/1.98 -------> usable clausifies to:
% 1.77/1.98
% 1.77/1.98 list(usable).
% 1.77/1.98 0 [] A=A.
% 1.77/1.98 0 [] -exists(X)|existsIn(X,X)|existsIn(X,Y).
% 1.77/1.98 0 [] -exists(X)|existsIn(X,X)|X!=Y.
% 1.77/1.98 0 [] exists(X)| -existsIn(X,X).
% 1.77/1.98 0 [] exists(X)| -existsIn(X,Y)|X=Y.
% 1.77/1.98 0 [] conceivedThru(X,X)|conceivedThru(X,Y).
% 1.77/1.98 0 [] conceivedThru(X,X)|X!=Y.
% 1.77/1.98 0 [] -definiteCause(X)|effectNecessarilyFollowsFrom(Y,X).
% 1.77/1.98 0 [] -knowledgeOfEffect(X,Y)|knowledgeOfACause(X).
% 1.77/1.98 0 [] knowledgeOfEffect(X,Y)| -knowledgeOfACause(X).
% 1.77/1.98 0 [] -haveNothingInCommon(X,Y)| -canBeUnderstoodInTermsOf(X,Y).
% 1.77/1.98 0 [] -haveNothingInCommon(X,Y)| -canBeUnderstoodInTermsOf(Y,X).
% 1.77/1.98 0 [] -haveNothingInCommon(X,Y)| -conceptionInvolves(X,Y).
% 1.77/1.98 0 [] -haveNothingInCommon(X,Y)| -conceptionInvolves(Y,X).
% 1.77/1.98 0 [] -trueIdea(X)|correspondWith(X,Y).
% 1.77/1.98 0 [] -trueIdea(X)|ideateOf(Y,X)|objectOf(Y,X).
% 1.77/1.98 0 [] -canBeConceivedAsNonExisting(X)| -essenceInvExistence(X).
% 1.77/1.98 0 [] -selfCaused(X)|essenceInvExistence(X).
% 1.77/1.98 0 [] -selfCaused(X)|natureConcOnlyByExistence(X).
% 1.77/1.98 0 [] selfCaused(X)| -essenceInvExistence(X)| -natureConcOnlyByExistence(X).
% 1.77/1.98 0 [] -finiteAfterItsKind(X)|canBeLimitedBy(X,Y).
% 1.77/1.98 0 [] -finiteAfterItsKind(X)|sameKind(X,Y).
% 1.77/1.98 0 [] finiteAfterItsKind(X)| -canBeLimitedBy(X,Y)| -sameKind(X,Y).
% 1.77/1.98 0 [] -substance(X)|inItself(X).
% 1.77/1.98 0 [] -substance(X)|conceivedThruItself(X).
% 1.77/1.98 0 [] substance(X)| -inItself(X)| -conceivedThruItself(X).
% 1.77/1.98 0 [] -attribute(X)|intPercAsConstEssSub(X).
% 1.77/1.98 0 [] attribute(X)| -intPercAsConstEssSub(X).
% 1.77/1.98 0 [] -mode(X)|modification(X,Y)|existsIn(X,Z).
% 1.77/1.98 0 [] -mode(X)|modification(X,Y)|conceivedThru(X,Z).
% 1.77/1.98 0 [] -mode(X)|substance(Y)|existsIn(X,Z).
% 1.77/1.98 0 [] -mode(X)|substance(Y)|conceivedThru(X,Z).
% 1.77/1.98 0 [] mode(X)| -modification(X,Y)| -substance(Y).
% 1.77/1.98 0 [] mode(X)| -existsIn(X,Z)| -conceivedThru(X,Z).
% 1.77/1.98 0 [] -god(X)|being(X).
% 1.77/1.98 0 [] -god(X)|absolutelyInfinite(X).
% 1.77/1.98 0 [] god(X)| -being(X)| -absolutelyInfinite(X).
% 1.77/1.98 0 [] -absolutelyInfinite(X)|substance(X).
% 1.77/1.98 0 [] -absolutelyInfinite(X)|constInInfAttributes(X).
% 1.77/1.98 0 [] -absolutelyInfinite(X)| -attributeOf(Y,X)|expressesEternalEssentiality(Y).
% 1.77/1.98 0 [] -absolutelyInfinite(X)| -attributeOf(Y,X)|expressesInfiniteEssentiality(Y).
% 1.77/1.98 0 [] absolutelyInfinite(X)| -substance(X)| -constInInfAttributes(X)|attributeOf(Y,X).
% 1.77/1.98 0 [] absolutelyInfinite(X)| -substance(X)| -constInInfAttributes(X)| -expressesEternalEssentiality(Y)| -expressesInfiniteEssentiality(Y).
% 1.77/1.98 0 [] free($c2)|existsOnlyByNecessityOfOwnNature($c2).
% 1.77/1.98 0 [] free($c2)| -actionOf($c1,$c2)|determinedByItselfAlone($c1,$c2).
% 1.77/1.98 0 [] -free($c2)| -existsOnlyByNecessityOfOwnNature($c2)|actionOf($c1,$c2).
% 1.77/1.98 0 [] -free($c2)| -existsOnlyByNecessityOfOwnNature($c2)| -determinedByItselfAlone($c1,$c2).
% 1.77/1.98 0 [] -necessary(X)|externalTo(Y,X).
% 1.77/1.98 0 [] -necessary(X)|determinedByFixedMethod(X,Y).
% 1.77/1.98 0 [] -necessary(X)|determinedByDefiniteMethod(X,Y).
% 1.77/1.98 0 [] -necessary(X)|isMethodAction(Y)|isMethodExistence(Y).
% 1.77/1.98 0 [] necessary(X)| -externalTo(Y,X)| -determinedByFixedMethod(X,Y)| -determinedByDefiniteMethod(X,Y)| -isMethodAction(Y).
% 1.77/1.98 0 [] necessary(X)| -externalTo(Y,X)| -determinedByFixedMethod(X,Y)| -determinedByDefiniteMethod(X,Y)| -isMethodExistence(Y).
% 1.77/1.98 0 [] -eternity(X)|existConcFollowFromDefEternal(X).
% 1.77/1.98 0 [] eternity(X)| -existConcFollowFromDefEternal(X).
% 1.77/1.98 0 [] -substance(X)|being(X).
% 1.77/1.98 0 [] -inItself(X)|selfCaused(X).
% 1.77/1.98 0 [] -being(X)|hasEssence(X).
% 1.77/1.98 0 [] -essenceInvExistence(X)| -hasEssence(X)|exists(X).
% 1.77/1.98 end_of_list.
% 1.77/1.98
% 1.77/1.98 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.77/1.98
% 1.77/1.98 This ia a non-Horn set with equality. The strategy will be
% 1.77/1.98 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.77/1.98 deletion, with positive clauses in sos and nonpositive
% 1.77/1.98 clauses in usable.
% 1.77/1.98
% 1.77/1.98 dependent: set(knuth_bendix).
% 1.77/1.98 dependent: set(anl_eq).
% 1.77/1.98 dependent: set(para_from).
% 1.77/1.98 dependent: set(para_into).
% 1.77/1.98 dependent: clear(para_from_right).
% 1.77/1.98 dependent: clear(para_into_right).
% 1.77/1.98 dependent: set(para_from_vars).
% 1.77/1.98 dependent: set(eq_units_both_ways).
% 1.77/1.98 dependent: set(dynamic_demod_all).
% 1.77/1.98 dependent: set(dynamic_demod).
% 1.77/1.98 dependent: set(order_eq).
% 1.77/1.98 dependent: set(back_demod).
% 1.77/1.98 dependent: set(lrpo).
% 1.77/1.98 dependent: set(hyper_res).
% 1.77/1.98 dependent: set(unit_deletion).
% 1.77/1.98 dependent: set(factor).
% 1.77/1.98
% 1.77/1.98 ------------> process usable:
% 1.77/1.98 ** KEPT (pick-wt=5): 2 [copy,1,factor_simp] -exists(A)|existsIn(A,A).
% 1.77/1.98 Following clause subsumed by 2 during input processing: 0 [] -exists(A)|existsIn(A,A)|A!=B.
% 1.77/1.98 ** KEPT (pick-wt=5): 3 [] exists(A)| -existsIn(A,A).
% 1.77/1.98 ** KEPT (pick-wt=8): 4 [] exists(A)| -existsIn(A,B)|A=B.
% 1.77/1.98 ** KEPT (pick-wt=6): 5 [] conceivedThru(A,A)|A!=B.
% 1.77/1.98 ** KEPT (pick-wt=5): 6 [] -definiteCause(A)|effectNecessarilyFollowsFrom(B,A).
% 1.77/1.98 ** KEPT (pick-wt=5): 7 [] -knowledgeOfEffect(A,B)|knowledgeOfACause(A).
% 1.77/1.98 ** KEPT (pick-wt=5): 8 [] knowledgeOfEffect(A,B)| -knowledgeOfACause(A).
% 1.77/1.98 ** KEPT (pick-wt=6): 9 [] -haveNothingInCommon(A,B)| -canBeUnderstoodInTermsOf(A,B).
% 1.77/1.98 ** KEPT (pick-wt=6): 10 [] -haveNothingInCommon(A,B)| -canBeUnderstoodInTermsOf(B,A).
% 1.77/1.98 ** KEPT (pick-wt=6): 11 [] -haveNothingInCommon(A,B)| -conceptionInvolves(A,B).
% 1.77/1.98 ** KEPT (pick-wt=6): 12 [] -haveNothingInCommon(A,B)| -conceptionInvolves(B,A).
% 1.77/1.98 ** KEPT (pick-wt=5): 13 [] -trueIdea(A)|correspondWith(A,B).
% 1.77/1.98 ** KEPT (pick-wt=8): 14 [] -trueIdea(A)|ideateOf(B,A)|objectOf(B,A).
% 1.77/1.98 ** KEPT (pick-wt=4): 15 [] -canBeConceivedAsNonExisting(A)| -essenceInvExistence(A).
% 1.77/1.98 ** KEPT (pick-wt=4): 16 [] -selfCaused(A)|essenceInvExistence(A).
% 1.77/1.98 ** KEPT (pick-wt=4): 17 [] -selfCaused(A)|natureConcOnlyByExistence(A).
% 1.77/1.98 ** KEPT (pick-wt=6): 18 [] selfCaused(A)| -essenceInvExistence(A)| -natureConcOnlyByExistence(A).
% 1.77/1.98 ** KEPT (pick-wt=5): 19 [] -finiteAfterItsKind(A)|canBeLimitedBy(A,B).
% 1.77/1.98 ** KEPT (pick-wt=5): 20 [] -finiteAfterItsKind(A)|sameKind(A,B).
% 1.77/1.98 ** KEPT (pick-wt=8): 21 [] finiteAfterItsKind(A)| -canBeLimitedBy(A,B)| -sameKind(A,B).
% 1.77/1.98 ** KEPT (pick-wt=4): 22 [] -substance(A)|inItself(A).
% 1.77/1.98 ** KEPT (pick-wt=4): 23 [] -substance(A)|conceivedThruItself(A).
% 1.77/1.98 ** KEPT (pick-wt=6): 24 [] substance(A)| -inItself(A)| -conceivedThruItself(A).
% 1.77/1.98 ** KEPT (pick-wt=4): 25 [] -attribute(A)|intPercAsConstEssSub(A).
% 1.77/1.98 ** KEPT (pick-wt=4): 26 [] attrAlarm clock
% 299.85/300.03 Otter interrupted
% 299.85/300.03 PROOF NOT FOUND
%------------------------------------------------------------------------------