TSTP Solution File: SWC339+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC339+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:04 EDT 2022
% Result : Theorem 7.63s 2.25s
% Output : CNFRefutation 7.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 10
% Syntax : Number of clauses : 25 ( 20 unt; 0 nHn; 25 RR)
% Number of literals : 39 ( 9 equ; 17 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_204,negated_conjecture,
ssList(esk48_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-34kgbva9/lgb.p',i_0_204) ).
cnf(i_0_199,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-34kgbva9/lgb.p',i_0_199) ).
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-34kgbva9/lgb.p',i_0_149) ).
cnf(i_0_196,negated_conjecture,
app(app(esk52_0,esk50_0),esk53_0) = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-34kgbva9/lgb.p',i_0_196) ).
cnf(i_0_197,negated_conjecture,
ssList(esk53_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-34kgbva9/lgb.p',i_0_197) ).
cnf(i_0_198,negated_conjecture,
ssList(esk52_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-34kgbva9/lgb.p',i_0_198) ).
cnf(i_0_203,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-34kgbva9/lgb.p',i_0_203) ).
cnf(i_0_200,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-34kgbva9/lgb.p',i_0_200) ).
cnf(i_0_191,negated_conjecture,
( ~ totalorderedP(esk48_0)
| ~ segmentP(esk49_0,esk48_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-34kgbva9/lgb.p',i_0_191) ).
cnf(i_0_195,negated_conjecture,
totalorderedP(esk50_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-34kgbva9/lgb.p',i_0_195) ).
cnf(c_0_215,negated_conjecture,
ssList(esk48_0),
i_0_204 ).
cnf(c_0_216,negated_conjecture,
esk50_0 = esk48_0,
i_0_199 ).
cnf(c_0_217,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
i_0_149 ).
cnf(c_0_218,negated_conjecture,
app(app(esk52_0,esk50_0),esk53_0) = esk51_0,
i_0_196 ).
cnf(c_0_219,negated_conjecture,
ssList(esk53_0),
i_0_197 ).
cnf(c_0_220,negated_conjecture,
ssList(esk52_0),
i_0_198 ).
cnf(c_0_221,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_215,c_0_216]) ).
cnf(c_0_222,negated_conjecture,
ssList(esk49_0),
i_0_203 ).
cnf(c_0_223,negated_conjecture,
esk49_0 = esk51_0,
i_0_200 ).
cnf(c_0_224,negated_conjecture,
( ~ totalorderedP(esk48_0)
| ~ segmentP(esk49_0,esk48_0) ),
i_0_191 ).
cnf(c_0_225,negated_conjecture,
totalorderedP(esk50_0),
i_0_195 ).
cnf(c_0_226,negated_conjecture,
( segmentP(X1,esk50_0)
| esk51_0 != X1
| ~ ssList(X1) ),
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])]) ).
cnf(c_0_227,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_222,c_0_223]) ).
cnf(c_0_228,negated_conjecture,
~ segmentP(esk51_0,esk50_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_224,c_0_216]),c_0_225]),c_0_223]),c_0_216])]) ).
cnf(c_0_229,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_226]),c_0_227])]),c_0_228]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC339+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 : n020.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:00:52 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
% 7.63/2.25 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.63/2.25 # No SInE strategy applied
% 7.63/2.25 # Trying AutoSched0 for 150 seconds
% 7.63/2.25 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4d
% 7.63/2.25 # and selection function SelectCQIPrecWNTNp.
% 7.63/2.25 #
% 7.63/2.25 # Preprocessing time : 0.012 s
% 7.63/2.25
% 7.63/2.25 # Proof found!
% 7.63/2.25 # SZS status Theorem
% 7.63/2.25 # SZS output start CNFRefutation
% See solution above
% 7.63/2.25 # Training examples: 0 positive, 0 negative
% 7.63/2.25
% 7.63/2.25 # -------------------------------------------------
% 7.63/2.25 # User time : 0.015 s
% 7.63/2.25 # System time : 0.004 s
% 7.63/2.25 # Total time : 0.019 s
% 7.63/2.25 # Maximum resident set size: 7128 pages
% 7.63/2.25
%------------------------------------------------------------------------------