TSTP Solution File: NUM316+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM316+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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 : Mon Jul 18 08:24:14 EDT 2022
% Result : Theorem 8.78s 2.42s
% Output : CNFRefutation 8.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of clauses : 34 ( 22 unt; 0 nHn; 34 RR)
% Number of literals : 63 ( 0 equ; 31 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-1 aty)
% Number of variables : 39 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_153,plain,
( rdn_positive_less(rdnn(X1),rdnn(X2))
| ~ rdn_positive_less(rdnn(X3),rdnn(X2))
| ~ rdn_positive_less(rdnn(X1),rdnn(X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8vmy_81s/lgb.p',i_0_153) ).
cnf(i_0_145,plain,
rdn_positive_less(rdnn(n3),rdnn(n4)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8vmy_81s/lgb.p',i_0_145) ).
cnf(i_0_156,plain,
( sum(X1,X2,X3)
| ~ rdn_positive_less(X4,X5)
| ~ rdn_translate(X3,rdn_neg(X6))
| ~ rdn_translate(X2,rdn_neg(X5))
| ~ rdn_translate(X1,rdn_pos(X4))
| ~ rdn_add_with_carry(rdnn(n0),X4,X6,X5) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8vmy_81s/lgb.p',i_0_156) ).
cnf(i_0_138,plain,
rdn_translate(nn3,rdn_neg(rdnn(n3))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8vmy_81s/lgb.p',i_0_138) ).
cnf(i_0_146,plain,
rdn_positive_less(rdnn(n4),rdnn(n5)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8vmy_81s/lgb.p',i_0_146) ).
cnf(i_0_144,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8vmy_81s/lgb.p',i_0_144) ).
cnf(i_0_1,plain,
( rdn_add_with_carry(rdnn(X1),rdnn(X2),rdnn(X3),rdnn(X4))
| ~ rdn_digit_add(rdnn(X5),rdnn(X1),rdnn(X4),rdnn(n0))
| ~ rdn_digit_add(rdnn(X2),rdnn(X3),rdnn(X5),rdnn(n0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8vmy_81s/lgb.p',i_0_1) ).
cnf(i_0_87,plain,
rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8vmy_81s/lgb.p',i_0_87) ).
cnf(i_0_139,plain,
rdn_translate(nn5,rdn_neg(rdnn(n5))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8vmy_81s/lgb.p',i_0_139) ).
cnf(i_0_60,plain,
rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8vmy_81s/lgb.p',i_0_60) ).
cnf(i_0_20,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8vmy_81s/lgb.p',i_0_20) ).
cnf(i_0_160,negated_conjecture,
~ sum(n2,nn5,nn3),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8vmy_81s/lgb.p',i_0_160) ).
cnf(c_0_173,plain,
( rdn_positive_less(rdnn(X1),rdnn(X2))
| ~ rdn_positive_less(rdnn(X3),rdnn(X2))
| ~ rdn_positive_less(rdnn(X1),rdnn(X3)) ),
i_0_153 ).
cnf(c_0_174,plain,
rdn_positive_less(rdnn(n3),rdnn(n4)),
i_0_145 ).
cnf(c_0_175,plain,
( sum(X1,X2,X3)
| ~ rdn_positive_less(X4,X5)
| ~ rdn_translate(X3,rdn_neg(X6))
| ~ rdn_translate(X2,rdn_neg(X5))
| ~ rdn_translate(X1,rdn_pos(X4))
| ~ rdn_add_with_carry(rdnn(n0),X4,X6,X5) ),
i_0_156 ).
cnf(c_0_176,plain,
rdn_translate(nn3,rdn_neg(rdnn(n3))),
i_0_138 ).
cnf(c_0_177,plain,
rdn_positive_less(rdnn(n4),rdnn(n5)),
i_0_146 ).
cnf(c_0_178,plain,
( rdn_positive_less(rdnn(X1),rdnn(n4))
| ~ rdn_positive_less(rdnn(X1),rdnn(n3)) ),
inference(spm,[status(thm)],[c_0_173,c_0_174]) ).
cnf(c_0_179,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
i_0_144 ).
cnf(c_0_180,plain,
( rdn_add_with_carry(rdnn(X1),rdnn(X2),rdnn(X3),rdnn(X4))
| ~ rdn_digit_add(rdnn(X5),rdnn(X1),rdnn(X4),rdnn(n0))
| ~ rdn_digit_add(rdnn(X2),rdnn(X3),rdnn(X5),rdnn(n0)) ),
i_0_1 ).
cnf(c_0_181,plain,
rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
i_0_87 ).
cnf(c_0_182,plain,
( sum(X1,X2,nn3)
| ~ rdn_positive_less(X3,X4)
| ~ rdn_translate(X2,rdn_neg(X4))
| ~ rdn_translate(X1,rdn_pos(X3))
| ~ rdn_add_with_carry(rdnn(n0),X3,rdnn(n3),X4) ),
inference(spm,[status(thm)],[c_0_175,c_0_176]) ).
cnf(c_0_183,plain,
rdn_translate(nn5,rdn_neg(rdnn(n5))),
i_0_139 ).
cnf(c_0_184,plain,
( rdn_positive_less(rdnn(X1),rdnn(n5))
| ~ rdn_positive_less(rdnn(X1),rdnn(n4)) ),
inference(spm,[status(thm)],[c_0_173,c_0_177]) ).
cnf(c_0_185,plain,
rdn_positive_less(rdnn(n2),rdnn(n4)),
inference(spm,[status(thm)],[c_0_178,c_0_179]) ).
cnf(c_0_186,plain,
( rdn_add_with_carry(rdnn(n0),rdnn(X1),rdnn(X2),rdnn(n5))
| ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(n5),rdnn(n0)) ),
inference(spm,[status(thm)],[c_0_180,c_0_181]) ).
cnf(c_0_187,plain,
rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
i_0_60 ).
cnf(c_0_188,plain,
( sum(X1,nn5,nn3)
| ~ rdn_positive_less(X2,rdnn(n5))
| ~ rdn_translate(X1,rdn_pos(X2))
| ~ rdn_add_with_carry(rdnn(n0),X2,rdnn(n3),rdnn(n5)) ),
inference(spm,[status(thm)],[c_0_182,c_0_183]) ).
cnf(c_0_189,plain,
rdn_positive_less(rdnn(n2),rdnn(n5)),
inference(spm,[status(thm)],[c_0_184,c_0_185]) ).
cnf(c_0_190,plain,
rdn_add_with_carry(rdnn(n0),rdnn(n2),rdnn(n3),rdnn(n5)),
inference(spm,[status(thm)],[c_0_186,c_0_187]) ).
cnf(c_0_191,plain,
( sum(X1,nn5,nn3)
| ~ rdn_translate(X1,rdn_pos(rdnn(n2))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_188,c_0_189]),c_0_190])]) ).
cnf(c_0_192,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
i_0_20 ).
cnf(c_0_193,negated_conjecture,
~ sum(n2,nn5,nn3),
i_0_160 ).
cnf(c_0_194,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_191,c_0_192]),c_0_193]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM316+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n028.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 : Thu Jul 7 02:54:10 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox/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
% 8.78/2.42 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.78/2.42 # No SInE strategy applied
% 8.78/2.42 # Trying AutoSched0 for 150 seconds
% 8.78/2.42 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 8.78/2.42 # and selection function SelectNewComplexAHP.
% 8.78/2.42 #
% 8.78/2.42 # Preprocessing time : 0.015 s
% 8.78/2.42 # Presaturation interreduction done
% 8.78/2.42
% 8.78/2.42 # Proof found!
% 8.78/2.42 # SZS status Theorem
% 8.78/2.42 # SZS output start CNFRefutation
% See solution above
% 8.78/2.42 # Training examples: 0 positive, 0 negative
% 8.78/2.42
% 8.78/2.42 # -------------------------------------------------
% 8.78/2.42 # User time : 0.163 s
% 8.78/2.42 # System time : 0.004 s
% 8.78/2.42 # Total time : 0.167 s
% 8.78/2.42 # Maximum resident set size: 7128 pages
% 8.78/2.42
%------------------------------------------------------------------------------