TSTP Solution File: SWC082+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC082+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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:29 EDT 2022
% Result : Theorem 7.69s 2.44s
% Output : CNFRefutation 7.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 23 ( 12 unt; 0 nHn; 23 RR)
% Number of literals : 40 ( 4 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 : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 3 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_197,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t2phpd2u/lgb.p',i_0_197) ).
cnf(i_0_199,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t2phpd2u/lgb.p',i_0_199) ).
cnf(i_0_196,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t2phpd2u/lgb.p',i_0_196) ).
cnf(i_0_198,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t2phpd2u/lgb.p',i_0_198) ).
cnf(i_0_191,negated_conjecture,
( segmentP(esk50_0,esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t2phpd2u/lgb.p',i_0_191) ).
cnf(i_0_192,negated_conjecture,
( segmentP(esk51_0,esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t2phpd2u/lgb.p',i_0_192) ).
cnf(i_0_193,negated_conjecture,
( neq(esk52_0,nil)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t2phpd2u/lgb.p',i_0_193) ).
cnf(i_0_194,negated_conjecture,
( ssList(esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t2phpd2u/lgb.p',i_0_194) ).
cnf(c_0_208,negated_conjecture,
neq(esk49_0,nil),
i_0_197 ).
cnf(c_0_209,negated_conjecture,
esk49_0 = esk51_0,
i_0_199 ).
cnf(c_0_210,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
i_0_196 ).
cnf(c_0_211,negated_conjecture,
esk50_0 = esk48_0,
i_0_198 ).
cnf(c_0_212,negated_conjecture,
( segmentP(esk50_0,esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_191 ).
cnf(c_0_213,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_208,c_0_209]) ).
cnf(c_0_214,negated_conjecture,
( segmentP(esk51_0,esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_192 ).
cnf(c_0_215,negated_conjecture,
( neq(esk52_0,nil)
| ~ neq(esk51_0,nil) ),
i_0_193 ).
cnf(c_0_216,negated_conjecture,
( ssList(esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_194 ).
cnf(c_0_217,negated_conjecture,
( ~ segmentP(esk50_0,X1)
| ~ segmentP(esk51_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_210,c_0_211]),c_0_209]) ).
cnf(c_0_218,negated_conjecture,
segmentP(esk50_0,esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_212,c_0_213])]) ).
cnf(c_0_219,negated_conjecture,
segmentP(esk51_0,esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_214,c_0_213])]) ).
cnf(c_0_220,negated_conjecture,
neq(esk52_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_215,c_0_213])]) ).
cnf(c_0_221,negated_conjecture,
ssList(esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_216,c_0_213])]) ).
cnf(c_0_222,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_217,c_0_218]),c_0_219]),c_0_220]),c_0_221])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC082+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n014.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 04:39:24 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.69/2.44 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.69/2.44 # No SInE strategy applied
% 7.69/2.44 # Trying AutoSched0 for 150 seconds
% 7.69/2.44 # AutoSched0-Mode selected heuristic G_____0017_C18_F1_SE_CS_SP_S4Y
% 7.69/2.44 # and selection function SelectMaxLComplexAPPNTNp.
% 7.69/2.44 #
% 7.69/2.44 # Preprocessing time : 0.023 s
% 7.69/2.44
% 7.69/2.44 # Proof found!
% 7.69/2.44 # SZS status Theorem
% 7.69/2.44 # SZS output start CNFRefutation
% See solution above
% 7.69/2.44 # Training examples: 0 positive, 0 negative
% 7.69/2.44
% 7.69/2.44 # -------------------------------------------------
% 7.69/2.44 # User time : 0.029 s
% 7.69/2.44 # System time : 0.001 s
% 7.69/2.44 # Total time : 0.030 s
% 7.69/2.44 # Maximum resident set size: 7124 pages
% 7.69/2.44
%------------------------------------------------------------------------------