%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : PHI023+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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 : 600s
% DateTime : Mon Jul 18 16:45:06 EDT 2022
% Result : Theorem 7.41s 2.19s
% Output : CNFRefutation 7.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 28 ( 7 unt; 0 nHn; 28 RR)
% Number of literals : 54 ( 0 equ; 28 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 : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_11,plain,
( exists(X1)
| ~ hasEssence(X1)
| ~ essenceInvExistence(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xdz66hoy/input.p',i_0_11) ).
cnf(i_0_7,plain,
( hasEssence(X1)
| ~ being(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xdz66hoy/input.p',i_0_7) ).
cnf(i_0_21,plain,
( selfCaused(X1)
| ~ inItself(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xdz66hoy/input.p',i_0_21) ).
cnf(i_0_33,plain,
( inItself(X1)
| ~ substance(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xdz66hoy/input.p',i_0_33) ).
cnf(i_0_18,plain,
( being(X1)
| ~ god(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xdz66hoy/input.p',i_0_18) ).
cnf(i_0_30,plain,
( essenceInvExistence(X1)
| ~ selfCaused(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xdz66hoy/input.p',i_0_30) ).
cnf(i_0_17,plain,
( absolutelyInfinite(X1)
| ~ god(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xdz66hoy/input.p',i_0_17) ).
cnf(i_0_20,negated_conjecture,
god(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xdz66hoy/input.p',i_0_20) ).
cnf(i_0_6,plain,
( substance(X1)
| ~ absolutelyInfinite(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xdz66hoy/input.p',i_0_6) ).
cnf(i_0_19,negated_conjecture,
~ exists(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xdz66hoy/input.p',i_0_19) ).
cnf(c_0_44,plain,
( exists(X1)
| ~ hasEssence(X1)
| ~ essenceInvExistence(X1) ),
i_0_11 ).
cnf(c_0_45,plain,
( hasEssence(X1)
| ~ being(X1) ),
i_0_7 ).
cnf(c_0_46,plain,
( selfCaused(X1)
| ~ inItself(X1) ),
i_0_21 ).
cnf(c_0_47,plain,
( inItself(X1)
| ~ substance(X1) ),
i_0_33 ).
cnf(c_0_48,plain,
( exists(X1)
| ~ essenceInvExistence(X1)
| ~ being(X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,plain,
( being(X1)
| ~ god(X1) ),
i_0_18 ).
cnf(c_0_50,plain,
( essenceInvExistence(X1)
| ~ selfCaused(X1) ),
i_0_30 ).
cnf(c_0_51,plain,
( selfCaused(X1)
| ~ substance(X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_52,plain,
( absolutelyInfinite(X1)
| ~ god(X1) ),
i_0_17 ).
cnf(c_0_53,negated_conjecture,
god(esk1_0),
i_0_20 ).
cnf(c_0_54,plain,
( exists(X1)
| ~ essenceInvExistence(X1)
| ~ god(X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_55,plain,
( essenceInvExistence(X1)
| ~ substance(X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,plain,
( substance(X1)
| ~ absolutelyInfinite(X1) ),
i_0_6 ).
cnf(c_0_57,negated_conjecture,
absolutelyInfinite(esk1_0),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_58,plain,
( exists(X1)
| ~ substance(X1)
| ~ god(X1) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,plain,
substance(esk1_0),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_60,negated_conjecture,
~ exists(esk1_0),
i_0_19 ).
cnf(c_0_61,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_53]),c_0_59])]),c_0_60]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : PHI023+1 : TPTP v8.1.0. Released v7.4.0.
% 0.06/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.31 % Computer : n028.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 600
% 0.10/0.31 % DateTime : Thu Jun 2 01:22:40 EDT 2022
% 0.16/0.31 % CPUTime :
% 0.16/0.42 # ENIGMATIC: Selected SinE mode:
% 0.16/0.43 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.43 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.16/0.43 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.16/0.43 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.41/2.19 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 7.41/2.19 # Version: 2.1pre011
% 7.41/2.19 # Preprocessing time : 0.017 s
% 7.41/2.19
% 7.41/2.19 # Proof found!
% 7.41/2.19 # SZS status Theorem
% 7.41/2.19 # SZS output start CNFRefutation
% See solution above
% 7.41/2.19 # Proof object total steps : 28
% 7.41/2.19 # Proof object clause steps : 18
% 7.41/2.19 # Proof object formula steps : 10
% 7.41/2.19 # Proof object conjectures : 6
% 7.41/2.19 # Proof object clause conjectures : 4
% 7.41/2.19 # Proof object formula conjectures : 2
% 7.41/2.19 # Proof object initial clauses used : 10
% 7.41/2.19 # Proof object initial formulas used : 10
% 7.41/2.19 # Proof object generating inferences : 8
% 7.41/2.19 # Proof object simplifying inferences : 3
% 7.41/2.19 # Training examples: 0 positive, 0 negative
% 7.41/2.19 # Parsed axioms : 33
% 7.41/2.19 # Removed by relevancy pruning/SinE : 0
% 7.41/2.19 # Initial clauses : 33
% 7.41/2.19 # Removed in clause preprocessing : 0
% 7.41/2.19 # Initial clauses in saturation : 33
% 7.41/2.19 # Processed clauses : 43
% 7.41/2.19 # ...of these trivial : 0
% 7.41/2.19 # ...subsumed : 0
% 7.41/2.19 # ...remaining for further processing : 43
% 7.41/2.19 # Other redundant clauses eliminated : 2
% 7.41/2.19 # Clauses deleted for lack of memory : 0
% 7.41/2.19 # Backward-subsumed : 2
% 7.41/2.19 # Backward-rewritten : 0
% 7.41/2.19 # Generated clauses : 21
% 7.41/2.19 # ...of the previous two non-trivial : 16
% 7.41/2.19 # Contextual simplify-reflections : 0
% 7.41/2.19 # Paramodulations : 15
% 7.41/2.19 # Factorizations : 4
% 7.41/2.19 # Equation resolutions : 2
% 7.41/2.19 # Propositional unsat checks : 0
% 7.41/2.19 # Propositional unsat check successes : 0
% 7.41/2.19 # Current number of processed clauses : 39
% 7.41/2.19 # Positive orientable unit clauses : 4
% 7.41/2.19 # Positive unorientable unit clauses: 0
% 7.41/2.19 # Negative unit clauses : 1
% 7.41/2.19 # Non-unit-clauses : 34
% 7.41/2.19 # Current number of unprocessed clauses: 0
% 7.41/2.19 # ...number of literals in the above : 0
% 7.41/2.19 # Current number of archived formulas : 0
% 7.41/2.19 # Current number of archived clauses : 2
% 7.41/2.19 # Clause-clause subsumption calls (NU) : 362
% 7.41/2.19 # Rec. Clause-clause subsumption calls : 300
% 7.41/2.19 # Non-unit clause-clause subsumptions : 1
% 7.41/2.19 # Unit Clause-clause subsumption calls : 3
% 7.41/2.19 # Rewrite failures with RHS unbound : 0
% 7.41/2.19 # BW rewrite match attempts : 3
% 7.41/2.19 # BW rewrite match successes : 1
% 7.41/2.19 # Condensation attempts : 0
% 7.41/2.19 # Condensation successes : 0
% 7.41/2.19 # Termbank termtop insertions : 833
% 7.41/2.19
% 7.41/2.19 # -------------------------------------------------
% 7.41/2.19 # User time : 0.017 s
% 7.41/2.19 # System time : 0.001 s
% 7.41/2.19 # Total time : 0.019 s
% 7.41/2.19 # ...preprocessing : 0.017 s
% 7.41/2.19 # ...main loop : 0.002 s
% 7.41/2.19 # Maximum resident set size: 7136 pages
% 7.41/2.19
%------------------------------------------------------------------------------