TSTP Solution File: SWC409+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC409+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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:31 EDT 2022
% Result : Theorem 18.68s 3.75s
% Output : CNFRefutation 18.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 18
% Syntax : Number of clauses : 56 ( 23 unt; 15 nHn; 56 RR)
% Number of literals : 165 ( 46 equ; 94 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_195,negated_conjecture,
( app(X1,cons(X2,nil)) = esk50_0
| app(cons(X2,nil),X1) != esk51_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tad03ysz/input.p',i_0_195) ).
cnf(i_0_154,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tad03ysz/input.p',i_0_154) ).
cnf(i_0_74,plain,
( memberP(app(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ memberP(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tad03ysz/input.p',i_0_74) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tad03ysz/input.p',i_0_43) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tad03ysz/input.p',i_0_44) ).
cnf(i_0_200,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tad03ysz/input.p',i_0_200) ).
cnf(i_0_197,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tad03ysz/input.p',i_0_197) ).
cnf(i_0_50,plain,
( nil = X1
| cons(esk26_1(X1),esk25_1(X1)) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tad03ysz/input.p',i_0_50) ).
cnf(i_0_78,plain,
( X1 = X2
| memberP(X3,X2)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ memberP(cons(X1,X3),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tad03ysz/input.p',i_0_78) ).
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/sandbox/tmp/enigma-theBenchmark.p-tad03ysz/input.p',i_0_81) ).
cnf(i_0_51,plain,
( nil = X1
| ssItem(esk26_1(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tad03ysz/input.p',i_0_51) ).
cnf(i_0_199,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tad03ysz/input.p',i_0_199) ).
cnf(i_0_52,plain,
( nil = X1
| ssList(esk25_1(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tad03ysz/input.p',i_0_52) ).
cnf(i_0_193,negated_conjecture,
memberP(esk49_0,esk52_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tad03ysz/input.p',i_0_193) ).
cnf(i_0_192,negated_conjecture,
~ memberP(esk48_0,esk52_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tad03ysz/input.p',i_0_192) ).
cnf(i_0_196,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tad03ysz/input.p',i_0_196) ).
cnf(i_0_194,negated_conjecture,
ssItem(esk52_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tad03ysz/input.p',i_0_194) ).
cnf(i_0_191,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tad03ysz/input.p',i_0_191) ).
cnf(c_0_219,negated_conjecture,
( app(X1,cons(X2,nil)) = esk50_0
| app(cons(X2,nil),X1) != esk51_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
i_0_195 ).
cnf(c_0_220,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_154 ).
cnf(c_0_221,plain,
( memberP(app(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ memberP(X1,X3) ),
i_0_74 ).
cnf(c_0_222,plain,
( app(X1,cons(X2,nil)) = esk50_0
| cons(X2,X1) != esk51_0
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_219,c_0_220]) ).
cnf(c_0_223,plain,
( memberP(esk50_0,X1)
| cons(X2,X3) != esk51_0
| ~ memberP(X3,X1)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(cons(X2,nil))
| ~ ssList(X3) ),
inference(spm,[status(thm)],[c_0_221,c_0_222]) ).
cnf(c_0_224,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_225,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_226,negated_conjecture,
ssList(esk49_0),
i_0_200 ).
cnf(c_0_227,negated_conjecture,
esk49_0 = esk51_0,
i_0_197 ).
cnf(c_0_228,plain,
( memberP(esk50_0,X1)
| cons(X2,X3) != esk51_0
| ~ memberP(X3,X1)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_223,c_0_224]),c_0_225])]) ).
cnf(c_0_229,plain,
( nil = X1
| cons(esk26_1(X1),esk25_1(X1)) = X1
| ~ ssList(X1) ),
i_0_50 ).
cnf(c_0_230,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_226,c_0_227]) ).
cnf(c_0_231,plain,
( X1 = X2
| memberP(X3,X2)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ memberP(cons(X1,X3),X2) ),
i_0_78 ).
cnf(c_0_232,plain,
( esk51_0 = nil
| memberP(esk50_0,X1)
| ~ memberP(esk25_1(esk51_0),X1)
| ~ ssItem(esk26_1(esk51_0))
| ~ ssItem(X1)
| ~ ssList(esk25_1(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_228,c_0_229])]),c_0_230])]) ).
cnf(c_0_233,plain,
( esk26_1(X1) = X2
| nil = X1
| memberP(esk25_1(X1),X2)
| ~ memberP(X1,X2)
| ~ ssItem(esk26_1(X1))
| ~ ssItem(X2)
| ~ ssList(esk25_1(X1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_231,c_0_229]) ).
cnf(c_0_234,plain,
( memberP(X1,X2)
| app(X3,cons(X2,X4)) != X1
| ~ ssList(X1)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2) ),
i_0_81 ).
cnf(c_0_235,plain,
( esk26_1(esk51_0) = X1
| esk51_0 = nil
| memberP(esk50_0,X1)
| ~ memberP(esk51_0,X1)
| ~ ssItem(esk26_1(esk51_0))
| ~ ssItem(X1)
| ~ ssList(esk25_1(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_232,c_0_233]),c_0_230])]) ).
cnf(c_0_236,plain,
( nil = X1
| ssItem(esk26_1(X1))
| ~ ssList(X1) ),
i_0_51 ).
cnf(c_0_237,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_234]) ).
cnf(c_0_238,negated_conjecture,
ssList(esk50_0),
i_0_199 ).
cnf(c_0_239,plain,
( esk26_1(esk51_0) = X1
| esk51_0 = nil
| memberP(esk50_0,X1)
| ~ memberP(esk51_0,X1)
| ~ ssItem(X1)
| ~ ssList(esk25_1(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_235,c_0_236]),c_0_230])]) ).
cnf(c_0_240,plain,
( nil = X1
| ssList(esk25_1(X1))
| ~ ssList(X1) ),
i_0_52 ).
cnf(c_0_241,negated_conjecture,
memberP(esk49_0,esk52_0),
i_0_193 ).
cnf(c_0_242,negated_conjecture,
~ memberP(esk48_0,esk52_0),
i_0_192 ).
cnf(c_0_243,negated_conjecture,
esk50_0 = esk48_0,
i_0_196 ).
cnf(c_0_244,plain,
( memberP(esk50_0,X1)
| cons(X1,X2) != esk51_0
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_222]),c_0_238]),c_0_225])]) ).
cnf(c_0_245,plain,
( esk26_1(esk51_0) = X1
| esk51_0 = nil
| memberP(esk50_0,X1)
| ~ memberP(esk51_0,X1)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_239,c_0_240]),c_0_230])]) ).
cnf(c_0_246,negated_conjecture,
memberP(esk51_0,esk52_0),
inference(rw,[status(thm)],[c_0_241,c_0_227]) ).
cnf(c_0_247,negated_conjecture,
ssItem(esk52_0),
i_0_194 ).
cnf(c_0_248,negated_conjecture,
~ memberP(esk50_0,esk52_0),
inference(rw,[status(thm)],[c_0_242,c_0_243]) ).
cnf(c_0_249,plain,
( esk51_0 = nil
| memberP(esk50_0,esk26_1(esk51_0))
| ~ ssItem(esk26_1(esk51_0))
| ~ ssList(esk25_1(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_244,c_0_229])]),c_0_230])]) ).
cnf(c_0_250,negated_conjecture,
( esk26_1(esk51_0) = esk52_0
| esk51_0 = nil ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_245,c_0_246]),c_0_247])]),c_0_248]) ).
cnf(c_0_251,plain,
( esk51_0 = nil
| ~ ssList(esk25_1(esk51_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_249,c_0_250]),c_0_247])]),c_0_248]) ).
cnf(c_0_252,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
i_0_191 ).
cnf(c_0_253,plain,
esk51_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_251,c_0_240]),c_0_230])]) ).
cnf(c_0_254,negated_conjecture,
esk50_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_252,c_0_253])]) ).
cnf(c_0_255,negated_conjecture,
~ memberP(nil,esk52_0),
inference(rw,[status(thm)],[c_0_248,c_0_254]) ).
cnf(c_0_256,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_246,c_0_253]),c_0_255]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWC409+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n024.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 13:03:35 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox/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
% 18.68/3.75 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d60-l8000-e0.15+coop-eprover73:
% 18.68/3.75 # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d60-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 62; version: 991; iters: 150)
% 18.68/3.75 # Preprocessing time : 1.171 s
% 18.68/3.75 # Presaturation interreduction done
% 18.68/3.75
% 18.68/3.75 # Proof found!
% 18.68/3.75 # SZS status Theorem
% 18.68/3.75 # SZS output start CNFRefutation
% See solution above
% 18.68/3.75 # Training examples: 0 positive, 0 negative
% 18.68/3.75
% 18.68/3.75 # -------------------------------------------------
% 18.68/3.75 # User time : 1.100 s
% 18.68/3.75 # System time : 0.129 s
% 18.68/3.75 # Total time : 1.229 s
% 18.68/3.75 # ...preprocessing : 1.171 s
% 18.68/3.75 # ...main loop : 0.057 s
% 18.68/3.75 # Maximum resident set size: 187796 pages
% 18.68/3.75
%------------------------------------------------------------------------------