TSTP Solution File: SWC324+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC324+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n008.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:59 EDT 2022
% Result : Theorem 11.63s 2.27s
% Output : CNFRefutation 11.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of clauses : 40 ( 14 unt; 6 nHn; 40 RR)
% Number of literals : 100 ( 45 equ; 66 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_193,negated_conjecture,
( app(X1,X2) != esk48_0
| app(X2,X1) != esk49_0
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ht094u9q/lgb.p',i_0_193) ).
cnf(i_0_195,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ht094u9q/lgb.p',i_0_195) ).
cnf(i_0_194,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ht094u9q/lgb.p',i_0_194) ).
cnf(i_0_156,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ht094u9q/lgb.p',i_0_156) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ht094u9q/lgb.p',i_0_44) ).
cnf(i_0_154,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ht094u9q/lgb.p',i_0_154) ).
cnf(i_0_198,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ht094u9q/lgb.p',i_0_198) ).
cnf(i_0_191,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ht094u9q/lgb.p',i_0_191) ).
cnf(i_0_147,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ht094u9q/lgb.p',i_0_147) ).
cnf(i_0_54,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ht094u9q/lgb.p',i_0_54) ).
cnf(i_0_56,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ht094u9q/lgb.p',i_0_56) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ht094u9q/lgb.p',i_0_43) ).
cnf(i_0_192,negated_conjecture,
( app(X1,cons(X2,nil)) = esk50_0
| app(cons(X2,nil),X1) != esk51_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ht094u9q/lgb.p',i_0_192) ).
cnf(c_0_212,negated_conjecture,
( app(X1,X2) != esk48_0
| app(X2,X1) != esk49_0
| ~ ssList(X1)
| ~ ssList(X2) ),
i_0_193 ).
cnf(c_0_213,negated_conjecture,
esk49_0 = esk51_0,
i_0_195 ).
cnf(c_0_214,negated_conjecture,
esk50_0 = esk48_0,
i_0_194 ).
cnf(c_0_215,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
i_0_156 ).
cnf(c_0_216,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_217,negated_conjecture,
( app(X1,X2) != esk51_0
| app(X2,X1) != esk50_0
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_212,c_0_213]),c_0_214]) ).
cnf(c_0_218,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_154 ).
cnf(c_0_219,negated_conjecture,
ssList(esk49_0),
i_0_198 ).
cnf(c_0_220,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_215])]),c_0_216])]) ).
cnf(c_0_221,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
i_0_191 ).
cnf(c_0_222,negated_conjecture,
( app(X1,cons(X2,nil)) != esk50_0
| cons(X2,X1) != esk51_0
| ~ ssItem(X2)
| ~ ssList(cons(X2,nil))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_217,c_0_218]) ).
cnf(c_0_223,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
i_0_147 ).
cnf(c_0_224,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_219,c_0_213]) ).
cnf(c_0_225,plain,
esk51_0 != nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_217,c_0_220]),c_0_220]),c_0_216])]),c_0_221]) ).
cnf(c_0_226,plain,
( app(tl(esk51_0),cons(hd(esk51_0),nil)) != esk50_0
| ~ ssItem(hd(esk51_0))
| ~ ssList(cons(hd(esk51_0),nil))
| ~ ssList(tl(esk51_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_222,c_0_223])]),c_0_224])]),c_0_225]) ).
cnf(c_0_227,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
i_0_54 ).
cnf(c_0_228,plain,
( app(tl(esk51_0),cons(hd(esk51_0),nil)) != esk50_0
| ~ ssList(cons(hd(esk51_0),nil))
| ~ ssList(tl(esk51_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_226,c_0_227]),c_0_224])]),c_0_225]) ).
cnf(c_0_229,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
i_0_56 ).
cnf(c_0_230,plain,
( app(tl(esk51_0),cons(hd(esk51_0),nil)) != esk50_0
| ~ ssList(cons(hd(esk51_0),nil)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_228,c_0_229]),c_0_224])]),c_0_225]) ).
cnf(c_0_231,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_232,negated_conjecture,
( app(X1,cons(X2,nil)) = esk50_0
| app(cons(X2,nil),X1) != esk51_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
i_0_192 ).
cnf(c_0_233,plain,
( app(tl(esk51_0),cons(hd(esk51_0),nil)) != esk50_0
| ~ ssItem(hd(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_230,c_0_231]),c_0_216])]) ).
cnf(c_0_234,plain,
( app(X1,cons(X2,nil)) = esk50_0
| cons(X2,X1) != esk51_0
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_232,c_0_218]) ).
cnf(c_0_235,plain,
app(tl(esk51_0),cons(hd(esk51_0),nil)) != esk50_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_233,c_0_227]),c_0_224])]),c_0_225]) ).
cnf(c_0_236,plain,
( ~ ssItem(hd(esk51_0))
| ~ ssList(tl(esk51_0)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_234,c_0_223])]),c_0_224])]),c_0_235]),c_0_225]) ).
cnf(c_0_237,plain,
~ ssList(tl(esk51_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_236,c_0_227]),c_0_224])]),c_0_225]) ).
cnf(c_0_238,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_229]),c_0_224])]),c_0_225]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC324+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n008.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 : Mon Jun 13 00:11:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 11.63/2.27 # ENIGMATIC: Solved by autoschedule-lgb:
% 11.63/2.27 # No SInE strategy applied
% 11.63/2.27 # Trying AutoSched0 for 150 seconds
% 11.63/2.27 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 11.63/2.27 # and selection function SelectNewComplexAHP.
% 11.63/2.27 #
% 11.63/2.27 # Preprocessing time : 0.014 s
% 11.63/2.27 # Presaturation interreduction done
% 11.63/2.27
% 11.63/2.27 # Proof found!
% 11.63/2.27 # SZS status Theorem
% 11.63/2.27 # SZS output start CNFRefutation
% See solution above
% 11.63/2.27 # Training examples: 0 positive, 0 negative
% 11.63/2.27
% 11.63/2.27 # -------------------------------------------------
% 11.63/2.27 # User time : 0.023 s
% 11.63/2.27 # System time : 0.005 s
% 11.63/2.27 # Total time : 0.028 s
% 11.63/2.27 # Maximum resident set size: 7124 pages
% 11.63/2.27
%------------------------------------------------------------------------------