%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PHI023+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 : n020.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 : Theorem 0.12s 0.43s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 5 unt; 0 def)
% Number of atoms : 111 ( 0 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 125 ( 49 ~; 47 |; 19 &)
% ( 4 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 16 ( 15 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 31 ( 0 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(essence_involves_existence_exists,axiom,
! [X1] :
( ( hasEssence(X1)
& essenceInvExistence(X1) )
=> exists(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',essence_involves_existence_exists) ).
fof(being_has_essense,axiom,
! [X1] :
( being(X1)
=> hasEssence(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',being_has_essense) ).
fof(god,axiom,
! [X1] :
( god(X1)
<=> ( absolutelyInfinite(X1)
& being(X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/PHI002+0.ax',god) ).
fof(if_god_then_exists,conjecture,
! [X1] :
( god(X1)
=> exists(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',if_god_then_exists) ).
fof(self_caused,axiom,
! [X1] :
( selfCaused(X1)
<=> ( natureConcOnlyByExistence(X1)
& essenceInvExistence(X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/PHI002+0.ax',self_caused) ).
fof(is_in_itself_is_self_caused,axiom,
! [X1] :
( inItself(X1)
=> selfCaused(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',is_in_itself_is_self_caused) ).
fof(substance,axiom,
! [X1] :
( substance(X1)
<=> ( conceivedThruItself(X1)
& inItself(X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/PHI002+0.ax',substance) ).
fof(absolutely_infinite,axiom,
! [X1,X2] :
( absolutelyInfinite(X1)
<=> ( ( attributeOf(X2,X1)
=> ( expressesInfiniteEssentiality(X2)
& expressesEternalEssentiality(X2) ) )
& constInInfAttributes(X1)
& substance(X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/PHI002+0.ax',absolutely_infinite) ).
fof(c_0_8,plain,
! [X7] :
( exists(X7)
| ~ hasEssence(X7)
| ~ essenceInvExistence(X7) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[essence_involves_existence_exists])])]) ).
fof(c_0_9,plain,
! [X12] :
( hasEssence(X12)
| ~ being(X12) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[being_has_essense])])]) ).
cnf(c_0_10,plain,
( ~ hasEssence(X1)
| ~ essenceInvExistence(X1)
| exists(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( ~ being(X1)
| hasEssence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X8] :
( ( god(X8)
| ~ absolutelyInfinite(X8)
| ~ being(X8) )
& ( ~ god(X8)
| absolutelyInfinite(X8) )
& ( ~ god(X8)
| being(X8) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[god])])])]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1] :
( god(X1)
=> exists(X1) ),
inference(assume_negation,[status(cth)],[if_god_then_exists]) ).
cnf(c_0_14,plain,
( ~ essenceInvExistence(X1)
| ~ being(X1)
| exists(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( ~ god(X1)
| being(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X13] :
( ( selfCaused(X13)
| ~ natureConcOnlyByExistence(X13)
| ~ essenceInvExistence(X13) )
& ( ~ selfCaused(X13)
| natureConcOnlyByExistence(X13) )
& ( ~ selfCaused(X13)
| essenceInvExistence(X13) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[self_caused])])])]) ).
fof(c_0_17,plain,
! [X20] :
( selfCaused(X20)
| ~ inItself(X20) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[is_in_itself_is_self_caused])])]) ).
fof(c_0_18,plain,
! [X19] :
( ( substance(X19)
| ~ conceivedThruItself(X19)
| ~ inItself(X19) )
& ( ~ substance(X19)
| conceivedThruItself(X19) )
& ( ~ substance(X19)
| inItself(X19) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[substance])])])]) ).
fof(c_0_19,negated_conjecture,
( ~ exists(esk1_0)
& god(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
cnf(c_0_20,plain,
( ~ essenceInvExistence(X1)
| ~ god(X1)
| exists(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( ~ selfCaused(X1)
| essenceInvExistence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( ~ inItself(X1)
| selfCaused(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
( ~ substance(X1)
| inItself(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_24,plain,
! [X15,X16] :
( ( absolutelyInfinite(X15)
| ~ constInInfAttributes(X15)
| ~ substance(X15)
| ~ expressesInfiniteEssentiality(X16)
| ~ expressesEternalEssentiality(X16) )
& ( absolutelyInfinite(X15)
| ~ constInInfAttributes(X15)
| ~ substance(X15)
| attributeOf(X16,X15) )
& ( ~ absolutelyInfinite(X15)
| ~ attributeOf(X16,X15)
| expressesInfiniteEssentiality(X16) )
& ( ~ absolutelyInfinite(X15)
| ~ attributeOf(X16,X15)
| expressesEternalEssentiality(X16) )
& ( ~ absolutelyInfinite(X15)
| constInInfAttributes(X15) )
& ( ~ absolutelyInfinite(X15)
| substance(X15) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[absolutely_infinite])])])]) ).
cnf(c_0_25,plain,
( ~ god(X1)
| absolutelyInfinite(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_26,negated_conjecture,
god(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
( ~ selfCaused(X1)
| ~ god(X1)
| exists(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
( ~ substance(X1)
| selfCaused(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( ~ absolutelyInfinite(X1)
| substance(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,negated_conjecture,
absolutelyInfinite(esk1_0),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
( ~ substance(X1)
| ~ god(X1)
| exists(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
substance(esk1_0),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
~ exists(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_26]),c_0_32])]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PHI023+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n020.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 03:31:19 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 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.12/0.43 % Version: 3.5.1
% 0.12/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.43 % Starting sh5l with 300s (1) cores
% 0.12/0.43 % sh5l with pid 1907680 completed with status 0
% 0.12/0.43 % Result found by sh5l
% 0.12/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.43 % Starting sh5l with 300s (1) cores
% 0.12/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.12/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.12/0.43 % Search class: FGHSF-FFSF00-SFFFFFNN
% 0.12/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.43 % SubtermCWHack with pid 1907688 completed with status 0
% 0.12/0.43 % Result found by SubtermCWHack
% 0.12/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.43 % Starting sh5l with 300s (1) cores
% 0.12/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.12/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.12/0.43 % Search class: FGHSF-FFSF00-SFFFFFNN
% 0.12/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.43 % Preprocessing time : 0.001 s
% 0.12/0.43
% 0.12/0.43 % Proof found!
% 0.12/0.43 % SZS status Theorem
% 0.12/0.43 % SZS output start CNFRefutation
% See solution above
% 0.12/0.43 % Parsed axioms : 21
% 0.12/0.43 % Removed by relevancy pruning/SinE : 9
% 0.12/0.43 % Initial clauses : 33
% 0.12/0.43 % Removed in clause preprocessing : 0
% 0.12/0.43 % Initial clauses in saturation : 33
% 0.12/0.43 % Processed clauses : 28
% 0.12/0.43 % ...of these trivial : 1
% 0.12/0.43 % ...subsumed : 0
% 0.12/0.43 % ...remaining for further processing : 27
% 0.12/0.43 % Other redundant clauses eliminated : 1
% 0.12/0.43 % Clauses deleted for lack of memory : 0
% 0.12/0.43 % Backward-subsumed : 0
% 0.12/0.43 % Backward-rewritten : 0
% 0.12/0.43 % Generated clauses : 12
% 0.12/0.43 % ...of the previous two non-redundant : 8
% 0.12/0.43 % ...aggressively subsumed : 0
% 0.12/0.43 % Contextual simplify-reflections : 0
% 0.12/0.43 % Paramodulations : 11
% 0.12/0.43 % Factorizations : 0
% 0.12/0.43 % NegExts : 0
% 0.12/0.43 % Equation resolutions : 1
% 0.12/0.43 % Disequality decompositions : 0
% 0.12/0.43 % Total rewrite steps : 2
% 0.12/0.43 % ...of those cached : 0
% 0.12/0.43 % Propositional unsat checks : 0
% 0.12/0.43 % Propositional check models : 0
% 0.12/0.43 % Propositional check unsatisfiable : 0
% 0.12/0.43 % Propositional clauses : 0
% 0.12/0.43 % Propositional clauses after purity: 0
% 0.12/0.43 % Propositional unsat core size : 0
% 0.12/0.43 % Propositional preprocessing time : 0.000
% 0.12/0.43 % Propositional encoding time : 0.000
% 0.12/0.43 % Propositional solver time : 0.000
% 0.12/0.43 % Success case prop preproc time : 0.000
% 0.12/0.43 % Success case prop encoding time : 0.000
% 0.12/0.43 % Success case prop solver time : 0.000
% 0.12/0.43 % Current number of processed clauses : 26
% 0.12/0.43 % Positive orientable unit clauses : 4
% 0.12/0.43 % Positive unorientable unit clauses: 0
% 0.12/0.43 % Negative unit clauses : 1
% 0.12/0.43 % Non-unit-clauses : 21
% 0.12/0.43 % Current number of unprocessed clauses: 13
% 0.12/0.43 % ...number of literals in the above : 42
% 0.12/0.43 % Current number of archived formulas : 0
% 0.12/0.43 % Current number of archived clauses : 0
% 0.12/0.43 % Clause-clause subsumption calls (NU) : 113
% 0.12/0.43 % Rec. Clause-clause subsumption calls : 109
% 0.12/0.43 % Non-unit clause-clause subsumptions : 0
% 0.12/0.43 % Unit Clause-clause subsumption calls : 0
% 0.12/0.43 % Rewrite failures with RHS unbound : 0
% 0.12/0.43 % BW rewrite match attempts : 0
% 0.12/0.43 % BW rewrite match successes : 0
% 0.12/0.43 % Condensation attempts : 0
% 0.12/0.43 % Condensation successes : 0
% 0.12/0.43 % Termbank termtop insertions : 1899
% 0.12/0.43 % Search garbage collected termcells : 465
% 0.12/0.43
% 0.12/0.43 % -------------------------------------------------
% 0.12/0.43 % User time : 0.007 s
% 0.12/0.43 % System time : 0.001 s
% 0.12/0.43 % Total time : 0.008 s
% 0.12/0.43 % Maximum resident set size: 3644 pages
% 0.12/0.43
% 0.12/0.43 % -------------------------------------------------
% 0.12/0.43 % User time : 0.009 s
% 0.12/0.43 % System time : 0.005 s
% 0.12/0.43 % Total time : 0.014 s
% 0.12/0.43 % Maximum resident set size: 4864 pages
% 0.12/0.43 % E exiting
%------------------------------------------------------------------------------