%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : NUM324+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n017.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:11:04 AM UTC 2026
% Result : Theorem 24.95s 15.53s
% Output : CNFRefutation 24.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 37 ( 24 unt; 0 def)
% Number of atoms : 68 ( 0 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 55 ( 24 ~; 22 |; 6 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 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 : 44 ( 1 sgn 14 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(rdn2,axiom,
'rdn$utranslate'(n2,'rdn$upos'(rdnn(n2))) ).
fof(rdnn3,axiom,
'rdn$utranslate'(nn3,'rdn$uneg'(rdnn(n3))) ).
fof(rdnn5,axiom,
'rdn$utranslate'(nn5,'rdn$uneg'(rdnn(n5))) ).
fof(rdn_positive_less23,axiom,
'rdn$upositive$uless'(rdnn(n2),rdnn(n3)) ).
fof(rdn_positive_less34,axiom,
'rdn$upositive$uless'(rdnn(n3),rdnn(n4)) ).
fof(rdn_positive_less45,axiom,
'rdn$upositive$uless'(rdnn(n4),rdnn(n5)) ).
fof(rdn_positive_less_transitivity,axiom,
! [X0,X1,X2] :
( ( 'rdn$upositive$uless'(rdnn(X1),rdnn(X2))
& 'rdn$upositive$uless'(rdnn(X0),rdnn(X1)) )
=> 'rdn$upositive$uless'(rdnn(X0),rdnn(X2)) ) ).
fof(sum_entry_point_pos_neg_1,axiom,
! [X0,X1,X2,X3,X4,X5] :
( ( 'rdn$utranslate'(X2,'rdn$uneg'(X5))
& 'rdn$uadd$uwith$ucarry'(rdnn(n0),X3,X5,X4)
& 'rdn$upositive$uless'(X3,X4)
& 'rdn$utranslate'(X1,'rdn$uneg'(X4))
& 'rdn$utranslate'(X0,'rdn$upos'(X3)) )
=> sum(X0,X1,X2) ) ).
fof(add_digit_digit_digit,axiom,
! [X0,X1,X2,X3,X4] :
( ( 'rdn$udigit$uadd'(rdnn(X4),rdnn(X0),rdnn(X3),rdnn(n0))
& 'rdn$udigit$uadd'(rdnn(X1),rdnn(X2),rdnn(X4),rdnn(n0)) )
=> 'rdn$uadd$uwith$ucarry'(rdnn(X0),rdnn(X1),rdnn(X2),rdnn(X3)) ) ).
fof(rdn_digit_add_n2_n3_n5_n0,axiom,
'rdn$udigit$uadd'(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)) ).
fof(rdn_digit_add_n5_n0_n5_n0,axiom,
'rdn$udigit$uadd'(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)) ).
fof(sum_what_nn5_nn3,conjecture,
? [X0] : sum(X0,nn5,nn3) ).
fof(negated_conjecture,negated_conjecture,
~ ? [X0] : sum(X0,nn5,nn3),
inference(negate_conjecture,[status(cth)],[sum_what_nn5_nn3]) ).
cnf(c2,plain,
'rdn$utranslate'(n2,'rdn$upos'(rdnn(n2))),
inference(clausification,[status(esa)],[rdn2]) ).
cnf(c10,plain,
'rdn$utranslate'(nn3,'rdn$uneg'(rdnn(n3))),
inference(clausification,[status(esa)],[rdnn3]) ).
cnf(c11,plain,
'rdn$utranslate'(nn5,'rdn$uneg'(rdnn(n5))),
inference(clausification,[status(esa)],[rdnn5]) ).
cnf(c23,plain,
'rdn$upositive$uless'(rdnn(n2),rdnn(n3)),
inference(clausification,[status(esa)],[rdn_positive_less23]) ).
cnf(c24,plain,
'rdn$upositive$uless'(rdnn(n3),rdnn(n4)),
inference(clausification,[status(esa)],[rdn_positive_less34]) ).
cnf(c25,plain,
'rdn$upositive$uless'(rdnn(n4),rdnn(n5)),
inference(clausification,[status(esa)],[rdn_positive_less45]) ).
cnf(c30,plain,
( 'rdn$upositive$uless'(rdnn(X2),rdnn(X1))
| ~ 'rdn$upositive$uless'(rdnn(X2),rdnn(X0))
| ~ 'rdn$upositive$uless'(rdnn(X0),rdnn(X1)) ),
inference(clausification,[status(esa)],[rdn_positive_less_transitivity]) ).
cnf(c48,plain,
( ~ 'rdn$utranslate'(X3,'rdn$uneg'(X5))
| ~ 'rdn$uadd$uwith$ucarry'(rdnn(n0),X4,X5,X1)
| ~ 'rdn$utranslate'(X2,'rdn$upos'(X4))
| ~ 'rdn$upositive$uless'(X4,X1)
| sum(X2,X0,X3)
| ~ 'rdn$utranslate'(X0,'rdn$uneg'(X1)) ),
inference(clausification,[status(esa)],[sum_entry_point_pos_neg_1]) ).
cnf(c55,plain,
( 'rdn$uadd$uwith$ucarry'(rdnn(X1),rdnn(X3),rdnn(X4),rdnn(X2))
| ~ 'rdn$udigit$uadd'(rdnn(X3),rdnn(X4),rdnn(X0),rdnn(n0))
| ~ 'rdn$udigit$uadd'(rdnn(X0),rdnn(X1),rdnn(X2),rdnn(n0)) ),
inference(clausification,[status(esa)],[add_digit_digit_digit]) ).
cnf(c83,plain,
'rdn$udigit$uadd'(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
inference(clausification,[status(esa)],[rdn_digit_add_n2_n3_n5_n0]) ).
cnf(c110,plain,
'rdn$udigit$uadd'(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
inference(clausification,[status(esa)],[rdn_digit_add_n5_n0_n5_n0]) ).
cnf(c160,plain,
~ sum(X0,nn5,nn3),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( ~ 'rdn$udigit$uadd'(rdnn(n5),rdnn(X0),rdnn(X1),rdnn(n0))
| 'rdn$uadd$uwith$ucarry'(rdnn(X0),rdnn(n2),rdnn(n3),rdnn(X1)) ),
inference(resolution,[status(thm)],[c83,c55]) ).
cnf(d1,plain,
'rdn$uadd$uwith$ucarry'(rdnn(n0),rdnn(n2),rdnn(n3),rdnn(n5)),
inference(resolution,[status(thm)],[d0,c110]) ).
cnf(d2,plain,
( sum(X2,X0,X1)
| ~ 'rdn$upositive$uless'(rdnn(n2),rdnn(n5))
| ~ 'rdn$utranslate'(X2,'rdn$upos'(rdnn(n2)))
| ~ 'rdn$utranslate'(X1,'rdn$uneg'(rdnn(n3)))
| ~ 'rdn$utranslate'(X0,'rdn$uneg'(rdnn(n5))) ),
inference(resolution,[status(thm)],[d1,c48]) ).
cnf(d3,plain,
( ~ 'rdn$upositive$uless'(rdnn(X0),rdnn(n4))
| 'rdn$upositive$uless'(rdnn(X0),rdnn(n5)) ),
inference(resolution,[status(thm)],[c30,c25]) ).
cnf(d4,plain,
( ~ 'rdn$upositive$uless'(rdnn(X0),rdnn(n3))
| 'rdn$upositive$uless'(rdnn(X0),rdnn(n4)) ),
inference(resolution,[status(thm)],[c30,c24]) ).
cnf(d5,plain,
'rdn$upositive$uless'(rdnn(n2),rdnn(n4)),
inference(resolution,[status(thm)],[d4,c23]) ).
cnf(d6,plain,
'rdn$upositive$uless'(rdnn(n2),rdnn(n5)),
inference(resolution,[status(thm)],[d5,d3]) ).
cnf(d7,plain,
( sum(X0,X2,X1)
| ~ 'rdn$utranslate'(X2,'rdn$uneg'(rdnn(n5)))
| ~ 'rdn$utranslate'(X1,'rdn$uneg'(rdnn(n3)))
| ~ 'rdn$utranslate'(X0,'rdn$upos'(rdnn(n2))) ),
inference(resolution,[status(thm)],[d6,d2]) ).
cnf(d8,plain,
( sum(n2,X0,X1)
| ~ 'rdn$utranslate'(X1,'rdn$uneg'(rdnn(n3)))
| ~ 'rdn$utranslate'(X0,'rdn$uneg'(rdnn(n5))) ),
inference(resolution,[status(thm)],[d7,c2]) ).
cnf(d9,plain,
( sum(n2,nn5,X0)
| ~ 'rdn$utranslate'(X0,'rdn$uneg'(rdnn(n3))) ),
inference(resolution,[status(thm)],[d8,c11]) ).
cnf(d10,plain,
sum(n2,nn5,nn3),
inference(resolution,[status(thm)],[d9,c10]) ).
cnf(d11,plain,
$false,
inference(resolution,[status(thm)],[c160,d10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM324+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/5.39 % Computer : n017.cluster.edu
% 0.11/5.39 % Model : x86_64 x86_64
% 0.11/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.39 % Memory : 8046.5625MB
% 0.11/5.39 % OS : Linux 6.8.0-71-generic
% 0.11/5.40 % CPULimit : 300
% 0.11/5.40 % WCLimit : 300
% 0.11/5.40 % DateTime : Sat Sep 26 02:22:55 UTC 2026
% 0.14/5.40 % CPUTime :
% 0.14/5.40 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 24.95/15.53 % SZS status Theorem for theBenchmark.p
% 24.95/15.53 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------