TSTP Solution File: SWC086+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC086+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n016.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:31 EDT 2022
% Result : Theorem 8.15s 2.46s
% Output : CNFRefutation 8.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of clauses : 30 ( 17 unt; 4 nHn; 30 RR)
% Number of literals : 49 ( 10 equ; 20 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_195,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lms9akrg/lgb.p',i_0_195) ).
cnf(i_0_198,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lms9akrg/lgb.p',i_0_198) ).
cnf(i_0_197,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lms9akrg/lgb.p',i_0_197) ).
cnf(i_0_201,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lms9akrg/lgb.p',i_0_201) ).
cnf(i_0_193,negated_conjecture,
( nil = esk51_0
| segmentP(esk51_0,esk50_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lms9akrg/lgb.p',i_0_193) ).
cnf(i_0_200,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lms9akrg/lgb.p',i_0_200) ).
cnf(i_0_194,negated_conjecture,
( nil = esk51_0
| neq(esk50_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lms9akrg/lgb.p',i_0_194) ).
cnf(i_0_109,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lms9akrg/lgb.p',i_0_109) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lms9akrg/lgb.p',i_0_44) ).
cnf(i_0_196,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lms9akrg/lgb.p',i_0_196) ).
cnf(i_0_107,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lms9akrg/lgb.p',i_0_107) ).
cnf(c_0_213,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
i_0_195 ).
cnf(c_0_214,negated_conjecture,
esk49_0 = esk51_0,
i_0_198 ).
cnf(c_0_215,negated_conjecture,
esk50_0 = esk48_0,
i_0_197 ).
cnf(c_0_216,negated_conjecture,
ssList(esk49_0),
i_0_201 ).
cnf(c_0_217,negated_conjecture,
( ~ segmentP(esk51_0,X1)
| ~ segmentP(esk50_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_213,c_0_214]),c_0_215]) ).
cnf(c_0_218,negated_conjecture,
( nil = esk51_0
| segmentP(esk51_0,esk50_0) ),
i_0_193 ).
cnf(c_0_219,negated_conjecture,
ssList(esk50_0),
i_0_200 ).
cnf(c_0_220,negated_conjecture,
( nil = esk51_0
| neq(esk50_0,nil) ),
i_0_194 ).
cnf(c_0_221,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
i_0_109 ).
cnf(c_0_222,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_223,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_216,c_0_214]) ).
cnf(c_0_224,negated_conjecture,
neq(esk49_0,nil),
i_0_196 ).
cnf(c_0_225,negated_conjecture,
( esk51_0 = nil
| ~ segmentP(esk50_0,esk50_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_217,c_0_218]),c_0_219])]),c_0_220]) ).
cnf(c_0_226,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
i_0_107 ).
cnf(c_0_227,plain,
( ~ segmentP(esk50_0,nil)
| ~ neq(nil,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_217,c_0_221]),c_0_222]),c_0_223])]) ).
cnf(c_0_228,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_224,c_0_214]) ).
cnf(c_0_229,plain,
esk51_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_225,c_0_226]),c_0_219])]) ).
cnf(c_0_230,plain,
~ neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_227,c_0_221]),c_0_219])]) ).
cnf(c_0_231,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_228,c_0_229]),c_0_230]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC086+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n016.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 05:52:14 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox2/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.46 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.15/2.46 # No SInE strategy applied
% 8.15/2.46 # Trying AutoSched0 for 150 seconds
% 8.15/2.46 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 8.15/2.46 # and selection function SelectNewComplexAHP.
% 8.15/2.46 #
% 8.15/2.46 # Preprocessing time : 0.013 s
% 8.15/2.46 # Presaturation interreduction done
% 8.15/2.46
% 8.15/2.46 # Proof found!
% 8.15/2.46 # SZS status Theorem
% 8.15/2.46 # SZS output start CNFRefutation
% See solution above
% 8.15/2.46 # Training examples: 0 positive, 0 negative
% 8.15/2.46
% 8.15/2.46 # -------------------------------------------------
% 8.15/2.46 # User time : 0.014 s
% 8.15/2.46 # System time : 0.005 s
% 8.15/2.46 # Total time : 0.019 s
% 8.15/2.46 # Maximum resident set size: 7120 pages
% 8.15/2.46
%------------------------------------------------------------------------------