%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : PHI022+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.17s 2.34s
% Output : CNFRefutation 7.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 5 unt; 0 nHn; 21 RR)
% Number of literals : 40 ( 0 equ; 21 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_22,plain,
( selfCaused(X1)
| ~ inItself(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xknnx5lg/input.p',i_0_22) ).
cnf(i_0_34,plain,
( inItself(X1)
| ~ substance(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xknnx5lg/input.p',i_0_34) ).
cnf(i_0_11,plain,
( exists(X1)
| ~ hasEssence(X1)
| ~ essenceInvExistence(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xknnx5lg/input.p',i_0_11) ).
cnf(i_0_7,plain,
( hasEssence(X1)
| ~ being(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xknnx5lg/input.p',i_0_7) ).
cnf(i_0_31,plain,
( essenceInvExistence(X1)
| ~ selfCaused(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xknnx5lg/input.p',i_0_31) ).
cnf(i_0_19,plain,
( being(X1)
| ~ substance(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xknnx5lg/input.p',i_0_19) ).
cnf(i_0_20,negated_conjecture,
~ exists(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xknnx5lg/input.p',i_0_20) ).
cnf(i_0_21,negated_conjecture,
substance(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xknnx5lg/input.p',i_0_21) ).
cnf(c_0_43,plain,
( selfCaused(X1)
| ~ inItself(X1) ),
i_0_22 ).
cnf(c_0_44,plain,
( inItself(X1)
| ~ substance(X1) ),
i_0_34 ).
cnf(c_0_45,plain,
( exists(X1)
| ~ hasEssence(X1)
| ~ essenceInvExistence(X1) ),
i_0_11 ).
cnf(c_0_46,plain,
( hasEssence(X1)
| ~ being(X1) ),
i_0_7 ).
cnf(c_0_47,plain,
( essenceInvExistence(X1)
| ~ selfCaused(X1) ),
i_0_31 ).
cnf(c_0_48,plain,
( selfCaused(X1)
| ~ substance(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,plain,
( exists(X1)
| ~ essenceInvExistence(X1)
| ~ being(X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,plain,
( essenceInvExistence(X1)
| ~ substance(X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,plain,
( being(X1)
| ~ substance(X1) ),
i_0_19 ).
cnf(c_0_52,negated_conjecture,
~ exists(esk1_0),
i_0_20 ).
cnf(c_0_53,plain,
( exists(X1)
| ~ substance(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]) ).
cnf(c_0_54,negated_conjecture,
substance(esk1_0),
i_0_21 ).
cnf(c_0_55,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : PHI022+1 : TPTP v8.1.0. Released v7.4.0.
% 0.04/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n028.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 : 600
% 0.12/0.33 % DateTime : Thu Jun 2 01:52:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.17/2.34 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.17/2.34 # Version: 2.1pre011
% 7.17/2.34 # Preprocessing time : 0.009 s
% 7.17/2.34
% 7.17/2.34 # Proof found!
% 7.17/2.34 # SZS status Theorem
% 7.17/2.34 # SZS output start CNFRefutation
% See solution above
% 7.17/2.34 # Proof object total steps : 21
% 7.17/2.34 # Proof object clause steps : 13
% 7.17/2.34 # Proof object formula steps : 8
% 7.17/2.34 # Proof object conjectures : 5
% 7.17/2.34 # Proof object clause conjectures : 3
% 7.17/2.34 # Proof object formula conjectures : 2
% 7.17/2.34 # Proof object initial clauses used : 8
% 7.17/2.34 # Proof object initial formulas used : 8
% 7.17/2.34 # Proof object generating inferences : 5
% 7.17/2.34 # Proof object simplifying inferences : 3
% 7.17/2.34 # Training examples: 0 positive, 0 negative
% 7.17/2.34 # Parsed axioms : 34
% 7.17/2.34 # Removed by relevancy pruning/SinE : 0
% 7.17/2.34 # Initial clauses : 34
% 7.17/2.34 # Removed in clause preprocessing : 0
% 7.17/2.34 # Initial clauses in saturation : 34
% 7.17/2.34 # Processed clauses : 38
% 7.17/2.34 # ...of these trivial : 0
% 7.17/2.34 # ...subsumed : 0
% 7.17/2.34 # ...remaining for further processing : 38
% 7.17/2.34 # Other redundant clauses eliminated : 2
% 7.17/2.34 # Clauses deleted for lack of memory : 0
% 7.17/2.34 # Backward-subsumed : 0
% 7.17/2.34 # Backward-rewritten : 0
% 7.17/2.34 # Generated clauses : 18
% 7.17/2.34 # ...of the previous two non-trivial : 10
% 7.17/2.34 # Contextual simplify-reflections : 1
% 7.17/2.34 # Paramodulations : 14
% 7.17/2.34 # Factorizations : 2
% 7.17/2.34 # Equation resolutions : 2
% 7.17/2.34 # Propositional unsat checks : 0
% 7.17/2.34 # Propositional unsat check successes : 0
% 7.17/2.34 # Current number of processed clauses : 36
% 7.17/2.34 # Positive orientable unit clauses : 1
% 7.17/2.34 # Positive unorientable unit clauses: 0
% 7.17/2.34 # Negative unit clauses : 1
% 7.17/2.34 # Non-unit-clauses : 34
% 7.17/2.34 # Current number of unprocessed clauses: 6
% 7.17/2.34 # ...number of literals in the above : 11
% 7.17/2.34 # Current number of archived formulas : 0
% 7.17/2.34 # Current number of archived clauses : 0
% 7.17/2.34 # Clause-clause subsumption calls (NU) : 380
% 7.17/2.34 # Rec. Clause-clause subsumption calls : 319
% 7.17/2.34 # Non-unit clause-clause subsumptions : 1
% 7.17/2.34 # Unit Clause-clause subsumption calls : 0
% 7.17/2.34 # Rewrite failures with RHS unbound : 0
% 7.17/2.34 # BW rewrite match attempts : 0
% 7.17/2.34 # BW rewrite match successes : 0
% 7.17/2.34 # Condensation attempts : 0
% 7.17/2.34 # Condensation successes : 0
% 7.17/2.34 # Termbank termtop insertions : 807
% 7.17/2.34
% 7.17/2.34 # -------------------------------------------------
% 7.17/2.34 # User time : 0.005 s
% 7.17/2.34 # System time : 0.005 s
% 7.17/2.34 # Total time : 0.010 s
% 7.17/2.34 # ...preprocessing : 0.009 s
% 7.17/2.34 # ...main loop : 0.001 s
% 7.17/2.34 # Maximum resident set size: 7128 pages
% 7.17/2.34
%------------------------------------------------------------------------------