TSTP Solution File: PHI041+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PHI041+1 : TPTP v8.2.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 : Tue May 21 02:18:13 EDT 2024
% Result : CounterSatisfiable 0.23s 0.54s
% Output : Saturation 0.23s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_37)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_28,plain,
( selfCaused(X1)
| ~ inItself(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]),
[final] ).
cnf(c_0_29,plain,
( inItself(X1)
| ~ substance(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]),
[final] ).
cnf(c_0_32,plain,
( exists(X1)
| ~ essenceInvExistence(X1)
| ~ hasEssence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]),
[final] ).
cnf(c_0_33,plain,
( hasEssence(X1)
| ~ being(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]),
[final] ).
cnf(c_0_35,plain,
( essenceInvExistence(X1)
| ~ selfCaused(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]),
[final] ).
cnf(c_0_36,plain,
( selfCaused(X1)
| ~ substance(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]),
[final] ).
cnf(c_0_40,plain,
( exists(X1)
| ~ being(X1)
| ~ essenceInvExistence(X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]),
[final] ).
cnf(c_0_41,plain,
( being(X1)
| ~ substance(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]),
[final] ).
cnf(c_0_42,plain,
( essenceInvExistence(X1)
| ~ substance(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]),
[final] ).
cnf(c_0_43,plain,
( mode(X1)
| ~ existsIn(X1,X2)
| ~ conceivedThru(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]),
[final] ).
cnf(c_0_44,plain,
conceivedThru(X1,X1),
inference(er,[status(thm)],[c_0_38]),
[final] ).
cnf(c_0_45,plain,
( existsIn(X1,X1)
| ~ exists(X1) ),
inference(er,[status(thm)],[c_0_39]),
[final] ).
cnf(c_0_46,plain,
( exists(X1)
| ~ substance(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),
[final] ).
cnf(c_0_47,plain,
( mode(X1)
| ~ existsIn(X1,X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]),
[final] ).
cnf(c_0_48,plain,
( existsIn(X1,X1)
| ~ substance(X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]),
[final] ).
cnf(c_0_53,plain,
( conceivedThru(X1,X2)
| modification(X1,X3)
| ~ mode(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]),
[final] ).
cnf(c_0_54,plain,
( mode(X1)
| ~ substance(X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]),
[final] ).
cnf(c_0_55,plain,
( existsIn(X1,X2)
| modification(X1,X3)
| ~ mode(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]),
[final] ).
cnf(c_0_56,plain,
( existsIn(X1,X2)
| substance(X3)
| ~ mode(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]),
[final] ).
cnf(c_0_57,plain,
( conceivedThru(X1,X2)
| substance(X3)
| ~ mode(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]),
[final] ).
cnf(c_0_70,plain,
( modification(X1,X2)
| conceivedThru(X1,X3)
| ~ substance(X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]),
[final] ).
cnf(c_0_71,plain,
( modification(X1,X2)
| existsIn(X1,X3)
| ~ substance(X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_54]),
[final] ).
cnf(c_0_72,plain,
( substance(X1)
| existsIn(X2,X3)
| ~ substance(X2) ),
inference(spm,[status(thm)],[c_0_56,c_0_54]),
[final] ).
cnf(c_0_73,plain,
( substance(X1)
| conceivedThru(X2,X3)
| ~ substance(X2) ),
inference(spm,[status(thm)],[c_0_57,c_0_54]),
[final] ).
cnf(c_0_74,plain,
( attributeOf(X1,X2)
| absolutelyInfinite(X2)
| ~ substance(X2)
| ~ constInInfAttributes(X2) ),
inference(split_conjunct,[status(thm)],[c_0_58]),
[final] ).
cnf(c_0_75,plain,
( ideateOf(X1,X2)
| objectOf(X1,X2)
| ~ trueIdea(X2) ),
inference(split_conjunct,[status(thm)],[c_0_59]),
[final] ).
cnf(c_0_76,plain,
( absolutelyInfinite(X2)
| ~ expressesEternalEssentiality(X1)
| ~ expressesInfiniteEssentiality(X1)
| ~ substance(X2)
| ~ constInInfAttributes(X2) ),
inference(split_conjunct,[status(thm)],[c_0_58]),
[final] ).
cnf(c_0_77,plain,
( X1 = X2
| exists(X1)
| ~ existsIn(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]),
[final] ).
cnf(c_0_78,plain,
( determinedByItselfAlone(X1,X2)
| ~ actionOf(X1,X2)
| ~ free(X2) ),
inference(split_conjunct,[status(thm)],[c_0_60]),
[final] ).
cnf(c_0_79,plain,
( actionOf(X1,X2)
| free(X2)
| ~ existsOnlyByNecessityOfOwnNature(X2) ),
inference(split_conjunct,[status(thm)],[c_0_60]),
[final] ).
cnf(c_0_80,plain,
( expressesInfiniteEssentiality(X1)
| ~ attributeOf(X1,X2)
| ~ absolutelyInfinite(X2) ),
inference(split_conjunct,[status(thm)],[c_0_58]),
[final] ).
cnf(c_0_81,plain,
( expressesEternalEssentiality(X1)
| ~ attributeOf(X1,X2)
| ~ absolutelyInfinite(X2) ),
inference(split_conjunct,[status(thm)],[c_0_58]),
[final] ).
cnf(c_0_82,plain,
( finiteAfterItsKind(X1)
| ~ canBeLimitedBy(X1,X2)
| ~ sameKind(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_61]),
[final] ).
cnf(c_0_83,plain,
( sameKind(X1,X2)
| ~ finiteAfterItsKind(X1) ),
inference(split_conjunct,[status(thm)],[c_0_61]),
[final] ).
cnf(c_0_84,plain,
( canBeLimitedBy(X1,X2)
| ~ finiteAfterItsKind(X1) ),
inference(split_conjunct,[status(thm)],[c_0_61]),
[final] ).
cnf(c_0_85,plain,
( correspondWith(X1,X2)
| ~ trueIdea(X1) ),
inference(split_conjunct,[status(thm)],[c_0_59]),
[final] ).
cnf(c_0_86,plain,
( knowledgeOfEffect(X1,X2)
| ~ knowledgeOfACause(X1) ),
inference(split_conjunct,[status(thm)],[c_0_62]),
[final] ).
cnf(c_0_87,plain,
( free(X2)
| ~ determinedByItselfAlone(X1,X2)
| ~ existsOnlyByNecessityOfOwnNature(X2) ),
inference(split_conjunct,[status(thm)],[c_0_60]),
[final] ).
cnf(c_0_88,plain,
( mode(X1)
| ~ modification(X1,X2)
| ~ substance(X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]),
[final] ).
cnf(c_0_89,plain,
( exists(X1)
| ~ existsIn(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]),
[final] ).
cnf(c_0_90,plain,
( god(X1)
| ~ being(X1)
| ~ absolutelyInfinite(X1) ),
inference(split_conjunct,[status(thm)],[c_0_63]),
[final] ).
cnf(c_0_91,plain,
( effectNecessarilyFollowsFrom(X1,X2)
| ~ definiteCause(X2) ),
inference(split_conjunct,[status(thm)],[c_0_64]),
[final] ).
cnf(c_0_92,plain,
( substance(X1)
| ~ inItself(X1)
| ~ conceivedThruItself(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]),
[final] ).
cnf(c_0_93,plain,
( selfCaused(X1)
| ~ essenceInvExistence(X1)
| ~ natureConcOnlyByExistence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]),
[final] ).
cnf(c_0_94,plain,
( knowledgeOfACause(X1)
| ~ knowledgeOfEffect(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_62]),
[final] ).
cnf(c_0_95,plain,
( existConcFollowFromDefEternal(X1)
| ~ eternity(X1) ),
inference(split_conjunct,[status(thm)],[c_0_65]),
[final] ).
cnf(c_0_96,plain,
( existsOnlyByNecessityOfOwnNature(X1)
| ~ free(X1) ),
inference(split_conjunct,[status(thm)],[c_0_60]),
[final] ).
cnf(c_0_97,plain,
( ~ conceptionInvolves(X1,X2)
| ~ haveNothingInCommon(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_66]),
[final] ).
cnf(c_0_98,plain,
( constInInfAttributes(X1)
| ~ absolutelyInfinite(X1) ),
inference(split_conjunct,[status(thm)],[c_0_58]),
[final] ).
cnf(c_0_99,plain,
( ~ canBeUnderstoodInTermsOf(X1,X2)
| ~ haveNothingInCommon(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_66]),
[final] ).
cnf(c_0_100,plain,
( intPercAsConstEssSub(X1)
| ~ attribute(X1) ),
inference(split_conjunct,[status(thm)],[c_0_67]),
[final] ).
cnf(c_0_101,plain,
( conceivedThruItself(X1)
| ~ substance(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]),
[final] ).
cnf(c_0_102,plain,
( natureConcOnlyByExistence(X1)
| ~ selfCaused(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]),
[final] ).
cnf(c_0_103,plain,
( ~ conceptionInvolves(X1,X2)
| ~ haveNothingInCommon(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_66]),
[final] ).
cnf(c_0_104,plain,
( ~ canBeUnderstoodInTermsOf(X1,X2)
| ~ haveNothingInCommon(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_66]),
[final] ).
cnf(c_0_105,plain,
( eternity(X1)
| ~ existConcFollowFromDefEternal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_65]),
[final] ).
cnf(c_0_106,plain,
( absolutelyInfinite(X1)
| ~ god(X1) ),
inference(split_conjunct,[status(thm)],[c_0_63]),
[final] ).
cnf(c_0_107,plain,
( being(X1)
| ~ god(X1) ),
inference(split_conjunct,[status(thm)],[c_0_63]),
[final] ).
cnf(c_0_108,plain,
( attribute(X1)
| ~ intPercAsConstEssSub(X1) ),
inference(split_conjunct,[status(thm)],[c_0_67]),
[final] ).
cnf(c_0_109,negated_conjecture,
( ~ isMethodExistence(esk2_0)
| ~ externalTo(esk2_0,esk1_0)
| ~ determinedByFixedMethod(esk1_0,esk2_0)
| ~ determinedByDefiniteMethod(esk1_0,esk2_0)
| ~ necessary(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_68]),
[final] ).
cnf(c_0_110,negated_conjecture,
( ~ isMethodAction(esk2_0)
| ~ externalTo(esk2_0,esk1_0)
| ~ determinedByFixedMethod(esk1_0,esk2_0)
| ~ determinedByDefiniteMethod(esk1_0,esk2_0)
| ~ necessary(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_68]),
[final] ).
cnf(c_0_111,negated_conjecture,
( isMethodAction(esk2_0)
| isMethodExistence(esk2_0)
| necessary(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_68]),
[final] ).
cnf(c_0_112,negated_conjecture,
( determinedByDefiniteMethod(esk1_0,esk2_0)
| necessary(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_68]),
[final] ).
cnf(c_0_113,negated_conjecture,
( determinedByFixedMethod(esk1_0,esk2_0)
| necessary(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_68]),
[final] ).
cnf(c_0_114,plain,
( substance(X1)
| ~ absolutelyInfinite(X1) ),
inference(split_conjunct,[status(thm)],[c_0_58]),
[final] ).
cnf(c_0_115,plain,
( ~ canBeConceivedAsNonExisting(X1)
| ~ essenceInvExistence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_69]),
[final] ).
cnf(c_0_116,negated_conjecture,
( externalTo(esk2_0,esk1_0)
| necessary(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_68]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : PHI041+1 : TPTP v8.2.0. Released v7.4.0.
% 0.14/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n002.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sat May 18 14:49:38 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.23/0.51 Running first-order theorem proving
% 0.23/0.51 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.23/0.54 # Version: 3.1.0
% 0.23/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # Starting sh5l with 300s (1) cores
% 0.23/0.54 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3655 completed with status 1
% 0.23/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.54 # No SInE strategy applied
% 0.23/0.54 # Search class: FGHSF-FFMS00-SFFFFFNN
% 0.23/0.54 # partial match(1): FGHSF-FFMM00-SFFFFFNN
% 0.23/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.23/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.54 # Starting new_bool_3 with 136s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 136s (1) cores
% 0.23/0.54 # Starting sh5l with 136s (1) cores
% 0.23/0.54 # SAT001_MinMin_p005000_rr_RG with pid 3662 completed with status 1
% 0.23/0.54 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.23/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.54 # No SInE strategy applied
% 0.23/0.54 # Search class: FGHSF-FFMS00-SFFFFFNN
% 0.23/0.54 # partial match(1): FGHSF-FFMM00-SFFFFFNN
% 0.23/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.23/0.54 # Preprocessing time : 0.002 s
% 0.23/0.54 # Presaturation interreduction done
% 0.23/0.54
% 0.23/0.54 # No proof found!
% 0.23/0.54 # SZS status CounterSatisfiable
% 0.23/0.54 # SZS output start Saturation
% See solution above
% 0.23/0.54 # Parsed axioms : 21
% 0.23/0.54 # Removed by relevancy pruning/SinE : 0
% 0.23/0.54 # Initial clauses : 59
% 0.23/0.54 # Removed in clause preprocessing : 1
% 0.23/0.54 # Initial clauses in saturation : 58
% 0.23/0.54 # Processed clauses : 128
% 0.23/0.54 # ...of these trivial : 1
% 0.23/0.54 # ...subsumed : 2
% 0.23/0.54 # ...remaining for further processing : 125
% 0.23/0.54 # Other redundant clauses eliminated : 2
% 0.23/0.54 # Clauses deleted for lack of memory : 0
% 0.23/0.54 # Backward-subsumed : 0
% 0.23/0.54 # Backward-rewritten : 0
% 0.23/0.54 # Generated clauses : 26
% 0.23/0.54 # ...of the previous two non-redundant : 14
% 0.23/0.54 # ...aggressively subsumed : 0
% 0.23/0.54 # Contextual simplify-reflections : 1
% 0.23/0.54 # Paramodulations : 24
% 0.23/0.54 # Factorizations : 0
% 0.23/0.54 # NegExts : 0
% 0.23/0.54 # Equation resolutions : 2
% 0.23/0.54 # Disequality decompositions : 0
% 0.23/0.54 # Total rewrite steps : 1
% 0.23/0.54 # ...of those cached : 0
% 0.23/0.54 # Propositional unsat checks : 0
% 0.23/0.54 # Propositional check models : 0
% 0.23/0.54 # Propositional check unsatisfiable : 0
% 0.23/0.54 # Propositional clauses : 0
% 0.23/0.54 # Propositional clauses after purity: 0
% 0.23/0.54 # Propositional unsat core size : 0
% 0.23/0.54 # Propositional preprocessing time : 0.000
% 0.23/0.54 # Propositional encoding time : 0.000
% 0.23/0.54 # Propositional solver time : 0.000
% 0.23/0.54 # Success case prop preproc time : 0.000
% 0.23/0.54 # Success case prop encoding time : 0.000
% 0.23/0.54 # Success case prop solver time : 0.000
% 0.23/0.54 # Current number of processed clauses : 67
% 0.23/0.54 # Positive orientable unit clauses : 1
% 0.23/0.54 # Positive unorientable unit clauses: 0
% 0.23/0.54 # Negative unit clauses : 0
% 0.23/0.54 # Non-unit-clauses : 66
% 0.23/0.54 # Current number of unprocessed clauses: 0
% 0.23/0.54 # ...number of literals in the above : 0
% 0.23/0.54 # Current number of archived formulas : 0
% 0.23/0.54 # Current number of archived clauses : 56
% 0.23/0.54 # Clause-clause subsumption calls (NU) : 2201
% 0.23/0.54 # Rec. Clause-clause subsumption calls : 1765
% 0.23/0.54 # Non-unit clause-clause subsumptions : 3
% 0.23/0.54 # Unit Clause-clause subsumption calls : 1
% 0.23/0.54 # Rewrite failures with RHS unbound : 0
% 0.23/0.54 # BW rewrite match attempts : 0
% 0.23/0.54 # BW rewrite match successes : 0
% 0.23/0.54 # Condensation attempts : 0
% 0.23/0.54 # Condensation successes : 0
% 0.23/0.54 # Termbank termtop insertions : 3797
% 0.23/0.54 # Search garbage collected termcells : 676
% 0.23/0.54
% 0.23/0.54 # -------------------------------------------------
% 0.23/0.54 # User time : 0.011 s
% 0.23/0.54 # System time : 0.005 s
% 0.23/0.54 # Total time : 0.015 s
% 0.23/0.54 # Maximum resident set size: 1932 pages
% 0.23/0.54
% 0.23/0.54 # -------------------------------------------------
% 0.23/0.54 # User time : 0.036 s
% 0.23/0.54 # System time : 0.015 s
% 0.23/0.54 # Total time : 0.051 s
% 0.23/0.54 # Maximum resident set size: 1760 pages
% 0.23/0.54 % E---3.1 exiting
% 0.23/0.54 % E exiting
%------------------------------------------------------------------------------