TSTP Solution File: SWC364+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC364+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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:14 EDT 2022
% Result : Theorem 7.54s 2.45s
% Output : CNFRefutation 7.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 17
% Syntax : Number of clauses : 52 ( 24 unt; 0 nHn; 52 RR)
% Number of literals : 120 ( 25 equ; 71 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_198,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sy12cyak/lgb.p',i_0_198) ).
cnf(i_0_200,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sy12cyak/lgb.p',i_0_200) ).
cnf(i_0_130,plain,
( rearsegP(X1,X2)
| app(X3,X2) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sy12cyak/lgb.p',i_0_130) ).
cnf(i_0_58,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sy12cyak/lgb.p',i_0_58) ).
cnf(i_0_193,negated_conjecture,
( app(cons(esk52_0,nil),esk50_0) = esk51_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sy12cyak/lgb.p',i_0_193) ).
cnf(i_0_199,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sy12cyak/lgb.p',i_0_199) ).
cnf(i_0_202,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sy12cyak/lgb.p',i_0_202) ).
cnf(i_0_195,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sy12cyak/lgb.p',i_0_195) ).
cnf(i_0_148,plain,
( X1 = X2
| app(X1,X3) != app(X2,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sy12cyak/lgb.p',i_0_148) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sy12cyak/lgb.p',i_0_43) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sy12cyak/lgb.p',i_0_44) ).
cnf(i_0_203,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sy12cyak/lgb.p',i_0_203) ).
cnf(i_0_131,plain,
( app(esk33_2(X1,X2),X2) = X1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sy12cyak/lgb.p',i_0_131) ).
cnf(i_0_132,plain,
( ssList(esk33_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sy12cyak/lgb.p',i_0_132) ).
cnf(i_0_149,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sy12cyak/lgb.p',i_0_149) ).
cnf(i_0_191,negated_conjecture,
( ~ neq(esk51_0,nil)
| ~ segmentP(esk49_0,esk48_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sy12cyak/lgb.p',i_0_191) ).
cnf(i_0_159,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sy12cyak/lgb.p',i_0_159) ).
cnf(c_0_221,negated_conjecture,
neq(esk49_0,nil),
i_0_198 ).
cnf(c_0_222,negated_conjecture,
esk49_0 = esk51_0,
i_0_200 ).
cnf(c_0_223,plain,
( rearsegP(X1,X2)
| app(X3,X2) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
i_0_130 ).
cnf(c_0_224,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_58 ).
cnf(c_0_225,negated_conjecture,
( app(cons(esk52_0,nil),esk50_0) = esk51_0
| ~ neq(esk51_0,nil) ),
i_0_193 ).
cnf(c_0_226,negated_conjecture,
esk50_0 = esk48_0,
i_0_199 ).
cnf(c_0_227,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_221,c_0_222]) ).
cnf(c_0_228,negated_conjecture,
ssList(esk50_0),
i_0_202 ).
cnf(c_0_229,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_223]),c_0_224]) ).
cnf(c_0_230,negated_conjecture,
app(cons(esk52_0,nil),esk48_0) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_225,c_0_226]),c_0_227])]) ).
cnf(c_0_231,negated_conjecture,
ssList(esk48_0),
inference(rw,[status(thm)],[c_0_228,c_0_226]) ).
cnf(c_0_232,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_195 ).
cnf(c_0_233,plain,
( X1 = X2
| app(X1,X3) != app(X2,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
i_0_148 ).
cnf(c_0_234,negated_conjecture,
( rearsegP(esk51_0,esk48_0)
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_229,c_0_230]),c_0_231])]) ).
cnf(c_0_235,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_236,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_237,negated_conjecture,
ssItem(esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_232,c_0_227])]) ).
cnf(c_0_238,negated_conjecture,
ssList(esk49_0),
i_0_203 ).
cnf(c_0_239,negated_conjecture,
( X1 = cons(esk52_0,nil)
| app(X1,esk48_0) != esk51_0
| ~ ssList(cons(esk52_0,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_233,c_0_230]),c_0_231])]) ).
cnf(c_0_240,plain,
( app(esk33_2(X1,X2),X2) = X1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(X1,X2) ),
i_0_131 ).
cnf(c_0_241,plain,
rearsegP(esk51_0,esk48_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_234,c_0_235]),c_0_236]),c_0_237])]) ).
cnf(c_0_242,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_238,c_0_222]) ).
cnf(c_0_243,plain,
( ssList(esk33_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(X1,X2) ),
i_0_132 ).
cnf(c_0_244,plain,
( X1 = cons(esk52_0,nil)
| app(X1,esk48_0) != esk51_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_239,c_0_235]),c_0_236]),c_0_237])]) ).
cnf(c_0_245,plain,
app(esk33_2(esk51_0,esk48_0),esk48_0) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_240,c_0_241]),c_0_231]),c_0_242])]) ).
cnf(c_0_246,plain,
ssList(esk33_2(esk51_0,esk48_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_243,c_0_241]),c_0_231]),c_0_242])]) ).
cnf(c_0_247,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
i_0_149 ).
cnf(c_0_248,plain,
esk33_2(esk51_0,esk48_0) = 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_249,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_247]) ).
cnf(c_0_250,plain,
ssList(cons(esk52_0,nil)),
inference(rw,[status(thm)],[c_0_246,c_0_248]) ).
cnf(c_0_251,negated_conjecture,
( ~ neq(esk51_0,nil)
| ~ segmentP(esk49_0,esk48_0) ),
i_0_191 ).
cnf(c_0_252,negated_conjecture,
( segmentP(app(esk51_0,X1),esk48_0)
| ~ ssList(app(esk51_0,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_249,c_0_230]),c_0_231])]),c_0_250])]) ).
cnf(c_0_253,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
i_0_159 ).
cnf(c_0_254,negated_conjecture,
~ segmentP(esk51_0,esk48_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_251,c_0_227]),c_0_222])]) ).
cnf(c_0_255,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_252,c_0_253]),c_0_242]),c_0_236])]),c_0_254]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWC364+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 12 11:05:36 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.54/2.45 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.54/2.45 # No SInE strategy applied
% 7.54/2.45 # Trying AutoSched0 for 150 seconds
% 7.54/2.45 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 7.54/2.45 # and selection function SelectNewComplexAHP.
% 7.54/2.45 #
% 7.54/2.45 # Preprocessing time : 0.024 s
% 7.54/2.45 # Presaturation interreduction done
% 7.54/2.45
% 7.54/2.45 # Proof found!
% 7.54/2.45 # SZS status Theorem
% 7.54/2.45 # SZS output start CNFRefutation
% See solution above
% 7.54/2.45 # Training examples: 0 positive, 0 negative
% 7.54/2.45
% 7.54/2.45 # -------------------------------------------------
% 7.54/2.45 # User time : 0.052 s
% 7.54/2.45 # System time : 0.006 s
% 7.54/2.45 # Total time : 0.058 s
% 7.54/2.45 # Maximum resident set size: 7124 pages
% 7.54/2.45
%------------------------------------------------------------------------------