TSTP Solution File: SWC388+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC388+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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:15:22 EDT 2022
% Result : Theorem 17.19s 3.54s
% Output : CNFRefutation 17.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 23
% Syntax : Number of clauses : 66 ( 17 unt; 9 nHn; 66 RR)
% Number of literals : 187 ( 45 equ; 122 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 74 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_199,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pndq3ws3/input.p',i_0_199) ).
cnf(i_0_196,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pndq3ws3/input.p',i_0_196) ).
cnf(i_0_74,plain,
( memberP(app(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ memberP(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pndq3ws3/input.p',i_0_74) ).
cnf(i_0_150,plain,
( app(app(esk36_2(X1,X2),X2),esk37_2(X1,X2)) = X1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pndq3ws3/input.p',i_0_150) ).
cnf(i_0_151,plain,
( ssList(esk37_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pndq3ws3/input.p',i_0_151) ).
cnf(i_0_81,plain,
( memberP(X1,X2)
| app(X3,cons(X2,X4)) != X1
| ~ ssList(X1)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pndq3ws3/input.p',i_0_81) ).
cnf(i_0_57,plain,
( tl(cons(X1,X2)) = X2
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pndq3ws3/input.p',i_0_57) ).
cnf(i_0_99,plain,
( cons(esk31_1(X1),nil) = X1
| ~ ssList(X1)
| ~ singletonP(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pndq3ws3/input.p',i_0_99) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pndq3ws3/input.p',i_0_44) ).
cnf(i_0_100,plain,
( ssItem(esk31_1(X1))
| ~ ssList(X1)
| ~ singletonP(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pndq3ws3/input.p',i_0_100) ).
cnf(i_0_192,negated_conjecture,
( singletonP(esk50_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pndq3ws3/input.p',i_0_192) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pndq3ws3/input.p',i_0_41) ).
cnf(i_0_53,plain,
( cons(X1,X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pndq3ws3/input.p',i_0_53) ).
cnf(i_0_191,negated_conjecture,
( nil != esk48_0
| nil != esk49_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pndq3ws3/input.p',i_0_191) ).
cnf(i_0_195,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pndq3ws3/input.p',i_0_195) ).
cnf(i_0_55,plain,
( hd(cons(X1,X2)) = X1
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pndq3ws3/input.p',i_0_55) ).
cnf(i_0_152,plain,
( ssList(esk36_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pndq3ws3/input.p',i_0_152) ).
cnf(i_0_198,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pndq3ws3/input.p',i_0_198) ).
cnf(i_0_58,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pndq3ws3/input.p',i_0_58) ).
cnf(i_0_147,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pndq3ws3/input.p',i_0_147) ).
cnf(i_0_193,negated_conjecture,
( cons(X1,nil) != esk48_0
| ~ ssItem(X1)
| ~ memberP(esk49_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pndq3ws3/input.p',i_0_193) ).
cnf(i_0_194,negated_conjecture,
segmentP(esk51_0,esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pndq3ws3/input.p',i_0_194) ).
cnf(i_0_111,plain,
( nil = X1
| ~ ssList(X1)
| ~ segmentP(nil,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pndq3ws3/input.p',i_0_111) ).
cnf(c_0_223,negated_conjecture,
ssList(esk49_0),
i_0_199 ).
cnf(c_0_224,negated_conjecture,
esk49_0 = esk51_0,
i_0_196 ).
cnf(c_0_225,plain,
( memberP(app(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ memberP(X1,X3) ),
i_0_74 ).
cnf(c_0_226,plain,
( app(app(esk36_2(X1,X2),X2),esk37_2(X1,X2)) = X1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X1,X2) ),
i_0_150 ).
cnf(c_0_227,plain,
( ssList(esk37_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X1,X2) ),
i_0_151 ).
cnf(c_0_228,plain,
( memberP(X1,X2)
| app(X3,cons(X2,X4)) != X1
| ~ ssList(X1)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2) ),
i_0_81 ).
cnf(c_0_229,plain,
( tl(cons(X1,X2)) = X2
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_57 ).
cnf(c_0_230,plain,
( cons(esk31_1(X1),nil) = X1
| ~ ssList(X1)
| ~ singletonP(X1) ),
i_0_99 ).
cnf(c_0_231,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_232,plain,
( ssItem(esk31_1(X1))
| ~ ssList(X1)
| ~ singletonP(X1) ),
i_0_100 ).
cnf(c_0_233,negated_conjecture,
( singletonP(esk50_0)
| ~ neq(esk51_0,nil) ),
i_0_192 ).
cnf(c_0_234,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_235,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_223,c_0_224]) ).
cnf(c_0_236,plain,
( cons(X1,X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_53 ).
cnf(c_0_237,negated_conjecture,
( nil != esk48_0
| nil != esk49_0 ),
i_0_191 ).
cnf(c_0_238,negated_conjecture,
esk50_0 = esk48_0,
i_0_195 ).
cnf(c_0_239,plain,
( hd(cons(X1,X2)) = X1
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_55 ).
cnf(c_0_240,plain,
( memberP(X1,X2)
| ~ memberP(app(esk36_2(X1,X3),X3),X2)
| ~ segmentP(X1,X3)
| ~ ssItem(X2)
| ~ ssList(app(esk36_2(X1,X3),X3))
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_225,c_0_226]),c_0_227]) ).
cnf(c_0_241,plain,
( memberP(app(X1,cons(X2,X3)),X2)
| ~ ssItem(X2)
| ~ ssList(app(X1,cons(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_228]) ).
cnf(c_0_242,plain,
( ssList(esk36_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X1,X2) ),
i_0_152 ).
cnf(c_0_243,plain,
( tl(X1) = nil
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_229,c_0_230]),c_0_231])]),c_0_232]) ).
cnf(c_0_244,negated_conjecture,
( esk51_0 = nil
| singletonP(esk50_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_233,c_0_234]),c_0_231]),c_0_235])]) ).
cnf(c_0_245,negated_conjecture,
ssList(esk50_0),
i_0_198 ).
cnf(c_0_246,plain,
( X1 != nil
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_236,c_0_230]),c_0_231])]),c_0_232]) ).
cnf(c_0_247,negated_conjecture,
( esk50_0 != nil
| esk51_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_237,c_0_238]),c_0_224]) ).
cnf(c_0_248,plain,
( esk31_1(X1) = hd(X1)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_239,c_0_230]),c_0_231])]),c_0_232]) ).
cnf(c_0_249,plain,
( memberP(X1,X2)
| ~ segmentP(X1,cons(X2,X3))
| ~ ssItem(X2)
| ~ ssList(app(esk36_2(X1,cons(X2,X3)),cons(X2,X3)))
| ~ ssList(cons(X2,X3))
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_240,c_0_241]),c_0_242]) ).
cnf(c_0_250,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_58 ).
cnf(c_0_251,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
i_0_147 ).
cnf(c_0_252,negated_conjecture,
( tl(esk50_0) = nil
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_243,c_0_244]),c_0_245])]) ).
cnf(c_0_253,negated_conjecture,
esk50_0 != nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_246,c_0_244]),c_0_245])]),c_0_247]) ).
cnf(c_0_254,plain,
( ssItem(hd(X1))
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_232,c_0_248]) ).
cnf(c_0_255,negated_conjecture,
( cons(X1,nil) != esk48_0
| ~ ssItem(X1)
| ~ memberP(esk49_0,X1) ),
i_0_193 ).
cnf(c_0_256,plain,
( memberP(X1,X2)
| ~ segmentP(X1,cons(X2,X3))
| ~ ssItem(X2)
| ~ ssList(cons(X2,X3))
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_249,c_0_250]),c_0_242]) ).
cnf(c_0_257,plain,
( cons(hd(esk50_0),nil) = esk50_0
| esk51_0 = nil ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_251,c_0_252]),c_0_245])]),c_0_253]) ).
cnf(c_0_258,negated_conjecture,
( esk51_0 = nil
| ssItem(hd(esk50_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_254,c_0_244]),c_0_245])]) ).
cnf(c_0_259,negated_conjecture,
( cons(X1,nil) != esk50_0
| ~ memberP(esk51_0,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_255,c_0_238]),c_0_224]) ).
cnf(c_0_260,plain,
( esk51_0 = nil
| memberP(X1,hd(esk50_0))
| ~ segmentP(X1,esk50_0)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_256,c_0_257]),c_0_245]),c_0_231])]),c_0_258]) ).
cnf(c_0_261,negated_conjecture,
segmentP(esk51_0,esk50_0),
i_0_194 ).
cnf(c_0_262,negated_conjecture,
esk51_0 = nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_259,c_0_260]),c_0_261]),c_0_235])]),c_0_258]),c_0_257]) ).
cnf(c_0_263,plain,
( nil = X1
| ~ ssList(X1)
| ~ segmentP(nil,X1) ),
i_0_111 ).
cnf(c_0_264,negated_conjecture,
segmentP(nil,esk50_0),
inference(rw,[status(thm)],[c_0_261,c_0_262]) ).
cnf(c_0_265,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_263,c_0_264]),c_0_245])]),c_0_253]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC388+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 12 06:58:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 17.19/3.54 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d45-l8000-e0.15+coop-mzr02:
% 17.19/3.54 # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d45-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 55; version: 991; iters: 150)
% 17.19/3.54 # Preprocessing time : 1.118 s
% 17.19/3.54
% 17.19/3.54 # Proof found!
% 17.19/3.54 # SZS status Theorem
% 17.19/3.54 # SZS output start CNFRefutation
% See solution above
% 17.19/3.54 # Training examples: 0 positive, 0 negative
% 17.19/3.54
% 17.19/3.54 # -------------------------------------------------
% 17.19/3.54 # User time : 1.080 s
% 17.19/3.54 # System time : 0.130 s
% 17.19/3.54 # Total time : 1.210 s
% 17.19/3.54 # ...preprocessing : 1.118 s
% 17.19/3.54 # ...main loop : 0.093 s
% 17.19/3.54 # Maximum resident set size: 177828 pages
% 17.19/3.54
%------------------------------------------------------------------------------