TSTP Solution File: SWC384+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC384+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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:21 EDT 2022
% Result : Theorem 7.82s 2.49s
% Output : CNFRefutation 7.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of clauses : 40 ( 14 unt; 12 nHn; 40 RR)
% Number of literals : 85 ( 26 equ; 39 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_98,plain,
( singletonP(X1)
| cons(X2,nil) != X1
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1pmwc2qy/lgb.p',i_0_98) ).
cnf(i_0_191,negated_conjecture,
( ~ singletonP(esk48_0)
| ~ segmentP(esk49_0,esk48_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1pmwc2qy/lgb.p',i_0_191) ).
cnf(i_0_207,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1pmwc2qy/lgb.p',i_0_207) ).
cnf(i_0_208,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1pmwc2qy/lgb.p',i_0_208) ).
cnf(i_0_199,negated_conjecture,
( nil = esk51_0
| cons(esk52_0,nil) = esk50_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1pmwc2qy/lgb.p',i_0_199) ).
cnf(i_0_210,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1pmwc2qy/lgb.p',i_0_210) ).
cnf(i_0_205,negated_conjecture,
( nil = esk51_0
| ssItem(esk52_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1pmwc2qy/lgb.p',i_0_205) ).
cnf(i_0_108,plain,
( segmentP(app(app(X1,X2),X3),X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ segmentP(X2,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1pmwc2qy/lgb.p',i_0_108) ).
cnf(i_0_197,negated_conjecture,
( nil = esk51_0
| app(app(esk53_0,esk50_0),esk54_0) = esk51_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1pmwc2qy/lgb.p',i_0_197) ).
cnf(i_0_203,negated_conjecture,
( nil = esk51_0
| ssList(esk53_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1pmwc2qy/lgb.p',i_0_203) ).
cnf(i_0_201,negated_conjecture,
( nil = esk51_0
| ssList(esk54_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1pmwc2qy/lgb.p',i_0_201) ).
cnf(i_0_206,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1pmwc2qy/lgb.p',i_0_206) ).
cnf(i_0_107,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1pmwc2qy/lgb.p',i_0_107) ).
cnf(i_0_42,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1pmwc2qy/lgb.p',i_0_42) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1pmwc2qy/lgb.p',i_0_44) ).
cnf(c_0_226,plain,
( singletonP(X1)
| cons(X2,nil) != X1
| ~ ssList(X1)
| ~ ssItem(X2) ),
i_0_98 ).
cnf(c_0_227,negated_conjecture,
( ~ singletonP(esk48_0)
| ~ segmentP(esk49_0,esk48_0) ),
i_0_191 ).
cnf(c_0_228,negated_conjecture,
esk50_0 = esk48_0,
i_0_207 ).
cnf(c_0_229,negated_conjecture,
esk49_0 = esk51_0,
i_0_208 ).
cnf(c_0_230,plain,
( singletonP(cons(X1,nil))
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_226]) ).
cnf(c_0_231,negated_conjecture,
( nil = esk51_0
| cons(esk52_0,nil) = esk50_0 ),
i_0_199 ).
cnf(c_0_232,negated_conjecture,
ssList(esk50_0),
i_0_210 ).
cnf(c_0_233,negated_conjecture,
( nil = esk51_0
| ssItem(esk52_0) ),
i_0_205 ).
cnf(c_0_234,plain,
( segmentP(app(app(X1,X2),X3),X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ segmentP(X2,X4) ),
i_0_108 ).
cnf(c_0_235,negated_conjecture,
( nil = esk51_0
| app(app(esk53_0,esk50_0),esk54_0) = esk51_0 ),
i_0_197 ).
cnf(c_0_236,negated_conjecture,
( nil = esk51_0
| ssList(esk53_0) ),
i_0_203 ).
cnf(c_0_237,negated_conjecture,
( nil = esk51_0
| ssList(esk54_0) ),
i_0_201 ).
cnf(c_0_238,negated_conjecture,
( ~ segmentP(esk51_0,esk50_0)
| ~ singletonP(esk50_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_227,c_0_228]),c_0_229]),c_0_228]) ).
cnf(c_0_239,negated_conjecture,
( esk51_0 = nil
| singletonP(esk50_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_230,c_0_231]),c_0_232])]),c_0_233]) ).
cnf(c_0_240,negated_conjecture,
neq(esk49_0,nil),
i_0_206 ).
cnf(c_0_241,negated_conjecture,
( esk51_0 = nil
| segmentP(esk51_0,X1)
| ~ ssList(X1)
| ~ segmentP(esk50_0,X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_234,c_0_235]),c_0_232])]),c_0_236]),c_0_237]) ).
cnf(c_0_242,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
i_0_107 ).
cnf(c_0_243,negated_conjecture,
( esk51_0 = nil
| ~ segmentP(esk51_0,esk50_0) ),
inference(spm,[status(thm)],[c_0_238,c_0_239]) ).
cnf(c_0_244,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
i_0_42 ).
cnf(c_0_245,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_240,c_0_229]) ).
cnf(c_0_246,plain,
esk51_0 = nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_241,c_0_242]),c_0_232])]),c_0_243]) ).
cnf(c_0_247,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_244]) ).
cnf(c_0_248,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_245,c_0_246]) ).
cnf(c_0_249,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_250,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_247,c_0_248]),c_0_249])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWC384+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n011.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 12 16:48:04 EDT 2022
% 0.13/0.35 % 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.82/2.49 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.82/2.49 # No SInE strategy applied
% 7.82/2.49 # Trying AutoSched0 for 150 seconds
% 7.82/2.49 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S068N
% 7.82/2.49 # and selection function PSelectNewComplexAHP.
% 7.82/2.49 #
% 7.82/2.49 # Preprocessing time : 0.023 s
% 7.82/2.49 # Presaturation interreduction done
% 7.82/2.49
% 7.82/2.49 # Proof found!
% 7.82/2.49 # SZS status Theorem
% 7.82/2.49 # SZS output start CNFRefutation
% See solution above
% 7.82/2.49 # Training examples: 0 positive, 0 negative
% 7.82/2.49
% 7.82/2.49 # -------------------------------------------------
% 7.82/2.49 # User time : 0.031 s
% 7.82/2.49 # System time : 0.005 s
% 7.82/2.49 # Total time : 0.036 s
% 7.82/2.49 # Maximum resident set size: 7124 pages
% 7.82/2.49
%------------------------------------------------------------------------------