TSTP Solution File: SWV182+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV182+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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:07 EDT 2022
% Result : Theorem 7.48s 2.36s
% Output : CNFRefutation 7.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of clauses : 44 ( 25 unt; 4 nHn; 40 RR)
% Number of literals : 77 ( 18 equ; 35 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_174,plain,
( a_select2(rho_init,X1) = init
| ~ epred1_0
| ~ leq(X1,n4)
| ~ leq(n0,X1)
| ~ gt(loopcounter,n0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2sb8c9cm/lgb.p',i_0_174) ).
cnf(i_0_4,negated_conjecture,
epred1_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2sb8c9cm/lgb.p',i_0_4) ).
cnf(i_0_1,negated_conjecture,
a_select2(rho_init,esk1_0) != init,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2sb8c9cm/lgb.p',i_0_1) ).
cnf(i_0_2,negated_conjecture,
leq(esk1_0,n4),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2sb8c9cm/lgb.p',i_0_2) ).
cnf(i_0_3,negated_conjecture,
leq(n0,esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2sb8c9cm/lgb.p',i_0_3) ).
cnf(i_0_168,plain,
( X1 = X2
| gt(X2,X1)
| gt(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2sb8c9cm/lgb.p',i_0_168) ).
cnf(i_0_43,plain,
( leq(X1,X2)
| ~ gt(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2sb8c9cm/lgb.p',i_0_43) ).
cnf(i_0_178,plain,
( leq(n1,loopcounter)
| ~ epred1_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2sb8c9cm/lgb.p',i_0_178) ).
cnf(i_0_42,plain,
~ gt(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2sb8c9cm/lgb.p',i_0_42) ).
cnf(i_0_51,plain,
( gt(plus(X1,n1),X2)
| ~ leq(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2sb8c9cm/lgb.p',i_0_51) ).
cnf(i_0_7,plain,
( X1 = n0
| ~ leq(X1,n0)
| ~ leq(n0,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2sb8c9cm/lgb.p',i_0_7) ).
cnf(i_0_170,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2sb8c9cm/lgb.p',i_0_170) ).
cnf(i_0_14,plain,
gt(n1,n0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2sb8c9cm/lgb.p',i_0_14) ).
cnf(i_0_154,plain,
plus(n1,X1) = plus(X1,n1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2sb8c9cm/lgb.p',i_0_154) ).
cnf(i_0_149,plain,
plus(n0,n1) = n1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2sb8c9cm/lgb.p',i_0_149) ).
cnf(c_0_194,plain,
( a_select2(rho_init,X1) = init
| ~ epred1_0
| ~ leq(X1,n4)
| ~ leq(n0,X1)
| ~ gt(loopcounter,n0) ),
i_0_174 ).
cnf(c_0_195,negated_conjecture,
epred1_0,
i_0_4 ).
cnf(c_0_196,negated_conjecture,
a_select2(rho_init,esk1_0) != init,
i_0_1 ).
cnf(c_0_197,plain,
( a_select2(rho_init,X1) = init
| ~ gt(loopcounter,n0)
| ~ leq(X1,n4)
| ~ leq(n0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_194,c_0_195])]) ).
cnf(c_0_198,negated_conjecture,
leq(esk1_0,n4),
i_0_2 ).
cnf(c_0_199,negated_conjecture,
leq(n0,esk1_0),
i_0_3 ).
cnf(c_0_200,negated_conjecture,
~ gt(loopcounter,n0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_196,c_0_197]),c_0_198]),c_0_199])]) ).
cnf(c_0_201,plain,
( X1 = X2
| gt(X2,X1)
| gt(X1,X2) ),
i_0_168 ).
cnf(c_0_202,plain,
( leq(X1,X2)
| ~ gt(X2,X1) ),
i_0_43 ).
cnf(c_0_203,negated_conjecture,
( loopcounter = n0
| gt(n0,loopcounter) ),
inference(spm,[status(thm)],[c_0_200,c_0_201]) ).
cnf(c_0_204,plain,
( leq(n1,loopcounter)
| ~ epred1_0 ),
i_0_178 ).
cnf(c_0_205,plain,
~ gt(X1,X1),
i_0_42 ).
cnf(c_0_206,plain,
( gt(plus(X1,n1),X2)
| ~ leq(X2,X1) ),
i_0_51 ).
cnf(c_0_207,plain,
( X1 = n0
| ~ leq(X1,n0)
| ~ leq(n0,X1) ),
i_0_7 ).
cnf(c_0_208,plain,
( loopcounter = n0
| leq(loopcounter,n0) ),
inference(spm,[status(thm)],[c_0_202,c_0_203]) ).
cnf(c_0_209,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
i_0_170 ).
cnf(c_0_210,plain,
leq(n1,loopcounter),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_204,c_0_195])]) ).
cnf(c_0_211,plain,
gt(n1,n0),
i_0_14 ).
cnf(c_0_212,plain,
~ leq(plus(X1,n1),X1),
inference(spm,[status(thm)],[c_0_205,c_0_206]) ).
cnf(c_0_213,plain,
plus(n1,X1) = plus(X1,n1),
i_0_154 ).
cnf(c_0_214,plain,
plus(n0,n1) = n1,
i_0_149 ).
cnf(c_0_215,plain,
( loopcounter = n0
| ~ leq(n0,loopcounter) ),
inference(spm,[status(thm)],[c_0_207,c_0_208]) ).
cnf(c_0_216,plain,
( leq(X1,loopcounter)
| ~ leq(X1,n1) ),
inference(spm,[status(thm)],[c_0_209,c_0_210]) ).
cnf(c_0_217,plain,
leq(n0,n1),
inference(spm,[status(thm)],[c_0_202,c_0_211]) ).
cnf(c_0_218,plain,
~ leq(plus(n1,X1),X1),
inference(spm,[status(thm)],[c_0_212,c_0_213]) ).
cnf(c_0_219,plain,
plus(n1,n0) = n1,
inference(rw,[status(thm)],[c_0_214,c_0_213]) ).
cnf(c_0_220,plain,
loopcounter = n0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_215,c_0_216]),c_0_217])]) ).
cnf(c_0_221,plain,
~ leq(n1,n0),
inference(spm,[status(thm)],[c_0_218,c_0_219]) ).
cnf(c_0_222,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_210,c_0_220]),c_0_221]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV182+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 14 16:09:23 EDT 2022
% 0.13/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.48/2.36 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.48/2.36 # No SInE strategy applied
% 7.48/2.36 # Trying AutoSched0 for 150 seconds
% 7.48/2.36 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.48/2.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.48/2.36 #
% 7.48/2.36 # Preprocessing time : 0.013 s
% 7.48/2.36 # Presaturation interreduction done
% 7.48/2.36
% 7.48/2.36 # Proof found!
% 7.48/2.36 # SZS status Theorem
% 7.48/2.36 # SZS output start CNFRefutation
% See solution above
% 7.48/2.36 # Training examples: 0 positive, 0 negative
% 7.48/2.36
% 7.48/2.36 # -------------------------------------------------
% 7.48/2.36 # User time : 0.026 s
% 7.48/2.36 # System time : 0.002 s
% 7.48/2.36 # Total time : 0.028 s
% 7.48/2.36 # Maximum resident set size: 7128 pages
% 7.48/2.36
%------------------------------------------------------------------------------