%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL527+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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 : Mon Sep 7 11:44:56 AM UTC 2026
% Result : Theorem 17.49s 4.52s
% Output : CNFRefutation 17.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 11 unt; 4 nHn; 20 RR)
% Number of literals : 43 ( 0 equ; 18 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 4 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_96,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3wej7fv_/input.p',i_0_96) ).
cnf(i_0_68,plain,
modus_ponens,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3wej7fv_/input.p',i_0_68) ).
cnf(i_0_10,plain,
( is_a_theorem(implies(X1,implies(X2,and(X1,X2))))
| ~ and_3 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3wej7fv_/input.p',i_0_10) ).
cnf(i_0_61,plain,
and_3,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3wej7fv_/input.p',i_0_61) ).
cnf(i_0_1,plain,
( adjunction
| ~ is_a_theorem(and(esk1_0,esk2_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3wej7fv_/input.p',i_0_1) ).
cnf(i_0_131,negated_conjecture,
~ adjunction,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3wej7fv_/input.p',i_0_131) ).
cnf(i_0_2,plain,
( adjunction
| is_a_theorem(esk2_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3wej7fv_/input.p',i_0_2) ).
cnf(i_0_3,plain,
( adjunction
| is_a_theorem(esk1_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3wej7fv_/input.p',i_0_3) ).
cnf(c_0_140,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
i_0_96 ).
cnf(c_0_141,plain,
modus_ponens,
i_0_68 ).
cnf(c_0_142,plain,
( is_a_theorem(implies(X1,implies(X2,and(X1,X2))))
| ~ and_3 ),
i_0_10 ).
cnf(c_0_143,plain,
and_3,
i_0_61 ).
cnf(c_0_144,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_140,c_0_141])]) ).
cnf(c_0_145,plain,
is_a_theorem(implies(X1,implies(X2,and(X1,X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_142,c_0_143])]) ).
cnf(c_0_146,plain,
( adjunction
| ~ is_a_theorem(and(esk1_0,esk2_0)) ),
i_0_1 ).
cnf(c_0_147,negated_conjecture,
~ adjunction,
i_0_131 ).
cnf(c_0_148,plain,
( is_a_theorem(implies(X1,and(X2,X1)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_144,c_0_145]) ).
cnf(c_0_149,plain,
( adjunction
| is_a_theorem(esk2_0) ),
i_0_2 ).
cnf(c_0_150,plain,
( adjunction
| is_a_theorem(esk1_0) ),
i_0_3 ).
cnf(c_0_151,plain,
~ is_a_theorem(and(esk1_0,esk2_0)),
inference(sr,[status(thm)],[c_0_146,c_0_147]) ).
cnf(c_0_152,plain,
( is_a_theorem(and(X1,X2))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_144,c_0_148]) ).
cnf(c_0_153,plain,
is_a_theorem(esk2_0),
inference(sr,[status(thm)],[c_0_149,c_0_147]) ).
cnf(c_0_154,plain,
is_a_theorem(esk1_0),
inference(sr,[status(thm)],[c_0_150,c_0_147]) ).
cnf(c_0_155,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_151,c_0_152]),c_0_153]),c_0_154])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL527+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.36 % Computer : n026.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 6 00:39:28 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected SinE mode:
% 0.21/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 17.49/4.52 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 17.49/4.52 # Version: 2.1pre011
% 17.49/4.52 # Preprocessing time : 0.011 s
% 17.49/4.52
% 17.49/4.52 # Proof found!
% 17.49/4.52 # SZS status Theorem
% 17.49/4.52 # SZS output start CNFRefutation
% See solution above
% 17.49/4.52 # Proof object total steps : 24
% 17.49/4.52 # Proof object clause steps : 16
% 17.49/4.52 # Proof object formula steps : 8
% 17.49/4.52 # Proof object conjectures : 2
% 17.49/4.52 # Proof object clause conjectures : 1
% 17.49/4.52 # Proof object formula conjectures : 1
% 17.49/4.52 # Proof object initial clauses used : 8
% 17.49/4.52 # Proof object initial formulas used : 8
% 17.49/4.52 # Proof object generating inferences : 3
% 17.49/4.52 # Proof object simplifying inferences : 10
% 17.49/4.52 # Training examples: 0 positive, 0 negative
% 17.49/4.52 # Parsed axioms : 143
% 17.49/4.52 # Removed by relevancy pruning/SinE : 0
% 17.49/4.52 # Initial clauses : 143
% 17.49/4.52 # Removed in clause preprocessing : 0
% 17.49/4.52 # Initial clauses in saturation : 143
% 17.49/4.52 # Processed clauses : 250
% 17.49/4.52 # ...of these trivial : 28
% 17.49/4.52 # ...subsumed : 7
% 17.49/4.52 # ...remaining for further processing : 215
% 17.49/4.52 # Other redundant clauses eliminated : 0
% 17.49/4.52 # Clauses deleted for lack of memory : 0
% 17.49/4.52 # Backward-subsumed : 0
% 17.49/4.52 # Backward-rewritten : 8
% 17.49/4.52 # Generated clauses : 1011
% 17.49/4.52 # ...of the previous two non-trivial : 956
% 17.49/4.52 # Contextual simplify-reflections : 4
% 17.49/4.52 # Paramodulations : 1011
% 17.49/4.52 # Factorizations : 0
% 17.49/4.52 # Equation resolutions : 0
% 17.49/4.52 # Propositional unsat checks : 0
% 17.49/4.52 # Propositional unsat check successes : 0
% 17.49/4.52 # Current number of processed clauses : 207
% 17.49/4.52 # Positive orientable unit clauses : 60
% 17.49/4.52 # Positive unorientable unit clauses: 1
% 17.49/4.52 # Negative unit clauses : 2
% 17.49/4.52 # Non-unit-clauses : 144
% 17.49/4.52 # Current number of unprocessed clauses: 835
% 17.49/4.52 # ...number of literals in the above : 2157
% 17.49/4.52 # Current number of archived formulas : 0
% 17.49/4.52 # Current number of archived clauses : 8
% 17.49/4.52 # Clause-clause subsumption calls (NU) : 1839
% 17.49/4.52 # Rec. Clause-clause subsumption calls : 1563
% 17.49/4.52 # Non-unit clause-clause subsumptions : 10
% 17.49/4.52 # Unit Clause-clause subsumption calls : 212
% 17.49/4.52 # Rewrite failures with RHS unbound : 0
% 17.49/4.52 # BW rewrite match attempts : 32
% 17.49/4.52 # BW rewrite match successes : 5
% 17.49/4.52 # Condensation attempts : 0
% 17.49/4.52 # Condensation successes : 0
% 17.49/4.52 # Termbank termtop insertions : 14298
% 17.49/4.52
% 17.49/4.52 # -------------------------------------------------
% 17.49/4.52 # User time : 0.024 s
% 17.49/4.52 # System time : 0.003 s
% 17.49/4.52 # Total time : 0.027 s
% 17.49/4.52 # ...preprocessing : 0.011 s
% 17.49/4.52 # ...main loop : 0.016 s
% 17.49/4.52 # Maximum resident set size: 8448 pages
% 17.49/4.52
%------------------------------------------------------------------------------