TSTP Solution File: LCL517+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL517+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:33 EDT 2022
% Result : Theorem 8.24s 2.33s
% Output : CNFRefutation 8.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 36
% Number of leaves : 18
% Syntax : Number of clauses : 112 ( 47 unt; 0 nHn; 51 RR)
% Number of literals : 198 ( 17 equ; 90 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 : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 188 ( 35 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_42,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kcbsu5zv/lgb.p',i_0_42) ).
cnf(i_0_66,plain,
op_implies_and,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kcbsu5zv/lgb.p',i_0_66) ).
cnf(i_0_44,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kcbsu5zv/lgb.p',i_0_44) ).
cnf(i_0_67,plain,
op_or,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kcbsu5zv/lgb.p',i_0_67) ).
cnf(i_0_37,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-kcbsu5zv/lgb.p',i_0_37) ).
cnf(i_0_64,plain,
modus_ponens,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kcbsu5zv/lgb.p',i_0_64) ).
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/sandbox/tmp/enigma-theBenchmark.p-kcbsu5zv/lgb.p',i_0_30) ).
cnf(i_0_63,plain,
kn3,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kcbsu5zv/lgb.p',i_0_63) ).
cnf(i_0_28,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ kn2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kcbsu5zv/lgb.p',i_0_28) ).
cnf(i_0_62,plain,
kn2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kcbsu5zv/lgb.p',i_0_62) ).
cnf(i_0_26,plain,
( is_a_theorem(implies(X1,and(X1,X1)))
| ~ kn1 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kcbsu5zv/lgb.p',i_0_26) ).
cnf(i_0_61,plain,
kn1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kcbsu5zv/lgb.p',i_0_61) ).
cnf(i_0_41,plain,
( and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2)
| ~ op_equiv ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kcbsu5zv/lgb.p',i_0_41) ).
cnf(i_0_65,plain,
op_equiv,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kcbsu5zv/lgb.p',i_0_65) ).
cnf(i_0_71,plain,
( X1 = X2
| ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kcbsu5zv/lgb.p',i_0_71) ).
cnf(i_0_68,plain,
substitution_of_equivalents,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kcbsu5zv/lgb.p',i_0_68) ).
cnf(i_0_11,plain,
( cn3
| ~ is_a_theorem(implies(implies(not(esk12_0),esk12_0),esk12_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kcbsu5zv/lgb.p',i_0_11) ).
cnf(i_0_31,negated_conjecture,
~ cn3,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kcbsu5zv/lgb.p',i_0_31) ).
cnf(c_0_90,plain,
( not(and(X1,not(X2))) = implies(X1,X2)
| ~ op_implies_and ),
i_0_42 ).
cnf(c_0_91,plain,
op_implies_and,
i_0_66 ).
cnf(c_0_92,plain,
( not(and(not(X1),not(X2))) = or(X1,X2)
| ~ op_or ),
i_0_44 ).
cnf(c_0_93,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_90,c_0_91])]) ).
cnf(c_0_94,plain,
op_or,
i_0_67 ).
cnf(c_0_95,plain,
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1)) ),
i_0_37 ).
cnf(c_0_96,plain,
modus_ponens,
i_0_64 ).
cnf(c_0_97,plain,
( is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X3)),not(and(X3,X1)))))
| ~ kn3 ),
i_0_30 ).
cnf(c_0_98,plain,
implies(not(X1),X2) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_93]),c_0_94])]) ).
cnf(c_0_99,plain,
kn3,
i_0_63 ).
cnf(c_0_100,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_95,c_0_96])]) ).
cnf(c_0_101,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_97,c_0_98]),c_0_99])]) ).
cnf(c_0_102,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(X2,X1))
| ~ is_a_theorem(not(X2)) ),
inference(spm,[status(thm)],[c_0_100,c_0_98]) ).
cnf(c_0_103,plain,
( is_a_theorem(or(and(X1,X2),not(and(X2,X3))))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_100,c_0_101]) ).
cnf(c_0_104,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_102,c_0_103]) ).
cnf(c_0_105,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ kn2 ),
i_0_28 ).
cnf(c_0_106,plain,
kn2,
i_0_62 ).
cnf(c_0_107,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_104,c_0_93]) ).
cnf(c_0_108,plain,
is_a_theorem(implies(and(X1,X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_105,c_0_106])]) ).
cnf(c_0_109,plain,
( is_a_theorem(implies(X1,and(X1,X1)))
| ~ kn1 ),
i_0_26 ).
cnf(c_0_110,plain,
kn1,
i_0_61 ).
cnf(c_0_111,plain,
( is_a_theorem(not(and(not(X1),X2)))
| ~ is_a_theorem(implies(X2,and(X1,X3))) ),
inference(spm,[status(thm)],[c_0_107,c_0_108]) ).
cnf(c_0_112,plain,
is_a_theorem(implies(X1,and(X1,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_109,c_0_110])]) ).
cnf(c_0_113,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_111,c_0_98]),c_0_93]),c_0_98]) ).
cnf(c_0_114,plain,
is_a_theorem(or(X1,and(not(X1),not(X1)))),
inference(spm,[status(thm)],[c_0_112,c_0_98]) ).
cnf(c_0_115,plain,
is_a_theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_113,c_0_114]) ).
cnf(c_0_116,plain,
is_a_theorem(or(X1,not(and(X1,X2)))),
inference(spm,[status(thm)],[c_0_113,c_0_115]) ).
cnf(c_0_117,plain,
( is_a_theorem(not(and(X1,X2)))
| ~ is_a_theorem(not(X1)) ),
inference(spm,[status(thm)],[c_0_102,c_0_116]) ).
cnf(c_0_118,plain,
is_a_theorem(not(and(not(X1),X1))),
inference(spm,[status(thm)],[c_0_111,c_0_112]) ).
cnf(c_0_119,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_104,c_0_117]) ).
cnf(c_0_120,plain,
( is_a_theorem(not(and(X1,X2)))
| ~ is_a_theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_104,c_0_118]) ).
cnf(c_0_121,plain,
( is_a_theorem(not(and(X1,X2)))
| ~ is_a_theorem(not(and(X2,X2))) ),
inference(spm,[status(thm)],[c_0_119,c_0_112]) ).
cnf(c_0_122,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(or(X2,not(X1))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_93]),c_0_98]) ).
cnf(c_0_123,plain,
( is_a_theorem(not(and(X1,X2)))
| ~ is_a_theorem(not(X2)) ),
inference(spm,[status(thm)],[c_0_121,c_0_117]) ).
cnf(c_0_124,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_122,c_0_115]) ).
cnf(c_0_125,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(not(not(X2))) ),
inference(spm,[status(thm)],[c_0_123,c_0_93]) ).
cnf(c_0_126,plain,
( is_a_theorem(not(not(X1)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_100,c_0_124]) ).
cnf(c_0_127,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_125,c_0_126]) ).
cnf(c_0_128,plain,
is_a_theorem(or(X1,implies(X1,X2))),
inference(spm,[status(thm)],[c_0_116,c_0_93]) ).
cnf(c_0_129,plain,
( is_a_theorem(not(and(not(X1),X2)))
| ~ is_a_theorem(and(X1,X3)) ),
inference(spm,[status(thm)],[c_0_111,c_0_127]) ).
cnf(c_0_130,plain,
( is_a_theorem(and(X1,X1))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_100,c_0_112]) ).
cnf(c_0_131,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(not(X1)) ),
inference(spm,[status(thm)],[c_0_102,c_0_128]) ).
cnf(c_0_132,plain,
( is_a_theorem(not(and(not(X1),X2)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_129,c_0_130]) ).
cnf(c_0_133,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_103,c_0_93]),c_0_98]) ).
cnf(c_0_134,plain,
( is_a_theorem(not(and(X1,X2)))
| ~ is_a_theorem(implies(X2,not(X2))) ),
inference(spm,[status(thm)],[c_0_121,c_0_120]) ).
cnf(c_0_135,plain,
is_a_theorem(implies(and(not(X1),X1),X2)),
inference(spm,[status(thm)],[c_0_131,c_0_118]) ).
cnf(c_0_136,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_104,c_0_132]) ).
cnf(c_0_137,plain,
( and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2)
| ~ op_equiv ),
i_0_41 ).
cnf(c_0_138,plain,
op_equiv,
i_0_65 ).
cnf(c_0_139,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_102,c_0_133]) ).
cnf(c_0_140,plain,
is_a_theorem(not(and(X1,and(not(X2),X2)))),
inference(spm,[status(thm)],[c_0_134,c_0_135]) ).
cnf(c_0_141,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_136,c_0_98]),c_0_93]) ).
cnf(c_0_142,plain,
not(and(X1,implies(X2,X3))) = implies(X1,and(X2,not(X3))),
inference(spm,[status(thm)],[c_0_93,c_0_93]) ).
cnf(c_0_143,plain,
and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_137,c_0_138])]) ).
cnf(c_0_144,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_139,c_0_93]),c_0_98]) ).
cnf(c_0_145,plain,
( is_a_theorem(not(and(and(not(X1),X1),X2)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_104,c_0_140]) ).
cnf(c_0_146,plain,
( is_a_theorem(implies(X1,not(not(X2))))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_141,c_0_115]) ).
cnf(c_0_147,plain,
implies(implies(X1,X2),and(X2,not(X1))) = not(equiv(X1,X2)),
inference(spm,[status(thm)],[c_0_142,c_0_143]) ).
cnf(c_0_148,plain,
( is_a_theorem(or(and(X1,X1),X2))
| ~ is_a_theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_144,c_0_112]) ).
cnf(c_0_149,plain,
( is_a_theorem(not(and(and(not(X1),X1),X2)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_145,c_0_146]) ).
cnf(c_0_150,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_101,c_0_147]),c_0_142]),c_0_98]) ).
cnf(c_0_151,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(not(and(X2,X2)))
| ~ is_a_theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_102,c_0_148]) ).
cnf(c_0_152,plain,
is_a_theorem(not(and(and(not(X1),X1),X2))),
inference(spm,[status(thm)],[c_0_149,c_0_150]) ).
cnf(c_0_153,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(X1,X2))
| ~ is_a_theorem(not(X2)) ),
inference(spm,[status(thm)],[c_0_151,c_0_117]) ).
cnf(c_0_154,plain,
( is_a_theorem(not(and(X1,X2)))
| ~ is_a_theorem(implies(X2,and(not(X3),X3))) ),
inference(spm,[status(thm)],[c_0_104,c_0_152]) ).
cnf(c_0_155,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_153,c_0_114]),c_0_93]),c_0_98]) ).
cnf(c_0_156,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_154,c_0_98]),c_0_93]) ).
cnf(c_0_157,plain,
is_a_theorem(or(implies(X1,X2),and(X1,not(X2)))),
inference(spm,[status(thm)],[c_0_115,c_0_93]) ).
cnf(c_0_158,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(X1,not(X2)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_151,c_0_132]) ).
cnf(c_0_159,plain,
( is_a_theorem(and(X1,X1))
| ~ is_a_theorem(or(and(X1,X1),X1)) ),
inference(spm,[status(thm)],[c_0_155,c_0_148]) ).
cnf(c_0_160,plain,
is_a_theorem(implies(X1,or(not(X2),X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_156,c_0_157]),c_0_98]) ).
cnf(c_0_161,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_158,c_0_103]) ).
cnf(c_0_162,plain,
( is_a_theorem(and(X1,X1))
| ~ is_a_theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_159,c_0_148]) ).
cnf(c_0_163,plain,
( is_a_theorem(or(or(not(X1),X1),X2))
| ~ is_a_theorem(or(X2,X3)) ),
inference(spm,[status(thm)],[c_0_144,c_0_160]) ).
cnf(c_0_164,plain,
( is_a_theorem(or(X1,not(not(X2))))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_146,c_0_98]) ).
cnf(c_0_165,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_161,c_0_162]) ).
cnf(c_0_166,plain,
( is_a_theorem(or(or(not(X1),X1),X2))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_163,c_0_164]) ).
cnf(c_0_167,plain,
( is_a_theorem(and(X1,X2))
| ~ is_a_theorem(or(X2,X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_165,c_0_127]) ).
cnf(c_0_168,plain,
is_a_theorem(or(or(not(X1),X1),X2)),
inference(spm,[status(thm)],[c_0_166,c_0_150]) ).
cnf(c_0_169,plain,
( X1 = X2
| ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X1,X2)) ),
i_0_71 ).
cnf(c_0_170,plain,
substitution_of_equivalents,
i_0_68 ).
cnf(c_0_171,plain,
( is_a_theorem(and(X1,or(not(X2),X2)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_167,c_0_168]) ).
cnf(c_0_172,plain,
and(implies(X1,not(X2)),or(X2,X1)) = equiv(X1,not(X2)),
inference(spm,[status(thm)],[c_0_143,c_0_98]) ).
cnf(c_0_173,plain,
( X1 = X2
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_169,c_0_170])]) ).
cnf(c_0_174,plain,
is_a_theorem(equiv(X1,not(not(X1)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_171,c_0_172]),c_0_124])]) ).
cnf(c_0_175,plain,
( cn3
| ~ is_a_theorem(implies(implies(not(esk12_0),esk12_0),esk12_0)) ),
i_0_11 ).
cnf(c_0_176,negated_conjecture,
~ cn3,
i_0_31 ).
cnf(c_0_177,plain,
not(not(X1)) = X1,
inference(spm,[status(thm)],[c_0_173,c_0_174]) ).
cnf(c_0_178,plain,
~ is_a_theorem(implies(implies(not(esk12_0),esk12_0),esk12_0)),
inference(sr,[status(thm)],[c_0_175,c_0_176]) ).
cnf(c_0_179,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X2,X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_177]),c_0_98]) ).
cnf(c_0_180,plain,
or(and(X1,not(X2)),X3) = implies(implies(X1,X2),X3),
inference(spm,[status(thm)],[c_0_98,c_0_93]) ).
cnf(c_0_181,plain,
~ is_a_theorem(implies(or(esk12_0,esk12_0),esk12_0)),
inference(rw,[status(thm)],[c_0_178,c_0_98]) ).
cnf(c_0_182,plain,
is_a_theorem(implies(or(X1,X1),X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_179,c_0_114]),c_0_180]),c_0_98]) ).
cnf(c_0_183,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_181,c_0_182])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL517+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n020.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 16:14:02 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.24/2.33 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.24/2.33 # No SInE strategy applied
% 8.24/2.33 # Trying AutoSched0 for 150 seconds
% 8.24/2.33 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 8.24/2.33 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.24/2.33 #
% 8.24/2.33 # Preprocessing time : 0.024 s
% 8.24/2.33 # Presaturation interreduction done
% 8.24/2.33
% 8.24/2.33 # Proof found!
% 8.24/2.33 # SZS status Theorem
% 8.24/2.33 # SZS output start CNFRefutation
% See solution above
% 8.24/2.33 # Training examples: 0 positive, 0 negative
% 8.24/2.33
% 8.24/2.33 # -------------------------------------------------
% 8.24/2.33 # User time : 0.143 s
% 8.24/2.33 # System time : 0.014 s
% 8.24/2.33 # Total time : 0.156 s
% 8.24/2.33 # Maximum resident set size: 7128 pages
% 8.24/2.33
%------------------------------------------------------------------------------