TSTP Solution File: LCL522+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL522+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:34 EDT 2022
% Result : Theorem 180.53s 24.26s
% Output : CNFRefutation 180.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 22
% Syntax : Number of clauses : 125 ( 71 unt; 0 nHn; 50 RR)
% Number of literals : 188 ( 28 equ; 67 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 14 ( 12 usr; 12 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 221 ( 20 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_39,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-06xl3x94/input.p',i_0_39) ).
cnf(i_0_67,plain,
op_implies_and,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-06xl3x94/input.p',i_0_67) ).
cnf(i_0_40,plain,
( or(not(X1),X2) = implies(X1,X2)
| ~ op_implies_or ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-06xl3x94/input.p',i_0_40) ).
cnf(i_0_50,plain,
op_implies_or,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-06xl3x94/input.p',i_0_50) ).
cnf(i_0_41,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-06xl3x94/input.p',i_0_41) ).
cnf(i_0_68,plain,
op_or,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-06xl3x94/input.p',i_0_68) ).
cnf(i_0_37,plain,
( not(or(not(X1),not(X2))) = and(X1,X2)
| ~ op_and ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-06xl3x94/input.p',i_0_37) ).
cnf(i_0_48,plain,
op_and,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-06xl3x94/input.p',i_0_48) ).
cnf(i_0_30,plain,
( is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X3)),not(and(X3,X1)))))
| ~ kn3 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-06xl3x94/input.p',i_0_30) ).
cnf(i_0_64,plain,
kn3,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-06xl3x94/input.p',i_0_64) ).
cnf(i_0_34,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-06xl3x94/input.p',i_0_34) ).
cnf(i_0_65,plain,
modus_ponens,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-06xl3x94/input.p',i_0_65) ).
cnf(i_0_26,plain,
( is_a_theorem(implies(X1,and(X1,X1)))
| ~ kn1 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-06xl3x94/input.p',i_0_26) ).
cnf(i_0_62,plain,
kn1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-06xl3x94/input.p',i_0_62) ).
cnf(i_0_28,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ kn2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-06xl3x94/input.p',i_0_28) ).
cnf(i_0_63,plain,
kn2,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-06xl3x94/input.p',i_0_63) ).
cnf(i_0_38,plain,
( and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2)
| ~ op_equiv ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-06xl3x94/input.p',i_0_38) ).
cnf(i_0_49,plain,
op_equiv,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-06xl3x94/input.p',i_0_49) ).
cnf(i_0_72,plain,
( X1 = X2
| ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-06xl3x94/input.p',i_0_72) ).
cnf(i_0_69,plain,
substitution_of_equivalents,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-06xl3x94/input.p',i_0_69) ).
cnf(i_0_60,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/sandbox2/tmp/enigma-theBenchmark.p-06xl3x94/input.p',i_0_60) ).
cnf(i_0_51,negated_conjecture,
~ r5,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-06xl3x94/input.p',i_0_51) ).
cnf(c_0_95,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
i_0_39 ).
cnf(c_0_96,plain,
op_implies_and,
i_0_67 ).
cnf(c_0_97,plain,
( or(not(X1),X2) = implies(X1,X2)
| ~ op_implies_or ),
i_0_40 ).
cnf(c_0_98,plain,
op_implies_or,
i_0_50 ).
cnf(c_0_99,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
i_0_41 ).
cnf(c_0_100,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_96])]) ).
cnf(c_0_101,plain,
op_or,
i_0_68 ).
cnf(c_0_102,plain,
( not(or(not(X1),not(X2))) = and(X1,X2)
| ~ op_and ),
i_0_37 ).
cnf(c_0_103,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_97,c_0_98])]) ).
cnf(c_0_104,plain,
op_and,
i_0_48 ).
cnf(c_0_105,plain,
( is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X3)),not(and(X3,X1)))))
| ~ kn3 ),
i_0_30 ).
cnf(c_0_106,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_107,plain,
kn3,
i_0_64 ).
cnf(c_0_108,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_102,c_0_103]),c_0_104])]) ).
cnf(c_0_109,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_105,c_0_106]),c_0_107])]) ).
cnf(c_0_110,plain,
or(and(X1,X2),X3) = implies(implies(X1,not(X2)),X3),
inference(spm,[status(thm)],[c_0_103,c_0_108]) ).
cnf(c_0_111,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
i_0_34 ).
cnf(c_0_112,plain,
modus_ponens,
i_0_65 ).
cnf(c_0_113,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,not(X3)),not(and(X3,X1))))),
inference(rw,[status(thm)],[c_0_109,c_0_110]) ).
cnf(c_0_114,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_111,c_0_112])]) ).
cnf(c_0_115,plain,
( is_a_theorem(implies(X1,and(X1,X1)))
| ~ kn1 ),
i_0_26 ).
cnf(c_0_116,plain,
kn1,
i_0_62 ).
cnf(c_0_117,plain,
is_a_theorem(implies(or(X1,X2),implies(implies(X2,not(X3)),implies(X3,X1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_100]),c_0_106]) ).
cnf(c_0_118,plain,
implies(implies(X1,not(not(X2))),X3) = implies(implies(X1,X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_100]),c_0_110]) ).
cnf(c_0_119,plain,
( is_a_theorem(implies(implies(X1,not(X2)),not(and(X2,X3))))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_114,c_0_113]) ).
cnf(c_0_120,plain,
is_a_theorem(implies(X1,and(X1,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_115,c_0_116])]) ).
cnf(c_0_121,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_117,c_0_106]),c_0_118]) ).
cnf(c_0_122,plain,
is_a_theorem(implies(implies(and(X1,X1),not(X2)),not(and(X2,X1)))),
inference(spm,[status(thm)],[c_0_119,c_0_120]) ).
cnf(c_0_123,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ kn2 ),
i_0_28 ).
cnf(c_0_124,plain,
kn2,
i_0_63 ).
cnf(c_0_125,plain,
( is_a_theorem(implies(implies(X1,X2),or(X2,X3)))
| ~ is_a_theorem(or(X3,X1)) ),
inference(spm,[status(thm)],[c_0_114,c_0_121]) ).
cnf(c_0_126,plain,
( is_a_theorem(not(and(X1,X2)))
| ~ is_a_theorem(implies(and(X2,X2),not(X1))) ),
inference(spm,[status(thm)],[c_0_114,c_0_122]) ).
cnf(c_0_127,plain,
is_a_theorem(implies(and(X1,X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_123,c_0_124])]) ).
cnf(c_0_128,plain,
( is_a_theorem(implies(implies(X1,X2),or(X2,not(X3))))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_125,c_0_103]) ).
cnf(c_0_129,plain,
is_a_theorem(implies(X1,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_127]),c_0_100]) ).
cnf(c_0_130,plain,
is_a_theorem(implies(implies(X1,X2),or(X2,not(X1)))),
inference(spm,[status(thm)],[c_0_128,c_0_129]) ).
cnf(c_0_131,plain,
is_a_theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_129,c_0_106]) ).
cnf(c_0_132,plain,
( and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2)
| ~ op_equiv ),
i_0_38 ).
cnf(c_0_133,plain,
op_equiv,
i_0_49 ).
cnf(c_0_134,plain,
( is_a_theorem(or(X1,not(X2)))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_114,c_0_130]) ).
cnf(c_0_135,plain,
is_a_theorem(implies(or(X1,X2),or(X2,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_131]),c_0_106]) ).
cnf(c_0_136,plain,
( is_a_theorem(implies(implies(X1,not(X2)),implies(X2,X3)))
| ~ is_a_theorem(or(X3,X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_106]),c_0_100]) ).
cnf(c_0_137,plain,
and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_132,c_0_133])]) ).
cnf(c_0_138,plain,
is_a_theorem(or(or(X1,X2),not(or(X2,X1)))),
inference(spm,[status(thm)],[c_0_134,c_0_135]) ).
cnf(c_0_139,plain,
implies(and(X1,not(X2)),X3) = or(implies(X1,X2),X3),
inference(spm,[status(thm)],[c_0_103,c_0_100]) ).
cnf(c_0_140,plain,
( is_a_theorem(implies(implies(X1,not(X2)),implies(X2,not(X3))))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_136,c_0_103]) ).
cnf(c_0_141,plain,
( X1 = X2
| ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X1,X2)) ),
i_0_72 ).
cnf(c_0_142,plain,
substitution_of_equivalents,
i_0_69 ).
cnf(c_0_143,plain,
and(implies(X1,not(X2)),or(X2,X1)) = equiv(X1,not(X2)),
inference(spm,[status(thm)],[c_0_137,c_0_106]) ).
cnf(c_0_144,plain,
and(implies(X1,not(not(X2))),X3) = and(implies(X1,X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_118]),c_0_108]) ).
cnf(c_0_145,plain,
( is_a_theorem(and(X1,X1))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_114,c_0_120]) ).
cnf(c_0_146,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_125,c_0_138]),c_0_106]) ).
cnf(c_0_147,plain,
is_a_theorem(or(implies(X1,X2),X1)),
inference(spm,[status(thm)],[c_0_127,c_0_139]) ).
cnf(c_0_148,plain,
is_a_theorem(implies(implies(X1,not(X2)),implies(X2,not(X1)))),
inference(spm,[status(thm)],[c_0_140,c_0_129]) ).
cnf(c_0_149,plain,
( X1 = X2
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_141,c_0_142])]) ).
cnf(c_0_150,plain,
equiv(X1,not(not(X2))) = equiv(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_143,c_0_144]),c_0_103]),c_0_137]) ).
cnf(c_0_151,plain,
( is_a_theorem(equiv(X1,X1))
| ~ is_a_theorem(implies(X1,X1)) ),
inference(spm,[status(thm)],[c_0_145,c_0_137]) ).
cnf(c_0_152,plain,
( is_a_theorem(or(X1,or(X2,X3)))
| ~ is_a_theorem(or(or(X3,X2),X1)) ),
inference(spm,[status(thm)],[c_0_114,c_0_146]) ).
cnf(c_0_153,plain,
is_a_theorem(or(or(X1,X2),not(X1))),
inference(spm,[status(thm)],[c_0_147,c_0_106]) ).
cnf(c_0_154,plain,
is_a_theorem(implies(implies(implies(X1,not(X2)),not(X3)),implies(X3,and(X2,X1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_140,c_0_148]),c_0_108]) ).
cnf(c_0_155,plain,
( X1 = not(not(X2))
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(spm,[status(thm)],[c_0_149,c_0_150]) ).
cnf(c_0_156,plain,
is_a_theorem(equiv(X1,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_151,c_0_129])]) ).
cnf(c_0_157,plain,
is_a_theorem(implies(X1,or(X2,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_152,c_0_153]),c_0_103]) ).
cnf(c_0_158,plain,
is_a_theorem(implies(implies(X1,not(X2)),implies(X2,implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_136,c_0_147]) ).
cnf(c_0_159,plain,
( is_a_theorem(implies(X1,and(X2,X3)))
| ~ is_a_theorem(implies(implies(X3,not(X2)),not(X1))) ),
inference(spm,[status(thm)],[c_0_114,c_0_154]) ).
cnf(c_0_160,plain,
not(not(X1)) = X1,
inference(spm,[status(thm)],[c_0_155,c_0_156]) ).
cnf(c_0_161,plain,
is_a_theorem(or(or(X1,X2),not(X2))),
inference(spm,[status(thm)],[c_0_134,c_0_157]) ).
cnf(c_0_162,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_114,c_0_158]) ).
cnf(c_0_163,plain,
( is_a_theorem(or(X1,and(X2,X3)))
| ~ is_a_theorem(implies(implies(X3,not(X2)),X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_159,c_0_160]),c_0_106]) ).
cnf(c_0_164,plain,
is_a_theorem(implies(or(X1,X2),or(X2,or(X3,X1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_161]),c_0_106]) ).
cnf(c_0_165,plain,
is_a_theorem(implies(X1,or(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_162,c_0_129]),c_0_106]) ).
cnf(c_0_166,plain,
( is_a_theorem(or(X1,and(not(X2),X3)))
| ~ is_a_theorem(implies(implies(X3,X2),X1)) ),
inference(spm,[status(thm)],[c_0_163,c_0_160]) ).
cnf(c_0_167,plain,
and(X1,not(X2)) = not(implies(X1,X2)),
inference(spm,[status(thm)],[c_0_108,c_0_160]) ).
cnf(c_0_168,plain,
is_a_theorem(or(or(X1,or(X2,X3)),not(or(X3,X1)))),
inference(spm,[status(thm)],[c_0_134,c_0_164]) ).
cnf(c_0_169,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(or(or(X2,X2),not(X1))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_139]),c_0_100]),c_0_106]) ).
cnf(c_0_170,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_114,c_0_165]) ).
cnf(c_0_171,plain,
( is_a_theorem(or(X1,not(or(X2,X3))))
| ~ is_a_theorem(implies(or(X3,X2),X1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_166,c_0_106]),c_0_167]),c_0_106]) ).
cnf(c_0_172,plain,
is_a_theorem(implies(or(X1,X2),or(or(X3,X1),X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_152,c_0_168]),c_0_103]) ).
cnf(c_0_173,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(or(X2,X2)) ),
inference(spm,[status(thm)],[c_0_169,c_0_170]) ).
cnf(c_0_174,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(or(X2,X2),X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_169,c_0_160]),c_0_106]) ).
cnf(c_0_175,plain,
is_a_theorem(or(or(or(X1,X2),X3),not(or(X3,X2)))),
inference(spm,[status(thm)],[c_0_171,c_0_172]) ).
cnf(c_0_176,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_173,c_0_170]) ).
cnf(c_0_177,plain,
is_a_theorem(implies(or(or(X1,X2),X2),or(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_174,c_0_175]),c_0_103]) ).
cnf(c_0_178,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_176,c_0_106]) ).
cnf(c_0_179,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(or(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_114,c_0_177]) ).
cnf(c_0_180,plain,
( is_a_theorem(implies(implies(X1,not(X2)),implies(X2,X3)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_136,c_0_178]) ).
cnf(c_0_181,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(or(implies(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_179,c_0_103]) ).
cnf(c_0_182,plain,
( is_a_theorem(or(implies(X1,X2),and(X3,X1)))
| ~ is_a_theorem(X3) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_180]),c_0_108]) ).
cnf(c_0_183,plain,
( is_a_theorem(implies(X1,and(X2,X1)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_181,c_0_182]) ).
cnf(c_0_184,plain,
( is_a_theorem(and(X1,X2))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_114,c_0_183]) ).
cnf(c_0_185,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_184,c_0_137]) ).
cnf(c_0_186,plain,
is_a_theorem(implies(or(X1,not(X2)),implies(or(X2,X3),or(X3,X1)))),
inference(spm,[status(thm)],[c_0_121,c_0_106]) ).
cnf(c_0_187,plain,
( r5
| ~ is_a_theorem(implies(implies(esk52_0,esk53_0),implies(or(esk51_0,esk52_0),or(esk51_0,esk53_0)))) ),
i_0_60 ).
cnf(c_0_188,negated_conjecture,
~ r5,
i_0_51 ).
cnf(c_0_189,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_185,c_0_135]),c_0_135])]) ).
cnf(c_0_190,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_114,c_0_135]) ).
cnf(c_0_191,plain,
is_a_theorem(or(implies(or(X1,X2),or(X2,X3)),not(implies(X1,X3)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_171,c_0_186]),c_0_103]) ).
cnf(c_0_192,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_187,c_0_188]) ).
cnf(c_0_193,plain,
or(X1,X2) = or(X2,X1),
inference(spm,[status(thm)],[c_0_149,c_0_189]) ).
cnf(c_0_194,plain,
is_a_theorem(implies(implies(X1,X2),implies(or(X1,X3),or(X3,X2)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_190,c_0_191]),c_0_103]) ).
cnf(c_0_195,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_192,c_0_193]),c_0_193]) ).
cnf(c_0_196,plain,
is_a_theorem(implies(implies(X1,X2),implies(or(X1,X3),or(X2,X3)))),
inference(spm,[status(thm)],[c_0_194,c_0_193]) ).
cnf(c_0_197,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_195,c_0_196])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL522+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/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 : Sun Jul 3 09:25:16 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 180.53/24.26 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d30-l6400-e0.15+coop-eprover66:
% 180.53/24.26 # ENIGMA: LightGBM model '/export/starexec/sandbox2/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)
% 180.53/24.26 # Preprocessing time : 0.860 s
% 180.53/24.26 # Presaturation interreduction done
% 180.53/24.26
% 180.53/24.26 # Proof found!
% 180.53/24.26 # SZS status Theorem
% 180.53/24.26 # SZS output start CNFRefutation
% See solution above
% 180.53/24.26 # Training examples: 0 positive, 0 negative
% 180.53/24.26
% 180.53/24.26 # -------------------------------------------------
% 180.53/24.26 # User time : 21.186 s
% 180.53/24.26 # System time : 0.341 s
% 180.53/24.26 # Total time : 21.527 s
% 180.53/24.26 # ...preprocessing : 0.860 s
% 180.53/24.26 # ...main loop : 20.667 s
% 180.53/24.26 # Maximum resident set size: 177296 pages
% 180.53/24.26
%------------------------------------------------------------------------------