TSTP Solution File: SWC016+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC016+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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:04 EDT 2022
% Result : Theorem 7.47s 2.38s
% Output : CNFRefutation 7.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of clauses : 40 ( 10 unt; 6 nHn; 40 RR)
% Number of literals : 83 ( 24 equ; 41 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_195,negated_conjecture,
( frontsegP(esk50_0,esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3uiz72z5/lgb.p',i_0_195) ).
cnf(i_0_200,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3uiz72z5/lgb.p',i_0_200) ).
cnf(i_0_201,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3uiz72z5/lgb.p',i_0_201) ).
cnf(i_0_198,negated_conjecture,
( ssList(esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3uiz72z5/lgb.p',i_0_198) ).
cnf(i_0_197,negated_conjecture,
( neq(esk52_0,nil)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3uiz72z5/lgb.p',i_0_197) ).
cnf(i_0_196,negated_conjecture,
( frontsegP(esk51_0,esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3uiz72z5/lgb.p',i_0_196) ).
cnf(i_0_194,negated_conjecture,
( nil = esk49_0
| neq(esk49_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3uiz72z5/lgb.p',i_0_194) ).
cnf(i_0_199,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3uiz72z5/lgb.p',i_0_199) ).
cnf(i_0_193,negated_conjecture,
( nil = esk49_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ frontsegP(esk48_0,X1)
| ~ frontsegP(esk49_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3uiz72z5/lgb.p',i_0_193) ).
cnf(i_0_191,negated_conjecture,
( nil != esk48_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ frontsegP(esk48_0,X1)
| ~ frontsegP(esk49_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3uiz72z5/lgb.p',i_0_191) ).
cnf(i_0_92,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3uiz72z5/lgb.p',i_0_92) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3uiz72z5/lgb.p',i_0_44) ).
cnf(i_0_192,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3uiz72z5/lgb.p',i_0_192) ).
cnf(c_0_215,negated_conjecture,
( frontsegP(esk50_0,esk52_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,
esk49_0 = esk51_0,
i_0_201 ).
cnf(c_0_218,negated_conjecture,
( ssList(esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_198 ).
cnf(c_0_219,negated_conjecture,
( neq(esk52_0,nil)
| ~ neq(esk51_0,nil) ),
i_0_197 ).
cnf(c_0_220,negated_conjecture,
( frontsegP(esk51_0,esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_196 ).
cnf(c_0_221,negated_conjecture,
( frontsegP(esk48_0,esk52_0)
| ~ neq(esk49_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_215,c_0_216]),c_0_217]) ).
cnf(c_0_222,negated_conjecture,
( nil = esk49_0
| neq(esk49_0,nil) ),
i_0_194 ).
cnf(c_0_223,negated_conjecture,
( ssList(esk52_0)
| ~ neq(esk49_0,nil) ),
inference(rw,[status(thm)],[c_0_218,c_0_217]) ).
cnf(c_0_224,negated_conjecture,
( neq(esk52_0,nil)
| ~ neq(esk49_0,nil) ),
inference(rw,[status(thm)],[c_0_219,c_0_217]) ).
cnf(c_0_225,negated_conjecture,
( frontsegP(esk49_0,esk52_0)
| ~ neq(esk49_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_220,c_0_217]),c_0_217]) ).
cnf(c_0_226,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
i_0_199 ).
cnf(c_0_227,negated_conjecture,
( nil = esk49_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ frontsegP(esk48_0,X1)
| ~ frontsegP(esk49_0,X1) ),
i_0_193 ).
cnf(c_0_228,negated_conjecture,
( esk49_0 = nil
| frontsegP(esk48_0,esk52_0) ),
inference(spm,[status(thm)],[c_0_221,c_0_222]) ).
cnf(c_0_229,negated_conjecture,
( esk49_0 = nil
| ssList(esk52_0) ),
inference(spm,[status(thm)],[c_0_223,c_0_222]) ).
cnf(c_0_230,negated_conjecture,
( esk49_0 = nil
| neq(esk52_0,nil) ),
inference(spm,[status(thm)],[c_0_224,c_0_222]) ).
cnf(c_0_231,negated_conjecture,
( esk49_0 = nil
| frontsegP(esk49_0,esk52_0) ),
inference(spm,[status(thm)],[c_0_225,c_0_222]) ).
cnf(c_0_232,negated_conjecture,
( esk48_0 = nil
| esk49_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_226,c_0_216]),c_0_217]) ).
cnf(c_0_233,negated_conjecture,
esk49_0 = nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_227,c_0_228]),c_0_229]),c_0_230]),c_0_231]) ).
cnf(c_0_234,negated_conjecture,
( nil != esk48_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ frontsegP(esk48_0,X1)
| ~ frontsegP(esk49_0,X1) ),
i_0_191 ).
cnf(c_0_235,negated_conjecture,
esk48_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_232,c_0_233])]) ).
cnf(c_0_236,negated_conjecture,
( ~ frontsegP(nil,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_234,c_0_233]),c_0_235]),c_0_235])]) ).
cnf(c_0_237,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
i_0_92 ).
cnf(c_0_238,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_239,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
i_0_192 ).
cnf(c_0_240,plain,
~ neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_236,c_0_237]),c_0_238])]) ).
cnf(c_0_241,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_239,c_0_233]),c_0_235])]),c_0_240]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC016+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n019.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 04:26:11 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox2/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
% 7.47/2.38 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.47/2.38 # No SInE strategy applied
% 7.47/2.38 # Trying AutoSched0 for 150 seconds
% 7.47/2.38 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S068N
% 7.47/2.38 # and selection function PSelectNewComplexAHP.
% 7.47/2.38 #
% 7.47/2.38 # Preprocessing time : 0.024 s
% 7.47/2.38 # Presaturation interreduction done
% 7.47/2.38
% 7.47/2.38 # Proof found!
% 7.47/2.38 # SZS status Theorem
% 7.47/2.38 # SZS output start CNFRefutation
% See solution above
% 7.47/2.38 # Training examples: 0 positive, 0 negative
% 7.47/2.38
% 7.47/2.38 # -------------------------------------------------
% 7.47/2.38 # User time : 0.025 s
% 7.47/2.38 # System time : 0.010 s
% 7.47/2.38 # Total time : 0.035 s
% 7.47/2.38 # Maximum resident set size: 7124 pages
% 7.47/2.38
%------------------------------------------------------------------------------