TSTP Solution File: SWV196+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV196+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n003.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 : Wed Jul 20 17:46:10 EDT 2022
% Result : Theorem 9.24s 2.63s
% Output : CNFRefutation 9.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 9 unt; 0 nHn; 17 RR)
% Number of literals : 27 ( 3 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_208,plain,
( leq(pv5,n0)
| ~ epred2_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w4m8__0_/lgb.p',i_0_208) ).
cnf(i_0_141,negated_conjecture,
epred2_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w4m8__0_/lgb.p',i_0_141) ).
cnf(i_0_209,plain,
( leq(n0,pv5)
| ~ epred2_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w4m8__0_/lgb.p',i_0_209) ).
cnf(i_0_206,plain,
( gt(pv5,n0)
| ~ epred2_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w4m8__0_/lgb.p',i_0_206) ).
cnf(i_0_4,plain,
( X1 = n0
| ~ leq(X1,n0)
| ~ leq(n0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w4m8__0_/lgb.p',i_0_4) ).
cnf(i_0_39,plain,
~ gt(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w4m8__0_/lgb.p',i_0_39) ).
cnf(c_0_216,plain,
( leq(pv5,n0)
| ~ epred2_0 ),
i_0_208 ).
cnf(c_0_217,negated_conjecture,
epred2_0,
i_0_141 ).
cnf(c_0_218,plain,
( leq(n0,pv5)
| ~ epred2_0 ),
i_0_209 ).
cnf(c_0_219,plain,
( gt(pv5,n0)
| ~ epred2_0 ),
i_0_206 ).
cnf(c_0_220,plain,
( X1 = n0
| ~ leq(X1,n0)
| ~ leq(n0,X1) ),
i_0_4 ).
cnf(c_0_221,plain,
leq(pv5,n0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_216,c_0_217])]) ).
cnf(c_0_222,plain,
leq(n0,pv5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_218,c_0_217])]) ).
cnf(c_0_223,plain,
gt(pv5,n0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_219,c_0_217])]) ).
cnf(c_0_224,plain,
pv5 = n0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_220,c_0_221]),c_0_222])]) ).
cnf(c_0_225,plain,
~ gt(X1,X1),
i_0_39 ).
cnf(c_0_226,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_223,c_0_224]),c_0_225]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SWV196+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.08/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.36 % Computer : n003.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Wed Jun 15 11:42:12 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.47 # ENIGMATIC: Selected SinE mode:
% 0.21/0.48 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.24/2.63 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.24/2.63 # No SInE strategy applied
% 9.24/2.63 # Trying AutoSched0 for 150 seconds
% 9.24/2.63 # AutoSched0-Mode selected heuristic G_E___300_C18_F1_URBAN_S0Y
% 9.24/2.63 # and selection function SelectMaxLComplexAvoidPosPred.
% 9.24/2.63 #
% 9.24/2.63 # Preprocessing time : 0.024 s
% 9.24/2.63
% 9.24/2.63 # Proof found!
% 9.24/2.63 # SZS status Theorem
% 9.24/2.63 # SZS output start CNFRefutation
% See solution above
% 9.24/2.63 # Training examples: 0 positive, 0 negative
% 9.24/2.63
% 9.24/2.63 # -------------------------------------------------
% 9.24/2.63 # User time : 0.028 s
% 9.24/2.63 # System time : 0.011 s
% 9.24/2.63 # Total time : 0.039 s
% 9.24/2.63 # Maximum resident set size: 7120 pages
% 9.24/2.63
%------------------------------------------------------------------------------