%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL464+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n003.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:49 AM UTC 2026
% Result : Theorem 208.96s 28.65s
% Output : CNFRefutation 208.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 18
% Syntax : Number of clauses : 132 ( 63 unt; 0 nHn; 53 RR)
% Number of literals : 226 ( 27 equ; 97 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 10 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 257 ( 41 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_44,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-xb5erfak/lgb.p',i_0_44) ).
cnf(i_0_38,plain,
modus_ponens,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xb5erfak/lgb.p',i_0_38) ).
cnf(i_0_8,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))
| ~ cn1 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xb5erfak/lgb.p',i_0_8) ).
cnf(i_0_35,plain,
cn1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xb5erfak/lgb.p',i_0_35) ).
cnf(i_0_49,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xb5erfak/lgb.p',i_0_49) ).
cnf(i_0_21,plain,
op_implies_and,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xb5erfak/lgb.p',i_0_21) ).
cnf(i_0_51,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xb5erfak/lgb.p',i_0_51) ).
cnf(i_0_40,plain,
op_or,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xb5erfak/lgb.p',i_0_40) ).
cnf(i_0_12,plain,
( is_a_theorem(implies(implies(not(X1),X1),X1))
| ~ cn3 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xb5erfak/lgb.p',i_0_12) ).
cnf(i_0_37,plain,
cn3,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xb5erfak/lgb.p',i_0_37) ).
cnf(i_0_10,plain,
( is_a_theorem(implies(X1,implies(not(X1),X2)))
| ~ cn2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xb5erfak/lgb.p',i_0_10) ).
cnf(i_0_36,plain,
cn2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xb5erfak/lgb.p',i_0_36) ).
cnf(i_0_48,plain,
( and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2)
| ~ op_equiv ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xb5erfak/lgb.p',i_0_48) ).
cnf(i_0_39,plain,
op_equiv,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xb5erfak/lgb.p',i_0_39) ).
cnf(i_0_70,plain,
( X1 = X2
| ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xb5erfak/lgb.p',i_0_70) ).
cnf(i_0_71,plain,
substitution_of_equivalents,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xb5erfak/lgb.p',i_0_71) ).
cnf(i_0_25,plain,
( implies_2
| ~ is_a_theorem(implies(implies(esk21_0,implies(esk21_0,esk22_0)),implies(esk21_0,esk22_0))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xb5erfak/lgb.p',i_0_25) ).
cnf(i_0_19,negated_conjecture,
~ implies_2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xb5erfak/lgb.p',i_0_19) ).
cnf(c_0_90,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
i_0_44 ).
cnf(c_0_91,plain,
modus_ponens,
i_0_38 ).
cnf(c_0_92,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))
| ~ cn1 ),
i_0_8 ).
cnf(c_0_93,plain,
cn1,
i_0_35 ).
cnf(c_0_94,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_90,c_0_91])]) ).
cnf(c_0_95,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_92,c_0_93])]) ).
cnf(c_0_96,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
i_0_49 ).
cnf(c_0_97,plain,
op_implies_and,
i_0_21 ).
cnf(c_0_98,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_99,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
i_0_51 ).
cnf(c_0_100,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_97])]) ).
cnf(c_0_101,plain,
op_or,
i_0_40 ).
cnf(c_0_102,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_94,c_0_98]) ).
cnf(c_0_103,plain,
implies(not(X1),X2) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_100]),c_0_101])]) ).
cnf(c_0_104,plain,
( is_a_theorem(implies(implies(not(X1),X1),X1))
| ~ cn3 ),
i_0_12 ).
cnf(c_0_105,plain,
cn3,
i_0_37 ).
cnf(c_0_106,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,not(X3)))
| ~ is_a_theorem(or(X3,X2)) ),
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_107,plain,
is_a_theorem(implies(or(X1,X1),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_104,c_0_103]),c_0_105])]) ).
cnf(c_0_108,plain,
( is_a_theorem(implies(X1,implies(not(X1),X2)))
| ~ cn2 ),
i_0_10 ).
cnf(c_0_109,plain,
cn2,
i_0_36 ).
cnf(c_0_110,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X1,not(X3)))
| ~ is_a_theorem(or(X3,X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_103]),c_0_103]) ).
cnf(c_0_111,plain,
or(and(X1,not(X2)),X3) = implies(implies(X1,X2),X3),
inference(spm,[status(thm)],[c_0_103,c_0_100]) ).
cnf(c_0_112,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,or(X2,X2))) ),
inference(spm,[status(thm)],[c_0_102,c_0_107]) ).
cnf(c_0_113,plain,
( is_a_theorem(implies(implies(X1,X2),or(X3,X2)))
| ~ is_a_theorem(or(X3,X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_103]),c_0_103]) ).
cnf(c_0_114,plain,
is_a_theorem(implies(X1,or(X1,X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_108,c_0_103]),c_0_109])]) ).
cnf(c_0_115,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X1,implies(X3,X4)))
| ~ is_a_theorem(implies(implies(X3,X4),X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_100]),c_0_111]) ).
cnf(c_0_116,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_112,c_0_113]) ).
cnf(c_0_117,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_94,c_0_114]) ).
cnf(c_0_118,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X1,or(X3,X4)))
| ~ is_a_theorem(implies(or(X3,X4),X2)) ),
inference(spm,[status(thm)],[c_0_115,c_0_103]) ).
cnf(c_0_119,plain,
is_a_theorem(or(X1,or(not(X1),X2))),
inference(spm,[status(thm)],[c_0_114,c_0_103]) ).
cnf(c_0_120,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_116,c_0_117]) ).
cnf(c_0_121,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(implies(or(not(X1),X3),X2)) ),
inference(spm,[status(thm)],[c_0_118,c_0_119]) ).
cnf(c_0_122,plain,
( is_a_theorem(implies(or(X1,X2),X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_120,c_0_103]) ).
cnf(c_0_123,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_121,c_0_122]) ).
cnf(c_0_124,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_116,c_0_123]) ).
cnf(c_0_125,plain,
( is_a_theorem(implies(X1,or(X2,X3)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_102,c_0_114]) ).
cnf(c_0_126,plain,
( is_a_theorem(implies(implies(X1,or(X2,X2)),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_112,c_0_124]) ).
cnf(c_0_127,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(implies(X3,X1))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_94,c_0_125]) ).
cnf(c_0_128,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,or(X1,X1)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_94,c_0_126]) ).
cnf(c_0_129,plain,
( and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2)
| ~ op_equiv ),
i_0_48 ).
cnf(c_0_130,plain,
op_equiv,
i_0_39 ).
cnf(c_0_131,plain,
( is_a_theorem(or(implies(X1,X2),X3))
| ~ is_a_theorem(implies(X4,X2))
| ~ is_a_theorem(implies(X1,X4)) ),
inference(spm,[status(thm)],[c_0_127,c_0_98]) ).
cnf(c_0_132,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_128,c_0_113]) ).
cnf(c_0_133,plain,
( is_a_theorem(or(X1,or(X2,X3)))
| ~ is_a_theorem(or(X1,X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_103]),c_0_103]) ).
cnf(c_0_134,plain,
not(and(X1,implies(X2,X3))) = implies(X1,and(X2,not(X3))),
inference(spm,[status(thm)],[c_0_100,c_0_100]) ).
cnf(c_0_135,plain,
and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_129,c_0_130])]) ).
cnf(c_0_136,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X1,or(X2,X2))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_103]),c_0_103]) ).
cnf(c_0_137,plain,
( is_a_theorem(or(implies(X1,X2),X3))
| ~ is_a_theorem(implies(X1,or(X2,X2))) ),
inference(spm,[status(thm)],[c_0_131,c_0_107]) ).
cnf(c_0_138,plain,
( is_a_theorem(implies(X1,or(X2,X3)))
| ~ is_a_theorem(implies(X1,X4))
| ~ is_a_theorem(implies(X4,X2)) ),
inference(spm,[status(thm)],[c_0_102,c_0_125]) ).
cnf(c_0_139,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(or(X2,X3),X1))
| ~ is_a_theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_132,c_0_133]) ).
cnf(c_0_140,plain,
( is_a_theorem(implies(or(X1,X2),X2))
| ~ is_a_theorem(not(X1)) ),
inference(spm,[status(thm)],[c_0_124,c_0_103]) ).
cnf(c_0_141,plain,
implies(implies(X1,X2),and(X2,not(X1))) = not(equiv(X1,X2)),
inference(spm,[status(thm)],[c_0_134,c_0_135]) ).
cnf(c_0_142,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X2,X2)) ),
inference(spm,[status(thm)],[c_0_136,c_0_123]) ).
cnf(c_0_143,plain,
is_a_theorem(or(implies(X1,X1),X2)),
inference(spm,[status(thm)],[c_0_137,c_0_114]) ).
cnf(c_0_144,plain,
is_a_theorem(implies(or(or(X1,X1),or(X1,X1)),X1)),
inference(spm,[status(thm)],[c_0_112,c_0_107]) ).
cnf(c_0_145,plain,
( is_a_theorem(implies(X1,or(X2,X3)))
| ~ is_a_theorem(implies(or(X1,X4),X2)) ),
inference(spm,[status(thm)],[c_0_138,c_0_114]) ).
cnf(c_0_146,plain,
is_a_theorem(implies(implies(implies(X1,X2),and(X1,not(X2))),and(X1,not(X2)))),
inference(spm,[status(thm)],[c_0_107,c_0_111]) ).
cnf(c_0_147,plain,
implies(implies(X1,and(X2,not(X3))),X4) = or(and(X1,implies(X2,X3)),X4),
inference(spm,[status(thm)],[c_0_111,c_0_100]) ).
cnf(c_0_148,plain,
( X1 = X2
| ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X1,X2)) ),
i_0_70 ).
cnf(c_0_149,plain,
substitution_of_equivalents,
i_0_71 ).
cnf(c_0_150,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(X1,X2))
| ~ is_a_theorem(not(X2)) ),
inference(spm,[status(thm)],[c_0_139,c_0_140]) ).
cnf(c_0_151,plain,
( is_a_theorem(or(equiv(X1,X2),and(X2,not(X1))))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_141]),c_0_103]) ).
cnf(c_0_152,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X3,X2)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_102,c_0_124]) ).
cnf(c_0_153,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_95,c_0_103]),c_0_103]) ).
cnf(c_0_154,plain,
is_a_theorem(or(X1,implies(X2,X2))),
inference(spm,[status(thm)],[c_0_142,c_0_143]) ).
cnf(c_0_155,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,or(or(X2,X2),or(X2,X2)))) ),
inference(spm,[status(thm)],[c_0_102,c_0_144]) ).
cnf(c_0_156,plain,
( is_a_theorem(implies(X1,or(X2,X3)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_145,c_0_122]) ).
cnf(c_0_157,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_112,c_0_114]) ).
cnf(c_0_158,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(implies(or(X3,X4),X2))
| ~ is_a_theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_118,c_0_133]) ).
cnf(c_0_159,plain,
is_a_theorem(or(and(implies(X1,X2),implies(X1,X2)),and(X1,not(X2)))),
inference(rw,[status(thm)],[c_0_146,c_0_147]) ).
cnf(c_0_160,plain,
( X1 = X2
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_148,c_0_149])]) ).
cnf(c_0_161,plain,
( is_a_theorem(equiv(X1,X2))
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_150,c_0_151]),c_0_100]) ).
cnf(c_0_162,plain,
( is_a_theorem(implies(or(X1,X2),or(X1,X3)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_152,c_0_153]) ).
cnf(c_0_163,plain,
is_a_theorem(implies(implies(implies(X1,X1),X2),X2)),
inference(spm,[status(thm)],[c_0_116,c_0_154]) ).
cnf(c_0_164,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(or(X2,X2)) ),
inference(spm,[status(thm)],[c_0_155,c_0_156]) ).
cnf(c_0_165,plain,
is_a_theorem(or(implies(or(X1,X1),X1),X2)),
inference(spm,[status(thm)],[c_0_137,c_0_157]) ).
cnf(c_0_166,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X1,X3))
| ~ is_a_theorem(not(X3)) ),
inference(spm,[status(thm)],[c_0_158,c_0_140]) ).
cnf(c_0_167,plain,
is_a_theorem(or(equiv(X1,X1),and(X1,not(X1)))),
inference(spm,[status(thm)],[c_0_159,c_0_135]) ).
cnf(c_0_168,plain,
( X1 = X2
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_160,c_0_161]) ).
cnf(c_0_169,plain,
( is_a_theorem(implies(or(X1,X2),X1))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_112,c_0_162]) ).
cnf(c_0_170,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(implies(X3,X3),X2))) ),
inference(spm,[status(thm)],[c_0_102,c_0_163]) ).
cnf(c_0_171,plain,
is_a_theorem(implies(and(X1,not(X2)),implies(implies(X1,X2),X3))),
inference(spm,[status(thm)],[c_0_114,c_0_111]) ).
cnf(c_0_172,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X1,implies(X4,X3)))
| ~ is_a_theorem(implies(X2,X4)) ),
inference(spm,[status(thm)],[c_0_102,c_0_98]) ).
cnf(c_0_173,plain,
is_a_theorem(implies(X1,implies(or(X2,X2),X2))),
inference(spm,[status(thm)],[c_0_164,c_0_165]) ).
cnf(c_0_174,plain,
is_a_theorem(or(equiv(X1,X1),X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_166,c_0_167]),c_0_100]),c_0_157])]) ).
cnf(c_0_175,plain,
( or(X1,X2) = X1
| ~ is_a_theorem(implies(X2,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_168,c_0_169]),c_0_114])]) ).
cnf(c_0_176,plain,
is_a_theorem(implies(and(X1,not(X1)),X2)),
inference(spm,[status(thm)],[c_0_170,c_0_171]) ).
cnf(c_0_177,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,or(X3,X3))) ),
inference(spm,[status(thm)],[c_0_172,c_0_173]) ).
cnf(c_0_178,plain,
is_a_theorem(or(X1,equiv(X2,X2))),
inference(spm,[status(thm)],[c_0_142,c_0_174]) ).
cnf(c_0_179,plain,
( is_a_theorem(implies(or(X1,X2),implies(X3,or(X1,X4))))
| ~ is_a_theorem(implies(X3,implies(X2,X4))) ),
inference(spm,[status(thm)],[c_0_172,c_0_153]) ).
cnf(c_0_180,plain,
or(X1,and(X2,not(X2))) = X1,
inference(spm,[status(thm)],[c_0_175,c_0_176]) ).
cnf(c_0_181,plain,
is_a_theorem(implies(X1,implies(and(X2,not(X2)),X3))),
inference(spm,[status(thm)],[c_0_177,c_0_176]) ).
cnf(c_0_182,plain,
is_a_theorem(implies(implies(equiv(X1,X1),X2),X2)),
inference(spm,[status(thm)],[c_0_116,c_0_178]) ).
cnf(c_0_183,plain,
is_a_theorem(implies(X1,implies(X2,or(X1,X3)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_179,c_0_180]),c_0_181])]) ).
cnf(c_0_184,plain,
or(X1,implies(equiv(X2,X2),X1)) = X1,
inference(spm,[status(thm)],[c_0_175,c_0_182]) ).
cnf(c_0_185,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_183,c_0_184]) ).
cnf(c_0_186,plain,
( implies(X1,X2) = X2
| ~ is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_168,c_0_185]) ).
cnf(c_0_187,plain,
is_a_theorem(implies(implies(X1,not(X2)),implies(or(X2,X3),implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_95,c_0_103]) ).
cnf(c_0_188,plain,
implies(implies(X1,X1),X2) = X2,
inference(spm,[status(thm)],[c_0_186,c_0_163]) ).
cnf(c_0_189,plain,
is_a_theorem(implies(implies(or(not(X1),X2),X1),X1)),
inference(spm,[status(thm)],[c_0_116,c_0_119]) ).
cnf(c_0_190,plain,
( is_a_theorem(implies(or(X1,X2),or(X3,X2)))
| ~ is_a_theorem(or(X3,not(X1))) ),
inference(spm,[status(thm)],[c_0_113,c_0_103]) ).
cnf(c_0_191,plain,
is_a_theorem(or(X1,implies(or(X1,X2),X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_187,c_0_188]),c_0_188]),c_0_103]) ).
cnf(c_0_192,plain,
implies(or(not(X1),X2),X1) = X1,
inference(spm,[status(thm)],[c_0_186,c_0_189]) ).
cnf(c_0_193,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(or(X2,not(X1))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_190,c_0_180]),c_0_180]) ).
cnf(c_0_194,plain,
is_a_theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_191,c_0_192]) ).
cnf(c_0_195,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_193,c_0_194]) ).
cnf(c_0_196,plain,
not(not(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_168,c_0_195]),c_0_103]),c_0_194])]) ).
cnf(c_0_197,plain,
or(not(X1),X2) = implies(X1,X2),
inference(spm,[status(thm)],[c_0_103,c_0_196]) ).
cnf(c_0_198,plain,
( implies_2
| ~ is_a_theorem(implies(implies(esk21_0,implies(esk21_0,esk22_0)),implies(esk21_0,esk22_0))) ),
i_0_25 ).
cnf(c_0_199,negated_conjecture,
~ implies_2,
i_0_19 ).
cnf(c_0_200,plain,
implies(implies(X1,X2),X1) = X1,
inference(rw,[status(thm)],[c_0_192,c_0_197]) ).
cnf(c_0_201,plain,
~ is_a_theorem(implies(implies(esk21_0,implies(esk21_0,esk22_0)),implies(esk21_0,esk22_0))),
inference(sr,[status(thm)],[c_0_198,c_0_199]) ).
cnf(c_0_202,plain,
implies(X1,implies(X1,X2)) = implies(X1,X2),
inference(spm,[status(thm)],[c_0_200,c_0_200]) ).
cnf(c_0_203,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_201,c_0_202]),c_0_157])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL464+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.34 % Computer : n003.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.34 % CPULimit : 300
% 0.09/0.34 % WCLimit : 300
% 0.09/0.34 % DateTime : Sat Sep 5 11:13:22 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.13/0.44 # ENIGMATIC: Selected SinE mode:
% 0.13/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.13/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.13/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 208.96/28.65 # ENIGMATIC: Solved by autoschedule-lgb:
% 208.96/28.65 # No SInE strategy applied
% 208.96/28.65 # Trying AutoSched0 for 150 seconds
% 208.96/28.65 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 208.96/28.65 # and selection function SelectComplexExceptUniqMaxHorn.
% 208.96/28.65 #
% 208.96/28.65 # Preprocessing time : 0.025 s
% 208.96/28.65 # Presaturation interreduction done
% 208.96/28.65
% 208.96/28.65 # Proof found!
% 208.96/28.65 # SZS status Theorem
% 208.96/28.65 # SZS output start CNFRefutation
% See solution above
% 208.96/28.65 # Training examples: 0 positive, 0 negative
% 208.96/28.65
% 208.96/28.65 # -------------------------------------------------
% 208.96/28.65 # User time : 23.685 s
% 208.96/28.65 # System time : 0.957 s
% 208.96/28.65 # Total time : 24.641 s
% 208.96/28.65 # Maximum resident set size: 3584 pages
% 208.96/28.65
%------------------------------------------------------------------------------