%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PHI025+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:58:18 PM UTC 2026
% Result : Satisfiable 0.24s 0.56s
% Output : Saturation 0.24s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_22ERROR: Could not build tree for root c_0_48ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_23,plain,
( ~ conceivedThru(X1,X2)
| ~ existsIn(X1,X2)
| mode(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]),
[final] ).
cnf(c_0_24,plain,
conceivedThru(X1,X1),
inference(er,[status(thm)],[c_0_21]),
[final] ).
cnf(c_0_29,plain,
( ~ existsIn(X1,X1)
| exists(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]),
[final] ).
cnf(c_0_30,plain,
( ~ mode(X1)
| modification(X1,X3)
| existsIn(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]),
[final] ).
cnf(c_0_33,plain,
( ~ mode(X1)
| substance(X3)
| existsIn(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]),
[final] ).
cnf(c_0_35,plain,
( ~ existsIn(X1,X1)
| mode(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]),
[final] ).
cnf(c_0_36,plain,
( ~ exists(X1)
| existsIn(X1,X1) ),
inference(er,[status(thm)],[c_0_25]),
[final] ).
cnf(c_0_48,plain,
( ~ mode(X1)
| modification(X1,X2)
| exists(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]),
[final] ).
cnf(c_0_49,plain,
( ~ mode(X1)
| modification(X1,X3)
| conceivedThru(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]),
[final] ).
cnf(c_0_50,plain,
( ~ determinedByDefiniteMethod(X2,X1)
| ~ determinedByFixedMethod(X2,X1)
| ~ externalTo(X1,X2)
| ~ isMethodExistence(X1)
| necessary(X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]),
[final] ).
cnf(c_0_51,plain,
( ~ determinedByDefiniteMethod(X2,X1)
| ~ determinedByFixedMethod(X2,X1)
| ~ externalTo(X1,X2)
| ~ isMethodAction(X1)
| necessary(X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]),
[final] ).
cnf(c_0_52,plain,
( ~ constInInfAttributes(X2)
| ~ substance(X2)
| absolutelyInfinite(X2)
| attributeOf(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]),
[final] ).
cnf(c_0_53,plain,
( ~ mode(X1)
| substance(X2)
| exists(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_33]),
[final] ).
cnf(c_0_54,plain,
( ~ mode(X1)
| substance(X3)
| conceivedThru(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]),
[final] ).
cnf(c_0_55,plain,
( ~ trueIdea(X2)
| objectOf(X1,X2)
| ideateOf(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]),
[final] ).
cnf(c_0_56,plain,
( ~ existsIn(X1,X2)
| exists(X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_22]),
[final] ).
cnf(c_0_57,plain,
( ~ exists(X1)
| mode(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]),
[final] ).
cnf(c_0_58,plain,
( ~ existsOnlyByNecessityOfOwnNature(X2)
| free(X2)
| actionOf(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]),
[final] ).
cnf(c_0_59,plain,
( ~ constInInfAttributes(X2)
| ~ substance(X2)
| ~ expressesInfiniteEssentiality(X1)
| ~ expressesEternalEssentiality(X1)
| absolutelyInfinite(X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]),
[final] ).
cnf(c_0_60,plain,
( ~ free(X2)
| ~ actionOf(X1,X2)
| determinedByItselfAlone(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]),
[final] ).
cnf(c_0_61,plain,
( ~ absolutelyInfinite(X2)
| ~ attributeOf(X1,X2)
| expressesInfiniteEssentiality(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]),
[final] ).
cnf(c_0_62,plain,
( ~ absolutelyInfinite(X2)
| ~ attributeOf(X1,X2)
| expressesEternalEssentiality(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]),
[final] ).
cnf(c_0_63,plain,
( ~ necessary(X2)
| isMethodExistence(X1)
| isMethodAction(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]),
[final] ).
cnf(c_0_64,plain,
( ~ sameKind(X1,X2)
| ~ canBeLimitedBy(X1,X2)
| finiteAfterItsKind(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]),
[final] ).
cnf(c_0_65,plain,
( ~ trueIdea(X1)
| correspondWith(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]),
[final] ).
cnf(c_0_66,plain,
( ~ knowledgeOfACause(X1)
| knowledgeOfEffect(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]),
[final] ).
cnf(c_0_67,plain,
( ~ definiteCause(X2)
| effectNecessarilyFollowsFrom(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_40]),
[final] ).
cnf(c_0_68,plain,
( ~ existsOnlyByNecessityOfOwnNature(X2)
| ~ determinedByItselfAlone(X1,X2)
| free(X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]),
[final] ).
cnf(c_0_69,plain,
( ~ substance(X2)
| ~ modification(X1,X2)
| mode(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]),
[final] ).
cnf(c_0_70,plain,
( ~ necessary(X1)
| determinedByDefiniteMethod(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]),
[final] ).
cnf(c_0_71,plain,
( ~ necessary(X1)
| determinedByFixedMethod(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]),
[final] ).
cnf(c_0_72,plain,
( ~ necessary(X2)
| externalTo(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]),
[final] ).
cnf(c_0_73,plain,
( ~ finiteAfterItsKind(X1)
| sameKind(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_38]),
[final] ).
cnf(c_0_74,plain,
( ~ absolutelyInfinite(X1)
| ~ being(X1)
| god(X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]),
[final] ).
cnf(c_0_75,plain,
( ~ conceivedThruItself(X1)
| ~ inItself(X1)
| substance(X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]),
[final] ).
cnf(c_0_76,plain,
( ~ finiteAfterItsKind(X1)
| canBeLimitedBy(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_38]),
[final] ).
cnf(c_0_77,plain,
( ~ natureConcOnlyByExistence(X1)
| ~ essenceInvExistence(X1)
| selfCaused(X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]),
[final] ).
cnf(c_0_78,plain,
( ~ knowledgeOfEffect(X1,X2)
| knowledgeOfACause(X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]),
[final] ).
cnf(c_0_79,plain,
( ~ eternity(X1)
| existConcFollowFromDefEternal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]),
[final] ).
cnf(c_0_80,plain,
( ~ haveNothingInCommon(X1,X2)
| ~ conceptionInvolves(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]),
[final] ).
cnf(c_0_81,plain,
( ~ free(X1)
| existsOnlyByNecessityOfOwnNature(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]),
[final] ).
cnf(c_0_82,plain,
( ~ absolutelyInfinite(X1)
| constInInfAttributes(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]),
[final] ).
cnf(c_0_83,plain,
( ~ god(X1)
| being(X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]),
[final] ).
cnf(c_0_84,plain,
( ~ attribute(X1)
| intPercAsConstEssSub(X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]),
[final] ).
cnf(c_0_85,plain,
( ~ substance(X1)
| conceivedThruItself(X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]),
[final] ).
cnf(c_0_86,plain,
( ~ substance(X1)
| inItself(X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]),
[final] ).
cnf(c_0_87,plain,
( ~ selfCaused(X1)
| natureConcOnlyByExistence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]),
[final] ).
cnf(c_0_88,plain,
( ~ haveNothingInCommon(X1,X2)
| ~ canBeUnderstoodInTermsOf(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]),
[final] ).
cnf(c_0_89,plain,
( ~ haveNothingInCommon(X2,X1)
| ~ conceptionInvolves(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]),
[final] ).
cnf(c_0_90,plain,
( ~ haveNothingInCommon(X2,X1)
| ~ canBeUnderstoodInTermsOf(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]),
[final] ).
cnf(c_0_91,plain,
( ~ existConcFollowFromDefEternal(X1)
| eternity(X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]),
[final] ).
cnf(c_0_92,plain,
( ~ god(X1)
| absolutelyInfinite(X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]),
[final] ).
cnf(c_0_93,plain,
( ~ intPercAsConstEssSub(X1)
| attribute(X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]),
[final] ).
cnf(c_0_94,plain,
( ~ absolutelyInfinite(X1)
| substance(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]),
[final] ).
cnf(c_0_95,plain,
( ~ selfCaused(X1)
| essenceInvExistence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]),
[final] ).
cnf(c_0_96,plain,
( ~ essenceInvExistence(X1)
| ~ canBeConceivedAsNonExisting(X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : PHI025+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.46 % Computer : n002.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Mon Sep 21 03:33:03 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.52 Running first-order theorem proving
% 0.24/0.53 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.24/0.56 % Version: 3.5.1
% 0.24/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.56 % Starting sh5l with 300s (1) cores
% 0.24/0.56 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2335016 completed with status 1
% 0.24/0.56 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.24/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.56 % No SInE strategy applied
% 0.24/0.56 % Search class: FGHSF-FFMF00-SFFFFFNN
% 0.24/0.56 % partial match(1): FGHSF-FFMM00-SFFFFFNN
% 0.24/0.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/0.56 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.24/0.56 % Starting new_bool_3 with 136s (1) cores
% 0.24/0.56 % Starting new_bool_1 with 136s (1) cores
% 0.24/0.56 % new_bool_3 with pid 2335035 completed with status 1
% 0.24/0.56 % Result found by new_bool_3
% 0.24/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.56 % No SInE strategy applied
% 0.24/0.56 % Search class: FGHSF-FFMF00-SFFFFFNN
% 0.24/0.56 % partial match(1): FGHSF-FFMM00-SFFFFFNN
% 0.24/0.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/0.56 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.24/0.56 % Starting new_bool_3 with 136s (1) cores
% 0.24/0.56 % Preprocessing time : 0.001 s
% 0.24/0.56 % Presaturation interreduction done
% 0.24/0.56
% 0.24/0.56 % No proof found!
% 0.24/0.56 % SZS status Satisfiable
% 0.24/0.56 % SZS output start Saturation
% See solution above
% 0.24/0.56 % Parsed axioms : 17
% 0.24/0.56 % Removed by relevancy pruning/SinE : 0
% 0.24/0.56 % Initial clauses : 55
% 0.24/0.56 % Removed in clause preprocessing : 1
% 0.24/0.56 % Initial clauses in saturation : 54
% 0.24/0.56 % Processed clauses : 115
% 0.24/0.56 % ...of these trivial : 1
% 0.24/0.56 % ...subsumed : 4
% 0.24/0.56 % ...remaining for further processing : 110
% 0.24/0.56 % Other redundant clauses eliminated : 2
% 0.24/0.56 % Clauses deleted for lack of memory : 0
% 0.24/0.56 % Backward-subsumed : 0
% 0.24/0.56 % Backward-rewritten : 0
% 0.24/0.56 % Generated clauses : 31
% 0.24/0.56 % ...of the previous two non-redundant : 9
% 0.24/0.56 % ...aggressively subsumed : 0
% 0.24/0.56 % Contextual simplify-reflections : 0
% 0.24/0.56 % Paramodulations : 29
% 0.24/0.56 % Factorizations : 0
% 0.24/0.56 % NegExts : 0
% 0.24/0.56 % Equation resolutions : 2
% 0.24/0.56 % Disequality decompositions : 0
% 0.24/0.56 % Total rewrite steps : 1
% 0.24/0.56 % ...of those cached : 0
% 0.24/0.56 % Propositional unsat checks : 0
% 0.24/0.56 % Propositional check models : 0
% 0.24/0.56 % Propositional check unsatisfiable : 0
% 0.24/0.56 % Propositional clauses : 0
% 0.24/0.56 % Propositional clauses after purity: 0
% 0.24/0.56 % Propositional unsat core size : 0
% 0.24/0.56 % Propositional preprocessing time : 0.000
% 0.24/0.56 % Propositional encoding time : 0.000
% 0.24/0.56 % Propositional solver time : 0.000
% 0.24/0.56 % Success case prop preproc time : 0.000
% 0.24/0.56 % Success case prop encoding time : 0.000
% 0.24/0.56 % Success case prop solver time : 0.000
% 0.24/0.56 % Current number of processed clauses : 56
% 0.24/0.56 % Positive orientable unit clauses : 1
% 0.24/0.56 % Positive unorientable unit clauses: 0
% 0.24/0.56 % Negative unit clauses : 0
% 0.24/0.56 % Non-unit-clauses : 55
% 0.24/0.56 % Current number of unprocessed clauses: 0
% 0.24/0.56 % ...number of literals in the above : 0
% 0.24/0.56 % Current number of archived formulas : 0
% 0.24/0.56 % Current number of archived clauses : 52
% 0.24/0.56 % Clause-clause subsumption calls (NU) : 1895
% 0.24/0.56 % Rec. Clause-clause subsumption calls : 1303
% 0.24/0.56 % Non-unit clause-clause subsumptions : 4
% 0.24/0.56 % Unit Clause-clause subsumption calls : 1
% 0.24/0.56 % Rewrite failures with RHS unbound : 0
% 0.24/0.56 % BW rewrite match attempts : 0
% 0.24/0.56 % BW rewrite match successes : 0
% 0.24/0.56 % Condensation attempts : 0
% 0.24/0.56 % Condensation successes : 0
% 0.24/0.56 % Termbank termtop insertions : 3654
% 0.24/0.56 % Search garbage collected termcells : 584
% 0.24/0.56
% 0.24/0.56 % -------------------------------------------------
% 0.24/0.56 % User time : 0.014 s
% 0.24/0.56 % System time : 0.003 s
% 0.24/0.56 % Total time : 0.017 s
% 0.24/0.56 % Maximum resident set size: 3360 pages
% 0.24/0.56
% 0.24/0.56 % -------------------------------------------------
% 0.24/0.56 % User time : 0.037 s
% 0.24/0.56 % System time : 0.015 s
% 0.24/0.56 % Total time : 0.052 s
% 0.24/0.56 % Maximum resident set size: 4608 pages
% 0.24/0.56 % E exiting
%------------------------------------------------------------------------------