%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL458+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n001.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:48 AM UTC 2026
% Result : Theorem 23.71s 5.30s
% Output : CNFRefutation 23.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 26
% Syntax : Number of clauses : 84 ( 48 unt; 0 nHn; 42 RR)
% Number of literals : 130 ( 19 equ; 50 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 16 ( 14 usr; 14 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 105 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_51,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-seskmsec/input.p',i_0_51) ).
cnf(i_0_28,plain,
modus_ponens,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-seskmsec/input.p',i_0_28) ).
cnf(i_0_6,plain,
( is_a_theorem(implies(X1,implies(X2,and(X1,X2))))
| ~ and_3 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-seskmsec/input.p',i_0_6) ).
cnf(i_0_21,plain,
and_3,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-seskmsec/input.p',i_0_21) ).
cnf(i_0_39,plain,
( is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))
| ~ implies_2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-seskmsec/input.p',i_0_39) ).
cnf(i_0_26,plain,
implies_2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-seskmsec/input.p',i_0_26) ).
cnf(i_0_37,plain,
( is_a_theorem(implies(X1,implies(X2,X1)))
| ~ implies_1 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-seskmsec/input.p',i_0_37) ).
cnf(i_0_25,plain,
implies_1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-seskmsec/input.p',i_0_25) ).
cnf(i_0_56,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-seskmsec/input.p',i_0_56) ).
cnf(i_0_31,plain,
op_implies_and,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-seskmsec/input.p',i_0_31) ).
cnf(i_0_55,plain,
( and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2)
| ~ op_equiv ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-seskmsec/input.p',i_0_55) ).
cnf(i_0_30,plain,
op_equiv,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-seskmsec/input.p',i_0_30) ).
cnf(i_0_58,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-seskmsec/input.p',i_0_58) ).
cnf(i_0_32,plain,
op_or,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-seskmsec/input.p',i_0_32) ).
cnf(i_0_81,plain,
( X1 = X2
| ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-seskmsec/input.p',i_0_81) ).
cnf(i_0_82,plain,
substitution_of_equivalents,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-seskmsec/input.p',i_0_82) ).
cnf(i_0_57,plain,
( or(not(X1),X2) = implies(X1,X2)
| ~ op_implies_or ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-seskmsec/input.p',i_0_57) ).
cnf(i_0_67,plain,
op_implies_or,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-seskmsec/input.p',i_0_67) ).
cnf(i_0_53,plain,
( is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1)))
| ~ modus_tollens ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-seskmsec/input.p',i_0_53) ).
cnf(i_0_29,plain,
modus_tollens,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-seskmsec/input.p',i_0_29) ).
cnf(i_0_74,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X1)))
| ~ r3 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-seskmsec/input.p',i_0_74) ).
cnf(i_0_73,plain,
( r3
| ~ is_a_theorem(implies(or(esk46_0,esk47_0),or(esk47_0,esk46_0))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-seskmsec/input.p',i_0_73) ).
cnf(i_0_41,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))
| ~ implies_3 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-seskmsec/input.p',i_0_41) ).
cnf(i_0_27,plain,
implies_3,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-seskmsec/input.p',i_0_27) ).
cnf(i_0_77,plain,
( r5
| ~ is_a_theorem(implies(implies(esk52_0,esk53_0),implies(or(esk51_0,esk52_0),or(esk51_0,esk53_0)))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-seskmsec/input.p',i_0_77) ).
cnf(i_0_68,negated_conjecture,
~ r5,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-seskmsec/input.p',i_0_68) ).
cnf(c_0_109,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
i_0_51 ).
cnf(c_0_110,plain,
modus_ponens,
i_0_28 ).
cnf(c_0_111,plain,
( is_a_theorem(implies(X1,implies(X2,and(X1,X2))))
| ~ and_3 ),
i_0_6 ).
cnf(c_0_112,plain,
and_3,
i_0_21 ).
cnf(c_0_113,plain,
( is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))
| ~ implies_2 ),
i_0_39 ).
cnf(c_0_114,plain,
implies_2,
i_0_26 ).
cnf(c_0_115,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_109,c_0_110])]) ).
cnf(c_0_116,plain,
is_a_theorem(implies(X1,implies(X2,and(X1,X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_111,c_0_112])]) ).
cnf(c_0_117,plain,
is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_113,c_0_114])]) ).
cnf(c_0_118,plain,
( is_a_theorem(implies(X1,implies(X2,X1)))
| ~ implies_1 ),
i_0_37 ).
cnf(c_0_119,plain,
implies_1,
i_0_25 ).
cnf(c_0_120,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
i_0_56 ).
cnf(c_0_121,plain,
op_implies_and,
i_0_31 ).
cnf(c_0_122,plain,
( is_a_theorem(implies(X1,and(X2,X1)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_115,c_0_116]) ).
cnf(c_0_123,plain,
( and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2)
| ~ op_equiv ),
i_0_55 ).
cnf(c_0_124,plain,
op_equiv,
i_0_30 ).
cnf(c_0_125,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_115,c_0_117]) ).
cnf(c_0_126,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_118,c_0_119])]) ).
cnf(c_0_127,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
i_0_58 ).
cnf(c_0_128,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_120,c_0_121])]) ).
cnf(c_0_129,plain,
op_or,
i_0_32 ).
cnf(c_0_130,plain,
( X1 = X2
| ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X1,X2)) ),
i_0_81 ).
cnf(c_0_131,plain,
substitution_of_equivalents,
i_0_82 ).
cnf(c_0_132,plain,
( is_a_theorem(and(X1,X2))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_115,c_0_122]) ).
cnf(c_0_133,plain,
and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_123,c_0_124])]) ).
cnf(c_0_134,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_125,c_0_126]) ).
cnf(c_0_135,plain,
implies(not(X1),X2) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_127,c_0_128]),c_0_129])]) ).
cnf(c_0_136,plain,
( or(not(X1),X2) = implies(X1,X2)
| ~ op_implies_or ),
i_0_57 ).
cnf(c_0_137,plain,
op_implies_or,
i_0_67 ).
cnf(c_0_138,plain,
( is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1)))
| ~ modus_tollens ),
i_0_53 ).
cnf(c_0_139,plain,
modus_tollens,
i_0_29 ).
cnf(c_0_140,plain,
( X1 = X2
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_130,c_0_131])]) ).
cnf(c_0_141,plain,
( is_a_theorem(equiv(X1,X2))
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_132,c_0_133]) ).
cnf(c_0_142,plain,
is_a_theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_134,c_0_135]) ).
cnf(c_0_143,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_136,c_0_137])]) ).
cnf(c_0_144,plain,
is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_138,c_0_135]),c_0_139])]) ).
cnf(c_0_145,plain,
( X1 = X2
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_140,c_0_141]) ).
cnf(c_0_146,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_142,c_0_143]) ).
cnf(c_0_147,plain,
is_a_theorem(implies(or(X1,not(not(X2))),or(X2,X1))),
inference(spm,[status(thm)],[c_0_144,c_0_135]) ).
cnf(c_0_148,plain,
not(not(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_146]),c_0_135]),c_0_143]),c_0_134])]) ).
cnf(c_0_149,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X1)))
| ~ r3 ),
i_0_74 ).
cnf(c_0_150,plain,
( r3
| ~ is_a_theorem(implies(or(esk46_0,esk47_0),or(esk47_0,esk46_0))) ),
i_0_73 ).
cnf(c_0_151,plain,
is_a_theorem(implies(or(X1,X2),or(X2,X1))),
inference(rw,[status(thm)],[c_0_147,c_0_148]) ).
cnf(c_0_152,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))
| ~ implies_3 ),
i_0_41 ).
cnf(c_0_153,plain,
implies_3,
i_0_27 ).
cnf(c_0_154,plain,
( is_a_theorem(implies(implies(X1,X2),or(X2,not(X1))))
| ~ r3 ),
inference(spm,[status(thm)],[c_0_149,c_0_143]) ).
cnf(c_0_155,plain,
r3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_150,c_0_151])]) ).
cnf(c_0_156,plain,
( r5
| ~ is_a_theorem(implies(implies(esk52_0,esk53_0),implies(or(esk51_0,esk52_0),or(esk51_0,esk53_0)))) ),
i_0_77 ).
cnf(c_0_157,negated_conjecture,
~ r5,
i_0_68 ).
cnf(c_0_158,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_152,c_0_153])]) ).
cnf(c_0_159,plain,
is_a_theorem(implies(implies(X1,X2),or(X2,not(X1)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_154,c_0_155])]) ).
cnf(c_0_160,plain,
~ is_a_theorem(implies(implies(esk52_0,esk53_0),implies(or(esk51_0,esk52_0),or(esk51_0,esk53_0)))),
inference(sr,[status(thm)],[c_0_156,c_0_157]) ).
cnf(c_0_161,plain,
or(X1,X2) = or(X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_151]),c_0_151])]) ).
cnf(c_0_162,plain,
is_a_theorem(implies(or(X1,X2),implies(implies(X2,X3),or(X1,X3)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_158,c_0_135]),c_0_135]) ).
cnf(c_0_163,plain,
or(X1,not(X2)) = implies(X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_159]),c_0_144])]) ).
cnf(c_0_164,plain,
~ is_a_theorem(implies(implies(esk52_0,esk53_0),implies(or(esk52_0,esk51_0),or(esk53_0,esk51_0)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_160,c_0_161]),c_0_161]) ).
cnf(c_0_165,plain,
is_a_theorem(implies(implies(X1,X2),implies(or(X1,X3),or(X2,X3)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_162,c_0_135]),c_0_163]) ).
cnf(c_0_166,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_164,c_0_165])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL458+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.08/0.34 % Computer : n001.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Fri Sep 4 16:01:16 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.12/0.40 # ENIGMATIC: Selected SinE mode:
% 0.12/0.40 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.40 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.12/0.40 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.12/0.40 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 23.71/5.30 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 23.71/5.30 # Version: 2.1pre011
% 23.71/5.30 # Preprocessing time : 0.017 s
% 23.71/5.30
% 23.71/5.30 # Proof found!
% 23.71/5.30 # SZS status Theorem
% 23.71/5.30 # SZS output start CNFRefutation
% See solution above
% 23.71/5.30 # Proof object total steps : 84
% 23.71/5.30 # Proof object clause steps : 58
% 23.71/5.30 # Proof object formula steps : 26
% 23.71/5.30 # Proof object conjectures : 2
% 23.71/5.30 # Proof object clause conjectures : 1
% 23.71/5.30 # Proof object formula conjectures : 1
% 23.71/5.30 # Proof object initial clauses used : 26
% 23.71/5.30 # Proof object initial formulas used : 26
% 23.71/5.30 # Proof object generating inferences : 15
% 23.71/5.30 # Proof object simplifying inferences : 44
% 23.71/5.30 # Training examples: 0 positive, 0 negative
% 23.71/5.30 # Parsed axioms : 82
% 23.71/5.30 # Removed by relevancy pruning/SinE : 0
% 23.71/5.30 # Initial clauses : 82
% 23.71/5.30 # Removed in clause preprocessing : 0
% 23.71/5.30 # Initial clauses in saturation : 82
% 23.71/5.30 # Processed clauses : 2003
% 23.71/5.30 # ...of these trivial : 158
% 23.71/5.30 # ...subsumed : 1127
% 23.71/5.30 # ...remaining for further processing : 718
% 23.71/5.30 # Other redundant clauses eliminated : 0
% 23.71/5.30 # Clauses deleted for lack of memory : 0
% 23.71/5.30 # Backward-subsumed : 19
% 23.71/5.30 # Backward-rewritten : 246
% 23.71/5.30 # Generated clauses : 74222
% 23.71/5.30 # ...of the previous two non-trivial : 65213
% 23.71/5.30 # Contextual simplify-reflections : 201
% 23.71/5.30 # Paramodulations : 74222
% 23.71/5.30 # Factorizations : 0
% 23.71/5.30 # Equation resolutions : 0
% 23.71/5.30 # Propositional unsat checks : 0
% 23.71/5.30 # Propositional unsat check successes : 0
% 23.71/5.30 # Current number of processed clauses : 453
% 23.71/5.30 # Positive orientable unit clauses : 133
% 23.71/5.30 # Positive unorientable unit clauses: 31
% 23.71/5.30 # Negative unit clauses : 9
% 23.71/5.30 # Non-unit-clauses : 280
% 23.71/5.30 # Current number of unprocessed clauses: 46926
% 23.71/5.30 # ...number of literals in the above : 108677
% 23.71/5.30 # Current number of archived formulas : 0
% 23.71/5.30 # Current number of archived clauses : 265
% 23.71/5.30 # Clause-clause subsumption calls (NU) : 34930
% 23.71/5.30 # Rec. Clause-clause subsumption calls : 32651
% 23.71/5.30 # Non-unit clause-clause subsumptions : 963
% 23.71/5.30 # Unit Clause-clause subsumption calls : 2338
% 23.71/5.30 # Rewrite failures with RHS unbound : 373
% 23.71/5.30 # BW rewrite match attempts : 6125
% 23.71/5.30 # BW rewrite match successes : 523
% 23.71/5.30 # Condensation attempts : 0
% 23.71/5.30 # Condensation successes : 0
% 23.71/5.30 # Termbank termtop insertions : 914585
% 23.71/5.30
% 23.71/5.30 # -------------------------------------------------
% 23.71/5.30 # User time : 1.366 s
% 23.71/5.30 # System time : 0.056 s
% 23.71/5.30 # Total time : 1.422 s
% 23.71/5.30 # ...preprocessing : 0.017 s
% 23.71/5.30 # ...main loop : 1.405 s
% 23.71/5.30 # Maximum resident set size: 57344 pages
% 23.71/5.30
%------------------------------------------------------------------------------