TSTP Solution File: SWC014+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC014+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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:03 EDT 2022
% Result : Theorem 8.83s 2.50s
% Output : CNFRefutation 8.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 18
% Syntax : Number of clauses : 51 ( 23 unt; 6 nHn; 51 RR)
% Number of literals : 112 ( 43 equ; 64 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_193,negated_conjecture,
( cons(esk52_0,nil) = esk50_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ze_liqda/lgb.p',i_0_193) ).
cnf(i_0_203,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ze_liqda/lgb.p',i_0_203) ).
cnf(i_0_204,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ze_liqda/lgb.p',i_0_204) ).
cnf(i_0_202,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ze_liqda/lgb.p',i_0_202) ).
cnf(i_0_197,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ze_liqda/lgb.p',i_0_197) ).
cnf(i_0_199,negated_conjecture,
( esk49_0 != X1
| tl(esk49_0) != X2
| app(esk48_0,X2) != X1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(nil,esk49_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ze_liqda/lgb.p',i_0_199) ).
cnf(i_0_205,negated_conjecture,
ssList(esk51_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ze_liqda/lgb.p',i_0_205) ).
cnf(i_0_191,negated_conjecture,
( app(cons(esk52_0,nil),esk53_0) = esk51_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ze_liqda/lgb.p',i_0_191) ).
cnf(i_0_195,negated_conjecture,
( ssList(esk53_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ze_liqda/lgb.p',i_0_195) ).
cnf(i_0_206,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ze_liqda/lgb.p',i_0_206) ).
cnf(i_0_57,plain,
( tl(cons(X1,X2)) = X2
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ze_liqda/lgb.p',i_0_57) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ze_liqda/lgb.p',i_0_44) ).
cnf(i_0_53,plain,
( cons(X1,X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ze_liqda/lgb.p',i_0_53) ).
cnf(i_0_56,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ze_liqda/lgb.p',i_0_56) ).
cnf(i_0_161,plain,
( nil = X1
| tl(app(X1,X2)) = app(tl(X1),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ze_liqda/lgb.p',i_0_161) ).
cnf(i_0_157,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ze_liqda/lgb.p',i_0_157) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ze_liqda/lgb.p',i_0_41) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ze_liqda/lgb.p',i_0_60) ).
cnf(c_0_225,negated_conjecture,
( cons(esk52_0,nil) = esk50_0
| ~ neq(esk51_0,nil) ),
i_0_193 ).
cnf(c_0_226,negated_conjecture,
esk50_0 = esk48_0,
i_0_203 ).
cnf(c_0_227,negated_conjecture,
esk49_0 = esk51_0,
i_0_204 ).
cnf(c_0_228,negated_conjecture,
neq(esk49_0,nil),
i_0_202 ).
cnf(c_0_229,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_197 ).
cnf(c_0_230,negated_conjecture,
( esk49_0 != X1
| tl(esk49_0) != X2
| app(esk48_0,X2) != X1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(nil,esk49_0)
| ~ neq(esk51_0,nil) ),
i_0_199 ).
cnf(c_0_231,negated_conjecture,
ssList(esk51_0),
i_0_205 ).
cnf(c_0_232,negated_conjecture,
( app(cons(esk52_0,nil),esk53_0) = esk51_0
| ~ neq(esk51_0,nil) ),
i_0_191 ).
cnf(c_0_233,negated_conjecture,
cons(esk52_0,nil) = esk48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_225,c_0_226]),c_0_227]),c_0_228])]) ).
cnf(c_0_234,negated_conjecture,
( ssList(esk53_0)
| ~ neq(esk51_0,nil) ),
i_0_195 ).
cnf(c_0_235,negated_conjecture,
ssList(esk50_0),
i_0_206 ).
cnf(c_0_236,plain,
( tl(cons(X1,X2)) = X2
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_57 ).
cnf(c_0_237,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_238,negated_conjecture,
ssItem(esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_229,c_0_227]),c_0_228])]) ).
cnf(c_0_239,plain,
( cons(X1,X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_53 ).
cnf(c_0_240,negated_conjecture,
( app(esk48_0,tl(esk49_0)) != esk49_0
| ~ ssList(app(esk48_0,tl(esk49_0)))
| ~ ssList(tl(esk49_0))
| ~ neq(nil,esk49_0) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_230,c_0_227]),c_0_228])])])]) ).
cnf(c_0_241,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
i_0_56 ).
cnf(c_0_242,negated_conjecture,
ssList(esk49_0),
inference(rw,[status(thm)],[c_0_231,c_0_227]) ).
cnf(c_0_243,plain,
( nil = X1
| tl(app(X1,X2)) = app(tl(X1),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_161 ).
cnf(c_0_244,negated_conjecture,
app(esk48_0,esk53_0) = esk49_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_232,c_0_233]),c_0_227]),c_0_227]),c_0_228])]) ).
cnf(c_0_245,negated_conjecture,
ssList(esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_234,c_0_227]),c_0_228])]) ).
cnf(c_0_246,negated_conjecture,
ssList(esk48_0),
inference(rw,[status(thm)],[c_0_235,c_0_226]) ).
cnf(c_0_247,negated_conjecture,
tl(esk48_0) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_236,c_0_233]),c_0_237]),c_0_238])]) ).
cnf(c_0_248,negated_conjecture,
esk48_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_239,c_0_233]),c_0_237]),c_0_238])]) ).
cnf(c_0_249,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_157 ).
cnf(c_0_250,negated_conjecture,
( esk49_0 = nil
| app(esk48_0,tl(esk49_0)) != esk49_0
| ~ ssList(app(esk48_0,tl(esk49_0)))
| ~ neq(nil,esk49_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_240,c_0_241]),c_0_242])]) ).
cnf(c_0_251,negated_conjecture,
tl(esk49_0) = app(nil,esk53_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_243,c_0_244]),c_0_245]),c_0_246])]),c_0_247]),c_0_248]) ).
cnf(c_0_252,negated_conjecture,
esk49_0 != nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_249,c_0_244]),c_0_245]),c_0_246])]),c_0_248]) ).
cnf(c_0_253,negated_conjecture,
( app(esk48_0,app(nil,esk53_0)) != esk49_0
| ~ ssList(app(esk48_0,app(nil,esk53_0)))
| ~ neq(nil,esk49_0) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_250,c_0_251]),c_0_251]),c_0_252]) ).
cnf(c_0_254,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_255,plain,
( app(esk48_0,app(nil,esk53_0)) != esk49_0
| ~ ssList(app(esk48_0,app(nil,esk53_0))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_253,c_0_254]),c_0_242]),c_0_237])]),c_0_252]) ).
cnf(c_0_256,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_257,plain,
$false,
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_255,c_0_256]),c_0_244]),c_0_244]),c_0_242]),c_0_245])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC014+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n022.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 21:51:50 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.83/2.50 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.83/2.50 # No SInE strategy applied
% 8.83/2.50 # Trying AutoSched0 for 150 seconds
% 8.83/2.50 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 8.83/2.50 # and selection function SelectNewComplexAHP.
% 8.83/2.50 #
% 8.83/2.50 # Preprocessing time : 0.024 s
% 8.83/2.50 # Presaturation interreduction done
% 8.83/2.50
% 8.83/2.50 # Proof found!
% 8.83/2.50 # SZS status Theorem
% 8.83/2.50 # SZS output start CNFRefutation
% See solution above
% 8.83/2.50 # Training examples: 0 positive, 0 negative
% 8.83/2.50
% 8.83/2.50 # -------------------------------------------------
% 8.83/2.50 # User time : 0.029 s
% 8.83/2.50 # System time : 0.008 s
% 8.83/2.50 # Total time : 0.037 s
% 8.83/2.50 # Maximum resident set size: 7132 pages
% 8.83/2.50
%------------------------------------------------------------------------------