TSTP Solution File: SWC162+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC162+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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:00 EDT 2022
% Result : Theorem 7.36s 2.29s
% Output : CNFRefutation 7.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 28
% Syntax : Number of clauses : 81 ( 39 unt; 3 nHn; 81 RR)
% Number of literals : 193 ( 32 equ; 116 neg)
% Maximal clause size : 10 ( 2 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 72 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_196,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-bb00s4rb/lgb.p',i_0_196) ).
cnf(i_0_203,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bb00s4rb/lgb.p',i_0_203) ).
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-bb00s4rb/lgb.p',i_0_155) ).
cnf(i_0_198,negated_conjecture,
ssList(esk55_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bb00s4rb/lgb.p',i_0_198) ).
cnf(i_0_199,negated_conjecture,
ssList(esk54_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bb00s4rb/lgb.p',i_0_199) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bb00s4rb/lgb.p',i_0_43) ).
cnf(i_0_201,negated_conjecture,
ssItem(esk52_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bb00s4rb/lgb.p',i_0_201) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bb00s4rb/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-bb00s4rb/lgb.p',i_0_154) ).
cnf(i_0_197,negated_conjecture,
ssList(esk56_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bb00s4rb/lgb.p',i_0_197) ).
cnf(i_0_200,negated_conjecture,
ssItem(esk53_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bb00s4rb/lgb.p',i_0_200) ).
cnf(i_0_58,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bb00s4rb/lgb.p',i_0_58) ).
cnf(i_0_173,plain,
( app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X6)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ cyclefreeP(X6)
| ~ leq(X4,X2)
| ~ leq(X2,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bb00s4rb/lgb.p',i_0_173) ).
cnf(i_0_208,negated_conjecture,
ssList(esk48_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bb00s4rb/lgb.p',i_0_208) ).
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/sandbox2/tmp/enigma-theBenchmark.p-bb00s4rb/lgb.p',i_0_17) ).
cnf(i_0_195,negated_conjecture,
leq(esk53_0,esk52_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bb00s4rb/lgb.p',i_0_195) ).
cnf(i_0_112,plain,
( cyclefreeP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bb00s4rb/lgb.p',i_0_112) ).
cnf(i_0_99,plain,
( cons(esk31_1(X1),nil) = X1
| ~ ssList(X1)
| ~ singletonP(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bb00s4rb/lgb.p',i_0_99) ).
cnf(i_0_100,plain,
( ssItem(esk31_1(X1))
| ~ ssList(X1)
| ~ singletonP(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bb00s4rb/lgb.p',i_0_100) ).
cnf(i_0_121,plain,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bb00s4rb/lgb.p',i_0_121) ).
cnf(i_0_191,negated_conjecture,
( singletonP(esk50_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bb00s4rb/lgb.p',i_0_191) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bb00s4rb/lgb.p',i_0_41) ).
cnf(i_0_205,negated_conjecture,
ssList(esk51_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bb00s4rb/lgb.p',i_0_205) ).
cnf(i_0_106,plain,
( X1 = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X2,X1)
| ~ segmentP(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bb00s4rb/lgb.p',i_0_106) ).
cnf(i_0_202,negated_conjecture,
segmentP(esk51_0,esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bb00s4rb/lgb.p',i_0_202) ).
cnf(i_0_109,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bb00s4rb/lgb.p',i_0_109) ).
cnf(i_0_116,plain,
cyclefreeP(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bb00s4rb/lgb.p',i_0_116) ).
cnf(i_0_122,plain,
totalorderedP(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bb00s4rb/lgb.p',i_0_122) ).
cnf(c_0_237,negated_conjecture,
app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0) = esk48_0,
i_0_196 ).
cnf(c_0_238,negated_conjecture,
esk50_0 = esk48_0,
i_0_203 ).
cnf(c_0_239,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_237,c_0_238]) ).
cnf(c_0_240,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_155 ).
cnf(c_0_241,negated_conjecture,
ssList(esk55_0),
i_0_198 ).
cnf(c_0_242,negated_conjecture,
ssList(esk54_0),
i_0_199 ).
cnf(c_0_243,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_239,c_0_240]),c_0_241]),c_0_242])]) ).
cnf(c_0_244,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_245,negated_conjecture,
ssItem(esk52_0),
i_0_201 ).
cnf(c_0_246,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_247,plain,
app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0) = esk50_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_245]),c_0_246])]) ).
cnf(c_0_248,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_154 ).
cnf(c_0_249,plain,
app(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,nil)),esk56_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_247,c_0_248]),c_0_245]),c_0_241])]) ).
cnf(c_0_250,negated_conjecture,
ssList(esk56_0),
i_0_197 ).
cnf(c_0_251,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)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_240,c_0_249]),c_0_250])]) ).
cnf(c_0_252,negated_conjecture,
ssItem(esk53_0),
i_0_200 ).
cnf(c_0_253,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))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_251,c_0_244]),c_0_252]),c_0_246])]) ).
cnf(c_0_254,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_58 ).
cnf(c_0_255,plain,
( app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0)) = esk50_0
| ~ ssList(cons(esk52_0,esk55_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_253,c_0_254]),c_0_242])]) ).
cnf(c_0_256,plain,
( app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X6)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ cyclefreeP(X6)
| ~ leq(X4,X2)
| ~ leq(X2,X4) ),
i_0_173 ).
cnf(c_0_257,plain,
app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_255,c_0_244]),c_0_245]),c_0_241])]) ).
cnf(c_0_258,negated_conjecture,
ssList(esk48_0),
i_0_208 ).
cnf(c_0_259,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_260,plain,
( ~ cyclefreeP(app(app(X1,cons(X2,X3)),cons(X4,X5)))
| ~ leq(X4,X2)
| ~ leq(X2,X4)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ ssList(app(app(X1,cons(X2,X3)),cons(X4,X5)))
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_256]) ).
cnf(c_0_261,plain,
app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,esk56_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_257,c_0_248]),c_0_252]),c_0_250])]) ).
cnf(c_0_262,negated_conjecture,
leq(esk53_0,esk52_0),
i_0_195 ).
cnf(c_0_263,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_258,c_0_238]) ).
cnf(c_0_264,plain,
( cyclefreeP(cons(X1,nil))
| ~ ssItem(X1) ),
i_0_112 ).
cnf(c_0_265,plain,
( cons(esk31_1(X1),nil) = X1
| ~ ssList(X1)
| ~ singletonP(X1) ),
i_0_99 ).
cnf(c_0_266,plain,
( ssItem(esk31_1(X1))
| ~ ssList(X1)
| ~ singletonP(X1) ),
i_0_100 ).
cnf(c_0_267,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_259]) ).
cnf(c_0_268,plain,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
i_0_121 ).
cnf(c_0_269,plain,
( ~ cyclefreeP(esk50_0)
| ~ leq(esk52_0,esk53_0) ),
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_260,c_0_261]),c_0_262]),c_0_252]),c_0_245]),c_0_263]),c_0_250]),c_0_241]),c_0_242])]) ).
cnf(c_0_270,plain,
( cyclefreeP(X1)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_264,c_0_265]),c_0_266]) ).
cnf(c_0_271,negated_conjecture,
( singletonP(esk50_0)
| ~ neq(esk51_0,nil) ),
i_0_191 ).
cnf(c_0_272,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_273,negated_conjecture,
ssList(esk51_0),
i_0_205 ).
cnf(c_0_274,plain,
( leq(esk52_0,esk53_0)
| ~ totalorderedP(esk50_0) ),
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(spm,[status(thm)],[c_0_267,c_0_261]),c_0_252]),c_0_245]),c_0_263]),c_0_250]),c_0_241]),c_0_242])]) ).
cnf(c_0_275,plain,
( totalorderedP(X1)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_268,c_0_265]),c_0_266]) ).
cnf(c_0_276,plain,
( ~ singletonP(esk50_0)
| ~ leq(esk52_0,esk53_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_269,c_0_270]),c_0_263])]) ).
cnf(c_0_277,plain,
( X1 = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X2,X1)
| ~ segmentP(X1,X2) ),
i_0_106 ).
cnf(c_0_278,negated_conjecture,
segmentP(esk51_0,esk50_0),
i_0_202 ).
cnf(c_0_279,negated_conjecture,
( esk51_0 = nil
| singletonP(esk50_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_271,c_0_272]),c_0_246]),c_0_273])]) ).
cnf(c_0_280,plain,
~ singletonP(esk50_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_274,c_0_275]),c_0_263])]),c_0_276]) ).
cnf(c_0_281,negated_conjecture,
( esk51_0 = esk50_0
| ~ segmentP(esk50_0,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_277,c_0_278]),c_0_273]),c_0_263])]) ).
cnf(c_0_282,negated_conjecture,
esk51_0 = nil,
inference(sr,[status(thm)],[c_0_279,c_0_280]) ).
cnf(c_0_283,negated_conjecture,
( esk50_0 = nil
| ~ segmentP(esk50_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_281,c_0_282]),c_0_282]) ).
cnf(c_0_284,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
i_0_109 ).
cnf(c_0_285,plain,
esk50_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_283,c_0_284]),c_0_263])]) ).
cnf(c_0_286,plain,
cyclefreeP(nil),
i_0_116 ).
cnf(c_0_287,plain,
totalorderedP(nil),
i_0_122 ).
cnf(c_0_288,plain,
~ leq(esk52_0,esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_269,c_0_285]),c_0_286])]) ).
cnf(c_0_289,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_274,c_0_285]),c_0_287])]),c_0_288]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC162+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n022.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 14:18:20 EDT 2022
% 0.18/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.36/2.29 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.36/2.29 # No SInE strategy applied
% 7.36/2.29 # Trying AutoSched0 for 150 seconds
% 7.36/2.29 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 7.36/2.29 # and selection function SelectNewComplexAHP.
% 7.36/2.29 #
% 7.36/2.29 # Preprocessing time : 0.027 s
% 7.36/2.29 # Presaturation interreduction done
% 7.36/2.29
% 7.36/2.29 # Proof found!
% 7.36/2.29 # SZS status Theorem
% 7.36/2.29 # SZS output start CNFRefutation
% See solution above
% 7.36/2.29 # Training examples: 0 positive, 0 negative
% 7.36/2.29
% 7.36/2.29 # -------------------------------------------------
% 7.36/2.29 # User time : 0.064 s
% 7.36/2.29 # System time : 0.010 s
% 7.36/2.29 # Total time : 0.074 s
% 7.36/2.29 # Maximum resident set size: 7116 pages
% 7.36/2.29
%------------------------------------------------------------------------------