TSTP Solution File: SWC399+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC399+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n016.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:15:27 EDT 2022
% Result : Theorem 8.60s 2.42s
% Output : CNFRefutation 8.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 17
% Syntax : Number of clauses : 48 ( 26 unt; 0 nHn; 48 RR)
% Number of literals : 112 ( 21 equ; 66 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 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 : 43 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_198,negated_conjecture,
app(app(esk52_0,esk50_0),esk53_0) = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4wwzqd0x/lgb.p',i_0_198) ).
cnf(i_0_201,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4wwzqd0x/lgb.p',i_0_201) ).
cnf(i_0_202,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4wwzqd0x/lgb.p',i_0_202) ).
cnf(i_0_130,plain,
( rearsegP(X1,X2)
| app(X3,X2) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4wwzqd0x/lgb.p',i_0_130) ).
cnf(i_0_58,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4wwzqd0x/lgb.p',i_0_58) ).
cnf(i_0_148,plain,
( X1 = X2
| app(X1,X3) != app(X2,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4wwzqd0x/lgb.p',i_0_148) ).
cnf(i_0_199,negated_conjecture,
ssList(esk53_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4wwzqd0x/lgb.p',i_0_199) ).
cnf(i_0_204,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4wwzqd0x/lgb.p',i_0_204) ).
cnf(i_0_200,negated_conjecture,
ssList(esk52_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4wwzqd0x/lgb.p',i_0_200) ).
cnf(i_0_131,plain,
( app(esk33_2(X1,X2),X2) = X1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4wwzqd0x/lgb.p',i_0_131) ).
cnf(i_0_205,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4wwzqd0x/lgb.p',i_0_205) ).
cnf(i_0_132,plain,
( ssList(esk33_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4wwzqd0x/lgb.p',i_0_132) ).
cnf(i_0_74,plain,
( memberP(app(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ memberP(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4wwzqd0x/lgb.p',i_0_74) ).
cnf(i_0_73,plain,
( memberP(app(X1,X2),X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3)
| ~ memberP(X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4wwzqd0x/lgb.p',i_0_73) ).
cnf(i_0_193,negated_conjecture,
memberP(esk48_0,esk54_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4wwzqd0x/lgb.p',i_0_193) ).
cnf(i_0_194,negated_conjecture,
ssItem(esk54_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4wwzqd0x/lgb.p',i_0_194) ).
cnf(i_0_192,negated_conjecture,
~ memberP(esk49_0,esk54_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4wwzqd0x/lgb.p',i_0_192) ).
cnf(c_0_223,negated_conjecture,
app(app(esk52_0,esk50_0),esk53_0) = esk51_0,
i_0_198 ).
cnf(c_0_224,negated_conjecture,
esk50_0 = esk48_0,
i_0_201 ).
cnf(c_0_225,negated_conjecture,
esk49_0 = esk51_0,
i_0_202 ).
cnf(c_0_226,plain,
( rearsegP(X1,X2)
| app(X3,X2) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
i_0_130 ).
cnf(c_0_227,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_58 ).
cnf(c_0_228,plain,
( X1 = X2
| app(X1,X3) != app(X2,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
i_0_148 ).
cnf(c_0_229,negated_conjecture,
app(app(esk52_0,esk48_0),esk53_0) = esk49_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_223,c_0_224]),c_0_225]) ).
cnf(c_0_230,negated_conjecture,
ssList(esk53_0),
i_0_199 ).
cnf(c_0_231,negated_conjecture,
ssList(esk50_0),
i_0_204 ).
cnf(c_0_232,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_226]),c_0_227]) ).
cnf(c_0_233,negated_conjecture,
( X1 = app(esk52_0,esk48_0)
| app(X1,esk53_0) != esk49_0
| ~ ssList(app(esk52_0,esk48_0))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_228,c_0_229]),c_0_230])]) ).
cnf(c_0_234,negated_conjecture,
ssList(esk48_0),
inference(rw,[status(thm)],[c_0_231,c_0_224]) ).
cnf(c_0_235,negated_conjecture,
ssList(esk52_0),
i_0_200 ).
cnf(c_0_236,negated_conjecture,
( rearsegP(esk49_0,esk53_0)
| ~ ssList(app(esk52_0,esk48_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_232,c_0_229]),c_0_230])]) ).
cnf(c_0_237,plain,
( X1 = app(esk52_0,esk48_0)
| app(X1,esk53_0) != esk49_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_233,c_0_227]),c_0_234]),c_0_235])]) ).
cnf(c_0_238,plain,
( app(esk33_2(X1,X2),X2) = X1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(X1,X2) ),
i_0_131 ).
cnf(c_0_239,plain,
rearsegP(esk49_0,esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_236,c_0_227]),c_0_234]),c_0_235])]) ).
cnf(c_0_240,negated_conjecture,
ssList(esk49_0),
i_0_205 ).
cnf(c_0_241,plain,
( esk33_2(esk49_0,esk53_0) = app(esk52_0,esk48_0)
| ~ ssList(esk33_2(esk49_0,esk53_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_238]),c_0_230])])]),c_0_239]),c_0_240])]) ).
cnf(c_0_242,plain,
( ssList(esk33_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(X1,X2) ),
i_0_132 ).
cnf(c_0_243,plain,
( memberP(app(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ memberP(X1,X3) ),
i_0_74 ).
cnf(c_0_244,plain,
esk33_2(esk49_0,esk53_0) = app(esk52_0,esk48_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_241,c_0_242]),c_0_239]),c_0_230]),c_0_240])]) ).
cnf(c_0_245,negated_conjecture,
( memberP(esk49_0,X1)
| ~ ssItem(X1)
| ~ ssList(app(esk52_0,esk48_0))
| ~ memberP(app(esk52_0,esk48_0),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_243,c_0_229]),c_0_230])]) ).
cnf(c_0_246,plain,
ssList(app(esk52_0,esk48_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_242,c_0_244]),c_0_239]),c_0_230]),c_0_240])]) ).
cnf(c_0_247,negated_conjecture,
( memberP(esk49_0,X1)
| ~ ssItem(X1)
| ~ memberP(app(esk52_0,esk48_0),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_245,c_0_246])]) ).
cnf(c_0_248,plain,
( memberP(app(X1,X2),X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3)
| ~ memberP(X2,X3) ),
i_0_73 ).
cnf(c_0_249,plain,
( memberP(esk49_0,X1)
| ~ ssItem(X1)
| ~ memberP(esk48_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_247,c_0_248]),c_0_234]),c_0_235])]) ).
cnf(c_0_250,negated_conjecture,
memberP(esk48_0,esk54_0),
i_0_193 ).
cnf(c_0_251,negated_conjecture,
ssItem(esk54_0),
i_0_194 ).
cnf(c_0_252,negated_conjecture,
~ memberP(esk49_0,esk54_0),
i_0_192 ).
cnf(c_0_253,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_249,c_0_250]),c_0_251])]),c_0_252]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC399+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n016.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 09:56:44 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.43 # ENIGMATIC: Selected SinE mode:
% 0.18/0.44 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.60/2.42 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.60/2.42 # No SInE strategy applied
% 8.60/2.42 # Trying AutoSched0 for 150 seconds
% 8.60/2.42 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 8.60/2.42 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.60/2.42 #
% 8.60/2.42 # Preprocessing time : 0.014 s
% 8.60/2.42
% 8.60/2.42 # Proof found!
% 8.60/2.42 # SZS status Theorem
% 8.60/2.42 # SZS output start CNFRefutation
% See solution above
% 8.60/2.42 # Training examples: 0 positive, 0 negative
% 8.60/2.42
% 8.60/2.42 # -------------------------------------------------
% 8.60/2.42 # User time : 0.095 s
% 8.60/2.42 # System time : 0.002 s
% 8.60/2.42 # Total time : 0.097 s
% 8.60/2.42 # Maximum resident set size: 7128 pages
% 8.60/2.42
%------------------------------------------------------------------------------