TSTP Solution File: LCL505+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL505+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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 : Sun Jul 17 09:26:29 EDT 2022
% Result : Theorem 17.24s 3.57s
% Output : CNFRefutation 17.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 44
% Number of leaves : 18
% Syntax : Number of clauses : 132 ( 57 unt; 0 nHn; 59 RR)
% Number of literals : 231 ( 24 equ; 102 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 10 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 236 ( 36 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-7404g3s9/lgb.p',i_0_43) ).
cnf(i_0_67,plain,
op_implies_and,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7404g3s9/lgb.p',i_0_67) ).
cnf(i_0_45,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7404g3s9/lgb.p',i_0_45) ).
cnf(i_0_68,plain,
op_or,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7404g3s9/lgb.p',i_0_68) ).
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-7404g3s9/lgb.p',i_0_38) ).
cnf(i_0_65,plain,
modus_ponens,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7404g3s9/lgb.p',i_0_65) ).
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-7404g3s9/lgb.p',i_0_34) ).
cnf(i_0_64,plain,
kn3,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7404g3s9/lgb.p',i_0_64) ).
cnf(i_0_32,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ kn2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7404g3s9/lgb.p',i_0_32) ).
cnf(i_0_63,plain,
kn2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7404g3s9/lgb.p',i_0_63) ).
cnf(i_0_30,plain,
( is_a_theorem(implies(X1,and(X1,X1)))
| ~ kn1 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7404g3s9/lgb.p',i_0_30) ).
cnf(i_0_62,plain,
kn1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7404g3s9/lgb.p',i_0_62) ).
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-7404g3s9/lgb.p',i_0_42) ).
cnf(i_0_66,plain,
op_equiv,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7404g3s9/lgb.p',i_0_66) ).
cnf(i_0_72,plain,
( X1 = X2
| ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7404g3s9/lgb.p',i_0_72) ).
cnf(i_0_69,plain,
substitution_of_equivalents,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7404g3s9/lgb.p',i_0_69) ).
cnf(i_0_27,plain,
( implies_3
| ~ is_a_theorem(implies(implies(esk23_0,esk24_0),implies(implies(esk24_0,esk25_0),implies(esk23_0,esk25_0)))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7404g3s9/lgb.p',i_0_27) ).
cnf(i_0_19,negated_conjecture,
~ implies_3,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7404g3s9/lgb.p',i_0_19) ).
cnf(c_0_91,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
i_0_43 ).
cnf(c_0_92,plain,
op_implies_and,
i_0_67 ).
cnf(c_0_93,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
i_0_45 ).
cnf(c_0_94,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_92])]) ).
cnf(c_0_95,plain,
op_or,
i_0_68 ).
cnf(c_0_96,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
i_0_38 ).
cnf(c_0_97,plain,
modus_ponens,
i_0_65 ).
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_93,c_0_94]),c_0_95])]) ).
cnf(c_0_100,plain,
kn3,
i_0_64 ).
cnf(c_0_101,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_96,c_0_97])]) ).
cnf(c_0_102,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_103,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(X2,X1))
| ~ is_a_theorem(not(X2)) ),
inference(spm,[status(thm)],[c_0_101,c_0_99]) ).
cnf(c_0_104,plain,
( is_a_theorem(or(and(X1,X2),not(and(X2,X3))))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_105,plain,
( is_a_theorem(not(and(X1,X2)))
| ~ is_a_theorem(not(and(X3,X1)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_106,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ kn2 ),
i_0_32 ).
cnf(c_0_107,plain,
kn2,
i_0_63 ).
cnf(c_0_108,plain,
( is_a_theorem(not(and(not(X1),X2)))
| ~ is_a_theorem(implies(X3,X1))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_105,c_0_94]) ).
cnf(c_0_109,plain,
is_a_theorem(implies(and(X1,X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_106,c_0_107])]) ).
cnf(c_0_110,plain,
( is_a_theorem(implies(X1,and(X1,X1)))
| ~ kn1 ),
i_0_30 ).
cnf(c_0_111,plain,
kn1,
i_0_62 ).
cnf(c_0_112,plain,
( is_a_theorem(not(and(not(X1),X2)))
| ~ is_a_theorem(implies(X2,and(X1,X3))) ),
inference(spm,[status(thm)],[c_0_108,c_0_109]) ).
cnf(c_0_113,plain,
is_a_theorem(implies(X1,and(X1,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_110,c_0_111])]) ).
cnf(c_0_114,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X2,and(X1,X3))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_99]),c_0_94]),c_0_99]) ).
cnf(c_0_115,plain,
is_a_theorem(or(X1,and(not(X1),not(X1)))),
inference(spm,[status(thm)],[c_0_113,c_0_99]) ).
cnf(c_0_116,plain,
is_a_theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_114,c_0_115]) ).
cnf(c_0_117,plain,
is_a_theorem(or(X1,not(and(X1,X2)))),
inference(spm,[status(thm)],[c_0_114,c_0_116]) ).
cnf(c_0_118,plain,
( is_a_theorem(not(and(X1,X2)))
| ~ is_a_theorem(not(X1)) ),
inference(spm,[status(thm)],[c_0_103,c_0_117]) ).
cnf(c_0_119,plain,
is_a_theorem(not(and(not(X1),X1))),
inference(spm,[status(thm)],[c_0_112,c_0_113]) ).
cnf(c_0_120,plain,
( is_a_theorem(not(and(X1,X2)))
| ~ is_a_theorem(implies(X2,X3))
| ~ is_a_theorem(not(X3)) ),
inference(spm,[status(thm)],[c_0_105,c_0_118]) ).
cnf(c_0_121,plain,
( is_a_theorem(not(and(X1,X2)))
| ~ is_a_theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_105,c_0_119]) ).
cnf(c_0_122,plain,
( is_a_theorem(not(and(X1,X2)))
| ~ is_a_theorem(not(and(X2,X2))) ),
inference(spm,[status(thm)],[c_0_120,c_0_113]) ).
cnf(c_0_123,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(or(X2,not(X1))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_94]),c_0_99]) ).
cnf(c_0_124,plain,
( is_a_theorem(not(and(X1,X2)))
| ~ is_a_theorem(not(X2)) ),
inference(spm,[status(thm)],[c_0_122,c_0_118]) ).
cnf(c_0_125,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_123,c_0_116]) ).
cnf(c_0_126,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(not(not(X2))) ),
inference(spm,[status(thm)],[c_0_124,c_0_94]) ).
cnf(c_0_127,plain,
( is_a_theorem(not(not(X1)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_101,c_0_125]) ).
cnf(c_0_128,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_126,c_0_127]) ).
cnf(c_0_129,plain,
is_a_theorem(or(X1,implies(X1,X2))),
inference(spm,[status(thm)],[c_0_117,c_0_94]) ).
cnf(c_0_130,plain,
( is_a_theorem(not(and(not(X1),X2)))
| ~ is_a_theorem(and(X1,X3)) ),
inference(spm,[status(thm)],[c_0_112,c_0_128]) ).
cnf(c_0_131,plain,
( is_a_theorem(and(X1,X1))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_101,c_0_113]) ).
cnf(c_0_132,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(not(X1)) ),
inference(spm,[status(thm)],[c_0_103,c_0_129]) ).
cnf(c_0_133,plain,
( is_a_theorem(not(and(not(X1),X2)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_130,c_0_131]) ).
cnf(c_0_134,plain,
( is_a_theorem(or(and(X1,X2),implies(X2,X3)))
| ~ is_a_theorem(or(X3,X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_94]),c_0_99]) ).
cnf(c_0_135,plain,
( is_a_theorem(not(and(X1,X2)))
| ~ is_a_theorem(implies(X2,not(X2))) ),
inference(spm,[status(thm)],[c_0_122,c_0_121]) ).
cnf(c_0_136,plain,
is_a_theorem(implies(and(not(X1),X1),X2)),
inference(spm,[status(thm)],[c_0_132,c_0_119]) ).
cnf(c_0_137,plain,
( is_a_theorem(not(and(X1,X2)))
| ~ is_a_theorem(implies(X2,not(X3)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_105,c_0_133]) ).
cnf(c_0_138,plain,
( and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2)
| ~ op_equiv ),
i_0_42 ).
cnf(c_0_139,plain,
op_equiv,
i_0_66 ).
cnf(c_0_140,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(not(and(X3,X1)))
| ~ is_a_theorem(or(X2,X3)) ),
inference(spm,[status(thm)],[c_0_103,c_0_134]) ).
cnf(c_0_141,plain,
is_a_theorem(not(and(X1,and(not(X2),X2)))),
inference(spm,[status(thm)],[c_0_135,c_0_136]) ).
cnf(c_0_142,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(or(X2,not(X3)))
| ~ is_a_theorem(X3) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_99]),c_0_94]) ).
cnf(c_0_143,plain,
not(and(X1,implies(X2,X3))) = implies(X1,and(X2,not(X3))),
inference(spm,[status(thm)],[c_0_94,c_0_94]) ).
cnf(c_0_144,plain,
and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_138,c_0_139])]) ).
cnf(c_0_145,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(implies(X3,X1))
| ~ is_a_theorem(or(X2,X3)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_140,c_0_94]),c_0_99]) ).
cnf(c_0_146,plain,
( is_a_theorem(not(and(and(not(X1),X1),X2)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_105,c_0_141]) ).
cnf(c_0_147,plain,
( is_a_theorem(implies(X1,not(not(X2))))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_142,c_0_116]) ).
cnf(c_0_148,plain,
implies(implies(X1,X2),and(X2,not(X1))) = not(equiv(X1,X2)),
inference(spm,[status(thm)],[c_0_143,c_0_144]) ).
cnf(c_0_149,plain,
( is_a_theorem(or(and(X1,X1),X2))
| ~ is_a_theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_145,c_0_113]) ).
cnf(c_0_150,plain,
( is_a_theorem(not(and(and(not(X1),X1),X2)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_146,c_0_147]) ).
cnf(c_0_151,plain,
is_a_theorem(or(equiv(X1,X2),or(and(and(X2,not(X1)),X3),implies(X3,and(X1,not(X2)))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_148]),c_0_143]),c_0_99]) ).
cnf(c_0_152,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(not(and(X2,X2)))
| ~ is_a_theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_103,c_0_149]) ).
cnf(c_0_153,plain,
is_a_theorem(not(and(and(not(X1),X1),X2))),
inference(spm,[status(thm)],[c_0_150,c_0_151]) ).
cnf(c_0_154,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(X1,X2))
| ~ is_a_theorem(not(X2)) ),
inference(spm,[status(thm)],[c_0_152,c_0_118]) ).
cnf(c_0_155,plain,
( is_a_theorem(not(and(X1,X2)))
| ~ is_a_theorem(implies(X2,and(not(X3),X3))) ),
inference(spm,[status(thm)],[c_0_105,c_0_153]) ).
cnf(c_0_156,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(X1,X1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_154,c_0_115]),c_0_94]),c_0_99]) ).
cnf(c_0_157,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(or(X2,and(not(X3),X3))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_155,c_0_99]),c_0_94]) ).
cnf(c_0_158,plain,
is_a_theorem(or(implies(X1,X2),and(X1,not(X2)))),
inference(spm,[status(thm)],[c_0_116,c_0_94]) ).
cnf(c_0_159,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(X1,not(X2)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_152,c_0_133]) ).
cnf(c_0_160,plain,
( is_a_theorem(and(X1,X1))
| ~ is_a_theorem(or(and(X1,X1),X1)) ),
inference(spm,[status(thm)],[c_0_156,c_0_149]) ).
cnf(c_0_161,plain,
is_a_theorem(implies(X1,or(not(X2),X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_157,c_0_158]),c_0_99]) ).
cnf(c_0_162,plain,
( is_a_theorem(and(X1,X2))
| ~ is_a_theorem(and(X2,X3))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_159,c_0_104]) ).
cnf(c_0_163,plain,
( is_a_theorem(and(X1,X1))
| ~ is_a_theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_160,c_0_149]) ).
cnf(c_0_164,plain,
( is_a_theorem(or(or(not(X1),X1),X2))
| ~ is_a_theorem(or(X2,X3)) ),
inference(spm,[status(thm)],[c_0_145,c_0_161]) ).
cnf(c_0_165,plain,
( is_a_theorem(or(X1,not(not(X2))))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_147,c_0_99]) ).
cnf(c_0_166,plain,
( is_a_theorem(and(X1,X2))
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(or(X2,X2)) ),
inference(spm,[status(thm)],[c_0_162,c_0_163]) ).
cnf(c_0_167,plain,
( is_a_theorem(or(or(not(X1),X1),X2))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_164,c_0_165]) ).
cnf(c_0_168,plain,
( is_a_theorem(and(X1,X2))
| ~ is_a_theorem(or(X2,X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_166,c_0_128]) ).
cnf(c_0_169,plain,
is_a_theorem(or(or(not(X1),X1),X2)),
inference(spm,[status(thm)],[c_0_167,c_0_151]) ).
cnf(c_0_170,plain,
( X1 = X2
| ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X1,X2)) ),
i_0_72 ).
cnf(c_0_171,plain,
substitution_of_equivalents,
i_0_69 ).
cnf(c_0_172,plain,
( is_a_theorem(and(X1,or(not(X2),X2)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_168,c_0_169]) ).
cnf(c_0_173,plain,
and(implies(X1,not(X2)),or(X2,X1)) = equiv(X1,not(X2)),
inference(spm,[status(thm)],[c_0_144,c_0_99]) ).
cnf(c_0_174,plain,
( X1 = X2
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_170,c_0_171])]) ).
cnf(c_0_175,plain,
is_a_theorem(equiv(X1,not(not(X1)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_172,c_0_173]),c_0_125])]) ).
cnf(c_0_176,plain,
not(not(X1)) = X1,
inference(spm,[status(thm)],[c_0_174,c_0_175]) ).
cnf(c_0_177,plain,
not(and(X1,X2)) = implies(X1,not(X2)),
inference(spm,[status(thm)],[c_0_94,c_0_176]) ).
cnf(c_0_178,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(spm,[status(thm)],[c_0_176,c_0_177]) ).
cnf(c_0_179,plain,
( is_a_theorem(or(not(not(X1)),X2))
| ~ is_a_theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_145,c_0_125]) ).
cnf(c_0_180,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(X1,and(not(X2),X2))) ),
inference(spm,[status(thm)],[c_0_152,c_0_141]) ).
cnf(c_0_181,plain,
and(X1,not(X2)) = not(implies(X1,X2)),
inference(spm,[status(thm)],[c_0_178,c_0_176]) ).
cnf(c_0_182,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X2,X1)) ),
inference(rw,[status(thm)],[c_0_179,c_0_176]) ).
cnf(c_0_183,plain,
or(not(X1),X2) = implies(X1,X2),
inference(spm,[status(thm)],[c_0_99,c_0_176]) ).
cnf(c_0_184,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_132,c_0_127]),c_0_99]) ).
cnf(c_0_185,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(X1,not(implies(X2,X2)))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_180,c_0_176]),c_0_181]) ).
cnf(c_0_186,plain,
( is_a_theorem(or(X1,not(X2)))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_182,c_0_183]) ).
cnf(c_0_187,plain,
( is_a_theorem(and(X1,X2))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_168,c_0_184]) ).
cnf(c_0_188,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X2,X2),X1)) ),
inference(spm,[status(thm)],[c_0_185,c_0_186]) ).
cnf(c_0_189,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_102,c_0_94]),c_0_99]) ).
cnf(c_0_190,plain,
or(and(X1,not(X2)),X3) = implies(implies(X1,X2),X3),
inference(spm,[status(thm)],[c_0_99,c_0_94]) ).
cnf(c_0_191,plain,
( is_a_theorem(equiv(X1,X2))
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_187,c_0_144]) ).
cnf(c_0_192,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(or(X2,not(X2)),X1)) ),
inference(spm,[status(thm)],[c_0_188,c_0_99]) ).
cnf(c_0_193,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_189,c_0_99]),c_0_190]) ).
cnf(c_0_194,plain,
( X1 = X2
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_174,c_0_191]) ).
cnf(c_0_195,plain,
is_a_theorem(implies(or(X1,X2),or(X2,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_192,c_0_193]),c_0_99]) ).
cnf(c_0_196,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),not(and(not(X3),X1))))),
inference(spm,[status(thm)],[c_0_102,c_0_190]) ).
cnf(c_0_197,plain,
or(X1,X2) = or(X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_194,c_0_195]),c_0_195])]) ).
cnf(c_0_198,plain,
( implies_3
| ~ is_a_theorem(implies(implies(esk23_0,esk24_0),implies(implies(esk24_0,esk25_0),implies(esk23_0,esk25_0)))) ),
i_0_27 ).
cnf(c_0_199,negated_conjecture,
~ implies_3,
i_0_19 ).
cnf(c_0_200,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),or(X3,not(X1))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_196,c_0_177]),c_0_99]) ).
cnf(c_0_201,plain,
or(X1,not(X2)) = implies(X2,X1),
inference(spm,[status(thm)],[c_0_183,c_0_197]) ).
cnf(c_0_202,plain,
~ is_a_theorem(implies(implies(esk23_0,esk24_0),implies(implies(esk24_0,esk25_0),implies(esk23_0,esk25_0)))),
inference(sr,[status(thm)],[c_0_198,c_0_199]) ).
cnf(c_0_203,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
inference(rw,[status(thm)],[c_0_200,c_0_201]) ).
cnf(c_0_204,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_202,c_0_203])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL505+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n015.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 : Sat Jul 2 21:01:31 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.44 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 17.24/3.57 # ENIGMATIC: Solved by autoschedule-lgb:
% 17.24/3.57 # No SInE strategy applied
% 17.24/3.57 # Trying AutoSched0 for 150 seconds
% 17.24/3.57 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 17.24/3.57 # and selection function SelectComplexExceptUniqMaxHorn.
% 17.24/3.57 #
% 17.24/3.57 # Preprocessing time : 0.025 s
% 17.24/3.57 # Presaturation interreduction done
% 17.24/3.57
% 17.24/3.57 # Proof found!
% 17.24/3.57 # SZS status Theorem
% 17.24/3.57 # SZS output start CNFRefutation
% See solution above
% 17.24/3.57 # Training examples: 0 positive, 0 negative
% 17.24/3.57
% 17.24/3.57 # -------------------------------------------------
% 17.24/3.57 # User time : 0.963 s
% 17.24/3.57 # System time : 0.046 s
% 17.24/3.57 # Total time : 1.009 s
% 17.24/3.57 # Maximum resident set size: 7128 pages
% 17.24/3.57
%------------------------------------------------------------------------------