TSTP Solution File: SWC222+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC222+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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:23 EDT 2022
% Result : Theorem 7.68s 2.42s
% Output : CNFRefutation 7.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of clauses : 44 ( 15 unt; 10 nHn; 44 RR)
% Number of literals : 113 ( 39 equ; 69 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-3 aty)
% Number of variables : 50 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_199,negated_conjecture,
( memberP(X1,esk52_3(X2,X1,X3))
| app(app(X1,cons(X2,nil)),X3) != esk48_0
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2_ubpdp_/lgb.p',i_0_199) ).
cnf(i_0_202,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2_ubpdp_/lgb.p',i_0_202) ).
cnf(i_0_79,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2_ubpdp_/lgb.p',i_0_79) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2_ubpdp_/lgb.p',i_0_44) ).
cnf(i_0_200,negated_conjecture,
( ssItem(esk52_3(X1,X2,X3))
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2_ubpdp_/lgb.p',i_0_200) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2_ubpdp_/lgb.p',i_0_60) ).
cnf(i_0_201,negated_conjecture,
nil != esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2_ubpdp_/lgb.p',i_0_201) ).
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-2_ubpdp_/lgb.p',i_0_154) ).
cnf(i_0_142,plain,
( nil = X1
| hd(X1) = esk34_1(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2_ubpdp_/lgb.p',i_0_142) ).
cnf(i_0_205,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2_ubpdp_/lgb.p',i_0_205) ).
cnf(i_0_144,plain,
( nil = X1
| tl(X1) = esk35_1(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2_ubpdp_/lgb.p',i_0_144) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2_ubpdp_/lgb.p',i_0_43) ).
cnf(i_0_147,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2_ubpdp_/lgb.p',i_0_147) ).
cnf(i_0_143,plain,
( nil = X1
| ssItem(esk34_1(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2_ubpdp_/lgb.p',i_0_143) ).
cnf(i_0_145,plain,
( nil = X1
| ssList(esk35_1(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2_ubpdp_/lgb.p',i_0_145) ).
cnf(c_0_221,negated_conjecture,
( memberP(X1,esk52_3(X2,X1,X3))
| app(app(X1,cons(X2,nil)),X3) != esk48_0
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
i_0_199 ).
cnf(c_0_222,negated_conjecture,
esk50_0 = esk48_0,
i_0_202 ).
cnf(c_0_223,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
i_0_79 ).
cnf(c_0_224,negated_conjecture,
( memberP(X1,esk52_3(X2,X1,X3))
| app(app(X1,cons(X2,nil)),X3) != esk50_0
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_221,c_0_222]) ).
cnf(c_0_225,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_226,negated_conjecture,
( ssItem(esk52_3(X1,X2,X3))
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_200 ).
cnf(c_0_227,plain,
( app(app(nil,cons(X1,nil)),X2) != esk50_0
| ~ ssItem(esk52_3(X1,nil,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_223,c_0_224]),c_0_225])]) ).
cnf(c_0_228,negated_conjecture,
( ssItem(esk52_3(X1,X2,X3))
| app(app(X2,cons(X1,nil)),X3) != esk50_0
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(rw,[status(thm)],[c_0_226,c_0_222]) ).
cnf(c_0_229,negated_conjecture,
( app(app(nil,cons(X1,nil)),X2) != esk50_0
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_227,c_0_228]),c_0_225])]) ).
cnf(c_0_230,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_231,negated_conjecture,
nil != esk48_0,
i_0_201 ).
cnf(c_0_232,plain,
( app(cons(X1,nil),X2) != esk50_0
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_229,c_0_230]) ).
cnf(c_0_233,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_154 ).
cnf(c_0_234,plain,
( nil = X1
| hd(X1) = esk34_1(X1)
| ~ ssList(X1) ),
i_0_142 ).
cnf(c_0_235,negated_conjecture,
ssList(esk50_0),
i_0_205 ).
cnf(c_0_236,negated_conjecture,
esk50_0 != nil,
inference(rw,[status(thm)],[c_0_231,c_0_222]) ).
cnf(c_0_237,plain,
( nil = X1
| tl(X1) = esk35_1(X1)
| ~ ssList(X1) ),
i_0_144 ).
cnf(c_0_238,plain,
( cons(X1,X2) != esk50_0
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_232,c_0_233]) ).
cnf(c_0_239,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_240,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
i_0_147 ).
cnf(c_0_241,plain,
( nil = X1
| ssItem(esk34_1(X1))
| ~ ssList(X1) ),
i_0_143 ).
cnf(c_0_242,negated_conjecture,
esk34_1(esk50_0) = hd(esk50_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_234,c_0_235]),c_0_236]) ).
cnf(c_0_243,plain,
( nil = X1
| ssList(esk35_1(X1))
| ~ ssList(X1) ),
i_0_145 ).
cnf(c_0_244,negated_conjecture,
esk35_1(esk50_0) = tl(esk50_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_235]),c_0_236]) ).
cnf(c_0_245,plain,
( cons(X1,X2) != esk50_0
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_238,c_0_239]),c_0_225])]) ).
cnf(c_0_246,negated_conjecture,
cons(hd(esk50_0),tl(esk50_0)) = esk50_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_240,c_0_235]),c_0_236]) ).
cnf(c_0_247,plain,
ssItem(hd(esk50_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_241,c_0_242]),c_0_235])]),c_0_236]) ).
cnf(c_0_248,plain,
ssList(tl(esk50_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_243,c_0_244]),c_0_235])]),c_0_236]) ).
cnf(c_0_249,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_245,c_0_246]),c_0_247]),c_0_248])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC222+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 : n010.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 08:12:26 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
% 7.68/2.42 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.68/2.42 # No SInE strategy applied
% 7.68/2.42 # Trying AutoSched0 for 150 seconds
% 7.68/2.42 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_RG_S04BN
% 7.68/2.42 # and selection function PSelectComplexExceptUniqMaxHorn.
% 7.68/2.42 #
% 7.68/2.42 # Preprocessing time : 0.025 s
% 7.68/2.42
% 7.68/2.42 # Proof found!
% 7.68/2.42 # SZS status Theorem
% 7.68/2.42 # SZS output start CNFRefutation
% See solution above
% 7.68/2.42 # Training examples: 0 positive, 0 negative
% 7.68/2.42
% 7.68/2.42 # -------------------------------------------------
% 7.68/2.42 # User time : 0.050 s
% 7.68/2.42 # System time : 0.007 s
% 7.68/2.42 # Total time : 0.058 s
% 7.68/2.42 # Maximum resident set size: 7124 pages
% 7.68/2.42
%------------------------------------------------------------------------------