%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL514+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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:55 AM UTC 2026
% Result : Theorem 93.81s 14.29s
% Output : CNFRefutation 93.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 20
% Syntax : Number of clauses : 161 ( 93 unt; 0 nHn; 55 RR)
% Number of literals : 246 ( 30 equ; 90 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 13 ( 11 usr; 11 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 278 ( 28 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_43,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0prir9ag/input.p',i_0_43) ).
cnf(i_0_21,plain,
op_implies_and,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0prir9ag/input.p',i_0_21) ).
cnf(i_0_45,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0prir9ag/input.p',i_0_45) ).
cnf(i_0_22,plain,
op_or,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0prir9ag/input.p',i_0_22) ).
cnf(i_0_34,plain,
( is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X3)),not(and(X3,X1)))))
| ~ kn3 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0prir9ag/input.p',i_0_34) ).
cnf(i_0_64,plain,
kn3,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0prir9ag/input.p',i_0_64) ).
cnf(i_0_38,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-0prir9ag/input.p',i_0_38) ).
cnf(i_0_65,plain,
modus_ponens,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0prir9ag/input.p',i_0_65) ).
cnf(i_0_30,plain,
( is_a_theorem(implies(X1,and(X1,X1)))
| ~ kn1 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0prir9ag/input.p',i_0_30) ).
cnf(i_0_62,plain,
kn1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0prir9ag/input.p',i_0_62) ).
cnf(i_0_32,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ kn2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0prir9ag/input.p',i_0_32) ).
cnf(i_0_63,plain,
kn2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0prir9ag/input.p',i_0_63) ).
cnf(i_0_42,plain,
( and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2)
| ~ op_equiv ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0prir9ag/input.p',i_0_42) ).
cnf(i_0_20,plain,
op_equiv,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0prir9ag/input.p',i_0_20) ).
cnf(i_0_71,plain,
( X1 = X2
| ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0prir9ag/input.p',i_0_71) ).
cnf(i_0_72,plain,
substitution_of_equivalents,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0prir9ag/input.p',i_0_72) ).
cnf(i_0_17,plain,
( equivalence_3
| ~ is_a_theorem(implies(implies(esk17_0,esk18_0),implies(implies(esk18_0,esk17_0),equiv(esk17_0,esk18_0)))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0prir9ag/input.p',i_0_17) ).
cnf(i_0_19,negated_conjecture,
~ equivalence_3,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0prir9ag/input.p',i_0_19) ).
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-0prir9ag/input.p',i_0_6) ).
cnf(i_0_5,plain,
( and_3
| ~ is_a_theorem(implies(esk5_0,implies(esk6_0,and(esk5_0,esk6_0)))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0prir9ag/input.p',i_0_5) ).
cnf(c_0_93,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
i_0_43 ).
cnf(c_0_94,plain,
op_implies_and,
i_0_21 ).
cnf(c_0_95,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
i_0_45 ).
cnf(c_0_96,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_93,c_0_94])]) ).
cnf(c_0_97,plain,
op_or,
i_0_22 ).
cnf(c_0_98,plain,
( is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X3)),not(and(X3,X1)))))
| ~ kn3 ),
i_0_34 ).
cnf(c_0_99,plain,
implies(not(X1),X2) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_96]),c_0_97])]) ).
cnf(c_0_100,plain,
kn3,
i_0_64 ).
cnf(c_0_101,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
i_0_38 ).
cnf(c_0_102,plain,
modus_ponens,
i_0_65 ).
cnf(c_0_103,plain,
is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_99]),c_0_100])]) ).
cnf(c_0_104,plain,
( is_a_theorem(implies(X1,and(X1,X1)))
| ~ kn1 ),
i_0_30 ).
cnf(c_0_105,plain,
kn1,
i_0_62 ).
cnf(c_0_106,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_101,c_0_102])]) ).
cnf(c_0_107,plain,
is_a_theorem(implies(or(X1,X2),or(and(X2,X3),implies(X3,X1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_96]),c_0_99]) ).
cnf(c_0_108,plain,
is_a_theorem(implies(X1,and(X1,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_104,c_0_105])]) ).
cnf(c_0_109,plain,
( is_a_theorem(or(and(X1,X2),implies(X2,X3)))
| ~ is_a_theorem(or(X3,X1)) ),
inference(spm,[status(thm)],[c_0_106,c_0_107]) ).
cnf(c_0_110,plain,
is_a_theorem(or(X1,and(not(X1),not(X1)))),
inference(spm,[status(thm)],[c_0_108,c_0_99]) ).
cnf(c_0_111,plain,
( is_a_theorem(or(and(X1,X2),not(and(X2,X3))))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_106,c_0_103]) ).
cnf(c_0_112,plain,
is_a_theorem(or(and(and(not(X1),not(X1)),X2),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_109,c_0_110]) ).
cnf(c_0_113,plain,
or(and(X1,not(X2)),X3) = implies(implies(X1,X2),X3),
inference(spm,[status(thm)],[c_0_99,c_0_96]) ).
cnf(c_0_114,plain,
is_a_theorem(or(and(and(X1,X1),X2),not(and(X2,X1)))),
inference(spm,[status(thm)],[c_0_111,c_0_108]) ).
cnf(c_0_115,plain,
is_a_theorem(implies(implies(and(not(X1),not(X1)),X2),or(X2,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_99]),c_0_113]) ).
cnf(c_0_116,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ kn2 ),
i_0_32 ).
cnf(c_0_117,plain,
kn2,
i_0_63 ).
cnf(c_0_118,plain,
is_a_theorem(implies(implies(and(X1,X1),X2),not(and(not(X2),X1)))),
inference(spm,[status(thm)],[c_0_114,c_0_113]) ).
cnf(c_0_119,plain,
is_a_theorem(implies(or(X1,X2),implies(implies(X2,X3),or(X3,X1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_99]),c_0_113]) ).
cnf(c_0_120,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(implies(and(not(X2),not(X2)),X1)) ),
inference(spm,[status(thm)],[c_0_106,c_0_115]) ).
cnf(c_0_121,plain,
is_a_theorem(implies(and(X1,X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_116,c_0_117])]) ).
cnf(c_0_122,plain,
( is_a_theorem(not(and(not(X1),X2)))
| ~ is_a_theorem(implies(and(X2,X2),X1)) ),
inference(spm,[status(thm)],[c_0_106,c_0_118]) ).
cnf(c_0_123,plain,
( is_a_theorem(implies(implies(X1,X2),or(X2,X3)))
| ~ is_a_theorem(or(X3,X1)) ),
inference(spm,[status(thm)],[c_0_106,c_0_119]) ).
cnf(c_0_124,plain,
is_a_theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_120,c_0_121]) ).
cnf(c_0_125,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(X2,X1))
| ~ is_a_theorem(not(X2)) ),
inference(spm,[status(thm)],[c_0_106,c_0_99]) ).
cnf(c_0_126,plain,
is_a_theorem(not(and(not(X1),X1))),
inference(spm,[status(thm)],[c_0_122,c_0_121]) ).
cnf(c_0_127,plain,
is_a_theorem(implies(implies(X1,X2),or(X2,not(X1)))),
inference(spm,[status(thm)],[c_0_123,c_0_124]) ).
cnf(c_0_128,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(and(not(X2),X2),X1)) ),
inference(spm,[status(thm)],[c_0_125,c_0_126]) ).
cnf(c_0_129,plain,
is_a_theorem(or(and(X1,X2),implies(X2,not(X1)))),
inference(spm,[status(thm)],[c_0_109,c_0_124]) ).
cnf(c_0_130,plain,
( is_a_theorem(or(X1,not(X2)))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_106,c_0_127]) ).
cnf(c_0_131,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_128,c_0_129]) ).
cnf(c_0_132,plain,
is_a_theorem(or(X1,not(and(X1,X2)))),
inference(spm,[status(thm)],[c_0_130,c_0_121]) ).
cnf(c_0_133,plain,
( is_a_theorem(not(not(X1)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_106,c_0_131]) ).
cnf(c_0_134,plain,
is_a_theorem(implies(or(and(X1,X2),X3),or(X3,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_132]),c_0_99]) ).
cnf(c_0_135,plain,
is_a_theorem(or(X1,implies(X1,X2))),
inference(spm,[status(thm)],[c_0_132,c_0_96]) ).
cnf(c_0_136,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(not(X2),X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_125,c_0_133]) ).
cnf(c_0_137,plain,
is_a_theorem(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_131]),c_0_96]),c_0_99]) ).
cnf(c_0_138,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(and(X2,X3),X1)) ),
inference(spm,[status(thm)],[c_0_106,c_0_134]) ).
cnf(c_0_139,plain,
is_a_theorem(or(and(implies(X1,X2),X3),implies(X3,X1))),
inference(spm,[status(thm)],[c_0_109,c_0_135]) ).
cnf(c_0_140,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_136,c_0_137]) ).
cnf(c_0_141,plain,
is_a_theorem(or(implies(X1,X2),implies(X2,X3))),
inference(spm,[status(thm)],[c_0_138,c_0_139]) ).
cnf(c_0_142,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_135]),c_0_99]) ).
cnf(c_0_143,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_140,c_0_141]) ).
cnf(c_0_144,plain,
( is_a_theorem(or(and(X1,X2),implies(X2,X3)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_109,c_0_142]) ).
cnf(c_0_145,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(implies(X2,X3),X1))
| ~ is_a_theorem(and(X2,not(X3))) ),
inference(spm,[status(thm)],[c_0_136,c_0_96]) ).
cnf(c_0_146,plain,
( is_a_theorem(and(not(not(X1)),not(not(X1))))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_136,c_0_110]) ).
cnf(c_0_147,plain,
is_a_theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_130,c_0_143]) ).
cnf(c_0_148,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_128,c_0_144]) ).
cnf(c_0_149,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(or(not(X2),not(X2)),X1))
| ~ is_a_theorem(X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_146]),c_0_99]) ).
cnf(c_0_150,plain,
is_a_theorem(or(or(X1,not(X2)),not(implies(X2,X1)))),
inference(spm,[status(thm)],[c_0_130,c_0_127]) ).
cnf(c_0_151,plain,
is_a_theorem(implies(or(X1,X2),or(X2,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_147]),c_0_99]) ).
cnf(c_0_152,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_148,c_0_99]) ).
cnf(c_0_153,plain,
( is_a_theorem(not(implies(X1,not(X1))))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_149,c_0_150]) ).
cnf(c_0_154,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_106,c_0_151]) ).
cnf(c_0_155,plain,
( is_a_theorem(or(and(X1,X2),implies(X2,X3)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_109,c_0_152]) ).
cnf(c_0_156,plain,
( and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2)
| ~ op_equiv ),
i_0_42 ).
cnf(c_0_157,plain,
op_equiv,
i_0_20 ).
cnf(c_0_158,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(implies(X2,not(X2)),X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_125,c_0_153]) ).
cnf(c_0_159,plain,
( is_a_theorem(or(implies(X1,X2),and(X3,X1)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_154,c_0_155]) ).
cnf(c_0_160,plain,
and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_156,c_0_157])]) ).
cnf(c_0_161,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(and(implies(X2,X3),and(X2,not(X3))),X1)) ),
inference(spm,[status(thm)],[c_0_128,c_0_96]) ).
cnf(c_0_162,plain,
is_a_theorem(or(and(implies(X1,not(X2)),X3),implies(X3,and(X2,X1)))),
inference(spm,[status(thm)],[c_0_109,c_0_129]) ).
cnf(c_0_163,plain,
( is_a_theorem(and(X1,X2))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_158,c_0_159]) ).
cnf(c_0_164,plain,
and(or(X1,X2),implies(X2,not(X1))) = equiv(not(X1),X2),
inference(spm,[status(thm)],[c_0_160,c_0_99]) ).
cnf(c_0_165,plain,
is_a_theorem(implies(and(X1,not(not(X2))),and(X2,X1))),
inference(spm,[status(thm)],[c_0_161,c_0_162]) ).
cnf(c_0_166,plain,
( X1 = X2
| ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X1,X2)) ),
i_0_71 ).
cnf(c_0_167,plain,
substitution_of_equivalents,
i_0_72 ).
cnf(c_0_168,plain,
( is_a_theorem(equiv(not(X1),X2))
| ~ is_a_theorem(implies(X2,not(X1)))
| ~ is_a_theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_163,c_0_164]) ).
cnf(c_0_169,plain,
is_a_theorem(implies(or(X1,not(X2)),implies(or(X2,X3),or(X3,X1)))),
inference(spm,[status(thm)],[c_0_119,c_0_99]) ).
cnf(c_0_170,plain,
is_a_theorem(or(and(X1,X2),not(and(X2,X1)))),
inference(spm,[status(thm)],[c_0_111,c_0_143]) ).
cnf(c_0_171,plain,
is_a_theorem(or(and(X1,X1),not(X1))),
inference(spm,[status(thm)],[c_0_130,c_0_108]) ).
cnf(c_0_172,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_163,c_0_160]) ).
cnf(c_0_173,plain,
is_a_theorem(implies(implies(X1,not(X1)),not(X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_165]),c_0_96]),c_0_96]) ).
cnf(c_0_174,plain,
( X1 = X2
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_166,c_0_167])]) ).
cnf(c_0_175,plain,
is_a_theorem(equiv(not(not(X1)),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_168,c_0_124]),c_0_131])]) ).
cnf(c_0_176,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X3)))
| ~ is_a_theorem(or(X3,not(X1))) ),
inference(spm,[status(thm)],[c_0_106,c_0_169]) ).
cnf(c_0_177,plain,
is_a_theorem(or(not(and(X1,X2)),X2)),
inference(spm,[status(thm)],[c_0_138,c_0_170]) ).
cnf(c_0_178,plain,
is_a_theorem(equiv(not(and(X1,X1)),not(X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_168,c_0_171]),c_0_99]),c_0_132])]) ).
cnf(c_0_179,plain,
is_a_theorem(equiv(not(X1),implies(X1,not(X1)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_172,c_0_173]),c_0_99]),c_0_135])]) ).
cnf(c_0_180,plain,
not(not(X1)) = X1,
inference(spm,[status(thm)],[c_0_174,c_0_175]) ).
cnf(c_0_181,plain,
is_a_theorem(equiv(or(X1,X2),or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_172,c_0_151]),c_0_151])]) ).
cnf(c_0_182,plain,
is_a_theorem(implies(or(X1,X2),or(X2,implies(X3,X1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_176,c_0_177]),c_0_96]) ).
cnf(c_0_183,plain,
not(and(X1,X1)) = not(X1),
inference(spm,[status(thm)],[c_0_174,c_0_178]) ).
cnf(c_0_184,plain,
( is_a_theorem(not(and(not(X1),X2)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_136,c_0_132]) ).
cnf(c_0_185,plain,
implies(X1,not(X1)) = not(X1),
inference(spm,[status(thm)],[c_0_174,c_0_179]) ).
cnf(c_0_186,plain,
or(not(X1),X2) = implies(X1,X2),
inference(spm,[status(thm)],[c_0_99,c_0_180]) ).
cnf(c_0_187,plain,
or(and(X1,X2),X3) = implies(implies(X1,not(X2)),X3),
inference(spm,[status(thm)],[c_0_113,c_0_180]) ).
cnf(c_0_188,plain,
or(X1,X2) = or(X2,X1),
inference(spm,[status(thm)],[c_0_174,c_0_181]) ).
cnf(c_0_189,plain,
( is_a_theorem(or(X1,implies(X2,X3)))
| ~ is_a_theorem(or(X3,X1)) ),
inference(spm,[status(thm)],[c_0_106,c_0_182]) ).
cnf(c_0_190,plain,
and(X1,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_180,c_0_183]),c_0_180]) ).
cnf(c_0_191,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(and(not(X2),X3),X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_125,c_0_184]) ).
cnf(c_0_192,plain,
is_a_theorem(or(and(not(and(X1,X2)),X3),implies(X3,X1))),
inference(spm,[status(thm)],[c_0_109,c_0_132]) ).
cnf(c_0_193,plain,
is_a_theorem(implies(implies(X1,X1),equiv(X1,X1))),
inference(spm,[status(thm)],[c_0_108,c_0_160]) ).
cnf(c_0_194,plain,
is_a_theorem(or(or(X1,X2),not(or(X2,X1)))),
inference(spm,[status(thm)],[c_0_130,c_0_151]) ).
cnf(c_0_195,plain,
( is_a_theorem(implies(X1,and(X2,X1)))
| ~ is_a_theorem(X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_159,c_0_185]),c_0_186]) ).
cnf(c_0_196,plain,
or(X1,and(X2,X3)) = implies(implies(X2,not(X3)),X1),
inference(spm,[status(thm)],[c_0_187,c_0_188]) ).
cnf(c_0_197,plain,
is_a_theorem(implies(or(X1,X1),implies(X2,X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_189,c_0_110]),c_0_113]),c_0_99]) ).
cnf(c_0_198,plain,
or(X1,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_190]),c_0_180]),c_0_99]) ).
cnf(c_0_199,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(and(X2,X3)) ),
inference(spm,[status(thm)],[c_0_191,c_0_192]) ).
cnf(c_0_200,plain,
( is_a_theorem(equiv(X1,X1))
| ~ is_a_theorem(implies(X1,X1)) ),
inference(spm,[status(thm)],[c_0_106,c_0_193]) ).
cnf(c_0_201,plain,
is_a_theorem(implies(or(or(X1,X2),X3),or(X3,or(X2,X1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_194]),c_0_99]) ).
cnf(c_0_202,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_195,c_0_99]),c_0_196]),c_0_180]) ).
cnf(c_0_203,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(rw,[status(thm)],[c_0_197,c_0_198]) ).
cnf(c_0_204,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(equiv(X2,X3)) ),
inference(spm,[status(thm)],[c_0_199,c_0_160]) ).
cnf(c_0_205,plain,
is_a_theorem(equiv(X1,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_200,c_0_143])]) ).
cnf(c_0_206,plain,
( is_a_theorem(or(X1,or(X2,X3)))
| ~ is_a_theorem(or(or(X3,X2),X1)) ),
inference(spm,[status(thm)],[c_0_106,c_0_201]) ).
cnf(c_0_207,plain,
is_a_theorem(or(or(and(X1,X2),not(and(X2,X3))),not(implies(X3,X1)))),
inference(spm,[status(thm)],[c_0_130,c_0_103]) ).
cnf(c_0_208,plain,
is_a_theorem(implies(and(X1,X2),and(X2,X1))),
inference(rw,[status(thm)],[c_0_165,c_0_180]) ).
cnf(c_0_209,plain,
( is_a_theorem(equiv(X1,implies(X2,X1)))
| ~ is_a_theorem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_172,c_0_202]),c_0_203])]) ).
cnf(c_0_210,plain,
( is_a_theorem(equiv(X1,X2))
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_172,c_0_148]) ).
cnf(c_0_211,plain,
is_a_theorem(implies(X1,implies(X2,X2))),
inference(spm,[status(thm)],[c_0_204,c_0_205]) ).
cnf(c_0_212,plain,
( equivalence_3
| ~ is_a_theorem(implies(implies(esk17_0,esk18_0),implies(implies(esk18_0,esk17_0),equiv(esk17_0,esk18_0)))) ),
i_0_17 ).
cnf(c_0_213,negated_conjecture,
~ equivalence_3,
i_0_19 ).
cnf(c_0_214,plain,
( is_a_theorem(implies(X1,implies(X2,and(X1,X2))))
| ~ and_3 ),
i_0_6 ).
cnf(c_0_215,plain,
is_a_theorem(or(not(implies(X1,X2)),or(not(and(X3,X1)),and(X2,X3)))),
inference(spm,[status(thm)],[c_0_206,c_0_207]) ).
cnf(c_0_216,plain,
is_a_theorem(equiv(and(X1,X2),and(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_172,c_0_208]),c_0_208])]) ).
cnf(c_0_217,plain,
not(and(X1,X2)) = implies(X1,not(X2)),
inference(spm,[status(thm)],[c_0_96,c_0_180]) ).
cnf(c_0_218,plain,
( implies(X1,X2) = X2
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_174,c_0_209]) ).
cnf(c_0_219,plain,
( is_a_theorem(equiv(X1,implies(X2,X2)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_210,c_0_211]) ).
cnf(c_0_220,plain,
~ is_a_theorem(implies(implies(esk17_0,esk18_0),implies(implies(esk18_0,esk17_0),equiv(esk17_0,esk18_0)))),
inference(sr,[status(thm)],[c_0_212,c_0_213]) ).
cnf(c_0_221,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2))))
| ~ and_3 ),
inference(spm,[status(thm)],[c_0_214,c_0_160]) ).
cnf(c_0_222,plain,
is_a_theorem(implies(implies(X1,X2),implies(and(X3,X1),and(X2,X3)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_215,c_0_186]),c_0_186]) ).
cnf(c_0_223,plain,
and(X1,X2) = and(X2,X1),
inference(spm,[status(thm)],[c_0_174,c_0_216]) ).
cnf(c_0_224,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(spm,[status(thm)],[c_0_180,c_0_217]) ).
cnf(c_0_225,plain,
implies(implies(X1,X1),X2) = X2,
inference(spm,[status(thm)],[c_0_218,c_0_143]) ).
cnf(c_0_226,plain,
( and_3
| ~ is_a_theorem(implies(esk5_0,implies(esk6_0,and(esk5_0,esk6_0)))) ),
i_0_5 ).
cnf(c_0_227,plain,
( X1 = implies(X2,X2)
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_174,c_0_219]) ).
cnf(c_0_228,plain,
~ and_3,
inference(spm,[status(thm)],[c_0_220,c_0_221]) ).
cnf(c_0_229,plain,
is_a_theorem(implies(implies(X1,X2),implies(and(X1,X3),and(X2,X3)))),
inference(spm,[status(thm)],[c_0_222,c_0_223]) ).
cnf(c_0_230,plain,
and(implies(X1,X1),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_224,c_0_225]),c_0_180]) ).
cnf(c_0_231,plain,
~ is_a_theorem(implies(esk5_0,implies(esk6_0,and(esk5_0,esk6_0)))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_226,c_0_227]),c_0_143])]),c_0_228]) ).
cnf(c_0_232,plain,
is_a_theorem(implies(X1,implies(X2,and(X1,X2)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_229,c_0_230]),c_0_225]) ).
cnf(c_0_233,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_231,c_0_232])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL514+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.37 % Computer : n009.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Fri Sep 4 14:31:23 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.22/0.47 # ENIGMATIC: Selected SinE mode:
% 0.22/0.48 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.22/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.22/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 93.81/14.29 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d30-l6400-e0.15+coop-eprover66:
% 93.81/14.29 # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 9; version: 991; iters: 150)
% 93.81/14.29 # Preprocessing time : 0.917 s
% 93.81/14.29 # Presaturation interreduction done
% 93.81/14.29
% 93.81/14.29 # Proof found!
% 93.81/14.29 # SZS status Theorem
% 93.81/14.29 # SZS output start CNFRefutation
% See solution above
% 93.81/14.29 # Training examples: 0 positive, 0 negative
% 93.81/14.29
% 93.81/14.29 # -------------------------------------------------
% 93.81/14.29 # User time : 10.100 s
% 93.81/14.29 # System time : 0.270 s
% 93.81/14.29 # Total time : 10.370 s
% 93.81/14.29 # ...preprocessing : 0.917 s
% 93.81/14.29 # ...main loop : 9.453 s
% 93.81/14.29 # Maximum resident set size: 170092 pages
% 93.81/14.29
%------------------------------------------------------------------------------