TSTP Solution File: SWC310+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC310+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:14:54 EDT 2022
% Result : Theorem 7.95s 2.43s
% Output : CNFRefutation 7.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 21
% Syntax : Number of clauses : 66 ( 13 unt; 15 nHn; 66 RR)
% Number of literals : 170 ( 72 equ; 92 neg)
% Maximal clause size : 11 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_193,negated_conjecture,
( nil = esk49_0
| esk48_0 != X1
| hd(esk49_0) != X2
| tl(esk49_0) != X3
| app(X3,X4) != X1
| cons(X2,nil) != X4
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ neq(nil,esk49_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ncuwuxbj/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-ncuwuxbj/lgb.p',i_0_58) ).
cnf(i_0_202,negated_conjecture,
ssList(esk51_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ncuwuxbj/lgb.p',i_0_202) ).
cnf(i_0_201,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ncuwuxbj/lgb.p',i_0_201) ).
cnf(i_0_56,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ncuwuxbj/lgb.p',i_0_56) ).
cnf(i_0_196,negated_conjecture,
( app(cons(esk52_0,nil),esk53_0) = esk51_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ncuwuxbj/lgb.p',i_0_196) ).
cnf(i_0_198,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ncuwuxbj/lgb.p',i_0_198) ).
cnf(i_0_197,negated_conjecture,
( ssList(esk53_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ncuwuxbj/lgb.p',i_0_197) ).
cnf(i_0_54,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ncuwuxbj/lgb.p',i_0_54) ).
cnf(i_0_194,negated_conjecture,
( nil = esk49_0
| neq(esk49_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ncuwuxbj/lgb.p',i_0_194) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ncuwuxbj/lgb.p',i_0_41) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ncuwuxbj/lgb.p',i_0_44) ).
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-ncuwuxbj/lgb.p',i_0_154) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ncuwuxbj/lgb.p',i_0_43) ).
cnf(i_0_55,plain,
( hd(cons(X1,X2)) = X1
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ncuwuxbj/lgb.p',i_0_55) ).
cnf(i_0_195,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = esk50_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ncuwuxbj/lgb.p',i_0_195) ).
cnf(i_0_200,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ncuwuxbj/lgb.p',i_0_200) ).
cnf(i_0_57,plain,
( tl(cons(X1,X2)) = X2
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ncuwuxbj/lgb.p',i_0_57) ).
cnf(i_0_199,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ncuwuxbj/lgb.p',i_0_199) ).
cnf(i_0_42,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ncuwuxbj/lgb.p',i_0_42) ).
cnf(i_0_192,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ncuwuxbj/lgb.p',i_0_192) ).
cnf(c_0_224,negated_conjecture,
( nil = esk49_0
| esk48_0 != X1
| hd(esk49_0) != X2
| tl(esk49_0) != X3
| app(X3,X4) != X1
| cons(X2,nil) != X4
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ neq(nil,esk49_0) ),
i_0_193 ).
cnf(c_0_225,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_58 ).
cnf(c_0_226,negated_conjecture,
ssList(esk51_0),
i_0_202 ).
cnf(c_0_227,negated_conjecture,
esk49_0 = esk51_0,
i_0_201 ).
cnf(c_0_228,negated_conjecture,
( esk49_0 = nil
| app(tl(esk49_0),cons(hd(esk49_0),nil)) != esk48_0
| ~ ssList(cons(hd(esk49_0),nil))
| ~ ssList(tl(esk49_0))
| ~ ssItem(hd(esk49_0))
| ~ neq(nil,esk49_0) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_224])])])]),c_0_225]) ).
cnf(c_0_229,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
i_0_56 ).
cnf(c_0_230,negated_conjecture,
ssList(esk49_0),
inference(rw,[status(thm)],[c_0_226,c_0_227]) ).
cnf(c_0_231,negated_conjecture,
( app(cons(esk52_0,nil),esk53_0) = esk51_0
| ~ neq(esk51_0,nil) ),
i_0_196 ).
cnf(c_0_232,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_198 ).
cnf(c_0_233,negated_conjecture,
( ssList(esk53_0)
| ~ neq(esk51_0,nil) ),
i_0_197 ).
cnf(c_0_234,negated_conjecture,
( esk49_0 = nil
| app(tl(esk49_0),cons(hd(esk49_0),nil)) != esk48_0
| ~ ssList(cons(hd(esk49_0),nil))
| ~ ssItem(hd(esk49_0))
| ~ neq(nil,esk49_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_228,c_0_229]),c_0_230])]) ).
cnf(c_0_235,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
i_0_54 ).
cnf(c_0_236,negated_conjecture,
( app(cons(esk52_0,nil),esk53_0) = esk49_0
| ~ neq(esk49_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_231,c_0_227]),c_0_227]) ).
cnf(c_0_237,negated_conjecture,
( nil = esk49_0
| neq(esk49_0,nil) ),
i_0_194 ).
cnf(c_0_238,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk49_0,nil) ),
inference(rw,[status(thm)],[c_0_232,c_0_227]) ).
cnf(c_0_239,negated_conjecture,
( ssList(esk53_0)
| ~ neq(esk49_0,nil) ),
inference(rw,[status(thm)],[c_0_233,c_0_227]) ).
cnf(c_0_240,plain,
( esk49_0 = nil
| app(tl(esk49_0),cons(hd(esk49_0),nil)) != esk48_0
| ~ ssList(cons(hd(esk49_0),nil))
| ~ neq(nil,esk49_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_234,c_0_235]),c_0_230])]) ).
cnf(c_0_241,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_242,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_243,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_154 ).
cnf(c_0_244,negated_conjecture,
( app(cons(esk52_0,nil),esk53_0) = esk49_0
| esk49_0 = nil ),
inference(spm,[status(thm)],[c_0_236,c_0_237]) ).
cnf(c_0_245,negated_conjecture,
( esk49_0 = nil
| ssItem(esk52_0) ),
inference(spm,[status(thm)],[c_0_238,c_0_237]) ).
cnf(c_0_246,negated_conjecture,
( esk49_0 = nil
| ssList(esk53_0) ),
inference(spm,[status(thm)],[c_0_239,c_0_237]) ).
cnf(c_0_247,plain,
( esk49_0 = nil
| app(tl(esk49_0),cons(hd(esk49_0),nil)) != esk48_0
| ~ ssList(cons(hd(esk49_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_240,c_0_241]),c_0_230]),c_0_242])]) ).
cnf(c_0_248,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_249,plain,
( hd(cons(X1,X2)) = X1
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_55 ).
cnf(c_0_250,plain,
( cons(esk52_0,esk53_0) = esk49_0
| esk49_0 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_243,c_0_244]),c_0_245]),c_0_246]) ).
cnf(c_0_251,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = esk50_0
| ~ neq(esk51_0,nil) ),
i_0_195 ).
cnf(c_0_252,negated_conjecture,
esk50_0 = esk48_0,
i_0_200 ).
cnf(c_0_253,plain,
( esk49_0 = nil
| app(tl(esk49_0),cons(hd(esk49_0),nil)) != esk48_0
| ~ ssItem(hd(esk49_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_247,c_0_248]),c_0_242])]) ).
cnf(c_0_254,plain,
( hd(esk49_0) = esk52_0
| esk49_0 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_249,c_0_250]),c_0_245]),c_0_246]) ).
cnf(c_0_255,plain,
( tl(cons(X1,X2)) = X2
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_57 ).
cnf(c_0_256,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = esk48_0
| ~ neq(esk49_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_251,c_0_252]),c_0_227]) ).
cnf(c_0_257,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
i_0_199 ).
cnf(c_0_258,plain,
( esk49_0 = nil
| app(tl(esk49_0),cons(esk52_0,nil)) != esk48_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_253,c_0_254]),c_0_245]) ).
cnf(c_0_259,plain,
( tl(esk49_0) = esk53_0
| esk49_0 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_255,c_0_250]),c_0_245]),c_0_246]) ).
cnf(c_0_260,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = esk48_0
| esk49_0 = nil ),
inference(spm,[status(thm)],[c_0_256,c_0_237]) ).
cnf(c_0_261,negated_conjecture,
( esk48_0 = nil
| esk49_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_257,c_0_252]),c_0_227]) ).
cnf(c_0_262,plain,
esk49_0 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_258,c_0_259]),c_0_260]) ).
cnf(c_0_263,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
i_0_42 ).
cnf(c_0_264,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
i_0_192 ).
cnf(c_0_265,negated_conjecture,
esk48_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_261,c_0_262])]) ).
cnf(c_0_266,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_263]) ).
cnf(c_0_267,negated_conjecture,
neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_264,c_0_262]),c_0_265])]) ).
cnf(c_0_268,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_266,c_0_267]),c_0_242])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC310+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n014.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 23:02:39 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected SinE mode:
% 0.19/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.95/2.43 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.95/2.43 # No SInE strategy applied
% 7.95/2.43 # Trying AutoSched0 for 150 seconds
% 7.95/2.43 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 7.95/2.43 # and selection function SelectNewComplexAHP.
% 7.95/2.43 #
% 7.95/2.43 # Preprocessing time : 0.013 s
% 7.95/2.43 # Presaturation interreduction done
% 7.95/2.43
% 7.95/2.43 # Proof found!
% 7.95/2.43 # SZS status Theorem
% 7.95/2.43 # SZS output start CNFRefutation
% See solution above
% 7.95/2.43 # Training examples: 0 positive, 0 negative
% 7.95/2.43
% 7.95/2.43 # -------------------------------------------------
% 7.95/2.43 # User time : 0.024 s
% 7.95/2.43 # System time : 0.006 s
% 7.95/2.43 # Total time : 0.030 s
% 7.95/2.43 # Maximum resident set size: 7124 pages
% 7.95/2.43
%------------------------------------------------------------------------------