TSTP Solution File: SWC340+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC340+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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:05 EDT 2022
% Result : Theorem 8.93s 2.64s
% Output : CNFRefutation 8.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 15
% Syntax : Number of clauses : 37 ( 14 unt; 13 nHn; 37 RR)
% Number of literals : 101 ( 8 equ; 54 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_25,plain,
( lt(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X6)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ strictorderedP(X6) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-54nd4byq/lgb.p',i_0_25) ).
cnf(i_0_193,negated_conjecture,
segmentP(esk51_0,esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-54nd4byq/lgb.p',i_0_193) ).
cnf(i_0_195,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-54nd4byq/lgb.p',i_0_195) ).
cnf(i_0_11,plain,
( app(app(esk8_1(X1),cons(esk6_1(X1),esk9_1(X1))),cons(esk7_1(X1),esk10_1(X1))) = X1
| totalorderedP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-54nd4byq/lgb.p',i_0_11) ).
cnf(i_0_16,plain,
( totalorderedP(X1)
| ssItem(esk6_1(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-54nd4byq/lgb.p',i_0_16) ).
cnf(i_0_15,plain,
( totalorderedP(X1)
| ssItem(esk7_1(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-54nd4byq/lgb.p',i_0_15) ).
cnf(i_0_14,plain,
( totalorderedP(X1)
| ssList(esk8_1(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-54nd4byq/lgb.p',i_0_14) ).
cnf(i_0_13,plain,
( totalorderedP(X1)
| ssList(esk9_1(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-54nd4byq/lgb.p',i_0_13) ).
cnf(i_0_12,plain,
( totalorderedP(X1)
| ssList(esk10_1(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-54nd4byq/lgb.p',i_0_12) ).
cnf(i_0_191,negated_conjecture,
( ~ totalorderedP(esk48_0)
| ~ segmentP(esk49_0,esk48_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-54nd4byq/lgb.p',i_0_191) ).
cnf(i_0_194,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-54nd4byq/lgb.p',i_0_194) ).
cnf(i_0_178,plain,
( leq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ lt(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-54nd4byq/lgb.p',i_0_178) ).
cnf(i_0_10,plain,
( totalorderedP(X1)
| ~ ssList(X1)
| ~ leq(esk6_1(X1),esk7_1(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-54nd4byq/lgb.p',i_0_10) ).
cnf(i_0_199,negated_conjecture,
ssList(esk48_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-54nd4byq/lgb.p',i_0_199) ).
cnf(i_0_192,negated_conjecture,
strictorderedP(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-54nd4byq/lgb.p',i_0_192) ).
cnf(c_0_215,plain,
( lt(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X6)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ strictorderedP(X6) ),
i_0_25 ).
cnf(c_0_216,negated_conjecture,
segmentP(esk51_0,esk50_0),
i_0_193 ).
cnf(c_0_217,negated_conjecture,
esk49_0 = esk51_0,
i_0_195 ).
cnf(c_0_218,plain,
( lt(X1,X2)
| ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_215]) ).
cnf(c_0_219,plain,
( app(app(esk8_1(X1),cons(esk6_1(X1),esk9_1(X1))),cons(esk7_1(X1),esk10_1(X1))) = X1
| totalorderedP(X1)
| ~ ssList(X1) ),
i_0_11 ).
cnf(c_0_220,plain,
( totalorderedP(X1)
| ssItem(esk6_1(X1))
| ~ ssList(X1) ),
i_0_16 ).
cnf(c_0_221,plain,
( totalorderedP(X1)
| ssItem(esk7_1(X1))
| ~ ssList(X1) ),
i_0_15 ).
cnf(c_0_222,plain,
( totalorderedP(X1)
| ssList(esk8_1(X1))
| ~ ssList(X1) ),
i_0_14 ).
cnf(c_0_223,plain,
( totalorderedP(X1)
| ssList(esk9_1(X1))
| ~ ssList(X1) ),
i_0_13 ).
cnf(c_0_224,plain,
( totalorderedP(X1)
| ssList(esk10_1(X1))
| ~ ssList(X1) ),
i_0_12 ).
cnf(c_0_225,negated_conjecture,
( ~ totalorderedP(esk48_0)
| ~ segmentP(esk49_0,esk48_0) ),
i_0_191 ).
cnf(c_0_226,negated_conjecture,
esk50_0 = esk48_0,
i_0_194 ).
cnf(c_0_227,negated_conjecture,
segmentP(esk49_0,esk50_0),
inference(rw,[status(thm)],[c_0_216,c_0_217]) ).
cnf(c_0_228,plain,
( leq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ lt(X1,X2) ),
i_0_178 ).
cnf(c_0_229,plain,
( lt(esk6_1(X1),esk7_1(X1))
| totalorderedP(X1)
| ~ strictorderedP(X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_218,c_0_219]),c_0_220]),c_0_221]),c_0_222]),c_0_223]),c_0_224]) ).
cnf(c_0_230,plain,
( totalorderedP(X1)
| ~ ssList(X1)
| ~ leq(esk6_1(X1),esk7_1(X1)) ),
i_0_10 ).
cnf(c_0_231,negated_conjecture,
ssList(esk48_0),
i_0_199 ).
cnf(c_0_232,negated_conjecture,
~ totalorderedP(esk50_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_225,c_0_226]),c_0_226]),c_0_227])]) ).
cnf(c_0_233,plain,
( totalorderedP(X1)
| ~ strictorderedP(X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_228,c_0_229]),c_0_220]),c_0_221]),c_0_230]) ).
cnf(c_0_234,negated_conjecture,
strictorderedP(esk50_0),
i_0_192 ).
cnf(c_0_235,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_231,c_0_226]) ).
cnf(c_0_236,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_232,c_0_233]),c_0_234]),c_0_235])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWC340+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n012.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 12 14:37:12 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
% 8.93/2.64 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.93/2.64 # No SInE strategy applied
% 8.93/2.64 # Trying AutoSched0 for 150 seconds
% 8.93/2.64 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 8.93/2.64 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.93/2.64 #
% 8.93/2.64 # Preprocessing time : 0.025 s
% 8.93/2.64
% 8.93/2.64 # Proof found!
% 8.93/2.64 # SZS status Theorem
% 8.93/2.64 # SZS output start CNFRefutation
% See solution above
% 8.93/2.64 # Training examples: 0 positive, 0 negative
% 8.93/2.64
% 8.93/2.64 # -------------------------------------------------
% 8.93/2.64 # User time : 0.033 s
% 8.93/2.64 # System time : 0.004 s
% 8.93/2.64 # Total time : 0.037 s
% 8.93/2.64 # Maximum resident set size: 7124 pages
% 8.93/2.64
%------------------------------------------------------------------------------