TSTP Solution File: SWC125+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC125+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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:47 EDT 2022
% Result : Theorem 16.05s 3.40s
% Output : CNFRefutation 16.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 21
% Syntax : Number of clauses : 65 ( 21 unt; 16 nHn; 65 RR)
% Number of literals : 165 ( 38 equ; 93 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 55 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_108,plain,
( segmentP(app(app(X1,X2),X3),X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ segmentP(X2,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zkmpajuh/input.p',i_0_108) ).
cnf(i_0_107,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zkmpajuh/input.p',i_0_107) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zkmpajuh/input.p',i_0_60) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zkmpajuh/input.p',i_0_44) ).
cnf(i_0_191,negated_conjecture,
( ~ neq(esk48_0,nil)
| ~ segmentP(esk49_0,esk48_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zkmpajuh/input.p',i_0_191) ).
cnf(i_0_196,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zkmpajuh/input.p',i_0_196) ).
cnf(i_0_197,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zkmpajuh/input.p',i_0_197) ).
cnf(i_0_194,negated_conjecture,
segmentP(esk51_0,esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zkmpajuh/input.p',i_0_194) ).
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-zkmpajuh/input.p',i_0_154) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zkmpajuh/input.p',i_0_41) ).
cnf(i_0_199,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zkmpajuh/input.p',i_0_199) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zkmpajuh/input.p',i_0_43) ).
cnf(i_0_192,negated_conjecture,
( ~ ssList(X1)
| ~ strictorderedP(X1)
| ~ segmentP(X1,esk50_0)
| ~ neq(esk50_0,X1)
| ~ segmentP(esk51_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zkmpajuh/input.p',i_0_192) ).
cnf(i_0_147,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zkmpajuh/input.p',i_0_147) ).
cnf(i_0_54,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zkmpajuh/input.p',i_0_54) ).
cnf(i_0_109,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zkmpajuh/input.p',i_0_109) ).
cnf(i_0_56,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zkmpajuh/input.p',i_0_56) ).
cnf(i_0_200,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zkmpajuh/input.p',i_0_200) ).
cnf(i_0_128,plain,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zkmpajuh/input.p',i_0_128) ).
cnf(i_0_45,plain,
( cons(X1,X2) != X2
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zkmpajuh/input.p',i_0_45) ).
cnf(i_0_195,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zkmpajuh/input.p',i_0_195) ).
cnf(c_0_222,plain,
( segmentP(app(app(X1,X2),X3),X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ segmentP(X2,X4) ),
i_0_108 ).
cnf(c_0_223,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
i_0_107 ).
cnf(c_0_224,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_222,c_0_223]) ).
cnf(c_0_225,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_226,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_227,negated_conjecture,
( ~ neq(esk48_0,nil)
| ~ segmentP(esk49_0,esk48_0) ),
i_0_191 ).
cnf(c_0_228,negated_conjecture,
esk50_0 = esk48_0,
i_0_196 ).
cnf(c_0_229,negated_conjecture,
esk49_0 = esk51_0,
i_0_197 ).
cnf(c_0_230,negated_conjecture,
segmentP(esk51_0,esk50_0),
i_0_194 ).
cnf(c_0_231,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_224,c_0_225]),c_0_226])]) ).
cnf(c_0_232,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_154 ).
cnf(c_0_233,negated_conjecture,
~ neq(esk50_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_227,c_0_228]),c_0_229]),c_0_228]),c_0_230])]) ).
cnf(c_0_234,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_235,negated_conjecture,
ssList(esk50_0),
i_0_199 ).
cnf(c_0_236,plain,
( segmentP(cons(X1,X2),cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_231,c_0_232]) ).
cnf(c_0_237,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_238,negated_conjecture,
( ~ ssList(X1)
| ~ strictorderedP(X1)
| ~ segmentP(X1,esk50_0)
| ~ neq(esk50_0,X1)
| ~ segmentP(esk51_0,X1) ),
i_0_192 ).
cnf(c_0_239,negated_conjecture,
esk50_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_233,c_0_234]),c_0_226]),c_0_235])]) ).
cnf(c_0_240,plain,
( segmentP(cons(X1,X2),cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_236,c_0_237]),c_0_226])]) ).
cnf(c_0_241,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
i_0_147 ).
cnf(c_0_242,negated_conjecture,
( ~ segmentP(X1,nil)
| ~ segmentP(esk51_0,X1)
| ~ neq(nil,X1)
| ~ strictorderedP(X1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_238,c_0_239]),c_0_239]) ).
cnf(c_0_243,plain,
( nil = X1
| segmentP(X1,cons(hd(X1),nil))
| ~ ssItem(hd(X1))
| ~ ssList(tl(X1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_240,c_0_241]) ).
cnf(c_0_244,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
i_0_54 ).
cnf(c_0_245,plain,
( nil = X1
| ~ segmentP(X1,nil)
| ~ segmentP(esk51_0,X1)
| ~ strictorderedP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_242,c_0_234]),c_0_226])]) ).
cnf(c_0_246,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
i_0_109 ).
cnf(c_0_247,plain,
( nil = X1
| segmentP(X1,cons(hd(X1),nil))
| ~ ssList(tl(X1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_243,c_0_244]) ).
cnf(c_0_248,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
i_0_56 ).
cnf(c_0_249,negated_conjecture,
ssList(esk49_0),
i_0_200 ).
cnf(c_0_250,plain,
( nil = X1
| ~ segmentP(esk51_0,X1)
| ~ strictorderedP(X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_245,c_0_246]) ).
cnf(c_0_251,plain,
( nil = X1
| segmentP(X1,cons(hd(X1),nil))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_247,c_0_248]) ).
cnf(c_0_252,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_249,c_0_229]) ).
cnf(c_0_253,plain,
( cons(hd(esk51_0),nil) = nil
| esk51_0 = nil
| ~ strictorderedP(cons(hd(esk51_0),nil))
| ~ ssList(cons(hd(esk51_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_250,c_0_251]),c_0_252])]) ).
cnf(c_0_254,plain,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
i_0_128 ).
cnf(c_0_255,plain,
( cons(hd(esk51_0),nil) = nil
| esk51_0 = nil
| ~ ssItem(hd(esk51_0))
| ~ ssList(cons(hd(esk51_0),nil)) ),
inference(spm,[status(thm)],[c_0_253,c_0_254]) ).
cnf(c_0_256,plain,
( cons(hd(esk51_0),nil) = nil
| esk51_0 = nil
| ~ ssList(cons(hd(esk51_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_255,c_0_244]),c_0_252])]) ).
cnf(c_0_257,plain,
( cons(hd(esk51_0),nil) = nil
| esk51_0 = nil
| ~ ssItem(hd(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_256,c_0_237]),c_0_226])]) ).
cnf(c_0_258,plain,
( cons(X1,X2) != X2
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_45 ).
cnf(c_0_259,plain,
( cons(hd(esk51_0),nil) = nil
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_257,c_0_244]),c_0_252])]) ).
cnf(c_0_260,negated_conjecture,
neq(esk49_0,nil),
i_0_195 ).
cnf(c_0_261,plain,
( esk51_0 = nil
| ~ ssItem(hd(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_258,c_0_259]),c_0_226])]) ).
cnf(c_0_262,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_260,c_0_229]) ).
cnf(c_0_263,plain,
esk51_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_261,c_0_244]),c_0_252])]) ).
cnf(c_0_264,negated_conjecture,
~ neq(nil,nil),
inference(rw,[status(thm)],[c_0_233,c_0_239]) ).
cnf(c_0_265,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_262,c_0_263]),c_0_264]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC125+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 12 01:49:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 16.05/3.40 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d30-l6400-e0.15+coop-eprover66:
% 16.05/3.40 # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 48; version: 991; iters: 150)
% 16.05/3.40 # Preprocessing time : 0.854 s
% 16.05/3.40 # Presaturation interreduction done
% 16.05/3.40
% 16.05/3.40 # Proof found!
% 16.05/3.40 # SZS status Theorem
% 16.05/3.40 # SZS output start CNFRefutation
% See solution above
% 16.05/3.41 # Training examples: 0 positive, 0 negative
% 16.05/3.41
% 16.05/3.41 # -------------------------------------------------
% 16.05/3.41 # User time : 0.919 s
% 16.05/3.41 # System time : 0.108 s
% 16.05/3.41 # Total time : 1.027 s
% 16.05/3.41 # ...preprocessing : 0.854 s
% 16.05/3.41 # ...main loop : 0.173 s
% 16.05/3.41 # Maximum resident set size: 168348 pages
% 16.05/3.41
%------------------------------------------------------------------------------