TSTP Solution File: SWC373+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC373+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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:17 EDT 2022
% Result : Theorem 7.75s 2.47s
% Output : CNFRefutation 7.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 12
% Syntax : Number of clauses : 31 ( 18 unt; 0 nHn; 31 RR)
% Number of literals : 68 ( 10 equ; 40 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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-3_75kekz/lgb.p',i_0_149) ).
cnf(i_0_159,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3_75kekz/lgb.p',i_0_159) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3_75kekz/lgb.p',i_0_44) ).
cnf(i_0_58,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3_75kekz/lgb.p',i_0_58) ).
cnf(i_0_191,negated_conjecture,
~ segmentP(esk49_0,esk48_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3_75kekz/lgb.p',i_0_191) ).
cnf(i_0_193,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3_75kekz/lgb.p',i_0_193) ).
cnf(i_0_131,plain,
( app(esk33_2(X1,X2),X2) = X1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3_75kekz/lgb.p',i_0_131) ).
cnf(i_0_132,plain,
( ssList(esk33_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3_75kekz/lgb.p',i_0_132) ).
cnf(i_0_198,negated_conjecture,
ssList(esk48_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3_75kekz/lgb.p',i_0_198) ).
cnf(i_0_192,negated_conjecture,
rearsegP(esk51_0,esk50_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3_75kekz/lgb.p',i_0_192) ).
cnf(i_0_194,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3_75kekz/lgb.p',i_0_194) ).
cnf(i_0_197,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3_75kekz/lgb.p',i_0_197) ).
cnf(c_0_211,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
i_0_149 ).
cnf(c_0_212,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_211]) ).
cnf(c_0_213,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
i_0_159 ).
cnf(c_0_214,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_215,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_58 ).
cnf(c_0_216,negated_conjecture,
~ segmentP(esk49_0,esk48_0),
i_0_191 ).
cnf(c_0_217,negated_conjecture,
esk50_0 = esk48_0,
i_0_193 ).
cnf(c_0_218,plain,
( segmentP(app(X1,X2),X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_212,c_0_213]),c_0_214])]),c_0_215]) ).
cnf(c_0_219,plain,
( app(esk33_2(X1,X2),X2) = X1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(X1,X2) ),
i_0_131 ).
cnf(c_0_220,plain,
( ssList(esk33_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(X1,X2) ),
i_0_132 ).
cnf(c_0_221,negated_conjecture,
ssList(esk48_0),
i_0_198 ).
cnf(c_0_222,negated_conjecture,
rearsegP(esk51_0,esk50_0),
i_0_192 ).
cnf(c_0_223,negated_conjecture,
esk49_0 = esk51_0,
i_0_194 ).
cnf(c_0_224,negated_conjecture,
~ segmentP(esk49_0,esk50_0),
inference(rw,[status(thm)],[c_0_216,c_0_217]) ).
cnf(c_0_225,plain,
( segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_218,c_0_219]),c_0_220]) ).
cnf(c_0_226,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_221,c_0_217]) ).
cnf(c_0_227,negated_conjecture,
ssList(esk49_0),
i_0_197 ).
cnf(c_0_228,negated_conjecture,
rearsegP(esk49_0,esk50_0),
inference(rw,[status(thm)],[c_0_222,c_0_223]) ).
cnf(c_0_229,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_224,c_0_225]),c_0_226]),c_0_227]),c_0_228])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC373+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 : n025.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 19:53:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/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.75/2.47 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.75/2.47 # No SInE strategy applied
% 7.75/2.47 # Trying AutoSched0 for 150 seconds
% 7.75/2.47 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 7.75/2.47 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.75/2.47 #
% 7.75/2.47 # Preprocessing time : 0.024 s
% 7.75/2.47
% 7.75/2.47 # Proof found!
% 7.75/2.47 # SZS status Theorem
% 7.75/2.47 # SZS output start CNFRefutation
% See solution above
% 7.75/2.47 # Training examples: 0 positive, 0 negative
% 7.75/2.47
% 7.75/2.47 # -------------------------------------------------
% 7.75/2.47 # User time : 0.031 s
% 7.75/2.47 # System time : 0.004 s
% 7.75/2.47 # Total time : 0.036 s
% 7.75/2.47 # Maximum resident set size: 7128 pages
% 7.75/2.47
%------------------------------------------------------------------------------