TSTP Solution File: SWC312+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC312+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:54 EDT 2022
% Result : Theorem 8.04s 2.38s
% Output : CNFRefutation 8.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 37 ( 8 unt; 5 nHn; 37 RR)
% Number of literals : 85 ( 49 equ; 50 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_191,negated_conjecture,
( nil != esk48_0
| app(X1,cons(X2,nil)) != esk48_0
| app(cons(X2,nil),X1) != esk49_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g3j6a7t6/lgb.p',i_0_191) ).
cnf(i_0_201,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g3j6a7t6/lgb.p',i_0_201) ).
cnf(i_0_195,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = esk50_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g3j6a7t6/lgb.p',i_0_195) ).
cnf(i_0_200,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g3j6a7t6/lgb.p',i_0_200) ).
cnf(i_0_192,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g3j6a7t6/lgb.p',i_0_192) ).
cnf(i_0_194,negated_conjecture,
( nil = esk49_0
| neq(esk49_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g3j6a7t6/lgb.p',i_0_194) ).
cnf(i_0_198,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g3j6a7t6/lgb.p',i_0_198) ).
cnf(i_0_193,negated_conjecture,
( nil = esk49_0
| app(X1,cons(X2,nil)) != esk48_0
| app(cons(X2,nil),X1) != esk49_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g3j6a7t6/lgb.p',i_0_193) ).
cnf(i_0_197,negated_conjecture,
( ssList(esk53_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g3j6a7t6/lgb.p',i_0_197) ).
cnf(i_0_196,negated_conjecture,
( app(cons(esk52_0,nil),esk53_0) = esk51_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g3j6a7t6/lgb.p',i_0_196) ).
cnf(i_0_199,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g3j6a7t6/lgb.p',i_0_199) ).
cnf(c_0_213,negated_conjecture,
( nil != esk48_0
| app(X1,cons(X2,nil)) != esk48_0
| app(cons(X2,nil),X1) != esk49_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
i_0_191 ).
cnf(c_0_214,negated_conjecture,
esk49_0 = esk51_0,
i_0_201 ).
cnf(c_0_215,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = esk50_0
| ~ neq(esk51_0,nil) ),
i_0_195 ).
cnf(c_0_216,negated_conjecture,
esk50_0 = esk48_0,
i_0_200 ).
cnf(c_0_217,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
i_0_192 ).
cnf(c_0_218,negated_conjecture,
( nil = esk49_0
| neq(esk49_0,nil) ),
i_0_194 ).
cnf(c_0_219,negated_conjecture,
( app(X1,cons(X2,nil)) != esk48_0
| app(cons(X2,nil),X1) != esk51_0
| nil != esk48_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(rw,[status(thm)],[c_0_213,c_0_214]) ).
cnf(c_0_220,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = esk48_0
| ~ neq(esk51_0,nil) ),
inference(rw,[status(thm)],[c_0_215,c_0_216]) ).
cnf(c_0_221,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_198 ).
cnf(c_0_222,negated_conjecture,
( neq(esk51_0,nil)
| nil != esk48_0 ),
inference(rw,[status(thm)],[c_0_217,c_0_214]) ).
cnf(c_0_223,negated_conjecture,
( nil = esk49_0
| app(X1,cons(X2,nil)) != esk48_0
| app(cons(X2,nil),X1) != esk49_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
i_0_193 ).
cnf(c_0_224,negated_conjecture,
( nil = esk51_0
| neq(esk51_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_218,c_0_214]),c_0_214]) ).
cnf(c_0_225,negated_conjecture,
( ssList(esk53_0)
| ~ neq(esk51_0,nil) ),
i_0_197 ).
cnf(c_0_226,negated_conjecture,
( app(cons(esk52_0,nil),esk53_0) != esk51_0
| nil != esk48_0
| ~ ssList(esk53_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_219,c_0_220]),c_0_221]),c_0_222]) ).
cnf(c_0_227,negated_conjecture,
( app(cons(esk52_0,nil),esk53_0) = esk51_0
| ~ neq(esk51_0,nil) ),
i_0_196 ).
cnf(c_0_228,negated_conjecture,
( nil = esk51_0
| app(X1,cons(X2,nil)) != esk48_0
| app(cons(X2,nil),X1) != esk51_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_223,c_0_214]),c_0_214]) ).
cnf(c_0_229,negated_conjecture,
( nil = esk51_0
| ssItem(esk52_0) ),
inference(spm,[status(thm)],[c_0_221,c_0_224]) ).
cnf(c_0_230,negated_conjecture,
( nil = esk51_0
| ssList(esk53_0) ),
inference(spm,[status(thm)],[c_0_225,c_0_224]) ).
cnf(c_0_231,negated_conjecture,
( nil != esk48_0
| ~ ssList(esk53_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_226,c_0_227]),c_0_222]) ).
cnf(c_0_232,negated_conjecture,
( nil = esk51_0
| app(cons(esk52_0,nil),esk53_0) != esk51_0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_228,c_0_220]),c_0_229]),c_0_224]),c_0_230]) ).
cnf(c_0_233,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
i_0_199 ).
cnf(c_0_234,negated_conjecture,
nil != esk48_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_225,c_0_222]),c_0_231]) ).
cnf(c_0_235,negated_conjecture,
nil = esk51_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_232,c_0_227]),c_0_224]) ).
cnf(c_0_236,negated_conjecture,
( nil = esk48_0
| nil != esk51_0 ),
inference(rw,[status(thm)],[c_0_233,c_0_216]) ).
cnf(c_0_237,negated_conjecture,
esk48_0 != esk51_0,
inference(rw,[status(thm)],[c_0_234,c_0_235]) ).
cnf(c_0_238,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_236,c_0_235]),c_0_235])]),c_0_237]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC312+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 12 10:38:45 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.04/2.38 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.04/2.38 # No SInE strategy applied
% 8.04/2.38 # Trying AutoSched0 for 150 seconds
% 8.04/2.38 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 8.04/2.38 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.04/2.38 #
% 8.04/2.38 # Preprocessing time : 0.024 s
% 8.04/2.38
% 8.04/2.38 # Proof found!
% 8.04/2.38 # SZS status Theorem
% 8.04/2.38 # SZS output start CNFRefutation
% See solution above
% 8.04/2.38 # Training examples: 0 positive, 0 negative
% 8.04/2.38
% 8.04/2.38 # -------------------------------------------------
% 8.04/2.38 # User time : 0.029 s
% 8.04/2.38 # System time : 0.005 s
% 8.04/2.38 # Total time : 0.034 s
% 8.04/2.38 # Maximum resident set size: 7128 pages
% 8.04/2.38
%------------------------------------------------------------------------------