%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : NUM327+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 08:16:27 AM UTC 2026
% Result : Theorem 12.04s 7.23s
% Output : CNFRefutation 12.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 20 ( 12 unt; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 36 ( 17 ~; 13 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 35 ( 1 sgn 11 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(sum_entry_point_pos_pos,axiom,
! [X,Y,Z,RDN_X,RDN_Y,RDN_Z] :
( ( rdn_translate(Z,rdn_pos(RDN_Z))
& rdn_add_with_carry(rdnn(n0),RDN_X,RDN_Y,RDN_Z)
& rdn_translate(Y,rdn_pos(RDN_Y))
& rdn_translate(X,rdn_pos(RDN_X)) )
=> sum(X,Y,Z) ),
file('theBenchmark.p',sum_entry_point_pos_pos) ).
fof(add_digit_digit_digit,axiom,
! [C,D1,D2,RD,ID] :
( ( rdn_digit_add(rdnn(ID),rdnn(C),rdnn(RD),rdnn(n0))
& rdn_digit_add(rdnn(D1),rdnn(D2),rdnn(ID),rdnn(n0)) )
=> rdn_add_with_carry(rdnn(C),rdnn(D1),rdnn(D2),rdnn(RD)) ),
file('theBenchmark.p',add_digit_digit_digit) ).
fof(sum_zero_identity,conjecture,
? [X] : sum(X,n0,X),
file('theBenchmark.p',sum_zero_identity) ).
fof(sum_zero_identity_neg,negated_conjecture,
~ ? [X] : sum(X,n0,X),
inference(assume_negation,[status(cth)],[sum_zero_identity]) ).
fof(rdn0,axiom,
rdn_translate(n0,rdn_pos(rdnn(n0))),
file('theBenchmark.p',rdn0) ).
cnf(c_287,plain,
rdn_translate(n0,rdn_pos(rdnn(n0))),
inference(clausify,[status(thm)],[rdn0]) ).
fof(rdn9,axiom,
rdn_translate(n9,rdn_pos(rdnn(n9))),
file('theBenchmark.p',rdn9) ).
cnf(c_296,plain,
rdn_translate(n9,rdn_pos(rdnn(n9))),
inference(clausify,[status(thm)],[rdn9]) ).
cnf(c_321,plain,
( sum(A,C,F)
| ~ rdn_translate(F,rdn_pos(E))
| ~ rdn_add_with_carry(rdnn(n0),B,D,E)
| ~ rdn_translate(C,rdn_pos(D))
| ~ rdn_translate(A,rdn_pos(B)) ),
inference(clausify,[status(thm)],[sum_entry_point_pos_pos]) ).
cnf(c_330,plain,
( rdn_add_with_carry(rdnn(D),rdnn(A),rdnn(B),rdnn(E))
| ~ rdn_digit_add(rdnn(C),rdnn(D),rdnn(E),rdnn(n0))
| ~ rdn_digit_add(rdnn(A),rdnn(B),rdnn(C),rdnn(n0)) ),
inference(clausify,[status(thm)],[add_digit_digit_digit]) ).
fof(rdn_digit_add_n9_n0_n9_n0,axiom,
rdn_digit_add(rdnn(n9),rdnn(n0),rdnn(n9),rdnn(n0)),
file('theBenchmark.p',rdn_digit_add_n9_n0_n9_n0) ).
cnf(c_425,plain,
rdn_digit_add(rdnn(n9),rdnn(n0),rdnn(n9),rdnn(n0)),
inference(clausify,[status(thm)],[rdn_digit_add_n9_n0_n9_n0]) ).
cnf(c_435,negated_conjecture,
~ sum(A,n0,A),
inference(clausify,[status(thm)],[sum_zero_identity_neg]) ).
cnf(c_444,plain,
( rdn_add_with_carry(rdnn(B),rdnn(A),rdnn(B),rdnn(A))
| ~ rdn_digit_add(rdnn(A),rdnn(B),rdnn(A),rdnn(n0)) ),
inference(factor,[status(thm)],[c_330]) ).
cnf(c_1353,plain,
( sum(A,n0,D)
| ~ rdn_translate(D,rdn_pos(C))
| ~ rdn_add_with_carry(rdnn(n0),B,rdnn(n0),C)
| ~ rdn_translate(A,rdn_pos(B)) ),
inference(resolve,[status(thm)],[c_321,c_287]) ).
cnf(c_9610,plain,
( sum(A,n0,A)
| ~ rdn_add_with_carry(rdnn(n0),B,rdnn(n0),B)
| ~ rdn_translate(A,rdn_pos(B)) ),
inference(factor,[status(thm)],[c_1353]) ).
cnf(c_1737,negated_conjecture,
( ~ rdn_add_with_carry(rdnn(n0),B,rdnn(n0),B)
| ~ rdn_translate(A,rdn_pos(B)) ),
inference(resolve,[status(thm)],[c_435,c_9610]) ).
cnf(c_4653,plain,
~ rdn_add_with_carry(rdnn(n0),rdnn(n9),rdnn(n0),rdnn(n9)),
inference(resolve,[status(thm)],[c_1737,c_296]) ).
cnf(c_9611,plain,
rdn_add_with_carry(rdnn(n0),rdnn(n9),rdnn(n0),rdnn(n9)),
inference(resolve,[status(thm)],[c_444,c_425]) ).
cnf(c_9609,plain,
$false,
inference(resolve,[status(thm)],[c_4653,c_9611]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM327+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/5.44 % Computer : n003.cluster.edu
% 0.16/5.44 % Model : x86_64 x86_64
% 0.16/5.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/5.44 % Memory : 8046.5625MB
% 0.16/5.44 % OS : Linux 6.8.0-71-generic
% 0.16/5.44 % CPULimit : 300
% 0.16/5.44 % WCLimit : 300
% 0.16/5.44 % DateTime : Sat Sep 26 02:29:13 UTC 2026
% 0.16/5.44 % CPUTime :
% 0.16/5.45 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.16/5.45 % Process 1829382 was started by sandbox2 on n003,
% 0.16/5.45 % Sat Sep 26 02:29:13 2026
% 0.16/5.45 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.16/5.47
% 0.16/5.47 % From the command line: assign(max_seconds, 300).
% 0.16/5.47
% 0.16/5.47 % SInE: 148 to sos, 253 to usable, of 401 axioms (tolerance 2.00, depth 0 fixpoint).
% 12.04/7.23
% 12.04/7.23 % given #500 (T,wt=8): 1104 less_or_equal(nn13,n0). [resolve(601,a,282,b)].
% 12.04/7.23
% 12.04/7.23 % given #1000 (F,wt=8): 6225 nn94 != n1. [resolve(5802,a,279,a),flip(a)].
% 12.04/7.23
% 12.04/7.23 % given #1500 (T,wt=12): 6589 -sum(A,n1,n1) | less_or_equal(nn52,A). [resolve(5844,a,284,b)].
% 12.04/7.23
% 12.04/7.23 % SZS status Theorem for theBenchmark
% 12.04/7.23
% 12.04/7.23 % Proof 1 at 1.40 (+ 0.28) seconds.
% 12.04/7.23 % Length of proof is 14.
% 12.04/7.23 % Level of proof is 5.
% 12.04/7.23 % Maximum clause weight is 137.000.
% 12.04/7.23 % Given clauses 1655.
% 12.04/7.23
% 12.04/7.23 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------