TSTP Solution File: SWC176+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC176+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n006.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:05 EDT 2022
% Result : Theorem 7.04s 2.35s
% Output : CNFRefutation 7.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 17
% Syntax : Number of clauses : 47 ( 25 unt; 3 nHn; 47 RR)
% Number of literals : 113 ( 17 equ; 70 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 44 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_193,negated_conjecture,
app(app(app(esk56_0,cons(esk54_0,nil)),cons(esk55_0,nil)),esk57_0) = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xdt1313b/lgb.p',i_0_193) ).
cnf(i_0_204,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xdt1313b/lgb.p',i_0_204) ).
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-xdt1313b/lgb.p',i_0_155) ).
cnf(i_0_194,negated_conjecture,
ssList(esk57_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xdt1313b/lgb.p',i_0_194) ).
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-xdt1313b/lgb.p',i_0_25) ).
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-xdt1313b/lgb.p',i_0_154) ).
cnf(i_0_196,negated_conjecture,
ssItem(esk55_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xdt1313b/lgb.p',i_0_196) ).
cnf(i_0_209,negated_conjecture,
ssList(esk48_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xdt1313b/lgb.p',i_0_209) ).
cnf(i_0_200,negated_conjecture,
strictorderedP(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xdt1313b/lgb.p',i_0_200) ).
cnf(i_0_197,negated_conjecture,
ssItem(esk54_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xdt1313b/lgb.p',i_0_197) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xdt1313b/lgb.p',i_0_44) ).
cnf(i_0_195,negated_conjecture,
ssList(esk56_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xdt1313b/lgb.p',i_0_195) ).
cnf(i_0_58,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xdt1313b/lgb.p',i_0_58) ).
cnf(i_0_48,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xdt1313b/lgb.p',i_0_48) ).
cnf(i_0_69,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| ~ lt(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xdt1313b/lgb.p',i_0_69) ).
cnf(i_0_192,negated_conjecture,
~ neq(esk54_0,esk55_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xdt1313b/lgb.p',i_0_192) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xdt1313b/lgb.p',i_0_43) ).
cnf(c_0_227,negated_conjecture,
app(app(app(esk56_0,cons(esk54_0,nil)),cons(esk55_0,nil)),esk57_0) = esk48_0,
i_0_193 ).
cnf(c_0_228,negated_conjecture,
esk50_0 = esk48_0,
i_0_204 ).
cnf(c_0_229,negated_conjecture,
app(app(app(esk56_0,cons(esk54_0,nil)),cons(esk55_0,nil)),esk57_0) = esk50_0,
inference(rw,[status(thm)],[c_0_227,c_0_228]) ).
cnf(c_0_230,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_155 ).
cnf(c_0_231,negated_conjecture,
ssList(esk57_0),
i_0_194 ).
cnf(c_0_232,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_233,negated_conjecture,
( app(app(esk56_0,cons(esk54_0,nil)),app(cons(esk55_0,nil),esk57_0)) = esk50_0
| ~ ssList(app(esk56_0,cons(esk54_0,nil)))
| ~ ssList(cons(esk55_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_229,c_0_230]),c_0_231])]) ).
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,
ssItem(esk55_0),
i_0_196 ).
cnf(c_0_236,negated_conjecture,
ssList(esk48_0),
i_0_209 ).
cnf(c_0_237,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_232]) ).
cnf(c_0_238,plain,
( app(app(esk56_0,cons(esk54_0,nil)),cons(esk55_0,esk57_0)) = esk50_0
| ~ ssList(app(esk56_0,cons(esk54_0,nil)))
| ~ ssList(cons(esk55_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_235]),c_0_231])]) ).
cnf(c_0_239,negated_conjecture,
strictorderedP(esk50_0),
i_0_200 ).
cnf(c_0_240,negated_conjecture,
ssItem(esk54_0),
i_0_197 ).
cnf(c_0_241,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_236,c_0_228]) ).
cnf(c_0_242,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_243,negated_conjecture,
ssList(esk56_0),
i_0_195 ).
cnf(c_0_244,plain,
( lt(esk54_0,esk55_0)
| ~ ssList(app(esk56_0,cons(esk54_0,nil)))
| ~ ssList(cons(esk55_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_235]),c_0_240]),c_0_241]),c_0_231]),c_0_242]),c_0_243])]) ).
cnf(c_0_245,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_58 ).
cnf(c_0_246,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
i_0_48 ).
cnf(c_0_247,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| ~ lt(X2,X1) ),
i_0_69 ).
cnf(c_0_248,plain,
( lt(esk54_0,esk55_0)
| ~ ssList(cons(esk55_0,nil))
| ~ ssList(cons(esk54_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_244,c_0_245]),c_0_243])]) ).
cnf(c_0_249,negated_conjecture,
( X1 = esk55_0
| neq(X1,esk55_0)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_246,c_0_235]) ).
cnf(c_0_250,negated_conjecture,
~ neq(esk54_0,esk55_0),
i_0_192 ).
cnf(c_0_251,plain,
( ~ lt(esk55_0,esk54_0)
| ~ ssList(cons(esk55_0,nil))
| ~ ssList(cons(esk54_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_247,c_0_248]),c_0_240]),c_0_235])]) ).
cnf(c_0_252,negated_conjecture,
esk55_0 = esk54_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_249,c_0_240]),c_0_250]) ).
cnf(c_0_253,plain,
( ~ lt(esk54_0,esk54_0)
| ~ ssList(cons(esk54_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_251,c_0_252]),c_0_252])]) ).
cnf(c_0_254,plain,
~ ssList(cons(esk54_0,nil)),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_248,c_0_252]),c_0_252])]),c_0_253]) ).
cnf(c_0_255,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_256,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_254,c_0_255]),c_0_240]),c_0_242])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC176+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n006.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jun 11 21:19:29 EDT 2022
% 0.13/0.34 % 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
% 7.04/2.35 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.04/2.35 # No SInE strategy applied
% 7.04/2.35 # Trying AutoSched0 for 150 seconds
% 7.04/2.35 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S04AN
% 7.04/2.35 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.04/2.35 #
% 7.04/2.35 # Preprocessing time : 0.022 s
% 7.04/2.35 # Presaturation interreduction done
% 7.04/2.35
% 7.04/2.35 # Proof found!
% 7.04/2.35 # SZS status Theorem
% 7.04/2.35 # SZS output start CNFRefutation
% See solution above
% 7.04/2.35 # Training examples: 0 positive, 0 negative
% 7.04/2.35
% 7.04/2.35 # -------------------------------------------------
% 7.04/2.35 # User time : 0.033 s
% 7.04/2.35 # System time : 0.005 s
% 7.04/2.35 # Total time : 0.038 s
% 7.04/2.35 # Maximum resident set size: 7120 pages
% 7.04/2.35
%------------------------------------------------------------------------------