TSTP Solution File: SWC270+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC270+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:14:40 EDT 2022
% Result : Theorem 15.50s 3.44s
% Output : CNFRefutation 15.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of clauses : 39 ( 10 unt; 21 nHn; 39 RR)
% Number of literals : 143 ( 6 equ; 86 neg)
% Maximal clause size : 9 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 45 ( 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-srxc4z4b/input.p',i_0_25) ).
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-srxc4z4b/input.p',i_0_11) ).
cnf(i_0_15,plain,
( totalorderedP(X1)
| ssItem(esk7_1(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-srxc4z4b/input.p',i_0_15) ).
cnf(i_0_16,plain,
( totalorderedP(X1)
| ssItem(esk6_1(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-srxc4z4b/input.p',i_0_16) ).
cnf(i_0_12,plain,
( totalorderedP(X1)
| ssList(esk10_1(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-srxc4z4b/input.p',i_0_12) ).
cnf(i_0_13,plain,
( totalorderedP(X1)
| ssList(esk9_1(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-srxc4z4b/input.p',i_0_13) ).
cnf(i_0_14,plain,
( totalorderedP(X1)
| ssList(esk8_1(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-srxc4z4b/input.p',i_0_14) ).
cnf(i_0_178,plain,
( leq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ lt(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-srxc4z4b/input.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-srxc4z4b/input.p',i_0_10) ).
cnf(i_0_191,negated_conjecture,
~ totalorderedP(esk48_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-srxc4z4b/input.p',i_0_191) ).
cnf(i_0_194,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-srxc4z4b/input.p',i_0_194) ).
cnf(i_0_192,negated_conjecture,
strictorderedP(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-srxc4z4b/input.p',i_0_192) ).
cnf(i_0_197,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-srxc4z4b/input.p',i_0_197) ).
cnf(c_0_211,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_212,plain,
( lt(X1,X2)
| ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(er,[status(thm)],[c_0_211]) ).
cnf(c_0_213,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_214,plain,
( lt(esk6_1(X1),esk7_1(X1))
| totalorderedP(X1)
| ~ strictorderedP(X1)
| ~ ssItem(esk7_1(X1))
| ~ ssItem(esk6_1(X1))
| ~ ssList(esk10_1(X1))
| ~ ssList(esk9_1(X1))
| ~ ssList(esk8_1(X1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_212,c_0_213]) ).
cnf(c_0_215,plain,
( totalorderedP(X1)
| ssItem(esk7_1(X1))
| ~ ssList(X1) ),
i_0_15 ).
cnf(c_0_216,plain,
( lt(esk6_1(X1),esk7_1(X1))
| totalorderedP(X1)
| ~ strictorderedP(X1)
| ~ ssItem(esk6_1(X1))
| ~ ssList(esk10_1(X1))
| ~ ssList(esk9_1(X1))
| ~ ssList(esk8_1(X1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_214,c_0_215]) ).
cnf(c_0_217,plain,
( totalorderedP(X1)
| ssItem(esk6_1(X1))
| ~ ssList(X1) ),
i_0_16 ).
cnf(c_0_218,plain,
( lt(esk6_1(X1),esk7_1(X1))
| totalorderedP(X1)
| ~ strictorderedP(X1)
| ~ ssList(esk10_1(X1))
| ~ ssList(esk9_1(X1))
| ~ ssList(esk8_1(X1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_216,c_0_217]) ).
cnf(c_0_219,plain,
( totalorderedP(X1)
| ssList(esk10_1(X1))
| ~ ssList(X1) ),
i_0_12 ).
cnf(c_0_220,plain,
( lt(esk6_1(X1),esk7_1(X1))
| totalorderedP(X1)
| ~ strictorderedP(X1)
| ~ ssList(esk9_1(X1))
| ~ ssList(esk8_1(X1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_218,c_0_219]) ).
cnf(c_0_221,plain,
( totalorderedP(X1)
| ssList(esk9_1(X1))
| ~ ssList(X1) ),
i_0_13 ).
cnf(c_0_222,plain,
( lt(esk6_1(X1),esk7_1(X1))
| totalorderedP(X1)
| ~ strictorderedP(X1)
| ~ ssList(esk8_1(X1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_220,c_0_221]) ).
cnf(c_0_223,plain,
( totalorderedP(X1)
| ssList(esk8_1(X1))
| ~ ssList(X1) ),
i_0_14 ).
cnf(c_0_224,plain,
( leq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ lt(X1,X2) ),
i_0_178 ).
cnf(c_0_225,plain,
( lt(esk6_1(X1),esk7_1(X1))
| totalorderedP(X1)
| ~ strictorderedP(X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_222,c_0_223]) ).
cnf(c_0_226,plain,
( leq(esk6_1(X1),esk7_1(X1))
| totalorderedP(X1)
| ~ strictorderedP(X1)
| ~ ssItem(esk7_1(X1))
| ~ ssItem(esk6_1(X1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_224,c_0_225]) ).
cnf(c_0_227,plain,
( leq(esk6_1(X1),esk7_1(X1))
| totalorderedP(X1)
| ~ strictorderedP(X1)
| ~ ssItem(esk6_1(X1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_226,c_0_215]) ).
cnf(c_0_228,plain,
( totalorderedP(X1)
| ~ ssList(X1)
| ~ leq(esk6_1(X1),esk7_1(X1)) ),
i_0_10 ).
cnf(c_0_229,plain,
( leq(esk6_1(X1),esk7_1(X1))
| totalorderedP(X1)
| ~ strictorderedP(X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_227,c_0_217]) ).
cnf(c_0_230,negated_conjecture,
~ totalorderedP(esk48_0),
i_0_191 ).
cnf(c_0_231,negated_conjecture,
esk50_0 = esk48_0,
i_0_194 ).
cnf(c_0_232,plain,
( totalorderedP(X1)
| ~ strictorderedP(X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_228,c_0_229]) ).
cnf(c_0_233,negated_conjecture,
strictorderedP(esk50_0),
i_0_192 ).
cnf(c_0_234,negated_conjecture,
ssList(esk50_0),
i_0_197 ).
cnf(c_0_235,negated_conjecture,
~ totalorderedP(esk50_0),
inference(rw,[status(thm)],[c_0_230,c_0_231]) ).
cnf(c_0_236,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[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.12 % Problem : SWC270+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n025.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 15:06:40 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 15.50/3.44 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d30-l6400-e0.15+coop-eprover66:
% 15.50/3.44 # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 30; version: 991; iters: 150)
% 15.50/3.44 # Preprocessing time : 0.839 s
% 15.50/3.44 # Presaturation interreduction done
% 15.50/3.44
% 15.50/3.44 # Proof found!
% 15.50/3.44 # SZS status Theorem
% 15.50/3.44 # SZS output start CNFRefutation
% See solution above
% 15.50/3.44 # Training examples: 0 positive, 0 negative
% 15.50/3.44
% 15.50/3.44 # -------------------------------------------------
% 15.50/3.44 # User time : 0.822 s
% 15.50/3.44 # System time : 0.112 s
% 15.50/3.44 # Total time : 0.934 s
% 15.50/3.44 # ...preprocessing : 0.839 s
% 15.50/3.44 # ...main loop : 0.095 s
% 15.50/3.44 # Maximum resident set size: 168344 pages
% 15.50/3.44
%------------------------------------------------------------------------------