TSTP Solution File: SWC066+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC066+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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:23 EDT 2022
% Result : Theorem 15.95s 3.37s
% Output : CNFRefutation 15.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 24
% Syntax : Number of clauses : 79 ( 20 unt; 22 nHn; 79 RR)
% Number of literals : 230 ( 61 equ; 137 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 : 68 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_149,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-buq8e4f3/input.p',i_0_149) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-buq8e4f3/input.p',i_0_60) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-buq8e4f3/input.p',i_0_44) ).
cnf(i_0_193,negated_conjecture,
( nil = esk49_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-buq8e4f3/input.p',i_0_193) ).
cnf(i_0_198,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-buq8e4f3/input.p',i_0_198) ).
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-buq8e4f3/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-buq8e4f3/input.p',i_0_41) ).
cnf(i_0_197,negated_conjecture,
segmentP(esk51_0,esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-buq8e4f3/input.p',i_0_197) ).
cnf(i_0_199,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-buq8e4f3/input.p',i_0_199) ).
cnf(i_0_147,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-buq8e4f3/input.p',i_0_147) ).
cnf(i_0_195,negated_conjecture,
( ~ ssList(X1)
| ~ totalorderedP(X1)
| ~ segmentP(X1,esk50_0)
| ~ neq(esk50_0,X1)
| ~ segmentP(esk51_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-buq8e4f3/input.p',i_0_195) ).
cnf(i_0_107,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-buq8e4f3/input.p',i_0_107) ).
cnf(i_0_201,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-buq8e4f3/input.p',i_0_201) ).
cnf(i_0_54,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-buq8e4f3/input.p',i_0_54) ).
cnf(i_0_56,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-buq8e4f3/input.p',i_0_56) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-buq8e4f3/input.p',i_0_43) ).
cnf(i_0_109,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-buq8e4f3/input.p',i_0_109) ).
cnf(i_0_202,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-buq8e4f3/input.p',i_0_202) ).
cnf(i_0_121,plain,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-buq8e4f3/input.p',i_0_121) ).
cnf(i_0_45,plain,
( cons(X1,X2) != X2
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-buq8e4f3/input.p',i_0_45) ).
cnf(i_0_110,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-buq8e4f3/input.p',i_0_110) ).
cnf(i_0_192,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-buq8e4f3/input.p',i_0_192) ).
cnf(i_0_122,plain,
totalorderedP(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-buq8e4f3/input.p',i_0_122) ).
cnf(i_0_42,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-buq8e4f3/input.p',i_0_42) ).
cnf(c_0_227,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
i_0_149 ).
cnf(c_0_228,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_227]) ).
cnf(c_0_229,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_230,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_231,negated_conjecture,
( nil = esk49_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
i_0_193 ).
cnf(c_0_232,negated_conjecture,
esk50_0 = esk48_0,
i_0_198 ).
cnf(c_0_233,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_228,c_0_229]),c_0_230])]) ).
cnf(c_0_234,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_154 ).
cnf(c_0_235,negated_conjecture,
( esk49_0 = nil
| ~ neq(X1,nil)
| ~ segmentP(esk50_0,X1)
| ~ segmentP(esk49_0,X1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_231,c_0_232]) ).
cnf(c_0_236,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_237,negated_conjecture,
segmentP(esk51_0,esk50_0),
i_0_197 ).
cnf(c_0_238,negated_conjecture,
esk49_0 = esk51_0,
i_0_199 ).
cnf(c_0_239,plain,
( segmentP(cons(X1,X2),cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| ~ ssList(cons(X1,X2))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_233,c_0_234]) ).
cnf(c_0_240,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
i_0_147 ).
cnf(c_0_241,negated_conjecture,
( ~ ssList(X1)
| ~ totalorderedP(X1)
| ~ segmentP(X1,esk50_0)
| ~ neq(esk50_0,X1)
| ~ segmentP(esk51_0,X1) ),
i_0_195 ).
cnf(c_0_242,plain,
( esk49_0 = nil
| X1 = nil
| ~ segmentP(esk50_0,X1)
| ~ segmentP(esk49_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_235,c_0_236]),c_0_230])]) ).
cnf(c_0_243,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
i_0_107 ).
cnf(c_0_244,negated_conjecture,
segmentP(esk49_0,esk50_0),
inference(rw,[status(thm)],[c_0_237,c_0_238]) ).
cnf(c_0_245,negated_conjecture,
ssList(esk50_0),
i_0_201 ).
cnf(c_0_246,plain,
( nil = X1
| segmentP(X1,cons(hd(X1),nil))
| ~ ssItem(hd(X1))
| ~ ssList(cons(hd(X1),nil))
| ~ ssList(tl(X1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_239,c_0_240]) ).
cnf(c_0_247,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
i_0_54 ).
cnf(c_0_248,negated_conjecture,
( ~ neq(esk50_0,X1)
| ~ segmentP(X1,esk50_0)
| ~ segmentP(esk49_0,X1)
| ~ totalorderedP(X1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_241,c_0_238]) ).
cnf(c_0_249,plain,
( esk49_0 = nil
| esk50_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_242,c_0_243]),c_0_244]),c_0_245])]) ).
cnf(c_0_250,plain,
( nil = X1
| segmentP(X1,cons(hd(X1),nil))
| ~ ssList(cons(hd(X1),nil))
| ~ ssList(tl(X1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_246,c_0_247]) ).
cnf(c_0_251,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
i_0_56 ).
cnf(c_0_252,plain,
( esk49_0 = nil
| ~ neq(nil,X1)
| ~ segmentP(X1,nil)
| ~ segmentP(esk49_0,X1)
| ~ totalorderedP(X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_248,c_0_249]) ).
cnf(c_0_253,plain,
( nil = X1
| segmentP(X1,cons(hd(X1),nil))
| ~ ssList(cons(hd(X1),nil))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_250,c_0_251]) ).
cnf(c_0_254,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_255,plain,
( esk49_0 = nil
| nil = X1
| ~ segmentP(X1,nil)
| ~ segmentP(esk49_0,X1)
| ~ totalorderedP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_252,c_0_236]),c_0_230])]) ).
cnf(c_0_256,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
i_0_109 ).
cnf(c_0_257,plain,
( nil = X1
| segmentP(X1,cons(hd(X1),nil))
| ~ ssItem(hd(X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_253,c_0_254]),c_0_230])]) ).
cnf(c_0_258,plain,
( esk49_0 = nil
| nil = X1
| ~ segmentP(esk49_0,X1)
| ~ totalorderedP(X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_255,c_0_256]) ).
cnf(c_0_259,plain,
( nil = X1
| segmentP(X1,cons(hd(X1),nil))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_257,c_0_247]) ).
cnf(c_0_260,negated_conjecture,
ssList(esk49_0),
i_0_202 ).
cnf(c_0_261,plain,
( cons(hd(esk49_0),nil) = nil
| esk49_0 = nil
| ~ totalorderedP(cons(hd(esk49_0),nil))
| ~ ssList(cons(hd(esk49_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_258,c_0_259]),c_0_260])]) ).
cnf(c_0_262,plain,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
i_0_121 ).
cnf(c_0_263,plain,
( cons(hd(esk49_0),nil) = nil
| esk49_0 = nil
| ~ ssItem(hd(esk49_0))
| ~ ssList(cons(hd(esk49_0),nil)) ),
inference(spm,[status(thm)],[c_0_261,c_0_262]) ).
cnf(c_0_264,plain,
( cons(hd(esk49_0),nil) = nil
| esk49_0 = nil
| ~ ssList(cons(hd(esk49_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_263,c_0_247]),c_0_260])]) ).
cnf(c_0_265,plain,
( cons(hd(esk49_0),nil) = nil
| esk49_0 = nil
| ~ ssItem(hd(esk49_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_264,c_0_254]),c_0_230])]) ).
cnf(c_0_266,plain,
( cons(X1,X2) != X2
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_45 ).
cnf(c_0_267,plain,
( cons(hd(esk49_0),nil) = nil
| esk49_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_265,c_0_247]),c_0_260])]) ).
cnf(c_0_268,plain,
( esk50_0 = X1
| ~ segmentP(X1,esk50_0)
| ~ segmentP(esk49_0,X1)
| ~ totalorderedP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_248,c_0_236]),c_0_245])]) ).
cnf(c_0_269,plain,
( esk49_0 = nil
| ~ ssItem(hd(esk49_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_266,c_0_267]),c_0_230])]) ).
cnf(c_0_270,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
i_0_110 ).
cnf(c_0_271,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
i_0_192 ).
cnf(c_0_272,negated_conjecture,
( esk50_0 = esk49_0
| ~ segmentP(esk49_0,esk49_0)
| ~ totalorderedP(esk49_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_268,c_0_244]),c_0_260])]) ).
cnf(c_0_273,plain,
esk49_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_269,c_0_247]),c_0_260])]) ).
cnf(c_0_274,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_270]),c_0_230])]) ).
cnf(c_0_275,plain,
totalorderedP(nil),
i_0_122 ).
cnf(c_0_276,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
i_0_42 ).
cnf(c_0_277,negated_conjecture,
( neq(esk49_0,nil)
| esk50_0 != nil ),
inference(rw,[status(thm)],[c_0_271,c_0_232]) ).
cnf(c_0_278,negated_conjecture,
esk50_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(rw,[status(thm)],[c_0_272,c_0_273]),c_0_273]),c_0_273]),c_0_274]),c_0_273]),c_0_275])]) ).
cnf(c_0_279,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_276]) ).
cnf(c_0_280,negated_conjecture,
neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_277,c_0_273]),c_0_278])]) ).
cnf(c_0_281,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_279,c_0_280]),c_0_230])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC066+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n010.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 16:52:11 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 15.95/3.37 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d30-l6400-e0.15+coop-eprover66:
% 15.95/3.37 # 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: 57; version: 991; iters: 150)
% 15.95/3.37 # Preprocessing time : 0.916 s
% 15.95/3.37 # Presaturation interreduction done
% 15.95/3.37
% 15.95/3.37 # Proof found!
% 15.95/3.37 # SZS status Theorem
% 15.95/3.37 # SZS output start CNFRefutation
% See solution above
% 15.95/3.37 # Training examples: 0 positive, 0 negative
% 15.95/3.37
% 15.95/3.37 # -------------------------------------------------
% 15.95/3.37 # User time : 0.858 s
% 15.95/3.37 # System time : 0.102 s
% 15.95/3.37 # Total time : 0.960 s
% 15.95/3.37 # ...preprocessing : 0.916 s
% 15.95/3.37 # ...main loop : 0.044 s
% 15.95/3.37 # Maximum resident set size: 168176 pages
% 15.95/3.37
%------------------------------------------------------------------------------