TSTP Solution File: SWC305+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC305+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:52 EDT 2022
% Result : Theorem 7.97s 2.38s
% Output : CNFRefutation 7.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 17
% Syntax : Number of clauses : 47 ( 27 unt; 0 nHn; 47 RR)
% Number of literals : 107 ( 15 equ; 67 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 39 ( 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/sandbox2/tmp/enigma-theBenchmark.p-pkcyi85x/lgb.p',i_0_192) ).
cnf(i_0_201,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pkcyi85x/lgb.p',i_0_201) ).
cnf(i_0_155,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pkcyi85x/lgb.p',i_0_155) ).
cnf(i_0_194,negated_conjecture,
ssList(esk55_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pkcyi85x/lgb.p',i_0_194) ).
cnf(i_0_195,negated_conjecture,
ssList(esk54_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pkcyi85x/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/sandbox2/tmp/enigma-theBenchmark.p-pkcyi85x/lgb.p',i_0_154) ).
cnf(i_0_197,negated_conjecture,
ssItem(esk52_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pkcyi85x/lgb.p',i_0_197) ).
cnf(i_0_193,negated_conjecture,
ssList(esk56_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pkcyi85x/lgb.p',i_0_193) ).
cnf(i_0_25,plain,
( lt(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X6)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ strictorderedP(X6) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pkcyi85x/lgb.p',i_0_25) ).
cnf(i_0_196,negated_conjecture,
ssItem(esk53_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pkcyi85x/lgb.p',i_0_196) ).
cnf(i_0_206,negated_conjecture,
ssList(esk48_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pkcyi85x/lgb.p',i_0_206) ).
cnf(i_0_69,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| ~ lt(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pkcyi85x/lgb.p',i_0_69) ).
cnf(i_0_191,negated_conjecture,
lt(esk53_0,esk52_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pkcyi85x/lgb.p',i_0_191) ).
cnf(i_0_199,negated_conjecture,
strictorderedP(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pkcyi85x/lgb.p',i_0_199) ).
cnf(i_0_58,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pkcyi85x/lgb.p',i_0_58) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pkcyi85x/lgb.p',i_0_43) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pkcyi85x/lgb.p',i_0_44) ).
cnf(c_0_224,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_225,negated_conjecture,
esk50_0 = esk48_0,
i_0_201 ).
cnf(c_0_226,negated_conjecture,
app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0) = esk50_0,
inference(rw,[status(thm)],[c_0_224,c_0_225]) ).
cnf(c_0_227,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_155 ).
cnf(c_0_228,negated_conjecture,
ssList(esk55_0),
i_0_194 ).
cnf(c_0_229,negated_conjecture,
ssList(esk54_0),
i_0_195 ).
cnf(c_0_230,negated_conjecture,
( app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0) = esk50_0
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_226,c_0_227]),c_0_228]),c_0_229])]) ).
cnf(c_0_231,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_154 ).
cnf(c_0_232,negated_conjecture,
ssItem(esk52_0),
i_0_197 ).
cnf(c_0_233,plain,
( app(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,nil)),esk56_0) = esk50_0
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_230,c_0_231]),c_0_232]),c_0_228])]) ).
cnf(c_0_234,negated_conjecture,
ssList(esk56_0),
i_0_193 ).
cnf(c_0_235,plain,
( lt(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X6)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ strictorderedP(X6) ),
i_0_25 ).
cnf(c_0_236,plain,
( app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0)) = esk50_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_227,c_0_233]),c_0_234])]) ).
cnf(c_0_237,negated_conjecture,
ssItem(esk53_0),
i_0_196 ).
cnf(c_0_238,negated_conjecture,
ssList(esk48_0),
i_0_206 ).
cnf(c_0_239,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| ~ lt(X2,X1) ),
i_0_69 ).
cnf(c_0_240,negated_conjecture,
lt(esk53_0,esk52_0),
i_0_191 ).
cnf(c_0_241,plain,
( lt(X1,X2)
| ~ strictorderedP(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_235]) ).
cnf(c_0_242,plain,
( app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,esk56_0)) = esk50_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_236,c_0_231]),c_0_237]),c_0_234])]) ).
cnf(c_0_243,negated_conjecture,
strictorderedP(esk50_0),
i_0_199 ).
cnf(c_0_244,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_238,c_0_225]) ).
cnf(c_0_245,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_239,c_0_240]),c_0_237]),c_0_232])]) ).
cnf(c_0_246,plain,
( ~ ssList(app(esk54_0,cons(esk52_0,esk55_0)))
| ~ ssList(cons(esk53_0,nil))
| ~ ssList(cons(esk52_0,nil)) ),
inference(sr,[status(thm)],[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_241,c_0_242]),c_0_243]),c_0_237]),c_0_232]),c_0_244]),c_0_234]),c_0_228]),c_0_229])]),c_0_245]) ).
cnf(c_0_247,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_58 ).
cnf(c_0_248,plain,
( ~ 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_246,c_0_247]),c_0_229])]) ).
cnf(c_0_249,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_250,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_251,plain,
( ~ 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_248,c_0_249]),c_0_237]),c_0_250])]) ).
cnf(c_0_252,plain,
~ ssList(cons(esk52_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_251,c_0_249]),c_0_232]),c_0_228])]) ).
cnf(c_0_253,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_252,c_0_249]),c_0_232]),c_0_250])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC305+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 12 08:29:24 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.97/2.38 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.97/2.38 # No SInE strategy applied
% 7.97/2.38 # Trying AutoSched0 for 150 seconds
% 7.97/2.38 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.97/2.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.97/2.38 #
% 7.97/2.38 # Preprocessing time : 0.024 s
% 7.97/2.38 # Presaturation interreduction done
% 7.97/2.38
% 7.97/2.38 # Proof found!
% 7.97/2.38 # SZS status Theorem
% 7.97/2.38 # SZS output start CNFRefutation
% See solution above
% 7.97/2.38 # Training examples: 0 positive, 0 negative
% 7.97/2.38
% 7.97/2.38 # -------------------------------------------------
% 7.97/2.38 # User time : 0.038 s
% 7.97/2.38 # System time : 0.004 s
% 7.97/2.38 # Total time : 0.042 s
% 7.97/2.38 # Maximum resident set size: 7124 pages
% 7.97/2.38
%------------------------------------------------------------------------------