TSTP Solution File: SWC279+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC279+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:43 EDT 2022
% Result : Theorem 7.54s 2.76s
% Output : CNFRefutation 7.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 12
% Syntax : Number of clauses : 31 ( 15 unt; 2 nHn; 31 RR)
% Number of literals : 79 ( 10 equ; 49 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_200,negated_conjecture,
( leq(X1,X2)
| app(app(X3,cons(X2,nil)),X4) != esk50_0
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ memberP(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k_d1pgqj/lgb.p',i_0_200) ).
cnf(i_0_202,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k_d1pgqj/lgb.p',i_0_202) ).
cnf(i_0_196,negated_conjecture,
app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k_d1pgqj/lgb.p',i_0_196) ).
cnf(i_0_199,negated_conjecture,
ssItem(esk52_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k_d1pgqj/lgb.p',i_0_199) ).
cnf(i_0_197,negated_conjecture,
ssList(esk54_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k_d1pgqj/lgb.p',i_0_197) ).
cnf(i_0_198,negated_conjecture,
ssList(esk53_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k_d1pgqj/lgb.p',i_0_198) ).
cnf(i_0_201,negated_conjecture,
( leq(X1,X2)
| app(app(X3,cons(X1,nil)),X4) != esk50_0
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ memberP(X4,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k_d1pgqj/lgb.p',i_0_201) ).
cnf(i_0_191,negated_conjecture,
( ~ leq(esk52_0,esk55_0)
| ~ leq(esk55_0,esk52_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k_d1pgqj/lgb.p',i_0_191) ).
cnf(i_0_195,negated_conjecture,
ssItem(esk55_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k_d1pgqj/lgb.p',i_0_195) ).
cnf(i_0_193,negated_conjecture,
( memberP(esk53_0,esk55_0)
| ~ leq(esk52_0,esk55_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k_d1pgqj/lgb.p',i_0_193) ).
cnf(i_0_192,negated_conjecture,
( memberP(esk54_0,esk55_0)
| ~ leq(esk55_0,esk52_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k_d1pgqj/lgb.p',i_0_192) ).
cnf(i_0_194,negated_conjecture,
( memberP(esk53_0,esk55_0)
| memberP(esk54_0,esk55_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k_d1pgqj/lgb.p',i_0_194) ).
cnf(c_0_215,negated_conjecture,
( leq(X1,X2)
| app(app(X3,cons(X2,nil)),X4) != esk50_0
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ memberP(X3,X1) ),
i_0_200 ).
cnf(c_0_216,negated_conjecture,
esk50_0 = esk48_0,
i_0_202 ).
cnf(c_0_217,negated_conjecture,
( leq(X1,X2)
| app(app(X3,cons(X2,nil)),X4) != esk48_0
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ memberP(X3,X1) ),
inference(rw,[status(thm)],[c_0_215,c_0_216]) ).
cnf(c_0_218,negated_conjecture,
app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk48_0,
i_0_196 ).
cnf(c_0_219,negated_conjecture,
ssItem(esk52_0),
i_0_199 ).
cnf(c_0_220,negated_conjecture,
ssList(esk54_0),
i_0_197 ).
cnf(c_0_221,negated_conjecture,
ssList(esk53_0),
i_0_198 ).
cnf(c_0_222,negated_conjecture,
( leq(X1,X2)
| app(app(X3,cons(X1,nil)),X4) != esk50_0
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ memberP(X4,X2) ),
i_0_201 ).
cnf(c_0_223,negated_conjecture,
( ~ leq(esk52_0,esk55_0)
| ~ leq(esk55_0,esk52_0) ),
i_0_191 ).
cnf(c_0_224,negated_conjecture,
( leq(X1,esk52_0)
| ~ ssItem(X1)
| ~ memberP(esk53_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_217,c_0_218]),c_0_219]),c_0_220]),c_0_221])]) ).
cnf(c_0_225,negated_conjecture,
ssItem(esk55_0),
i_0_195 ).
cnf(c_0_226,negated_conjecture,
( memberP(esk53_0,esk55_0)
| ~ leq(esk52_0,esk55_0) ),
i_0_193 ).
cnf(c_0_227,negated_conjecture,
( leq(X1,X2)
| app(app(X3,cons(X1,nil)),X4) != esk48_0
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ memberP(X4,X2) ),
inference(rw,[status(thm)],[c_0_222,c_0_216]) ).
cnf(c_0_228,negated_conjecture,
( memberP(esk54_0,esk55_0)
| ~ leq(esk55_0,esk52_0) ),
i_0_192 ).
cnf(c_0_229,negated_conjecture,
( memberP(esk53_0,esk55_0)
| memberP(esk54_0,esk55_0) ),
i_0_194 ).
cnf(c_0_230,negated_conjecture,
~ leq(esk52_0,esk55_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_223,c_0_224]),c_0_225])]),c_0_226]) ).
cnf(c_0_231,negated_conjecture,
( leq(esk52_0,X1)
| ~ ssItem(X1)
| ~ memberP(esk54_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_227,c_0_218]),c_0_219]),c_0_220]),c_0_221])]) ).
cnf(c_0_232,negated_conjecture,
memberP(esk54_0,esk55_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_228,c_0_224]),c_0_225])]),c_0_229]) ).
cnf(c_0_233,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_230,c_0_231]),c_0_225]),c_0_232])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWC279+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jun 11 21:47:22 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.45 # ENIGMATIC: Selected SinE mode:
% 0.21/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.54/2.76 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.54/2.76 # No SInE strategy applied
% 7.54/2.76 # Trying AutoSched0 for 150 seconds
% 7.54/2.76 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 7.54/2.76 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.54/2.76 #
% 7.54/2.76 # Preprocessing time : 0.013 s
% 7.54/2.76
% 7.54/2.76 # Proof found!
% 7.54/2.76 # SZS status Theorem
% 7.54/2.76 # SZS output start CNFRefutation
% See solution above
% 7.54/2.76 # Training examples: 0 positive, 0 negative
% 7.54/2.76
% 7.54/2.76 # -------------------------------------------------
% 7.54/2.76 # User time : 0.012 s
% 7.54/2.76 # System time : 0.006 s
% 7.54/2.76 # Total time : 0.018 s
% 7.54/2.76 # Maximum resident set size: 7124 pages
% 7.54/2.76
%------------------------------------------------------------------------------