TSTP Solution File: SWC112+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC112+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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:13:42 EDT 2022
% Result : Theorem 7.54s 2.42s
% Output : CNFRefutation 7.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of clauses : 43 ( 24 unt; 2 nHn; 43 RR)
% Number of literals : 83 ( 30 equ; 42 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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-97ra5u32/lgb.p',i_0_149) ).
cnf(i_0_199,negated_conjecture,
app(app(esk52_0,esk50_0),esk53_0) = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-97ra5u32/lgb.p',i_0_199) ).
cnf(i_0_202,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-97ra5u32/lgb.p',i_0_202) ).
cnf(i_0_203,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-97ra5u32/lgb.p',i_0_203) ).
cnf(i_0_205,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-97ra5u32/lgb.p',i_0_205) ).
cnf(i_0_206,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-97ra5u32/lgb.p',i_0_206) ).
cnf(i_0_200,negated_conjecture,
ssList(esk53_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-97ra5u32/lgb.p',i_0_200) ).
cnf(i_0_201,negated_conjecture,
ssList(esk52_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-97ra5u32/lgb.p',i_0_201) ).
cnf(i_0_193,negated_conjecture,
( nil = esk49_0
| ~ neq(esk48_0,nil)
| ~ segmentP(esk49_0,esk48_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-97ra5u32/lgb.p',i_0_193) ).
cnf(i_0_195,negated_conjecture,
( nil = esk51_0
| esk50_0 != nil ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-97ra5u32/lgb.p',i_0_195) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-97ra5u32/lgb.p',i_0_41) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-97ra5u32/lgb.p',i_0_44) ).
cnf(i_0_191,negated_conjecture,
( nil != esk48_0
| ~ neq(esk48_0,nil)
| ~ segmentP(esk49_0,esk48_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-97ra5u32/lgb.p',i_0_191) ).
cnf(i_0_111,plain,
( nil = X1
| ~ ssList(X1)
| ~ segmentP(nil,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-97ra5u32/lgb.p',i_0_111) ).
cnf(i_0_192,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-97ra5u32/lgb.p',i_0_192) ).
cnf(c_0_222,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
i_0_149 ).
cnf(c_0_223,negated_conjecture,
app(app(esk52_0,esk50_0),esk53_0) = esk51_0,
i_0_199 ).
cnf(c_0_224,negated_conjecture,
esk50_0 = esk48_0,
i_0_202 ).
cnf(c_0_225,negated_conjecture,
esk49_0 = esk51_0,
i_0_203 ).
cnf(c_0_226,negated_conjecture,
ssList(esk50_0),
i_0_205 ).
cnf(c_0_227,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_222]) ).
cnf(c_0_228,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_229,negated_conjecture,
ssList(esk49_0),
i_0_206 ).
cnf(c_0_230,negated_conjecture,
ssList(esk53_0),
i_0_200 ).
cnf(c_0_231,negated_conjecture,
ssList(esk52_0),
i_0_201 ).
cnf(c_0_232,negated_conjecture,
ssList(esk48_0),
inference(rw,[status(thm)],[c_0_226,c_0_224]) ).
cnf(c_0_233,negated_conjecture,
( nil = esk49_0
| ~ neq(esk48_0,nil)
| ~ segmentP(esk49_0,esk48_0) ),
i_0_193 ).
cnf(c_0_234,negated_conjecture,
segmentP(esk49_0,esk48_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_227,c_0_228]),c_0_229]),c_0_230]),c_0_231]),c_0_232])]) ).
cnf(c_0_235,negated_conjecture,
( nil = esk51_0
| esk50_0 != nil ),
i_0_195 ).
cnf(c_0_236,negated_conjecture,
( esk49_0 = nil
| ~ neq(esk48_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_233,c_0_234])]) ).
cnf(c_0_237,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_238,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_239,negated_conjecture,
( esk49_0 = nil
| esk48_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_235,c_0_225]),c_0_224]) ).
cnf(c_0_240,plain,
esk49_0 = nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_236,c_0_237]),c_0_238]),c_0_232])]),c_0_239]) ).
cnf(c_0_241,negated_conjecture,
( nil != esk48_0
| ~ neq(esk48_0,nil)
| ~ segmentP(esk49_0,esk48_0) ),
i_0_191 ).
cnf(c_0_242,plain,
( nil = X1
| ~ ssList(X1)
| ~ segmentP(nil,X1) ),
i_0_111 ).
cnf(c_0_243,negated_conjecture,
segmentP(nil,esk48_0),
inference(rw,[status(thm)],[c_0_234,c_0_240]) ).
cnf(c_0_244,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
i_0_192 ).
cnf(c_0_245,negated_conjecture,
( esk48_0 != nil
| ~ neq(esk48_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_241,c_0_234])]) ).
cnf(c_0_246,plain,
esk48_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_242,c_0_243]),c_0_232])]) ).
cnf(c_0_247,negated_conjecture,
( neq(nil,nil)
| esk48_0 != nil ),
inference(rw,[status(thm)],[c_0_244,c_0_240]) ).
cnf(c_0_248,negated_conjecture,
~ neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_245,c_0_246]),c_0_246])]) ).
cnf(c_0_249,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_247,c_0_246])]),c_0_248]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC112+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n021.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 12 15:39:43 EDT 2022
% 0.13/0.34 % 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.42 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.54/2.42 # No SInE strategy applied
% 7.54/2.42 # Trying AutoSched0 for 150 seconds
% 7.54/2.42 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 7.54/2.42 # and selection function SelectNewComplexAHP.
% 7.54/2.42 #
% 7.54/2.42 # Preprocessing time : 0.024 s
% 7.54/2.42 # Presaturation interreduction done
% 7.54/2.42
% 7.54/2.42 # Proof found!
% 7.54/2.42 # SZS status Theorem
% 7.54/2.42 # SZS output start CNFRefutation
% See solution above
% 7.54/2.42 # Training examples: 0 positive, 0 negative
% 7.54/2.42
% 7.54/2.42 # -------------------------------------------------
% 7.54/2.42 # User time : 0.037 s
% 7.54/2.42 # System time : 0.004 s
% 7.54/2.42 # Total time : 0.041 s
% 7.54/2.42 # Maximum resident set size: 7124 pages
% 7.54/2.42
%------------------------------------------------------------------------------