TSTP Solution File: SWC418+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC418+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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:34 EDT 2022
% Result : Theorem 9.56s 2.64s
% Output : CNFRefutation 9.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 18
% Syntax : Number of clauses : 52 ( 17 unt; 8 nHn; 52 RR)
% Number of literals : 157 ( 55 equ; 107 neg)
% Maximal clause size : 11 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_193,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk48_0
| app(app(X3,cons(X2,nil)),X1) != esk49_0
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-luz9oq9r/lgb.p',i_0_193) ).
cnf(i_0_196,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-luz9oq9r/lgb.p',i_0_196) ).
cnf(i_0_194,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-luz9oq9r/lgb.p',i_0_194) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-luz9oq9r/lgb.p',i_0_60) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-luz9oq9r/lgb.p',i_0_44) ).
cnf(i_0_191,negated_conjecture,
( esk50_0 = X1
| hd(esk51_0) != X2
| tl(esk51_0) != X3
| app(X3,X4) != X1
| cons(X2,nil) != X4
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ neq(nil,esk51_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-luz9oq9r/lgb.p',i_0_191) ).
cnf(i_0_195,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-luz9oq9r/lgb.p',i_0_195) ).
cnf(i_0_58,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-luz9oq9r/lgb.p',i_0_58) ).
cnf(i_0_154,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-luz9oq9r/lgb.p',i_0_154) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-luz9oq9r/lgb.p',i_0_43) ).
cnf(i_0_147,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-luz9oq9r/lgb.p',i_0_147) ).
cnf(i_0_197,negated_conjecture,
ssList(esk51_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-luz9oq9r/lgb.p',i_0_197) ).
cnf(i_0_54,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-luz9oq9r/lgb.p',i_0_54) ).
cnf(i_0_56,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-luz9oq9r/lgb.p',i_0_56) ).
cnf(i_0_198,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-luz9oq9r/lgb.p',i_0_198) ).
cnf(i_0_159,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-luz9oq9r/lgb.p',i_0_159) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-luz9oq9r/lgb.p',i_0_41) ).
cnf(i_0_42,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-luz9oq9r/lgb.p',i_0_42) ).
cnf(c_0_217,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk48_0
| app(app(X3,cons(X2,nil)),X1) != esk49_0
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
i_0_193 ).
cnf(c_0_218,negated_conjecture,
esk49_0 = esk51_0,
i_0_196 ).
cnf(c_0_219,negated_conjecture,
neq(esk49_0,nil),
i_0_194 ).
cnf(c_0_220,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk51_0
| app(app(X3,cons(X2,nil)),X1) != esk48_0
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(rw,[status(thm)],[c_0_217,c_0_218]) ).
cnf(c_0_221,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_222,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_223,negated_conjecture,
( esk50_0 = X1
| hd(esk51_0) != X2
| tl(esk51_0) != X3
| app(X3,X4) != X1
| cons(X2,nil) != X4
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ neq(nil,esk51_0)
| ~ neq(esk51_0,nil) ),
i_0_191 ).
cnf(c_0_224,negated_conjecture,
esk50_0 = esk48_0,
i_0_195 ).
cnf(c_0_225,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_219,c_0_218]) ).
cnf(c_0_226,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_58 ).
cnf(c_0_227,plain,
( app(app(X1,cons(X2,nil)),nil) != esk48_0
| app(cons(X2,nil),X1) != esk51_0
| ~ ssItem(X2)
| ~ ssList(cons(X2,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_220,c_0_221]),c_0_222])]) ).
cnf(c_0_228,negated_conjecture,
( app(tl(esk51_0),cons(hd(esk51_0),nil)) = esk48_0
| ~ neq(nil,esk51_0)
| ~ ssItem(hd(esk51_0))
| ~ ssList(cons(hd(esk51_0),nil))
| ~ ssList(tl(esk51_0)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_223,c_0_224]),c_0_225])])])])])]),c_0_226]) ).
cnf(c_0_229,negated_conjecture,
( app(cons(hd(esk51_0),nil),tl(esk51_0)) != esk51_0
| app(esk48_0,nil) != esk48_0
| ~ neq(nil,esk51_0)
| ~ ssItem(hd(esk51_0))
| ~ ssList(cons(hd(esk51_0),nil))
| ~ ssList(tl(esk51_0)) ),
inference(spm,[status(thm)],[c_0_227,c_0_228]) ).
cnf(c_0_230,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_154 ).
cnf(c_0_231,plain,
( cons(hd(esk51_0),tl(esk51_0)) != esk51_0
| app(esk48_0,nil) != esk48_0
| ~ neq(nil,esk51_0)
| ~ ssItem(hd(esk51_0))
| ~ ssList(cons(hd(esk51_0),nil))
| ~ ssList(tl(esk51_0)) ),
inference(spm,[status(thm)],[c_0_229,c_0_230]) ).
cnf(c_0_232,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_233,plain,
( cons(hd(esk51_0),tl(esk51_0)) != esk51_0
| app(esk48_0,nil) != esk48_0
| ~ neq(nil,esk51_0)
| ~ ssItem(hd(esk51_0))
| ~ ssList(tl(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_231,c_0_232]),c_0_222])]) ).
cnf(c_0_234,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
i_0_147 ).
cnf(c_0_235,negated_conjecture,
ssList(esk51_0),
i_0_197 ).
cnf(c_0_236,plain,
( nil = esk51_0
| app(esk48_0,nil) != esk48_0
| ~ neq(nil,esk51_0)
| ~ ssItem(hd(esk51_0))
| ~ ssList(tl(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_233,c_0_234]),c_0_235])]) ).
cnf(c_0_237,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
i_0_54 ).
cnf(c_0_238,plain,
( nil = esk51_0
| app(esk48_0,nil) != esk48_0
| ~ neq(nil,esk51_0)
| ~ ssList(tl(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_236,c_0_237]),c_0_235])]) ).
cnf(c_0_239,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
i_0_56 ).
cnf(c_0_240,negated_conjecture,
ssList(esk50_0),
i_0_198 ).
cnf(c_0_241,plain,
( nil = esk51_0
| app(esk48_0,nil) != esk48_0
| ~ neq(nil,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_238,c_0_239]),c_0_235])]) ).
cnf(c_0_242,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
i_0_159 ).
cnf(c_0_243,negated_conjecture,
ssList(esk48_0),
inference(rw,[status(thm)],[c_0_240,c_0_224]) ).
cnf(c_0_244,plain,
( nil = esk51_0
| ~ neq(nil,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_241,c_0_242]),c_0_243])]) ).
cnf(c_0_245,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_246,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
i_0_42 ).
cnf(c_0_247,plain,
nil = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_244,c_0_245]),c_0_235]),c_0_222])]) ).
cnf(c_0_248,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_246]) ).
cnf(c_0_249,negated_conjecture,
neq(esk51_0,esk51_0),
inference(rw,[status(thm)],[c_0_225,c_0_247]) ).
cnf(c_0_250,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_248,c_0_249]),c_0_235])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC418+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n017.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 23:06:24 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
% 9.56/2.64 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.56/2.64 # No SInE strategy applied
% 9.56/2.64 # Trying AutoSched0 for 150 seconds
% 9.56/2.64 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 9.56/2.64 # and selection function SelectMaxLComplexAvoidPosPred.
% 9.56/2.64 #
% 9.56/2.64 # Preprocessing time : 0.025 s
% 9.56/2.64
% 9.56/2.64 # Proof found!
% 9.56/2.64 # SZS status Theorem
% 9.56/2.64 # SZS output start CNFRefutation
% See solution above
% 9.56/2.64 # Training examples: 0 positive, 0 negative
% 9.56/2.64
% 9.56/2.64 # -------------------------------------------------
% 9.56/2.64 # User time : 0.076 s
% 9.56/2.64 # System time : 0.006 s
% 9.56/2.64 # Total time : 0.082 s
% 9.56/2.64 # Maximum resident set size: 7124 pages
% 9.56/2.64
%------------------------------------------------------------------------------