TSTP Solution File: SWC290+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC290+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:46 EDT 2022
% Result : Theorem 17.42s 3.59s
% Output : CNFRefutation 17.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 17
% Syntax : Number of clauses : 44 ( 10 unt; 13 nHn; 44 RR)
% Number of literals : 150 ( 19 equ; 96 neg)
% Maximal clause size : 8 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-2 aty)
% Number of variables : 65 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_192,negated_conjecture,
( lt(X1,X2)
| app(app(X3,cons(X2,nil)),X4) != esk50_0
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ memberP(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l32gxocm/input.p',i_0_192) ).
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-l32gxocm/input.p',i_0_155) ).
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-l32gxocm/input.p',i_0_154) ).
cnf(i_0_19,plain,
( app(app(esk13_1(X1),cons(esk11_1(X1),esk14_1(X1))),cons(esk12_1(X1),esk15_1(X1))) = X1
| strictorderedP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l32gxocm/input.p',i_0_19) ).
cnf(i_0_20,plain,
( strictorderedP(X1)
| ssList(esk15_1(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l32gxocm/input.p',i_0_20) ).
cnf(i_0_23,plain,
( strictorderedP(X1)
| ssItem(esk12_1(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l32gxocm/input.p',i_0_23) ).
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-l32gxocm/input.p',i_0_81) ).
cnf(i_0_22,plain,
( strictorderedP(X1)
| ssList(esk13_1(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l32gxocm/input.p',i_0_22) ).
cnf(i_0_21,plain,
( strictorderedP(X1)
| ssList(esk14_1(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l32gxocm/input.p',i_0_21) ).
cnf(i_0_24,plain,
( strictorderedP(X1)
| ssItem(esk11_1(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l32gxocm/input.p',i_0_24) ).
cnf(i_0_18,plain,
( strictorderedP(X1)
| ~ ssList(X1)
| ~ lt(esk11_1(X1),esk12_1(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l32gxocm/input.p',i_0_18) ).
cnf(i_0_58,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l32gxocm/input.p',i_0_58) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l32gxocm/input.p',i_0_43) ).
cnf(i_0_191,negated_conjecture,
~ strictorderedP(esk48_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l32gxocm/input.p',i_0_191) ).
cnf(i_0_194,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l32gxocm/input.p',i_0_194) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l32gxocm/input.p',i_0_44) ).
cnf(i_0_197,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l32gxocm/input.p',i_0_197) ).
cnf(c_0_215,negated_conjecture,
( lt(X1,X2)
| app(app(X3,cons(X2,nil)),X4) != esk50_0
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ memberP(X3,X1) ),
i_0_192 ).
cnf(c_0_216,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_155 ).
cnf(c_0_217,plain,
( lt(X1,X2)
| app(X3,app(cons(X2,nil),X4)) != esk50_0
| ~ memberP(X3,X1)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(cons(X2,nil))
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[c_0_215,c_0_216]) ).
cnf(c_0_218,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_154 ).
cnf(c_0_219,plain,
( lt(X1,X2)
| app(X3,cons(X2,X4)) != esk50_0
| ~ memberP(X3,X1)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(cons(X2,nil))
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[c_0_217,c_0_218]) ).
cnf(c_0_220,plain,
( app(app(esk13_1(X1),cons(esk11_1(X1),esk14_1(X1))),cons(esk12_1(X1),esk15_1(X1))) = X1
| strictorderedP(X1)
| ~ ssList(X1) ),
i_0_19 ).
cnf(c_0_221,plain,
( strictorderedP(X1)
| ssList(esk15_1(X1))
| ~ ssList(X1) ),
i_0_20 ).
cnf(c_0_222,plain,
( strictorderedP(X1)
| ssItem(esk12_1(X1))
| ~ ssList(X1) ),
i_0_23 ).
cnf(c_0_223,plain,
( memberP(X1,X2)
| app(X3,cons(X2,X4)) != X1
| ~ ssList(X1)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2) ),
i_0_81 ).
cnf(c_0_224,plain,
( lt(X1,esk12_1(X2))
| strictorderedP(X2)
| X2 != esk50_0
| ~ memberP(app(esk13_1(X2),cons(esk11_1(X2),esk14_1(X2))),X1)
| ~ ssItem(X1)
| ~ ssList(app(esk13_1(X2),cons(esk11_1(X2),esk14_1(X2))))
| ~ ssList(cons(esk12_1(X2),nil))
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_219,c_0_220]),c_0_221]),c_0_222]) ).
cnf(c_0_225,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_223]) ).
cnf(c_0_226,plain,
( strictorderedP(X1)
| ssList(esk13_1(X1))
| ~ ssList(X1) ),
i_0_22 ).
cnf(c_0_227,plain,
( strictorderedP(X1)
| ssList(esk14_1(X1))
| ~ ssList(X1) ),
i_0_21 ).
cnf(c_0_228,plain,
( strictorderedP(X1)
| ssItem(esk11_1(X1))
| ~ ssList(X1) ),
i_0_24 ).
cnf(c_0_229,plain,
( strictorderedP(X1)
| ~ ssList(X1)
| ~ lt(esk11_1(X1),esk12_1(X1)) ),
i_0_18 ).
cnf(c_0_230,plain,
( strictorderedP(X1)
| X1 != esk50_0
| ~ ssList(app(esk13_1(X1),cons(esk11_1(X1),esk14_1(X1))))
| ~ ssList(cons(esk12_1(X1),nil))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_224,c_0_225]),c_0_226]),c_0_227]),c_0_228]),c_0_229]) ).
cnf(c_0_231,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_58 ).
cnf(c_0_232,plain,
( strictorderedP(X1)
| X1 != esk50_0
| ~ ssList(cons(esk11_1(X1),esk14_1(X1)))
| ~ ssList(cons(esk12_1(X1),nil))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_230,c_0_231]),c_0_226]) ).
cnf(c_0_233,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_234,negated_conjecture,
~ strictorderedP(esk48_0),
i_0_191 ).
cnf(c_0_235,negated_conjecture,
esk50_0 = esk48_0,
i_0_194 ).
cnf(c_0_236,plain,
( strictorderedP(X1)
| X1 != esk50_0
| ~ ssList(cons(esk12_1(X1),nil))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_232,c_0_233]),c_0_227]),c_0_228]) ).
cnf(c_0_237,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_238,negated_conjecture,
~ strictorderedP(esk50_0),
inference(rw,[status(thm)],[c_0_234,c_0_235]) ).
cnf(c_0_239,plain,
( strictorderedP(X1)
| X1 != esk50_0
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_236,c_0_233]),c_0_237])]),c_0_222]) ).
cnf(c_0_240,negated_conjecture,
ssList(esk50_0),
i_0_197 ).
cnf(c_0_241,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_238,c_0_239]),c_0_240])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC290+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n013.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 13:20:45 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 17.42/3.59 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d45-l8000-e0.15+coop-mzr02:
% 17.42/3.59 # 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: 59; version: 991; iters: 150)
% 17.42/3.59 # Preprocessing time : 1.177 s
% 17.42/3.59
% 17.42/3.59 # Proof found!
% 17.42/3.59 # SZS status Theorem
% 17.42/3.59 # SZS output start CNFRefutation
% See solution above
% 17.42/3.59 # Training examples: 0 positive, 0 negative
% 17.42/3.59
% 17.42/3.59 # -------------------------------------------------
% 17.42/3.59 # User time : 1.084 s
% 17.42/3.59 # System time : 0.151 s
% 17.42/3.59 # Total time : 1.235 s
% 17.42/3.59 # ...preprocessing : 1.177 s
% 17.42/3.59 # ...main loop : 0.059 s
% 17.42/3.59 # Maximum resident set size: 174024 pages
% 17.42/3.59
%------------------------------------------------------------------------------