TSTP Solution File: NUM315+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM315+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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:13 EDT 2022
% Result : Theorem 8.12s 2.50s
% Output : CNFRefutation 8.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 14 unt; 0 nHn; 21 RR)
% Number of literals : 39 ( 0 equ; 21 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-1 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_155,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_neg(X4))
| ~ rdn_translate(X2,rdn_neg(X5))
| ~ rdn_translate(X1,rdn_neg(X6))
| ~ rdn_add_with_carry(rdnn(n0),X6,X5,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vnancktt/lgb.p',i_0_155) ).
cnf(i_0_140,plain,
rdn_translate(nn7,rdn_neg(rdnn(n7))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vnancktt/lgb.p',i_0_140) ).
cnf(i_0_139,plain,
rdn_translate(nn5,rdn_neg(rdnn(n5))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vnancktt/lgb.p',i_0_139) ).
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/sandbox2/tmp/enigma-theBenchmark.p-vnancktt/lgb.p',i_0_1) ).
cnf(i_0_107,plain,
rdn_digit_add(rdnn(n7),rdnn(n0),rdnn(n7),rdnn(n0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vnancktt/lgb.p',i_0_107) ).
cnf(i_0_138,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vnancktt/lgb.p',i_0_138) ).
cnf(i_0_161,negated_conjecture,
~ sum(nn2,nn5,nn7),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vnancktt/lgb.p',i_0_161) ).
cnf(i_0_62,plain,
rdn_digit_add(rdnn(n2),rdnn(n5),rdnn(n7),rdnn(n0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vnancktt/lgb.p',i_0_62) ).
cnf(c_0_170,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_neg(X4))
| ~ rdn_translate(X2,rdn_neg(X5))
| ~ rdn_translate(X1,rdn_neg(X6))
| ~ rdn_add_with_carry(rdnn(n0),X6,X5,X4) ),
i_0_155 ).
cnf(c_0_171,plain,
rdn_translate(nn7,rdn_neg(rdnn(n7))),
i_0_140 ).
cnf(c_0_172,plain,
( sum(X1,X2,nn7)
| ~ rdn_translate(X2,rdn_neg(X3))
| ~ rdn_translate(X1,rdn_neg(X4))
| ~ rdn_add_with_carry(rdnn(n0),X4,X3,rdnn(n7)) ),
inference(spm,[status(thm)],[c_0_170,c_0_171]) ).
cnf(c_0_173,plain,
rdn_translate(nn5,rdn_neg(rdnn(n5))),
i_0_139 ).
cnf(c_0_174,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_175,plain,
rdn_digit_add(rdnn(n7),rdnn(n0),rdnn(n7),rdnn(n0)),
i_0_107 ).
cnf(c_0_176,plain,
( sum(X1,nn5,nn7)
| ~ rdn_translate(X1,rdn_neg(X2))
| ~ rdn_add_with_carry(rdnn(n0),X2,rdnn(n5),rdnn(n7)) ),
inference(spm,[status(thm)],[c_0_172,c_0_173]) ).
cnf(c_0_177,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
i_0_138 ).
cnf(c_0_178,negated_conjecture,
~ sum(nn2,nn5,nn7),
i_0_161 ).
cnf(c_0_179,plain,
( rdn_add_with_carry(rdnn(n0),rdnn(X1),rdnn(X2),rdnn(n7))
| ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(n7),rdnn(n0)) ),
inference(spm,[status(thm)],[c_0_174,c_0_175]) ).
cnf(c_0_180,plain,
rdn_digit_add(rdnn(n2),rdnn(n5),rdnn(n7),rdnn(n0)),
i_0_62 ).
cnf(c_0_181,plain,
~ rdn_add_with_carry(rdnn(n0),rdnn(n2),rdnn(n5),rdnn(n7)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_176,c_0_177]),c_0_178]) ).
cnf(c_0_182,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_179,c_0_180]),c_0_181]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM315+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Wed Jul 6 10:12:20 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.22/0.46 # ENIGMATIC: Selected SinE mode:
% 0.22/0.48 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.22/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.22/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.12/2.50 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.12/2.50 # No SInE strategy applied
% 8.12/2.50 # Trying AutoSched0 for 150 seconds
% 8.12/2.50 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 8.12/2.50 # and selection function SelectNewComplexAHP.
% 8.12/2.50 #
% 8.12/2.50 # Preprocessing time : 0.015 s
% 8.12/2.50 # Presaturation interreduction done
% 8.12/2.50
% 8.12/2.50 # Proof found!
% 8.12/2.50 # SZS status Theorem
% 8.12/2.50 # SZS output start CNFRefutation
% See solution above
% 8.12/2.50 # Training examples: 0 positive, 0 negative
% 8.12/2.50
% 8.12/2.50 # -------------------------------------------------
% 8.12/2.50 # User time : 0.075 s
% 8.12/2.50 # System time : 0.008 s
% 8.12/2.50 # Total time : 0.083 s
% 8.12/2.50 # Maximum resident set size: 7120 pages
% 8.12/2.50
%------------------------------------------------------------------------------