%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : PHI023+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n023.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:41 EDT 2022
% Result : Theorem 2.00s 2.20s
% Output : Refutation 2.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 19 ( 11 unt; 0 nHn; 19 RR)
% Number of literals : 28 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ selfCaused(A)
| essenceInvExistence(A) ),
file('PHI023+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ substance(A)
| inItself(A) ),
file('PHI023+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ god(A)
| being(A) ),
file('PHI023+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ god(A)
| absolutelyInfinite(A) ),
file('PHI023+1.p',unknown),
[] ).
cnf(21,axiom,
( ~ absolutelyInfinite(A)
| substance(A) ),
file('PHI023+1.p',unknown),
[] ).
cnf(54,axiom,
( ~ inItself(A)
| selfCaused(A) ),
file('PHI023+1.p',unknown),
[] ).
cnf(55,axiom,
( ~ being(A)
| hasEssence(A) ),
file('PHI023+1.p',unknown),
[] ).
cnf(56,axiom,
( ~ essenceInvExistence(A)
| ~ hasEssence(A)
| exists(A) ),
file('PHI023+1.p',unknown),
[] ).
cnf(57,axiom,
~ exists(dollar_c1),
file('PHI023+1.p',unknown),
[] ).
cnf(61,axiom,
god(dollar_c1),
file('PHI023+1.p',unknown),
[] ).
cnf(62,plain,
absolutelyInfinite(dollar_c1),
inference(hyper,[status(thm)],[61,19]),
[iquote('hyper,61,19')] ).
cnf(63,plain,
being(dollar_c1),
inference(hyper,[status(thm)],[61,18]),
[iquote('hyper,61,18')] ).
cnf(66,plain,
substance(dollar_c1),
inference(hyper,[status(thm)],[62,21]),
[iquote('hyper,62,21')] ).
cnf(68,plain,
hasEssence(dollar_c1),
inference(hyper,[status(thm)],[63,55]),
[iquote('hyper,63,55')] ).
cnf(72,plain,
inItself(dollar_c1),
inference(hyper,[status(thm)],[66,7]),
[iquote('hyper,66,7')] ).
cnf(76,plain,
selfCaused(dollar_c1),
inference(hyper,[status(thm)],[72,54]),
[iquote('hyper,72,54')] ).
cnf(80,plain,
essenceInvExistence(dollar_c1),
inference(hyper,[status(thm)],[76,1]),
[iquote('hyper,76,1')] ).
cnf(83,plain,
exists(dollar_c1),
inference(hyper,[status(thm)],[80,56,68]),
[iquote('hyper,80,56,68')] ).
cnf(84,plain,
$false,
inference(binary,[status(thm)],[83,57]),
[iquote('binary,83.1,57.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : PHI023+1 : TPTP v8.1.0. Released v7.4.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jul 27 02:55:18 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.00/2.20 ----- Otter 3.3f, August 2004 -----
% 2.00/2.20 The process was started by sandbox2 on n023.cluster.edu,
% 2.00/2.20 Wed Jul 27 02:55:18 2022
% 2.00/2.20 The command was "./otter". The process ID is 10234.
% 2.00/2.20
% 2.00/2.20 set(prolog_style_variables).
% 2.00/2.20 set(auto).
% 2.00/2.20 dependent: set(auto1).
% 2.00/2.20 dependent: set(process_input).
% 2.00/2.20 dependent: clear(print_kept).
% 2.00/2.20 dependent: clear(print_new_demod).
% 2.00/2.20 dependent: clear(print_back_demod).
% 2.00/2.20 dependent: clear(print_back_sub).
% 2.00/2.20 dependent: set(control_memory).
% 2.00/2.20 dependent: assign(max_mem, 12000).
% 2.00/2.20 dependent: assign(pick_given_ratio, 4).
% 2.00/2.20 dependent: assign(stats_level, 1).
% 2.00/2.20 dependent: assign(max_seconds, 10800).
% 2.00/2.20 clear(print_given).
% 2.00/2.20
% 2.00/2.20 formula_list(usable).
% 2.00/2.20 all A (A=A).
% 2.00/2.20 all X (selfCaused(X)<->essenceInvExistence(X)&natureConcOnlyByExistence(X)).
% 2.00/2.20 all X Y (finiteAfterItsKind(X)<->canBeLimitedBy(X,Y)&sameKind(X,Y)).
% 2.00/2.20 all X (substance(X)<->inItself(X)&conceivedThruItself(X)).
% 2.00/2.20 all X (attribute(X)<->intPercAsConstEssSub(X)).
% 2.00/2.20 all X Y Z (mode(X)<->modification(X,Y)&substance(Y)|existsIn(X,Z)&conceivedThru(X,Z)).
% 2.00/2.20 all X (god(X)<->being(X)&absolutelyInfinite(X)).
% 2.00/2.20 all X Y (absolutelyInfinite(X)<->substance(X)&constInInfAttributes(X)& (attributeOf(Y,X)->expressesEternalEssentiality(Y)&expressesInfiniteEssentiality(Y))).
% 2.00/2.20 all X Y (free(X)<->existsOnlyByNecessityOfOwnNature(X)& (actionOf(Y,X)->determinedByItselfAlone(Y,X))).
% 2.00/2.20 all X Y (necessary(X)<->externalTo(Y,X)&determinedByFixedMethod(X,Y)&determinedByDefiniteMethod(X,Y)& (isMethodAction(Y)|isMethodExistence(Y))).
% 2.00/2.20 all X (eternity(X)<->existConcFollowFromDefEternal(X)).
% 2.00/2.20 all X Y (exists(X)<->existsIn(X,X)|existsIn(X,Y)&X!=Y).
% 2.00/2.20 all X Y (-conceivedThru(X,X)->conceivedThru(X,Y)&X!=Y).
% 2.00/2.20 all X Y (definiteCause(X)->effectNecessarilyFollowsFrom(Y,X)& (-definiteCause(X)-> -effectNecessarilyFollowsFrom(Y,X))).
% 2.00/2.20 all X Y (knowledgeOfEffect(X,Y)<->knowledgeOfACause(X)).
% 2.00/2.20 all X Y (haveNothingInCommon(X,Y)-> -canBeUnderstoodInTermsOf(X,Y)& -canBeUnderstoodInTermsOf(Y,X)& -conceptionInvolves(X,Y)& -conceptionInvolves(Y,X)).
% 2.00/2.20 all X Y (trueIdea(X)->correspondWith(X,Y)& (ideateOf(Y,X)|objectOf(Y,X))).
% 2.00/2.20 all X (canBeConceivedAsNonExisting(X)-> -essenceInvExistence(X)).
% 2.00/2.20 all X (inItself(X)->selfCaused(X)).
% 2.00/2.20 all X (being(X)->hasEssence(X)).
% 2.00/2.20 all X (essenceInvExistence(X)&hasEssence(X)->exists(X)).
% 2.00/2.20 -(all X (god(X)->exists(X))).
% 2.00/2.20 end_of_list.
% 2.00/2.20
% 2.00/2.20 -------> usable clausifies to:
% 2.00/2.20
% 2.00/2.20 list(usable).
% 2.00/2.20 0 [] A=A.
% 2.00/2.20 0 [] -selfCaused(X)|essenceInvExistence(X).
% 2.00/2.20 0 [] -selfCaused(X)|natureConcOnlyByExistence(X).
% 2.00/2.20 0 [] selfCaused(X)| -essenceInvExistence(X)| -natureConcOnlyByExistence(X).
% 2.00/2.20 0 [] -finiteAfterItsKind(X)|canBeLimitedBy(X,Y).
% 2.00/2.20 0 [] -finiteAfterItsKind(X)|sameKind(X,Y).
% 2.00/2.20 0 [] finiteAfterItsKind(X)| -canBeLimitedBy(X,Y)| -sameKind(X,Y).
% 2.00/2.20 0 [] -substance(X)|inItself(X).
% 2.00/2.20 0 [] -substance(X)|conceivedThruItself(X).
% 2.00/2.20 0 [] substance(X)| -inItself(X)| -conceivedThruItself(X).
% 2.00/2.20 0 [] -attribute(X)|intPercAsConstEssSub(X).
% 2.00/2.20 0 [] attribute(X)| -intPercAsConstEssSub(X).
% 2.00/2.20 0 [] -mode(X)|modification(X,Y)|existsIn(X,Z).
% 2.00/2.20 0 [] -mode(X)|modification(X,Y)|conceivedThru(X,Z).
% 2.00/2.20 0 [] -mode(X)|substance(Y)|existsIn(X,Z).
% 2.00/2.20 0 [] -mode(X)|substance(Y)|conceivedThru(X,Z).
% 2.00/2.20 0 [] mode(X)| -modification(X,Y)| -substance(Y).
% 2.00/2.20 0 [] mode(X)| -existsIn(X,Z)| -conceivedThru(X,Z).
% 2.00/2.20 0 [] -god(X)|being(X).
% 2.00/2.20 0 [] -god(X)|absolutelyInfinite(X).
% 2.00/2.20 0 [] god(X)| -being(X)| -absolutelyInfinite(X).
% 2.00/2.20 0 [] -absolutelyInfinite(X)|substance(X).
% 2.00/2.20 0 [] -absolutelyInfinite(X)|constInInfAttributes(X).
% 2.00/2.20 0 [] -absolutelyInfinite(X)| -attributeOf(Y,X)|expressesEternalEssentiality(Y).
% 2.00/2.20 0 [] -absolutelyInfinite(X)| -attributeOf(Y,X)|expressesInfiniteEssentiality(Y).
% 2.00/2.20 0 [] absolutelyInfinite(X)| -substance(X)| -constInInfAttributes(X)|attributeOf(Y,X).
% 2.00/2.20 0 [] absolutelyInfinite(X)| -substance(X)| -constInInfAttributes(X)| -expressesEternalEssentiality(Y)| -expressesInfiniteEssentiality(Y).
% 2.00/2.20 0 [] -free(X)|existsOnlyByNecessityOfOwnNature(X).
% 2.00/2.20 0 [] -free(X)| -actionOf(Y,X)|determinedByItselfAlone(Y,X).
% 2.00/2.20 0 [] free(X)| -existsOnlyByNecessityOfOwnNature(X)|actionOf(Y,X).
% 2.00/2.20 0 [] free(X)| -existsOnlyByNecessityOfOwnNature(X)| -determinedByItselfAlone(Y,X).
% 2.00/2.20 0 [] -necessary(X)|externalTo(Y,X).
% 2.00/2.20 0 [] -necessary(X)|determinedByFixedMethod(X,Y).
% 2.00/2.20 0 [] -necessary(X)|determinedByDefiniteMethod(X,Y).
% 2.00/2.20 0 [] -necessary(X)|isMethodAction(Y)|isMethodExistence(Y).
% 2.00/2.20 0 [] necessary(X)| -externalTo(Y,X)| -determinedByFixedMethod(X,Y)| -determinedByDefiniteMethod(X,Y)| -isMethodAction(Y).
% 2.00/2.20 0 [] necessary(X)| -externalTo(Y,X)| -determinedByFixedMethod(X,Y)| -determinedByDefiniteMethod(X,Y)| -isMethodExistence(Y).
% 2.00/2.20 0 [] -eternity(X)|existConcFollowFromDefEternal(X).
% 2.00/2.20 0 [] eternity(X)| -existConcFollowFromDefEternal(X).
% 2.00/2.20 0 [] -exists(X)|existsIn(X,X)|existsIn(X,Y).
% 2.00/2.20 0 [] -exists(X)|existsIn(X,X)|X!=Y.
% 2.00/2.20 0 [] exists(X)| -existsIn(X,X).
% 2.00/2.20 0 [] exists(X)| -existsIn(X,Y)|X=Y.
% 2.00/2.20 0 [] conceivedThru(X,X)|conceivedThru(X,Y).
% 2.00/2.20 0 [] conceivedThru(X,X)|X!=Y.
% 2.00/2.20 0 [] -definiteCause(X)|effectNecessarilyFollowsFrom(Y,X).
% 2.00/2.20 0 [] -knowledgeOfEffect(X,Y)|knowledgeOfACause(X).
% 2.00/2.20 0 [] knowledgeOfEffect(X,Y)| -knowledgeOfACause(X).
% 2.00/2.20 0 [] -haveNothingInCommon(X,Y)| -canBeUnderstoodInTermsOf(X,Y).
% 2.00/2.20 0 [] -haveNothingInCommon(X,Y)| -canBeUnderstoodInTermsOf(Y,X).
% 2.00/2.20 0 [] -haveNothingInCommon(X,Y)| -conceptionInvolves(X,Y).
% 2.00/2.20 0 [] -haveNothingInCommon(X,Y)| -conceptionInvolves(Y,X).
% 2.00/2.20 0 [] -trueIdea(X)|correspondWith(X,Y).
% 2.00/2.20 0 [] -trueIdea(X)|ideateOf(Y,X)|objectOf(Y,X).
% 2.00/2.20 0 [] -canBeConceivedAsNonExisting(X)| -essenceInvExistence(X).
% 2.00/2.20 0 [] -inItself(X)|selfCaused(X).
% 2.00/2.20 0 [] -being(X)|hasEssence(X).
% 2.00/2.20 0 [] -essenceInvExistence(X)| -hasEssence(X)|exists(X).
% 2.00/2.20 0 [] god($c1).
% 2.00/2.20 0 [] -exists($c1).
% 2.00/2.20 end_of_list.
% 2.00/2.20
% 2.00/2.20 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 2.00/2.20
% 2.00/2.20 This ia a non-Horn set with equality. The strategy will be
% 2.00/2.20 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.00/2.20 deletion, with positive clauses in sos and nonpositive
% 2.00/2.20 clauses in usable.
% 2.00/2.20
% 2.00/2.20 dependent: set(knuth_bendix).
% 2.00/2.20 dependent: set(anl_eq).
% 2.00/2.20 dependent: set(para_from).
% 2.00/2.20 dependent: set(para_into).
% 2.00/2.20 dependent: clear(para_from_right).
% 2.00/2.20 dependent: clear(para_into_right).
% 2.00/2.20 dependent: set(para_from_vars).
% 2.00/2.20 dependent: set(eq_units_both_ways).
% 2.00/2.20 dependent: set(dynamic_demod_all).
% 2.00/2.20 dependent: set(dynamic_demod).
% 2.00/2.20 dependent: set(order_eq).
% 2.00/2.20 dependent: set(back_demod).
% 2.00/2.20 dependent: set(lrpo).
% 2.00/2.20 dependent: set(hyper_res).
% 2.00/2.20 dependent: set(unit_deletion).
% 2.00/2.20 dependent: set(factor).
% 2.00/2.20
% 2.00/2.20 ------------> process usable:
% 2.00/2.20 ** KEPT (pick-wt=4): 1 [] -selfCaused(A)|essenceInvExistence(A).
% 2.00/2.20 ** KEPT (pick-wt=4): 2 [] -selfCaused(A)|natureConcOnlyByExistence(A).
% 2.00/2.20 ** KEPT (pick-wt=6): 3 [] selfCaused(A)| -essenceInvExistence(A)| -natureConcOnlyByExistence(A).
% 2.00/2.20 ** KEPT (pick-wt=5): 4 [] -finiteAfterItsKind(A)|canBeLimitedBy(A,B).
% 2.00/2.20 ** KEPT (pick-wt=5): 5 [] -finiteAfterItsKind(A)|sameKind(A,B).
% 2.00/2.20 ** KEPT (pick-wt=8): 6 [] finiteAfterItsKind(A)| -canBeLimitedBy(A,B)| -sameKind(A,B).
% 2.00/2.20 ** KEPT (pick-wt=4): 7 [] -substance(A)|inItself(A).
% 2.00/2.20 ** KEPT (pick-wt=4): 8 [] -substance(A)|conceivedThruItself(A).
% 2.00/2.20 ** KEPT (pick-wt=6): 9 [] substance(A)| -inItself(A)| -conceivedThruItself(A).
% 2.00/2.20 ** KEPT (pick-wt=4): 10 [] -attribute(A)|intPercAsConstEssSub(A).
% 2.00/2.20 ** KEPT (pick-wt=4): 11 [] attribute(A)| -intPercAsConstEssSub(A).
% 2.00/2.20 ** KEPT (pick-wt=8): 12 [] -mode(A)|modification(A,B)|existsIn(A,C).
% 2.00/2.20 ** KEPT (pick-wt=8): 13 [] -mode(A)|modification(A,B)|conceivedThru(A,C).
% 2.00/2.20 ** KEPT (pick-wt=7): 14 [] -mode(A)|substance(B)|existsIn(A,C).
% 2.00/2.20 ** KEPT (pick-wt=7): 15 [] -mode(A)|substance(B)|conceivedThru(A,C).
% 2.00/2.20 ** KEPT (pick-wt=7): 16 [] mode(A)| -modification(A,B)| -substance(B).
% 2.00/2.20 ** KEPT (pick-wt=8): 17 [] mode(A)| -existsIn(A,B)| -conceivedThru(A,B).
% 2.00/2.20 ** KEPT (pick-wt=4): 18 [] -god(A)|being(A).
% 2.00/2.20 ** KEPT (pick-wt=4): 19 [] -god(A)|absolutelyInfinite(A).
% 2.00/2.20 ** KEPT (pick-wt=6): 20 [] god(A)| -being(A)| -absolutelyInfinite(A).
% 2.00/2.20 ** KEPT (pick-wt=4): 21 [] -absolutelyInfinite(A)|substance(A).
% 2.00/2.20 ** KEPT (pick-wt=4): 22 [] -absolutelyInfinite(A)|constInInfAttributes(A).
% 2.00/2.20 ** KEPT (pick-wt=7): 23 [] -absolutelyInfinite(A)| -attributeOf(B,A)|expressesEternalEssentiality(B).
% 2.00/2.20 ** KEPT (pick-wt=7): 24 [] -absolutelyInfinite(A)| -attributeOf(B,A)|expressesInfiniteEssentiality(B).
% 2.00/2.20 ** KEPT (pick-wt=9): 25 [] absolutelyInfinite(A)| -substance(A)| -constInInfAttributes(A)|attributeOf(B,A).
% 2.00/2.20 ** KEPT (pick-wt=10): 26 [] absolutelyInfinite(A)| -substance(A)| -constInInfAttributes(A)| -expressesEternalEssentiality(B)| -expressesInfiniteEssentiality(B).
% 2.00/2.20 ** KEPT (pick-wt=4): 27 [] -free(A)|existsOnlyByNecessityOfOwnNature(A).
% 2.00/2.20 ** KEPT (pick-wt=8): 28 [] -free(A)| -actionOf(B,A)|determinedByItselfAlone(B,A).
% 2.00/2.20 ** KEPT (pick-wt=7): 29 [] free(A)| -existsOnlyByNecessityOfOwnNature(A)|actionOf(B,A).
% 2.00/2.20 ** KEPT (pick-wt=7): 30 [] free(A)| -existsOnlyByNecessityOfOwnNature(A)| -determinedByItselfAlone(B,A).
% 2.00/2.20 ** KEPT (pick-wt=5): 31 [] -necessary(A)|externalTo(B,A).
% 2.00/2.20 ** KEPT (pick-wt=5): 32 [] -necessary(A)|determinedByFixedMethod(A,B).
% 2.00/2.20 ** KEPT (pick-wt=5): 33 [] -necessary(A)|determinedByDefiniteMethod(A,B).
% 2.00/2.20 ** KEPT (pick-wt=6): 34 [] -necessary(A)|isMethodAction(B)|isMethodExistence(B).
% 2.00/2.20 ** KEPT (pick-wt=13): 35 [] necessary(A)| -externalTo(B,A)| -determinedByFixedMethod(A,B)| -determinedByDefiniteMethod(A,B)| -isMethodAction(B).
% 2.00/2.20 ** KEPT (pick-wt=13): 36 [] necessary(A)| -externalTo(B,A)| -determinedByFixedMethod(A,B)| -determinedByDefiniteMethod(A,B)| -isMethodExistence(B).
% 2.00/2.20 ** KEPT (pick-wt=4): 37 [] -eternity(A)|existConcFollowFromDefEternal(A).
% 2.00/2.20 ** KEPT (pick-wt=4): 38 [] eternity(A)| -existConcFollowFromDefEternal(A).
% 2.00/2.20 ** KEPT (pick-wt=5): 40 [copy,39,factor_simp] -exists(A)|existsIn(A,A).
% 2.00/2.20 Following clause subsumed by 40 during input processing: 0 [] -exists(A)|existsIn(A,A)|A!=B.
% 2.00/2.20 ** KEPT (pick-wt=5): 41 [] exists(A)| -existsIn(A,A).
% 2.00/2.20 ** KEPT (pick-wt=8): 42 [] exists(A)| -existsIn(A,B)|A=B.
% 2.00/2.20 ** KEPT (pick-wt=6): 43 [] conceivedThru(A,A)|A!=B.
% 2.00/2.20 ** KEPT (pick-wt=5): 44 [] -definiteCause(A)|effectNecessarilyFollowsFrom(B,A).
% 2.00/2.20 ** KEPT (pick-wt=5): 45 [] -knowledgeOfEffect(A,B)|knowledgeOfACause(A).
% 2.00/2.20 ** KEPT (pick-wt=5): 46 [] knowledgeOfEffect(A,B)| -knowledgeOfACause(A).
% 2.00/2.20 ** KEPT (pick-wt=6): 47 [] -haveNothingInCommon(A,B)| -canBeUnderstoodInTermsOf(A,B).
% 2.00/2.20 ** KEPT (pick-wt=6): 48 [] -haveNothingInCommon(A,B)| -canBeUnderstoodInTermsOf(B,A).
% 2.00/2.20 ** KEPT (pick-wt=6): 49 [] -haveNothingInCommon(A,B)| -conceptionInvolves(A,B).
% 2.00/2.20 ** KEPT (pick-wt=6): 50 [] -haveNothingInCommon(A,B)| -conceptionInvolves(B,A).
% 2.00/2.20 ** KEPT (pick-wt=5): 51 [] -trueIdea(A)|correspondWith(A,B).
% 2.00/2.20 ** KEPT (pick-wt=8): 52 [] -trueIdea(A)|ideateOf(B,A)|objectOf(B,A).
% 2.00/2.20 ** KEPT (pick-wt=4): 53 [] -canBeConceivedAsNonExisting(A)| -essenceInvExistence(A).
% 2.00/2.20 ** KEPT (pick-wt=4): 54 [] -inItself(A)|selfCaused(A).
% 2.00/2.20 ** KEPT (pick-wt=4): 55 [] -being(A)|hasEssence(A).
% 2.00/2.20 ** KEPT (pick-wt=6): 56 [] -essenceInvExistence(A)| -hasEssence(A)|exists(A).
% 2.00/2.20 ** KEPT (pick-wt=2): 57 [] -exists($c1).
% 2.00/2.20
% 2.00/2.20 ------------> process sos:
% 2.00/2.20 ** KEPT (pick-wt=3): 58 [] A=A.
% 2.00/2.20 ** KEPT (pick-wt=3): 60 [copy,59,factor_simp] conceivedThru(A,A).
% 2.00/2.20 ** KEPT (pick-wt=2): 61 [] god($c1).
% 2.00/2.20 Following clause subsumed by 58 during input processing: 0 [copy,58,flip.1] A=A.
% 2.00/2.20 60 back subsumes 43.
% 2.00/2.20
% 2.00/2.20 ======= end of input processing =======
% 2.00/2.20
% 2.00/2.20 =========== start of search ===========
% 2.00/2.20
% 2.00/2.20 -------- PROOF --------
% 2.00/2.20
% 2.00/2.20 ----> UNIT CONFLICT at 0.00 sec ----> 84 [binary,83.1,57.1] $F.
% 2.00/2.20
% 2.00/2.20 Length of proof is 8. Level of proof is 6.
% 2.00/2.20
% 2.00/2.20 ---------------- PROOF ----------------
% 2.00/2.20 % SZS status Theorem
% 2.00/2.20 % SZS output start Refutation
% See solution above
% 2.00/2.20 ------------ end of proof -------------
% 2.00/2.20
% 2.00/2.20
% 2.00/2.20 Search stopped by max_proofs option.
% 2.00/2.20
% 2.00/2.20
% 2.00/2.20 Search stopped by max_proofs option.
% 2.00/2.20
% 2.00/2.20 ============ end of search ============
% 2.00/2.20
% 2.00/2.20 -------------- statistics -------------
% 2.00/2.20 clauses given 14
% 2.00/2.20 clauses generated 26
% 2.00/2.20 clauses kept 81
% 2.00/2.20 clauses forward subsumed 6
% 2.00/2.20 clauses back subsumed 1
% 2.00/2.20 Kbytes malloced 976
% 2.00/2.20
% 2.00/2.20 ----------- times (seconds) -----------
% 2.00/2.20 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.00/2.20 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.00/2.20 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.00/2.20
% 2.00/2.20 That finishes the proof of the theorem.
% 2.00/2.20
% 2.00/2.20 Process 10234 finished Wed Jul 27 02:55:20 2022
% 2.00/2.20 Otter interrupted
% 2.00/2.20 PROOF FOUND
%------------------------------------------------------------------------------