TSTP Solution File: SWC046+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC046+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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:16 EDT 2022
% Result : Theorem 9.82s 2.80s
% Output : CNFRefutation 9.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of clauses : 49 ( 14 unt; 18 nHn; 49 RR)
% Number of literals : 119 ( 43 equ; 63 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 : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_144,plain,
( nil = X1
| tl(X1) = esk35_1(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m_j9z72k/lgb.p',i_0_144) ).
cnf(i_0_198,negated_conjecture,
esk49_0 = nil,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m_j9z72k/lgb.p',i_0_198) ).
cnf(i_0_53,plain,
( cons(X1,X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m_j9z72k/lgb.p',i_0_53) ).
cnf(i_0_57,plain,
( tl(cons(X1,X2)) = X2
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m_j9z72k/lgb.p',i_0_57) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m_j9z72k/lgb.p',i_0_43) ).
cnf(i_0_50,plain,
( nil = X1
| cons(esk26_1(X1),esk25_1(X1)) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m_j9z72k/lgb.p',i_0_50) ).
cnf(i_0_52,plain,
( nil = X1
| ssList(esk25_1(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m_j9z72k/lgb.p',i_0_52) ).
cnf(i_0_51,plain,
( nil = X1
| ssItem(esk26_1(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m_j9z72k/lgb.p',i_0_51) ).
cnf(i_0_79,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m_j9z72k/lgb.p',i_0_79) ).
cnf(i_0_77,plain,
( memberP(cons(X1,X2),X3)
| X3 != X1
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m_j9z72k/lgb.p',i_0_77) ).
cnf(i_0_145,plain,
( nil = X1
| ssList(esk35_1(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m_j9z72k/lgb.p',i_0_145) ).
cnf(i_0_192,negated_conjecture,
( memberP(esk51_0,X1)
| ~ ssItem(X1)
| ~ memberP(esk50_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m_j9z72k/lgb.p',i_0_192) ).
cnf(i_0_197,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m_j9z72k/lgb.p',i_0_197) ).
cnf(i_0_202,negated_conjecture,
ssList(esk48_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m_j9z72k/lgb.p',i_0_202) ).
cnf(i_0_196,negated_conjecture,
esk48_0 = esk50_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m_j9z72k/lgb.p',i_0_196) ).
cnf(i_0_195,negated_conjecture,
esk48_0 != nil,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m_j9z72k/lgb.p',i_0_195) ).
cnf(c_0_219,plain,
( nil = X1
| tl(X1) = esk35_1(X1)
| ~ ssList(X1) ),
i_0_144 ).
cnf(c_0_220,negated_conjecture,
esk49_0 = nil,
i_0_198 ).
cnf(c_0_221,plain,
( cons(X1,X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_53 ).
cnf(c_0_222,plain,
( tl(X1) = esk35_1(X1)
| esk49_0 = X1
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_219,c_0_220]) ).
cnf(c_0_223,plain,
( tl(cons(X1,X2)) = X2
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_57 ).
cnf(c_0_224,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_225,plain,
( cons(X1,X2) != esk49_0
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(rw,[status(thm)],[c_0_221,c_0_220]) ).
cnf(c_0_226,plain,
( nil = X1
| cons(esk26_1(X1),esk25_1(X1)) = X1
| ~ ssList(X1) ),
i_0_50 ).
cnf(c_0_227,plain,
( nil = X1
| ssList(esk25_1(X1))
| ~ ssList(X1) ),
i_0_52 ).
cnf(c_0_228,plain,
( nil = X1
| ssItem(esk26_1(X1))
| ~ ssList(X1) ),
i_0_51 ).
cnf(c_0_229,plain,
( esk35_1(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_222,c_0_223]),c_0_224]),c_0_225]) ).
cnf(c_0_230,plain,
( cons(esk26_1(X1),esk25_1(X1)) = X1
| esk49_0 = X1
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_226,c_0_220]) ).
cnf(c_0_231,plain,
( esk49_0 = X1
| ssList(esk25_1(X1))
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_227,c_0_220]) ).
cnf(c_0_232,plain,
( esk49_0 = X1
| ssItem(esk26_1(X1))
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_228,c_0_220]) ).
cnf(c_0_233,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
i_0_79 ).
cnf(c_0_234,plain,
( memberP(cons(X1,X2),X3)
| X3 != X1
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
i_0_77 ).
cnf(c_0_235,plain,
( esk25_1(X1) = esk35_1(X1)
| esk49_0 = X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_229,c_0_230]),c_0_231]),c_0_232]) ).
cnf(c_0_236,plain,
( nil = X1
| ssList(esk35_1(X1))
| ~ ssList(X1) ),
i_0_145 ).
cnf(c_0_237,negated_conjecture,
( memberP(esk51_0,X1)
| ~ ssItem(X1)
| ~ memberP(esk50_0,X1) ),
i_0_192 ).
cnf(c_0_238,negated_conjecture,
esk49_0 = esk51_0,
i_0_197 ).
cnf(c_0_239,plain,
( ~ memberP(esk49_0,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_233,c_0_220]) ).
cnf(c_0_240,plain,
( memberP(cons(X1,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_234]) ).
cnf(c_0_241,plain,
( cons(esk26_1(X1),esk35_1(X1)) = X1
| esk49_0 = X1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_230,c_0_235]) ).
cnf(c_0_242,plain,
( esk49_0 = X1
| ssList(esk35_1(X1))
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_236,c_0_220]) ).
cnf(c_0_243,negated_conjecture,
ssList(esk48_0),
i_0_202 ).
cnf(c_0_244,negated_conjecture,
esk48_0 = esk50_0,
i_0_196 ).
cnf(c_0_245,negated_conjecture,
esk48_0 != nil,
i_0_195 ).
cnf(c_0_246,negated_conjecture,
( ~ memberP(esk50_0,X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_237,c_0_238]),c_0_239]) ).
cnf(c_0_247,plain,
( esk49_0 = X1
| memberP(X1,esk26_1(X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_240,c_0_241]),c_0_242]),c_0_232]) ).
cnf(c_0_248,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_243,c_0_244]) ).
cnf(c_0_249,negated_conjecture,
esk50_0 != esk49_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_245,c_0_244]),c_0_220]) ).
cnf(c_0_250,negated_conjecture,
~ ssItem(esk26_1(esk50_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_246,c_0_247]),c_0_248])]),c_0_249]) ).
cnf(c_0_251,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_250,c_0_232]),c_0_248])]),c_0_249]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC046+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n005.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 12 00:39:25 EDT 2022
% 0.12/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.82/2.80 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.82/2.80 # No SInE strategy applied
% 9.82/2.80 # Trying AutoSched0 for 150 seconds
% 9.82/2.80 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 9.82/2.80 # and selection function SelectMaxLComplexAvoidPosPred.
% 9.82/2.80 #
% 9.82/2.80 # Preprocessing time : 0.024 s
% 9.82/2.80
% 9.82/2.80 # Proof found!
% 9.82/2.80 # SZS status Theorem
% 9.82/2.80 # SZS output start CNFRefutation
% See solution above
% 9.82/2.80 # Training examples: 0 positive, 0 negative
% 9.82/2.80
% 9.82/2.80 # -------------------------------------------------
% 9.82/2.80 # User time : 0.054 s
% 9.82/2.80 # System time : 0.014 s
% 9.82/2.80 # Total time : 0.067 s
% 9.82/2.80 # Maximum resident set size: 7120 pages
% 9.82/2.80
%------------------------------------------------------------------------------