TSTP Solution File: SWC178+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC178+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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:07 EDT 2022
% Result : Theorem 8.33s 2.50s
% Output : CNFRefutation 8.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 25
% Syntax : Number of clauses : 69 ( 34 unt; 6 nHn; 69 RR)
% Number of literals : 152 ( 34 equ; 83 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 55 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_193,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gppl6kfz/lgb.p',i_0_193) ).
cnf(i_0_199,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gppl6kfz/lgb.p',i_0_199) ).
cnf(i_0_192,negated_conjecture,
~ neq(esk52_0,esk53_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gppl6kfz/lgb.p',i_0_192) ).
cnf(i_0_48,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gppl6kfz/lgb.p',i_0_48) ).
cnf(i_0_196,negated_conjecture,
ssItem(esk53_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gppl6kfz/lgb.p',i_0_196) ).
cnf(i_0_197,negated_conjecture,
ssItem(esk52_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gppl6kfz/lgb.p',i_0_197) ).
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-gppl6kfz/lgb.p',i_0_155) ).
cnf(i_0_194,negated_conjecture,
ssList(esk55_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gppl6kfz/lgb.p',i_0_194) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gppl6kfz/lgb.p',i_0_43) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gppl6kfz/lgb.p',i_0_44) ).
cnf(i_0_58,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gppl6kfz/lgb.p',i_0_58) ).
cnf(i_0_195,negated_conjecture,
ssList(esk54_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gppl6kfz/lgb.p',i_0_195) ).
cnf(i_0_138,plain,
( duplicatefreeP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gppl6kfz/lgb.p',i_0_138) ).
cnf(i_0_99,plain,
( cons(esk31_1(X1),nil) = X1
| ~ ssList(X1)
| ~ singletonP(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gppl6kfz/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-gppl6kfz/lgb.p',i_0_100) ).
cnf(i_0_191,negated_conjecture,
( singletonP(esk50_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gppl6kfz/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-gppl6kfz/lgb.p',i_0_41) ).
cnf(i_0_201,negated_conjecture,
ssList(esk51_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gppl6kfz/lgb.p',i_0_201) ).
cnf(i_0_204,negated_conjecture,
ssList(esk48_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gppl6kfz/lgb.p',i_0_204) ).
cnf(i_0_33,plain,
( X1 != X2
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X6)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ duplicatefreeP(X6) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gppl6kfz/lgb.p',i_0_33) ).
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-gppl6kfz/lgb.p',i_0_154) ).
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-gppl6kfz/lgb.p',i_0_106) ).
cnf(i_0_198,negated_conjecture,
segmentP(esk51_0,esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gppl6kfz/lgb.p',i_0_198) ).
cnf(i_0_109,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gppl6kfz/lgb.p',i_0_109) ).
cnf(i_0_139,plain,
duplicatefreeP(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gppl6kfz/lgb.p',i_0_139) ).
cnf(c_0_230,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk48_0,
i_0_193 ).
cnf(c_0_231,negated_conjecture,
esk50_0 = esk48_0,
i_0_199 ).
cnf(c_0_232,negated_conjecture,
~ neq(esk52_0,esk53_0),
i_0_192 ).
cnf(c_0_233,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
i_0_48 ).
cnf(c_0_234,negated_conjecture,
ssItem(esk53_0),
i_0_196 ).
cnf(c_0_235,negated_conjecture,
ssItem(esk52_0),
i_0_197 ).
cnf(c_0_236,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk50_0,
inference(rw,[status(thm)],[c_0_230,c_0_231]) ).
cnf(c_0_237,negated_conjecture,
esk53_0 = esk52_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_232,c_0_233]),c_0_234]),c_0_235])]) ).
cnf(c_0_238,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_155 ).
cnf(c_0_239,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk52_0,nil)),esk55_0) = esk50_0,
inference(rw,[status(thm)],[c_0_236,c_0_237]) ).
cnf(c_0_240,negated_conjecture,
ssList(esk55_0),
i_0_194 ).
cnf(c_0_241,plain,
( app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0)) = esk50_0
| ~ ssList(app(esk54_0,cons(esk52_0,nil)))
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_238,c_0_239]),c_0_240])]) ).
cnf(c_0_242,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_243,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_244,plain,
( app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0)) = esk50_0
| ~ ssList(app(esk54_0,cons(esk52_0,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_241,c_0_242]),c_0_235]),c_0_243])]) ).
cnf(c_0_245,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_58 ).
cnf(c_0_246,negated_conjecture,
ssList(esk54_0),
i_0_195 ).
cnf(c_0_247,plain,
( app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0)) = esk50_0
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_244,c_0_245]),c_0_246])]) ).
cnf(c_0_248,plain,
( duplicatefreeP(cons(X1,nil))
| ~ ssItem(X1) ),
i_0_138 ).
cnf(c_0_249,plain,
( cons(esk31_1(X1),nil) = X1
| ~ ssList(X1)
| ~ singletonP(X1) ),
i_0_99 ).
cnf(c_0_250,plain,
( ssItem(esk31_1(X1))
| ~ ssList(X1)
| ~ singletonP(X1) ),
i_0_100 ).
cnf(c_0_251,negated_conjecture,
( singletonP(esk50_0)
| ~ neq(esk51_0,nil) ),
i_0_191 ).
cnf(c_0_252,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_253,negated_conjecture,
ssList(esk51_0),
i_0_201 ).
cnf(c_0_254,negated_conjecture,
ssList(esk48_0),
i_0_204 ).
cnf(c_0_255,plain,
( X1 != X2
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X6)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ duplicatefreeP(X6) ),
i_0_33 ).
cnf(c_0_256,plain,
app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_247,c_0_242]),c_0_235]),c_0_243])]) ).
cnf(c_0_257,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_154 ).
cnf(c_0_258,plain,
( duplicatefreeP(X1)
| ~ ssList(X1)
| ~ singletonP(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_248,c_0_249]),c_0_250]) ).
cnf(c_0_259,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_251,c_0_252]),c_0_243]),c_0_253])]) ).
cnf(c_0_260,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_254,c_0_231]) ).
cnf(c_0_261,plain,
( ~ duplicatefreeP(app(app(X1,cons(X2,X3)),cons(X2,X4)))
| ~ ssItem(X2)
| ~ ssList(app(app(X1,cons(X2,X3)),cons(X2,X4)))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_255])]) ).
cnf(c_0_262,plain,
app(app(esk54_0,cons(esk52_0,nil)),cons(esk52_0,esk55_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_256,c_0_257]),c_0_235]),c_0_240])]) ).
cnf(c_0_263,plain,
( X1 = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X2,X1)
| ~ segmentP(X1,X2) ),
i_0_106 ).
cnf(c_0_264,negated_conjecture,
segmentP(esk51_0,esk50_0),
i_0_198 ).
cnf(c_0_265,negated_conjecture,
( esk51_0 = nil
| duplicatefreeP(esk50_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_258,c_0_259]),c_0_260])]) ).
cnf(c_0_266,plain,
~ duplicatefreeP(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(spm,[status(thm)],[c_0_261,c_0_262]),c_0_235]),c_0_260]),c_0_240]),c_0_243]),c_0_246])]) ).
cnf(c_0_267,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_263,c_0_264]),c_0_253]),c_0_260])]) ).
cnf(c_0_268,negated_conjecture,
esk51_0 = nil,
inference(sr,[status(thm)],[c_0_265,c_0_266]) ).
cnf(c_0_269,negated_conjecture,
( esk50_0 = nil
| ~ segmentP(esk50_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_267,c_0_268]),c_0_268]) ).
cnf(c_0_270,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
i_0_109 ).
cnf(c_0_271,plain,
esk50_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_269,c_0_270]),c_0_260])]) ).
cnf(c_0_272,plain,
duplicatefreeP(nil),
i_0_139 ).
cnf(c_0_273,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_266,c_0_271]),c_0_272])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC178+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n012.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 : Sun Jun 12 21:25:12 EDT 2022
% 0.12/0.33 % 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
% 8.33/2.50 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.33/2.50 # No SInE strategy applied
% 8.33/2.50 # Trying AutoSched0 for 150 seconds
% 8.33/2.50 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 8.33/2.50 # and selection function SelectNewComplexAHP.
% 8.33/2.50 #
% 8.33/2.50 # Preprocessing time : 0.017 s
% 8.33/2.50 # Presaturation interreduction done
% 8.33/2.50
% 8.33/2.50 # Proof found!
% 8.33/2.50 # SZS status Theorem
% 8.33/2.50 # SZS output start CNFRefutation
% See solution above
% 8.33/2.50 # Training examples: 0 positive, 0 negative
% 8.33/2.50
% 8.33/2.50 # -------------------------------------------------
% 8.33/2.50 # User time : 0.048 s
% 8.33/2.50 # System time : 0.006 s
% 8.33/2.50 # Total time : 0.054 s
% 8.33/2.50 # Maximum resident set size: 7124 pages
% 8.33/2.50
%------------------------------------------------------------------------------