TSTP Solution File: SWC300+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC300+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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:50 EDT 2022
% Result : Theorem 8.02s 2.42s
% Output : CNFRefutation 8.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 18
% Syntax : Number of clauses : 51 ( 28 unt; 2 nHn; 51 RR)
% Number of literals : 123 ( 17 equ; 74 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_192,negated_conjecture,
app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0) = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l7xtciwg/lgb.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/sandbox/tmp/enigma-theBenchmark.p-l7xtciwg/lgb.p',i_0_155) ).
cnf(i_0_194,negated_conjecture,
ssList(esk55_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l7xtciwg/lgb.p',i_0_194) ).
cnf(i_0_195,negated_conjecture,
ssList(esk54_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l7xtciwg/lgb.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-l7xtciwg/lgb.p',i_0_154) ).
cnf(i_0_197,negated_conjecture,
ssItem(esk52_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l7xtciwg/lgb.p',i_0_197) ).
cnf(i_0_193,negated_conjecture,
ssList(esk56_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l7xtciwg/lgb.p',i_0_193) ).
cnf(i_0_17,plain,
( leq(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X6)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ totalorderedP(X6) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l7xtciwg/lgb.p',i_0_17) ).
cnf(i_0_196,negated_conjecture,
ssItem(esk53_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l7xtciwg/lgb.p',i_0_196) ).
cnf(i_0_198,negated_conjecture,
totalorderedP(esk50_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l7xtciwg/lgb.p',i_0_198) ).
cnf(i_0_199,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l7xtciwg/lgb.p',i_0_199) ).
cnf(i_0_204,negated_conjecture,
ssList(esk48_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l7xtciwg/lgb.p',i_0_204) ).
cnf(i_0_58,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l7xtciwg/lgb.p',i_0_58) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l7xtciwg/lgb.p',i_0_43) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l7xtciwg/lgb.p',i_0_44) ).
cnf(i_0_69,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| ~ lt(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l7xtciwg/lgb.p',i_0_69) ).
cnf(i_0_191,negated_conjecture,
lt(esk53_0,esk52_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l7xtciwg/lgb.p',i_0_191) ).
cnf(i_0_177,plain,
( X1 = X2
| lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l7xtciwg/lgb.p',i_0_177) ).
cnf(c_0_223,negated_conjecture,
app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0) = esk48_0,
i_0_192 ).
cnf(c_0_224,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_155 ).
cnf(c_0_225,negated_conjecture,
ssList(esk55_0),
i_0_194 ).
cnf(c_0_226,negated_conjecture,
ssList(esk54_0),
i_0_195 ).
cnf(c_0_227,negated_conjecture,
( app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0) = esk48_0
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_223,c_0_224]),c_0_225]),c_0_226])]) ).
cnf(c_0_228,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_154 ).
cnf(c_0_229,negated_conjecture,
ssItem(esk52_0),
i_0_197 ).
cnf(c_0_230,plain,
( app(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,nil)),esk56_0) = esk48_0
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_227,c_0_228]),c_0_229]),c_0_225])]) ).
cnf(c_0_231,negated_conjecture,
ssList(esk56_0),
i_0_193 ).
cnf(c_0_232,plain,
( leq(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X6)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ totalorderedP(X6) ),
i_0_17 ).
cnf(c_0_233,plain,
( app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0)) = esk48_0
| ~ ssList(app(esk54_0,cons(esk52_0,esk55_0)))
| ~ ssList(cons(esk53_0,nil))
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_224,c_0_230]),c_0_231])]) ).
cnf(c_0_234,negated_conjecture,
ssItem(esk53_0),
i_0_196 ).
cnf(c_0_235,negated_conjecture,
totalorderedP(esk50_0),
i_0_198 ).
cnf(c_0_236,negated_conjecture,
esk50_0 = esk48_0,
i_0_199 ).
cnf(c_0_237,plain,
( leq(X1,X2)
| ~ totalorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(er,[status(thm)],[c_0_232]) ).
cnf(c_0_238,plain,
( app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,esk56_0)) = esk48_0
| ~ ssList(app(esk54_0,cons(esk52_0,esk55_0)))
| ~ ssList(cons(esk53_0,nil))
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_233,c_0_228]),c_0_234]),c_0_231])]) ).
cnf(c_0_239,negated_conjecture,
totalorderedP(esk48_0),
inference(rw,[status(thm)],[c_0_235,c_0_236]) ).
cnf(c_0_240,negated_conjecture,
ssList(esk48_0),
i_0_204 ).
cnf(c_0_241,plain,
( leq(esk52_0,esk53_0)
| ~ ssList(app(esk54_0,cons(esk52_0,esk55_0)))
| ~ ssList(cons(esk53_0,nil))
| ~ ssList(cons(esk52_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)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_238]),c_0_239]),c_0_234]),c_0_229]),c_0_240]),c_0_231]),c_0_225]),c_0_226])]) ).
cnf(c_0_242,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_58 ).
cnf(c_0_243,plain,
( leq(esk52_0,esk53_0)
| ~ ssList(cons(esk53_0,nil))
| ~ ssList(cons(esk52_0,nil))
| ~ ssList(cons(esk52_0,esk55_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_241,c_0_242]),c_0_226])]) ).
cnf(c_0_244,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_245,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_246,plain,
( leq(esk52_0,esk53_0)
| ~ ssList(cons(esk52_0,nil))
| ~ ssList(cons(esk52_0,esk55_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_243,c_0_244]),c_0_234]),c_0_245])]) ).
cnf(c_0_247,plain,
( leq(esk52_0,esk53_0)
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_246,c_0_244]),c_0_229]),c_0_225])]) ).
cnf(c_0_248,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| ~ lt(X2,X1) ),
i_0_69 ).
cnf(c_0_249,negated_conjecture,
lt(esk53_0,esk52_0),
i_0_191 ).
cnf(c_0_250,plain,
( X1 = X2
| lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ leq(X1,X2) ),
i_0_177 ).
cnf(c_0_251,plain,
leq(esk52_0,esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_247,c_0_244]),c_0_229]),c_0_245])]) ).
cnf(c_0_252,negated_conjecture,
~ lt(esk52_0,esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_248,c_0_249]),c_0_234]),c_0_229])]) ).
cnf(c_0_253,plain,
esk53_0 = esk52_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_250,c_0_251]),c_0_234]),c_0_229])]),c_0_252]) ).
cnf(c_0_254,negated_conjecture,
~ lt(esk52_0,esk52_0),
inference(rw,[status(thm)],[c_0_252,c_0_253]) ).
cnf(c_0_255,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_249,c_0_253]),c_0_254]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC300+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 : n027.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 : Mon Jun 13 00:31:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox/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
% 8.02/2.42 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.02/2.42 # No SInE strategy applied
% 8.02/2.42 # Trying AutoSched0 for 150 seconds
% 8.02/2.42 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 8.02/2.42 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.02/2.42 #
% 8.02/2.42 # Preprocessing time : 0.025 s
% 8.02/2.42
% 8.02/2.42 # Proof found!
% 8.02/2.42 # SZS status Theorem
% 8.02/2.42 # SZS output start CNFRefutation
% See solution above
% 8.02/2.42 # Training examples: 0 positive, 0 negative
% 8.02/2.42
% 8.02/2.42 # -------------------------------------------------
% 8.02/2.42 # User time : 0.048 s
% 8.02/2.42 # System time : 0.005 s
% 8.02/2.42 # Total time : 0.054 s
% 8.02/2.42 # Maximum resident set size: 7128 pages
% 8.02/2.42
%------------------------------------------------------------------------------