TSTP Solution File: SWC336+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC336+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:15:03 EDT 2022
% Result : Theorem 8.15s 2.54s
% Output : CNFRefutation 8.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 18
% Syntax : Number of clauses : 46 ( 17 unt; 15 nHn; 46 RR)
% Number of literals : 90 ( 36 equ; 34 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_191,negated_conjecture,
( ~ totalorderedP(esk48_0)
| ~ segmentP(esk49_0,esk48_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2n1z9fbe/lgb.p',i_0_191) ).
cnf(i_0_206,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2n1z9fbe/lgb.p',i_0_206) ).
cnf(i_0_207,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2n1z9fbe/lgb.p',i_0_207) ).
cnf(i_0_121,plain,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2n1z9fbe/lgb.p',i_0_121) ).
cnf(i_0_198,negated_conjecture,
( esk50_0 = nil
| cons(esk52_0,nil) = esk50_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2n1z9fbe/lgb.p',i_0_198) ).
cnf(i_0_204,negated_conjecture,
( esk50_0 = nil
| ssItem(esk52_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2n1z9fbe/lgb.p',i_0_204) ).
cnf(i_0_149,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2n1z9fbe/lgb.p',i_0_149) ).
cnf(i_0_210,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2n1z9fbe/lgb.p',i_0_210) ).
cnf(i_0_53,plain,
( cons(X1,X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2n1z9fbe/lgb.p',i_0_53) ).
cnf(i_0_199,negated_conjecture,
( nil = esk51_0
| cons(esk52_0,nil) = esk50_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2n1z9fbe/lgb.p',i_0_199) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2n1z9fbe/lgb.p',i_0_44) ).
cnf(i_0_205,negated_conjecture,
( nil = esk51_0
| ssItem(esk52_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2n1z9fbe/lgb.p',i_0_205) ).
cnf(i_0_196,negated_conjecture,
( esk50_0 = nil
| app(app(esk53_0,esk50_0),esk54_0) = esk51_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2n1z9fbe/lgb.p',i_0_196) ).
cnf(i_0_209,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2n1z9fbe/lgb.p',i_0_209) ).
cnf(i_0_202,negated_conjecture,
( esk50_0 = nil
| ssList(esk53_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2n1z9fbe/lgb.p',i_0_202) ).
cnf(i_0_200,negated_conjecture,
( esk50_0 = nil
| ssList(esk54_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2n1z9fbe/lgb.p',i_0_200) ).
cnf(i_0_110,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2n1z9fbe/lgb.p',i_0_110) ).
cnf(i_0_122,plain,
totalorderedP(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2n1z9fbe/lgb.p',i_0_122) ).
cnf(c_0_229,negated_conjecture,
( ~ totalorderedP(esk48_0)
| ~ segmentP(esk49_0,esk48_0) ),
i_0_191 ).
cnf(c_0_230,negated_conjecture,
esk50_0 = esk48_0,
i_0_206 ).
cnf(c_0_231,negated_conjecture,
esk49_0 = esk51_0,
i_0_207 ).
cnf(c_0_232,plain,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
i_0_121 ).
cnf(c_0_233,negated_conjecture,
( esk50_0 = nil
| cons(esk52_0,nil) = esk50_0 ),
i_0_198 ).
cnf(c_0_234,negated_conjecture,
( esk50_0 = nil
| ssItem(esk52_0) ),
i_0_204 ).
cnf(c_0_235,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
i_0_149 ).
cnf(c_0_236,negated_conjecture,
ssList(esk49_0),
i_0_210 ).
cnf(c_0_237,negated_conjecture,
( ~ segmentP(esk51_0,esk50_0)
| ~ totalorderedP(esk50_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_229,c_0_230]),c_0_231]),c_0_230]) ).
cnf(c_0_238,negated_conjecture,
( esk50_0 = nil
| totalorderedP(esk50_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_232,c_0_233]),c_0_234]) ).
cnf(c_0_239,plain,
( cons(X1,X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_53 ).
cnf(c_0_240,negated_conjecture,
( nil = esk51_0
| cons(esk52_0,nil) = esk50_0 ),
i_0_199 ).
cnf(c_0_241,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_242,negated_conjecture,
( nil = esk51_0
| ssItem(esk52_0) ),
i_0_205 ).
cnf(c_0_243,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_235]) ).
cnf(c_0_244,negated_conjecture,
( esk50_0 = nil
| app(app(esk53_0,esk50_0),esk54_0) = esk51_0 ),
i_0_196 ).
cnf(c_0_245,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_236,c_0_231]) ).
cnf(c_0_246,negated_conjecture,
ssList(esk50_0),
i_0_209 ).
cnf(c_0_247,negated_conjecture,
( esk50_0 = nil
| ssList(esk53_0) ),
i_0_202 ).
cnf(c_0_248,negated_conjecture,
( esk50_0 = nil
| ssList(esk54_0) ),
i_0_200 ).
cnf(c_0_249,negated_conjecture,
( esk50_0 = nil
| ~ segmentP(esk51_0,esk50_0) ),
inference(spm,[status(thm)],[c_0_237,c_0_238]) ).
cnf(c_0_250,negated_conjecture,
( esk51_0 = nil
| esk50_0 != nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_239,c_0_240]),c_0_241])]),c_0_242]) ).
cnf(c_0_251,negated_conjecture,
esk50_0 = nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[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]),c_0_249]) ).
cnf(c_0_252,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
i_0_110 ).
cnf(c_0_253,plain,
totalorderedP(nil),
i_0_122 ).
cnf(c_0_254,negated_conjecture,
esk51_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_250,c_0_251])]) ).
cnf(c_0_255,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_252]),c_0_241])]) ).
cnf(c_0_256,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_237,c_0_251]),c_0_251]),c_0_253])]),c_0_254]),c_0_255])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC336+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 07:58:50 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # 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
% 8.15/2.54 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.15/2.54 # No SInE strategy applied
% 8.15/2.54 # Trying AutoSched0 for 150 seconds
% 8.15/2.54 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 8.15/2.54 # and selection function SelectNewComplexAHP.
% 8.15/2.54 #
% 8.15/2.54 # Preprocessing time : 0.024 s
% 8.15/2.54 # Presaturation interreduction done
% 8.15/2.54
% 8.15/2.54 # Proof found!
% 8.15/2.54 # SZS status Theorem
% 8.15/2.54 # SZS output start CNFRefutation
% See solution above
% 8.15/2.54 # Training examples: 0 positive, 0 negative
% 8.15/2.54
% 8.15/2.54 # -------------------------------------------------
% 8.15/2.54 # User time : 0.035 s
% 8.15/2.54 # System time : 0.007 s
% 8.15/2.54 # Total time : 0.042 s
% 8.15/2.54 # Maximum resident set size: 7128 pages
% 8.15/2.54
%------------------------------------------------------------------------------