TSTP Solution File: SWC063+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC063+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n016.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 : Tue Jul 19 20:13:22 EDT 2022
% Result : Theorem 8.42s 2.45s
% Output : CNFRefutation 8.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 32
% Syntax : Number of clauses : 104 ( 24 unt; 6 nHn; 104 RR)
% Number of literals : 280 ( 80 equ; 184 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 96 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_191,negated_conjecture,
( nil != esk48_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_191) ).
cnf(i_0_201,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_201) ).
cnf(i_0_192,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_192) ).
cnf(i_0_204,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_204) ).
cnf(i_0_199,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_199) ).
cnf(i_0_200,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_200) ).
cnf(i_0_107,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_107) ).
cnf(i_0_194,negated_conjecture,
( nil = esk49_0
| neq(esk49_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_194) ).
cnf(i_0_110,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_110) ).
cnf(i_0_196,negated_conjecture,
( app(cons(esk52_0,nil),esk53_0) = esk50_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_196) ).
cnf(i_0_197,negated_conjecture,
( ssList(esk53_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_197) ).
cnf(i_0_198,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_198) ).
cnf(i_0_59,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_59) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_44) ).
cnf(i_0_193,negated_conjecture,
( nil = esk49_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_193) ).
cnf(i_0_154,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_154) ).
cnf(i_0_195,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = esk51_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_195) ).
cnf(i_0_156,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_156) ).
cnf(i_0_149,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_149) ).
cnf(i_0_159,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_159) ).
cnf(i_0_58,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_58) ).
cnf(i_0_130,plain,
( rearsegP(X1,X2)
| app(X3,X2) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_130) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_41) ).
cnf(i_0_203,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_203) ).
cnf(i_0_53,plain,
( cons(X1,X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_53) ).
cnf(i_0_131,plain,
( app(esk33_2(X1,X2),X2) = X1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_131) ).
cnf(i_0_132,plain,
( ssList(esk33_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_132) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_60) ).
cnf(i_0_113,plain,
( frontsegP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_113) ).
cnf(i_0_114,plain,
( app(X1,esk32_2(X2,X1)) = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_114) ).
cnf(i_0_115,plain,
( ssList(esk32_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_115) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qbdey35j/input.p',i_0_43) ).
cnf(c_0_237,negated_conjecture,
( nil != esk48_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
i_0_191 ).
cnf(c_0_238,negated_conjecture,
esk49_0 = esk51_0,
i_0_201 ).
cnf(c_0_239,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
i_0_192 ).
cnf(c_0_240,negated_conjecture,
ssList(esk49_0),
i_0_204 ).
cnf(c_0_241,negated_conjecture,
( esk48_0 != nil
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk51_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_237,c_0_238]) ).
cnf(c_0_242,negated_conjecture,
( neq(esk51_0,nil)
| esk48_0 != nil ),
inference(rw,[status(thm)],[c_0_239,c_0_238]) ).
cnf(c_0_243,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_240,c_0_238]) ).
cnf(c_0_244,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
i_0_199 ).
cnf(c_0_245,negated_conjecture,
esk50_0 = esk48_0,
i_0_200 ).
cnf(c_0_246,negated_conjecture,
( esk48_0 != nil
| ~ segmentP(esk48_0,esk51_0)
| ~ segmentP(esk51_0,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_241,c_0_242]),c_0_243])]) ).
cnf(c_0_247,negated_conjecture,
( esk48_0 = nil
| esk51_0 != nil ),
inference(rw,[status(thm)],[c_0_244,c_0_245]) ).
cnf(c_0_248,negated_conjecture,
( esk51_0 != nil
| ~ segmentP(nil,esk51_0)
| ~ segmentP(esk51_0,esk51_0) ),
inference(spm,[status(thm)],[c_0_246,c_0_247]) ).
cnf(c_0_249,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
i_0_107 ).
cnf(c_0_250,negated_conjecture,
( nil = esk49_0
| neq(esk49_0,nil) ),
i_0_194 ).
cnf(c_0_251,plain,
( esk51_0 != nil
| ~ segmentP(nil,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_248,c_0_249]),c_0_243])]) ).
cnf(c_0_252,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
i_0_110 ).
cnf(c_0_253,negated_conjecture,
( app(cons(esk52_0,nil),esk53_0) = esk50_0
| ~ neq(esk51_0,nil) ),
i_0_196 ).
cnf(c_0_254,negated_conjecture,
( esk51_0 = nil
| neq(esk51_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_250,c_0_238]),c_0_238]) ).
cnf(c_0_255,plain,
esk51_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_251,c_0_252]),c_0_243])]) ).
cnf(c_0_256,negated_conjecture,
( ssList(esk53_0)
| ~ neq(esk51_0,nil) ),
i_0_197 ).
cnf(c_0_257,negated_conjecture,
( app(cons(esk52_0,nil),esk53_0) = esk48_0
| ~ neq(esk51_0,nil) ),
inference(rw,[status(thm)],[c_0_253,c_0_245]) ).
cnf(c_0_258,negated_conjecture,
neq(esk51_0,nil),
inference(sr,[status(thm)],[c_0_254,c_0_255]) ).
cnf(c_0_259,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_198 ).
cnf(c_0_260,negated_conjecture,
( esk51_0 = nil
| ssList(esk53_0) ),
inference(spm,[status(thm)],[c_0_256,c_0_254]) ).
cnf(c_0_261,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1) ),
i_0_59 ).
cnf(c_0_262,negated_conjecture,
app(cons(esk52_0,nil),esk53_0) = esk48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_257,c_0_258])]) ).
cnf(c_0_263,negated_conjecture,
ssItem(esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_259,c_0_258])]) ).
cnf(c_0_264,negated_conjecture,
ssList(esk53_0),
inference(sr,[status(thm)],[c_0_260,c_0_255]) ).
cnf(c_0_265,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_266,negated_conjecture,
( nil = esk49_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
i_0_193 ).
cnf(c_0_267,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_154 ).
cnf(c_0_268,negated_conjecture,
( app(cons(esk52_0,nil),esk53_0) = esk48_0
| esk48_0 != nil ),
inference(spm,[status(thm)],[c_0_257,c_0_242]) ).
cnf(c_0_269,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = esk51_0
| ~ neq(esk51_0,nil) ),
i_0_195 ).
cnf(c_0_270,plain,
cons(esk52_0,app(nil,esk53_0)) = esk48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_261,c_0_262]),c_0_263]),c_0_264]),c_0_265])]) ).
cnf(c_0_271,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
i_0_156 ).
cnf(c_0_272,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
i_0_149 ).
cnf(c_0_273,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
i_0_159 ).
cnf(c_0_274,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_58 ).
cnf(c_0_275,plain,
( rearsegP(X1,X2)
| app(X3,X2) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
i_0_130 ).
cnf(c_0_276,negated_conjecture,
( esk51_0 = nil
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk51_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_266,c_0_238]),c_0_238]) ).
cnf(c_0_277,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_278,negated_conjecture,
ssList(esk50_0),
i_0_203 ).
cnf(c_0_279,plain,
( cons(X1,X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_53 ).
cnf(c_0_280,plain,
( cons(esk52_0,esk53_0) = esk48_0
| esk48_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_267,c_0_268]),c_0_264])]),c_0_263])]) ).
cnf(c_0_281,negated_conjecture,
app(esk53_0,cons(esk52_0,nil)) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_269,c_0_258])]) ).
cnf(c_0_282,plain,
( cons(esk52_0,nil) = esk48_0
| esk53_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_270,c_0_271]),c_0_264]),c_0_265])]) ).
cnf(c_0_283,plain,
( segmentP(X1,X2)
| app(X3,X2) != X1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_272,c_0_273]),c_0_265])]),c_0_274]) ).
cnf(c_0_284,plain,
( app(esk33_2(X1,X2),X2) = X1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(X1,X2) ),
i_0_131 ).
cnf(c_0_285,plain,
( ssList(esk33_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(X1,X2) ),
i_0_132 ).
cnf(c_0_286,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_275]),c_0_274]) ).
cnf(c_0_287,negated_conjecture,
( X1 = nil
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk51_0,X1)
| ~ ssList(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_276,c_0_277]),c_0_265])]),c_0_255]) ).
cnf(c_0_288,negated_conjecture,
ssList(esk48_0),
inference(rw,[status(thm)],[c_0_278,c_0_245]) ).
cnf(c_0_289,plain,
esk48_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_279,c_0_280]),c_0_263]),c_0_264])]) ).
cnf(c_0_290,negated_conjecture,
( app(esk53_0,esk48_0) = esk51_0
| esk53_0 != nil ),
inference(spm,[status(thm)],[c_0_281,c_0_282]) ).
cnf(c_0_291,plain,
( segmentP(X1,X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_283,c_0_284])]),c_0_285]) ).
cnf(c_0_292,negated_conjecture,
( rearsegP(esk48_0,esk53_0)
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_286,c_0_262]),c_0_264])]) ).
cnf(c_0_293,plain,
~ segmentP(esk51_0,esk48_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_287,c_0_249]),c_0_288])]),c_0_289]) ).
cnf(c_0_294,negated_conjecture,
( segmentP(X1,esk48_0)
| esk53_0 != nil
| esk51_0 != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_283,c_0_290]),c_0_264]),c_0_288])]) ).
cnf(c_0_295,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_296,plain,
( frontsegP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
i_0_113 ).
cnf(c_0_297,negated_conjecture,
( segmentP(esk48_0,esk53_0)
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_291,c_0_292]),c_0_264]),c_0_288])]) ).
cnf(c_0_298,plain,
esk53_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_293,c_0_294]),c_0_243])]) ).
cnf(c_0_299,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_272,c_0_295]),c_0_265])]) ).
cnf(c_0_300,plain,
( app(X1,esk32_2(X2,X1)) = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1) ),
i_0_114 ).
cnf(c_0_301,plain,
( ssList(esk32_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X1,X2) ),
i_0_115 ).
cnf(c_0_302,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_296]),c_0_274]) ).
cnf(c_0_303,negated_conjecture,
( ~ segmentP(esk51_0,esk53_0)
| ~ ssList(cons(esk52_0,nil)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_287,c_0_297]),c_0_264])]),c_0_298]) ).
cnf(c_0_304,plain,
( segmentP(X1,X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_299,c_0_300])]),c_0_301]) ).
cnf(c_0_305,negated_conjecture,
( frontsegP(esk51_0,esk53_0)
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_302,c_0_281]),c_0_264])]) ).
cnf(c_0_306,plain,
~ ssList(cons(esk52_0,nil)),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_303,c_0_304]),c_0_264]),c_0_243])]),c_0_305]) ).
cnf(c_0_307,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_308,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_306,c_0_307]),c_0_263]),c_0_265])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC063+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.34 % Computer : n016.cluster.edu
% 0.11/0.34 % Model : x86_64 x86_64
% 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34 % Memory : 8042.1875MB
% 0.11/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34 % CPULimit : 300
% 0.11/0.34 % WCLimit : 600
% 0.11/0.34 % DateTime : Sun Jun 12 09:50:44 EDT 2022
% 0.11/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.42/2.45 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.42/2.45 # Version: 2.1pre011
% 8.42/2.45 # Preprocessing time : 0.024 s
% 8.42/2.45
% 8.42/2.45 # Proof found!
% 8.42/2.45 # SZS status Theorem
% 8.42/2.45 # SZS output start CNFRefutation
% See solution above
% 8.42/2.45 # Proof object total steps : 104
% 8.42/2.45 # Proof object clause steps : 72
% 8.42/2.45 # Proof object formula steps : 32
% 8.42/2.45 # Proof object conjectures : 50
% 8.42/2.45 # Proof object clause conjectures : 37
% 8.42/2.45 # Proof object formula conjectures : 13
% 8.42/2.45 # Proof object initial clauses used : 32
% 8.42/2.45 # Proof object initial formulas used : 32
% 8.42/2.45 # Proof object generating inferences : 27
% 8.42/2.45 # Proof object simplifying inferences : 77
% 8.42/2.45 # Training examples: 0 positive, 0 negative
% 8.42/2.45 # Parsed axioms : 203
% 8.42/2.45 # Removed by relevancy pruning/SinE : 0
% 8.42/2.45 # Initial clauses : 203
% 8.42/2.45 # Removed in clause preprocessing : 0
% 8.42/2.45 # Initial clauses in saturation : 203
% 8.42/2.45 # Processed clauses : 776
% 8.42/2.45 # ...of these trivial : 18
% 8.42/2.45 # ...subsumed : 301
% 8.42/2.45 # ...remaining for further processing : 457
% 8.42/2.45 # Other redundant clauses eliminated : 143
% 8.42/2.45 # Clauses deleted for lack of memory : 0
% 8.42/2.45 # Backward-subsumed : 19
% 8.42/2.45 # Backward-rewritten : 10
% 8.42/2.45 # Generated clauses : 3394
% 8.42/2.45 # ...of the previous two non-trivial : 2948
% 8.42/2.45 # Contextual simplify-reflections : 170
% 8.42/2.45 # Paramodulations : 3208
% 8.42/2.45 # Factorizations : 0
% 8.42/2.45 # Equation resolutions : 184
% 8.42/2.45 # Propositional unsat checks : 0
% 8.42/2.45 # Propositional unsat check successes : 0
% 8.42/2.45 # Current number of processed clauses : 420
% 8.42/2.45 # Positive orientable unit clauses : 27
% 8.42/2.45 # Positive unorientable unit clauses: 0
% 8.42/2.45 # Negative unit clauses : 12
% 8.42/2.45 # Non-unit-clauses : 381
% 8.42/2.45 # Current number of unprocessed clauses: 2183
% 8.42/2.45 # ...number of literals in the above : 14320
% 8.42/2.45 # Current number of archived formulas : 0
% 8.42/2.45 # Current number of archived clauses : 31
% 8.42/2.45 # Clause-clause subsumption calls (NU) : 36517
% 8.42/2.45 # Rec. Clause-clause subsumption calls : 11463
% 8.42/2.45 # Non-unit clause-clause subsumptions : 303
% 8.42/2.45 # Unit Clause-clause subsumption calls : 2166
% 8.42/2.45 # Rewrite failures with RHS unbound : 0
% 8.42/2.45 # BW rewrite match attempts : 7
% 8.42/2.45 # BW rewrite match successes : 7
% 8.42/2.45 # Condensation attempts : 0
% 8.42/2.45 # Condensation successes : 0
% 8.42/2.45 # Termbank termtop insertions : 64553
% 8.42/2.45
% 8.42/2.45 # -------------------------------------------------
% 8.42/2.45 # User time : 0.108 s
% 8.42/2.45 # System time : 0.008 s
% 8.42/2.45 # Total time : 0.116 s
% 8.42/2.45 # ...preprocessing : 0.024 s
% 8.42/2.45 # ...main loop : 0.093 s
% 8.42/2.45 # Maximum resident set size: 7352 pages
% 8.42/2.45
%------------------------------------------------------------------------------