TSTP Solution File: NUM311+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM311+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n016.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:12 EDT 2022
% Result : Theorem 7.80s 2.34s
% Output : CNFRefutation 7.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 28 ( 16 unt; 0 nHn; 28 RR)
% Number of literals : 56 ( 5 equ; 30 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 44 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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-fnxe4825/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-fnxe4825/lgb.p',i_0_87) ).
cnf(i_0_156,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_pos(X4))
| ~ rdn_translate(X2,rdn_pos(X5))
| ~ rdn_translate(X1,rdn_pos(X6))
| ~ rdn_add_with_carry(rdnn(n0),X6,X5,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fnxe4825/lgb.p',i_0_156) ).
cnf(i_0_60,plain,
rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fnxe4825/lgb.p',i_0_60) ).
cnf(i_0_23,plain,
rdn_translate(n5,rdn_pos(rdnn(n5))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fnxe4825/lgb.p',i_0_23) ).
cnf(i_0_21,plain,
rdn_translate(n3,rdn_pos(rdnn(n3))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fnxe4825/lgb.p',i_0_21) ).
cnf(i_0_162,plain,
( X1 = X2
| ~ sum(X3,X4,X2)
| ~ sum(X3,X4,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fnxe4825/lgb.p',i_0_162) ).
cnf(i_0_159,negated_conjecture,
sum(n2,n3,esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fnxe4825/lgb.p',i_0_159) ).
cnf(i_0_20,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fnxe4825/lgb.p',i_0_20) ).
cnf(i_0_158,negated_conjecture,
esk1_0 != n5,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fnxe4825/lgb.p',i_0_158) ).
cnf(c_0_173,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_174,plain,
rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
i_0_87 ).
cnf(c_0_175,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_pos(X4))
| ~ rdn_translate(X2,rdn_pos(X5))
| ~ rdn_translate(X1,rdn_pos(X6))
| ~ rdn_add_with_carry(rdnn(n0),X6,X5,X4) ),
i_0_156 ).
cnf(c_0_176,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_173,c_0_174]) ).
cnf(c_0_177,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_pos(rdnn(n5)))
| ~ rdn_translate(X2,rdn_pos(rdnn(X4)))
| ~ rdn_translate(X1,rdn_pos(rdnn(X5)))
| ~ rdn_digit_add(rdnn(X5),rdnn(X4),rdnn(n5),rdnn(n0)) ),
inference(spm,[status(thm)],[c_0_175,c_0_176]) ).
cnf(c_0_178,plain,
rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
i_0_60 ).
cnf(c_0_179,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_pos(rdnn(n5)))
| ~ rdn_translate(X2,rdn_pos(rdnn(n3)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n2))) ),
inference(spm,[status(thm)],[c_0_177,c_0_178]) ).
cnf(c_0_180,plain,
rdn_translate(n5,rdn_pos(rdnn(n5))),
i_0_23 ).
cnf(c_0_181,plain,
( sum(X1,X2,n5)
| ~ rdn_translate(X2,rdn_pos(rdnn(n3)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n2))) ),
inference(spm,[status(thm)],[c_0_179,c_0_180]) ).
cnf(c_0_182,plain,
rdn_translate(n3,rdn_pos(rdnn(n3))),
i_0_21 ).
cnf(c_0_183,plain,
( X1 = X2
| ~ sum(X3,X4,X2)
| ~ sum(X3,X4,X1) ),
i_0_162 ).
cnf(c_0_184,negated_conjecture,
sum(n2,n3,esk1_0),
i_0_159 ).
cnf(c_0_185,plain,
( sum(X1,n3,n5)
| ~ rdn_translate(X1,rdn_pos(rdnn(n2))) ),
inference(spm,[status(thm)],[c_0_181,c_0_182]) ).
cnf(c_0_186,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
i_0_20 ).
cnf(c_0_187,negated_conjecture,
( X1 = esk1_0
| ~ sum(n2,n3,X1) ),
inference(spm,[status(thm)],[c_0_183,c_0_184]) ).
cnf(c_0_188,plain,
sum(n2,n3,n5),
inference(spm,[status(thm)],[c_0_185,c_0_186]) ).
cnf(c_0_189,negated_conjecture,
esk1_0 != n5,
i_0_158 ).
cnf(c_0_190,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_187,c_0_188]),c_0_189]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : NUM311+1 : TPTP v8.1.0. Released v3.1.0.
% 0.10/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n016.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Wed Jul 6 07:42:21 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.17/0.44 # ENIGMATIC: Selected SinE mode:
% 0.17/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.17/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.17/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.80/2.34 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.80/2.34 # No SInE strategy applied
% 7.80/2.34 # Trying AutoSched0 for 150 seconds
% 7.80/2.34 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.80/2.34 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.80/2.34 #
% 7.80/2.34 # Preprocessing time : 0.024 s
% 7.80/2.34 # Presaturation interreduction done
% 7.80/2.34
% 7.80/2.34 # Proof found!
% 7.80/2.34 # SZS status Theorem
% 7.80/2.34 # SZS output start CNFRefutation
% See solution above
% 7.80/2.34 # Training examples: 0 positive, 0 negative
% 7.80/2.34
% 7.80/2.34 # -------------------------------------------------
% 7.80/2.34 # User time : 0.039 s
% 7.80/2.34 # System time : 0.007 s
% 7.80/2.34 # Total time : 0.045 s
% 7.80/2.34 # Maximum resident set size: 7124 pages
% 7.80/2.34
%------------------------------------------------------------------------------