TSTP Solution File: SWC174+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC174+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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:14:05 EDT 2022
% Result : Theorem 8.58s 2.57s
% Output : CNFRefutation 8.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 26
% Syntax : Number of clauses : 80 ( 31 unt; 11 nHn; 80 RR)
% Number of literals : 204 ( 64 equ; 124 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 73 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_157,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cyu4ph4r/lgb.p',i_0_157) ).
cnf(i_0_192,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cyu4ph4r/lgb.p',i_0_192) ).
cnf(i_0_193,negated_conjecture,
ssList(esk55_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cyu4ph4r/lgb.p',i_0_193) ).
cnf(i_0_58,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cyu4ph4r/lgb.p',i_0_58) ).
cnf(i_0_158,plain,
( nil = X1
| app(X2,X1) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cyu4ph4r/lgb.p',i_0_158) ).
cnf(i_0_194,negated_conjecture,
ssList(esk54_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cyu4ph4r/lgb.p',i_0_194) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cyu4ph4r/lgb.p',i_0_43) ).
cnf(i_0_195,negated_conjecture,
ssItem(esk53_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cyu4ph4r/lgb.p',i_0_195) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cyu4ph4r/lgb.p',i_0_44) ).
cnf(i_0_196,negated_conjecture,
ssItem(esk52_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cyu4ph4r/lgb.p',i_0_196) ).
cnf(i_0_45,plain,
( cons(X1,X2) != X2
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cyu4ph4r/lgb.p',i_0_45) ).
cnf(i_0_54,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cyu4ph4r/lgb.p',i_0_54) ).
cnf(i_0_203,negated_conjecture,
ssList(esk48_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cyu4ph4r/lgb.p',i_0_203) ).
cnf(i_0_56,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cyu4ph4r/lgb.p',i_0_56) ).
cnf(i_0_147,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cyu4ph4r/lgb.p',i_0_147) ).
cnf(i_0_47,plain,
( X1 = X2
| cons(X1,X3) != cons(X2,X4)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cyu4ph4r/lgb.p',i_0_47) ).
cnf(i_0_197,negated_conjecture,
singletonP(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cyu4ph4r/lgb.p',i_0_197) ).
cnf(i_0_198,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cyu4ph4r/lgb.p',i_0_198) ).
cnf(i_0_155,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cyu4ph4r/lgb.p',i_0_155) ).
cnf(i_0_48,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cyu4ph4r/lgb.p',i_0_48) ).
cnf(i_0_99,plain,
( cons(esk31_1(X1),nil) = X1
| ~ ssList(X1)
| ~ singletonP(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cyu4ph4r/lgb.p',i_0_99) ).
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-cyu4ph4r/lgb.p',i_0_154) ).
cnf(i_0_191,negated_conjecture,
~ neq(esk52_0,esk53_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cyu4ph4r/lgb.p',i_0_191) ).
cnf(i_0_100,plain,
( ssItem(esk31_1(X1))
| ~ ssList(X1)
| ~ singletonP(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cyu4ph4r/lgb.p',i_0_100) ).
cnf(i_0_33,plain,
( X1 != X2
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X6)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ duplicatefreeP(X6) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cyu4ph4r/lgb.p',i_0_33) ).
cnf(i_0_138,plain,
( duplicatefreeP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cyu4ph4r/lgb.p',i_0_138) ).
cnf(c_0_230,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_157 ).
cnf(c_0_231,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk48_0,
i_0_192 ).
cnf(c_0_232,negated_conjecture,
ssList(esk55_0),
i_0_193 ).
cnf(c_0_233,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)) = nil
| esk48_0 != nil
| ~ ssList(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_230,c_0_231]),c_0_232])]) ).
cnf(c_0_234,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_58 ).
cnf(c_0_235,plain,
( nil = X1
| app(X2,X1) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_158 ).
cnf(c_0_236,plain,
( app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)) = nil
| esk48_0 != nil
| ~ ssList(app(esk54_0,cons(esk52_0,nil)))
| ~ ssList(cons(esk53_0,nil)) ),
inference(spm,[status(thm)],[c_0_233,c_0_234]) ).
cnf(c_0_237,plain,
( cons(esk53_0,nil) = nil
| esk48_0 != nil
| ~ ssList(app(esk54_0,cons(esk52_0,nil)))
| ~ ssList(cons(esk53_0,nil)) ),
inference(spm,[status(thm)],[c_0_235,c_0_236]) ).
cnf(c_0_238,negated_conjecture,
ssList(esk54_0),
i_0_194 ).
cnf(c_0_239,plain,
( cons(esk53_0,nil) = nil
| esk48_0 != nil
| ~ ssList(cons(esk53_0,nil))
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_234]),c_0_238])]) ).
cnf(c_0_240,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_241,negated_conjecture,
ssItem(esk53_0),
i_0_195 ).
cnf(c_0_242,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_243,plain,
( cons(esk53_0,nil) = nil
| esk48_0 != nil
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_239,c_0_240]),c_0_241]),c_0_242])]) ).
cnf(c_0_244,negated_conjecture,
ssItem(esk52_0),
i_0_196 ).
cnf(c_0_245,plain,
( cons(X1,X2) != X2
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_45 ).
cnf(c_0_246,plain,
( cons(esk53_0,nil) = nil
| esk48_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_243,c_0_240]),c_0_244]),c_0_242])]) ).
cnf(c_0_247,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
i_0_54 ).
cnf(c_0_248,negated_conjecture,
ssList(esk48_0),
i_0_203 ).
cnf(c_0_249,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
i_0_56 ).
cnf(c_0_250,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
i_0_147 ).
cnf(c_0_251,plain,
esk48_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_245,c_0_246]),c_0_241]),c_0_242])]) ).
cnf(c_0_252,negated_conjecture,
( esk48_0 = nil
| ssItem(hd(esk48_0)) ),
inference(spm,[status(thm)],[c_0_247,c_0_248]) ).
cnf(c_0_253,negated_conjecture,
( esk48_0 = nil
| ssList(tl(esk48_0)) ),
inference(spm,[status(thm)],[c_0_249,c_0_248]) ).
cnf(c_0_254,plain,
( X1 = X2
| cons(X1,X3) != cons(X2,X4)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
i_0_47 ).
cnf(c_0_255,negated_conjecture,
cons(hd(esk48_0),tl(esk48_0)) = esk48_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_250,c_0_248]),c_0_251]) ).
cnf(c_0_256,negated_conjecture,
ssItem(hd(esk48_0)),
inference(sr,[status(thm)],[c_0_252,c_0_251]) ).
cnf(c_0_257,negated_conjecture,
ssList(tl(esk48_0)),
inference(sr,[status(thm)],[c_0_253,c_0_251]) ).
cnf(c_0_258,negated_conjecture,
singletonP(esk50_0),
i_0_197 ).
cnf(c_0_259,negated_conjecture,
esk50_0 = esk48_0,
i_0_198 ).
cnf(c_0_260,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_155 ).
cnf(c_0_261,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
i_0_48 ).
cnf(c_0_262,plain,
( X1 = hd(esk48_0)
| cons(X1,X2) != esk48_0
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_254,c_0_255]),c_0_256]),c_0_257])]) ).
cnf(c_0_263,plain,
( cons(esk31_1(X1),nil) = X1
| ~ ssList(X1)
| ~ singletonP(X1) ),
i_0_99 ).
cnf(c_0_264,negated_conjecture,
singletonP(esk48_0),
inference(rw,[status(thm)],[c_0_258,c_0_259]) ).
cnf(c_0_265,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk53_0,nil),esk55_0)) = esk48_0
| ~ ssList(app(esk54_0,cons(esk52_0,nil)))
| ~ ssList(cons(esk53_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_231,c_0_260]),c_0_232])]) ).
cnf(c_0_266,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_154 ).
cnf(c_0_267,negated_conjecture,
( X1 = esk53_0
| neq(X1,esk53_0)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_261,c_0_241]) ).
cnf(c_0_268,negated_conjecture,
~ neq(esk52_0,esk53_0),
i_0_191 ).
cnf(c_0_269,plain,
( esk31_1(esk48_0) = hd(esk48_0)
| ~ ssItem(esk31_1(esk48_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_262,c_0_263]),c_0_242])])]),c_0_264]),c_0_248])]) ).
cnf(c_0_270,plain,
( ssItem(esk31_1(X1))
| ~ ssList(X1)
| ~ singletonP(X1) ),
i_0_100 ).
cnf(c_0_271,plain,
( X1 != X2
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X6)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ duplicatefreeP(X6) ),
i_0_33 ).
cnf(c_0_272,plain,
( app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,esk55_0)) = esk48_0
| ~ ssList(app(esk54_0,cons(esk52_0,nil)))
| ~ ssList(cons(esk53_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_265,c_0_266]),c_0_241]),c_0_232])]) ).
cnf(c_0_273,negated_conjecture,
esk53_0 = esk52_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_267,c_0_244]),c_0_268]) ).
cnf(c_0_274,plain,
esk31_1(esk48_0) = hd(esk48_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_269,c_0_270]),c_0_264]),c_0_248])]) ).
cnf(c_0_275,plain,
( ~ duplicatefreeP(app(app(X1,cons(X2,X3)),cons(X2,X4)))
| ~ ssItem(X2)
| ~ ssList(app(app(X1,cons(X2,X3)),cons(X2,X4)))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_271])]) ).
cnf(c_0_276,plain,
( app(app(esk54_0,cons(esk52_0,nil)),cons(esk52_0,esk55_0)) = esk48_0
| ~ ssList(app(esk54_0,cons(esk52_0,nil)))
| ~ ssList(cons(esk52_0,nil)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_272,c_0_273]),c_0_273]) ).
cnf(c_0_277,plain,
( duplicatefreeP(cons(X1,nil))
| ~ ssItem(X1) ),
i_0_138 ).
cnf(c_0_278,plain,
cons(hd(esk48_0),nil) = esk48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_263,c_0_274]),c_0_264]),c_0_248])]) ).
cnf(c_0_279,plain,
( ~ duplicatefreeP(esk48_0)
| ~ ssList(app(esk54_0,cons(esk52_0,nil)))
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_275,c_0_276]),c_0_244]),c_0_248]),c_0_232]),c_0_242]),c_0_238])]) ).
cnf(c_0_280,plain,
duplicatefreeP(esk48_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_277,c_0_278]),c_0_256])]) ).
cnf(c_0_281,plain,
( ~ ssList(app(esk54_0,cons(esk52_0,nil)))
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_279,c_0_280])]) ).
cnf(c_0_282,plain,
~ ssList(cons(esk52_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_281,c_0_234]),c_0_238])]) ).
cnf(c_0_283,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_282,c_0_240]),c_0_244]),c_0_242])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SWC174+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 12 16:28:26 EDT 2022
% 0.12/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.58/2.57 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.58/2.57 # No SInE strategy applied
% 8.58/2.57 # Trying AutoSched0 for 150 seconds
% 8.58/2.57 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.58/2.57 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.58/2.57 #
% 8.58/2.57 # Preprocessing time : 0.018 s
% 8.58/2.57 # Presaturation interreduction done
% 8.58/2.57
% 8.58/2.57 # Proof found!
% 8.58/2.57 # SZS status Theorem
% 8.58/2.57 # SZS output start CNFRefutation
% See solution above
% 8.58/2.57 # Training examples: 0 positive, 0 negative
% 8.58/2.57
% 8.58/2.57 # -------------------------------------------------
% 8.58/2.57 # User time : 0.049 s
% 8.58/2.57 # System time : 0.008 s
% 8.58/2.57 # Total time : 0.057 s
% 8.58/2.57 # Maximum resident set size: 7124 pages
% 8.58/2.57
%------------------------------------------------------------------------------