%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : NUM340+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art01.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 2018MB
% OS       : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Wed Dec 29 18:09:02 EST 2010

% Result   : Theorem 161.69s
% Output   : Solution 162.60s
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP3028/NUM340+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% not found
% Adding ~C to TBU       ... ~diff_zero_identity:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... minus_entry_point:
%  CSA axiom minus_entry_point found
% Looking for CSA axiom ... rdn_positive_less_transitivity:
%  CSA axiom rdn_positive_less_transitivity found
% Looking for CSA axiom ... rdn_digit_add_n0_n0_n0_n0:
%  CSA axiom rdn_digit_add_n0_n0_n0_n0 found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... rdn0:
%  CSA axiom rdn0 found
% Looking for CSA axiom ... rdn_positive_less_multi_digit_high:
%  CSA axiom rdn_positive_less_multi_digit_high found
% Looking for CSA axiom ... rdn_digit_add_n0_n1_n1_n0:
%  CSA axiom rdn_digit_add_n0_n1_n1_n0 found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... rdn_digit_add_n1_n0_n1_n0:
%  CSA axiom rdn_digit_add_n1_n0_n1_n0 found
% Looking for CSA axiom ... rdn_non_zero_by_structure:
%  CSA axiom rdn_non_zero_by_structure found
% Looking for CSA axiom ... rdn_digit_add_n0_n2_n2_n0:
%  CSA axiom rdn_digit_add_n0_n2_n2_n0 found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... rdn_digit_add_n2_n0_n2_n0:
%  CSA axiom rdn_digit_add_n2_n0_n2_n0 found
% Looking for CSA axiom ... rdn1:
%  CSA axiom rdn1 found
% Looking for CSA axiom ... rdn_digit_add_n0_n3_n3_n0:
%  CSA axiom rdn_digit_add_n0_n3_n3_n0 found
% ---- Iteration 5 (12 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... rdn_digit_add_n0_n4_n4_n0:
%  CSA axiom rdn_digit_add_n0_n4_n4_n0 found
% Looking for CSA axiom ... rdn_digit_add_n0_n5_n5_n0:
%  CSA axiom rdn_digit_add_n0_n5_n5_n0 found
% Looking for CSA axiom ... rdn_digit_add_n0_n6_n6_n0:
%  CSA axiom rdn_digit_add_n0_n6_n6_n0 found
% ---- Iteration 6 (15 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... rdn_digit_add_n0_n7_n7_n0:
%  CSA axiom rdn_digit_add_n0_n7_n7_n0 found
% Looking for CSA axiom ... rdn_digit_add_n0_n8_n8_n0:
%  CSA axiom rdn_digit_add_n0_n8_n8_n0 found
% Looking for CSA axiom ... rdn_digit_add_n0_n9_n9_n0:
%  CSA axiom rdn_digit_add_n0_n9_n9_n0 found
% ---- Iteration 7 (18 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... rdn_digit_add_n3_n0_n3_n0:
%  CSA axiom rdn_digit_add_n3_n0_n3_n0 found
% Looking for CSA axiom ... rdn_digit_add_n4_n0_n4_n0:
%  CSA axiom rdn_digit_add_n4_n0_n4_n0 found
% Looking for CSA axiom ... rdn_digit_add_n5_n0_n5_n0:
%  CSA axiom rdn_digit_add_n5_n0_n5_n0 found
% ---- Iteration 8 (21 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... rdn_digit_add_n6_n0_n6_n0:
%  CSA axiom rdn_digit_add_n6_n0_n6_n0 found
% Looking for CSA axiom ... rdn_digit_add_n7_n0_n7_n0:
%  CSA axiom rdn_digit_add_n7_n0_n7_n0 found
% Looking for CSA axiom ... rdn_digit_add_n8_n0_n8_n0:
%  CSA axiom rdn_digit_add_n8_n0_n8_n0 found
% ---- Iteration 9 (24 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... rdn_digit_add_n9_n0_n9_n0:
%  CSA axiom rdn_digit_add_n9_n0_n9_n0 found
% Looking for CSA axiom ... rdn_positive_less01:
%  CSA axiom rdn_positive_less01 found
% Looking for CSA axiom ... add_digit_digit_digit:
%  CSA axiom add_digit_digit_digit found
% ---- Iteration 10 (27 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... rdn2:
%  CSA axiom rdn2 found
% Looking for CSA axiom ... rdn3:
%  CSA axiom rdn3 found
% Looking for CSA axiom ... rdn4:
%  CSA axiom rdn4 found
% ---- Iteration 11 (30 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... rdn5:
%  CSA axiom rdn5 found
% Looking for CSA axiom ... rdn6:
%  CSA axiom rdn6 found
% Looking for CSA axiom ... rdn7:
%  CSA axiom rdn7 found
% ---- Iteration 12 (33 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... rdn8:
%  CSA axiom rdn8 found
% Looking for CSA axiom ... rdn9:
%  CSA axiom rdn9 found
% Looking for CSA axiom ... sum_entry_point_posx_negx:
%  CSA axiom sum_entry_point_posx_negx found
% ---- Iteration 13 (36 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... rdn_digit_add_n1_n1_n2_n0:
%  CSA axiom rdn_digit_add_n1_n1_n2_n0 found
% Looking for CSA axiom ... rdn_digit_add_n1_n9_n0_n1:
%  CSA axiom rdn_digit_add_n1_n9_n0_n1 found
% Looking for CSA axiom ... rdn_digit_add_n5_n5_n0_n1:
%  CSA axiom rdn_digit_add_n5_n5_n0_n1 found
% ---- Iteration 14 (39 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... rdn_digit_add_n9_n1_n0_n1:
%  CSA axiom rdn_digit_add_n9_n1_n0_n1 found
% Looking for CSA axiom ... unique_sum:
%  CSA axiom unique_sum found
% Looking for CSA axiom ... unique_LHS:
%  CSA axiom unique_LHS found
% ---- Iteration 15 (42 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... unique_RHS:
%  CSA axiom unique_RHS found
% Looking for CSA axiom ... rdn_digit_add_n2_n9_n1_n1:
%  CSA axiom rdn_digit_add_n2_n9_n1_n1 found
% Looking for CSA axiom ... rdn_digit_add_n9_n2_n1_n1:
%  CSA axiom rdn_digit_add_n9_n2_n1_n1 found
% ---- Iteration 16 (45 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... sum_entry_point_pos_pos:
%  CSA axiom sum_entry_point_pos_pos found
% Looking for CSA axiom ... add_rdn_digit_rdn:
%  CSA axiom add_rdn_digit_rdn found
% Looking for CSA axiom ... rdn_digit_add_n2_n2_n4_n0:
%  CSA axiom rdn_digit_add_n2_n2_n4_n0 found
% ---- Iteration 17 (48 axioms selected)
% Looking for TBU SAT   ... 
% no
% Looking for TBU UNS   ... 
% yes - theorem proved
% ---- Selection completed
% Selected axioms are   ... :rdn_digit_add_n2_n2_n4_n0:add_rdn_digit_rdn:sum_entry_point_pos_pos:rdn_digit_add_n9_n2_n1_n1:rdn_digit_add_n2_n9_n1_n1:unique_RHS:unique_LHS:unique_sum:rdn_digit_add_n9_n1_n0_n1:rdn_digit_add_n5_n5_n0_n1:rdn_digit_add_n1_n9_n0_n1:rdn_digit_add_n1_n1_n2_n0:sum_entry_point_posx_negx:rdn9:rdn8:rdn7:rdn6:rdn5:rdn4:rdn3:rdn2:add_digit_digit_digit:rdn_positive_less01:rdn_digit_add_n9_n0_n9_n0:rdn_digit_add_n8_n0_n8_n0:rdn_digit_add_n7_n0_n7_n0:rdn_digit_add_n6_n0_n6_n0:rdn_digit_add_n5_n0_n5_n0:rdn_digit_add_n4_n0_n4_n0:rdn_digit_add_n3_n0_n3_n0:rdn_digit_add_n0_n9_n9_n0:rdn_digit_add_n0_n8_n8_n0:rdn_digit_add_n0_n7_n7_n0:rdn_digit_add_n0_n6_n6_n0:rdn_digit_add_n0_n5_n5_n0:rdn_digit_add_n0_n4_n4_n0:rdn_digit_add_n0_n3_n3_n0:rdn1:rdn_digit_add_n2_n0_n2_n0:rdn_digit_add_n0_n2_n2_n0:rdn_non_zero_by_structure:rdn_digit_add_n1_n0_n1_n0:rdn_digit_add_n0_n1_n1_n0:rdn_positive_less_multi_digit_high:rdn0:rdn_digit_add_n0_n0_n0_n0:rdn_positive_less_transitivity:minus_entry_point (48)
% Unselected axioms are ... :rdn_digit_add_n3_n3_n6_n0:rdn_digit_add_n4_n4_n8_n0:rdn_digit_add_n9_n9_n8_n1:rdn10:rdn100:rdn101:rdn110:rdn20:rdn30:rdn40:rdn50:rdn60:rdn70:rdn80:rdn90:rdn_positive_less_multi_digit_low:rdn_extra_digits_positive_less:add_digit_digit_rdn:rdn_digit_add_n4_n8_n2_n1:rdn_digit_add_n6_n7_n3_n1:rdn_digit_add_n6_n8_n4_n1:rdn_digit_add_n7_n6_n3_n1:rdn_digit_add_n8_n4_n2_n1:rdn_digit_add_n8_n6_n4_n1:rdn_digit1:rdn_positive_less12:rdn_digit_add_n1_n2_n3_n0:rdn_digit_add_n1_n3_n4_n0:rdn_digit_add_n1_n4_n5_n0:rdn_digit_add_n1_n5_n6_n0:rdn_digit_add_n1_n6_n7_n0:rdn_digit_add_n1_n7_n8_n0:rdn_digit_add_n1_n8_n9_n0:rdn_digit_add_n2_n1_n3_n0:rdn_digit_add_n2_n8_n0_n1:rdn_digit_add_n3_n1_n4_n0:rdn_digit_add_n3_n7_n0_n1:rdn_digit_add_n4_n1_n5_n0:rdn_digit_add_n4_n6_n0_n1:rdn_digit_add_n5_n1_n6_n0:rdn_digit_add_n6_n1_n7_n0:rdn_digit_add_n6_n4_n0_n1:rdn_digit_add_n7_n1_n8_n0:rdn_digit_add_n7_n3_n0_n1:rdn_digit_add_n8_n1_n9_n0:rdn_digit_add_n8_n2_n0_n1:rdn23:rdn24:rdn25:rdn26:rdn27:rdn28:rdn29:rdn32:rdn42:rdn52:rdn62:rdn72:rdn82:rdn92:rdn102:rdn103:rdn104:rdn105:rdn106:rdn107:rdn108:rdn109:rdn120:rdn_positive_less23:rdn_positive_less34:rdn_positive_less45:rdn_positive_less56:rdn_positive_less67:rdn_positive_less78:rdn_positive_less89:less_entry_point_neg_pos:sum_entry_point_neg_pos:add_digit_rdn_rdn:add_rdn_rdn_rdn:rdn_digit_add_n2_n3_n5_n0:rdn_digit_add_n2_n4_n6_n0:rdn_digit_add_n2_n5_n7_n0:rdn_digit_add_n2_n6_n8_n0:rdn_digit_add_n2_n7_n9_n0:rdn_digit_add_n3_n2_n5_n0:rdn_digit_add_n3_n4_n7_n0:rdn_digit_add_n3_n5_n8_n0:rdn_digit_add_n3_n6_n9_n0:rdn_digit_add_n3_n9_n2_n1:rdn_digit_add_n4_n2_n6_n0:rdn_digit_add_n4_n3_n7_n0:rdn_digit_add_n4_n5_n9_n0:rdn_digit_add_n4_n9_n3_n1:rdn_digit_add_n5_n2_n7_n0:rdn_digit_add_n5_n3_n8_n0:rdn_digit_add_n5_n4_n9_n0:rdn_digit_add_n5_n7_n2_n1:rdn_digit_add_n5_n8_n3_n1:rdn_digit_add_n5_n9_n4_n1:rdn_digit_add_n6_n2_n8_n0:rdn_digit_add_n6_n3_n9_n0:rdn_digit_add_n6_n9_n5_n1:rdn_digit_add_n7_n2_n9_n0:rdn_digit_add_n7_n5_n2_n1:rdn_digit_add_n7_n8_n5_n1:rdn_digit_add_n7_n9_n6_n1:rdn_digit_add_n8_n5_n3_n1:rdn_digit_add_n8_n7_n5_n1:rdn_digit_add_n8_n9_n7_n1:rdn_digit_add_n9_n3_n2_n1:rdn_digit_add_n9_n4_n3_n1:rdn_digit_add_n9_n5_n4_n1:rdn_digit_add_n9_n6_n5_n1:rdn_digit_add_n9_n7_n6_n1:rdn_digit_add_n9_n8_n7_n1:rdn12:rdn13:rdn14:rdn15:rdn16:rdn17:rdn18:rdn19:rdn21:rdn31:rdn34:rdn35:rdn37:rdn38:rdn39:rdn41:rdn43:rdn45:rdn46:rdn47:rdn49:rdn51:rdn53:rdn54:rdn56:rdn57:rdn58:rdn59:rdn61:rdn64:rdn65:rdn67:rdn68:rdn69:rdn71:rdn73:rdn74:rdn75:rdn76:rdn78:rdn79:rdn81:rdn83:rdn85:rdn86:rdn87:rdn89:rdn91:rdn93:rdn94:rdn95:rdn96:rdn97:rdn98:rdn112:rdn113:rdn114:rdn115:rdn116:rdn117:rdn118:rdn119:rdn121:rdn122:rdnn10:rdnn100:rdnn101:rdnn110:rdn_digit_add_n3_n8_n1_n1:rdn_digit_add_n4_n7_n1_n1:rdn_digit_add_n5_n6_n1_n1:rdn_digit_add_n6_n5_n1_n1:rdn_digit_add_n6_n6_n2_n1:rdn_digit_add_n7_n4_n1_n1:rdn_digit_add_n7_n7_n4_n1:rdn_digit_add_n8_n3_n1_n1:rdn_digit_add_n8_n8_n6_n1:rdn11:rdn111:rdn_non_zero_by_digit:less_entry_point_pos_pos:less_property:less_or_equal:rdn22:rdn33:rdn44:rdn55:rdn66:rdn77:rdn88:rdn99:rdnn22:rdnn33:rdnn44:rdnn55:rdnn66:rdnn77:rdnn88:rdnn99:rdnn102:rdnn105:rdnn109:rdnn120:rdnn123:rdnn128:rdn_digit8:rdn_digit9:less_entry_point_neg_neg:sum_entry_point_pos_neg_1:sum_entry_point_pos_neg_2:rdn123:rdn124:rdn125:rdn126:rdn127:rdnn11:rdnn20:rdnn103:rdnn104:rdnn106:rdnn107:rdnn108:rdnn111:rdnn124:rdnn125:rdnn126:rdnn127:rdn_digit2:rdn_digit3:rdn_digit4:rdn_digit5:rdn_digit6:rdn_digit7:sum_entry_point_neg_neg:rdn36:rdn48:rdn63:rdn84:rdnn2:rdnn3:rdnn4:rdnn5:rdnn6:rdnn7:rdnn8:rdnn9:rdnn13:rdnn14:rdnn15:rdnn16:rdnn17:rdnn18:rdnn19:rdnn30:rdnn31:rdnn34:rdnn36:rdnn37:rdnn40:rdnn41:rdnn43:rdnn45:rdnn46:rdnn48:rdnn50:rdnn51:rdnn54:rdnn56:rdnn60:rdnn61:rdnn63:rdnn64:rdnn65:rdnn67:rdnn70:rdnn71:rdnn73:rdnn76:rdnn78:rdnn80:rdnn81:rdnn84:rdnn87:rdnn89:rdnn90:rdnn91:rdnn98:rdnn113:rdnn114:rdnn115:rdnn116:rdnn117:rdnn118:rdnn119:less_successor:rdnn1:rdnn12:rdnn21:rdnn23:rdnn24:rdnn25:rdnn26:rdnn27:rdnn28:rdnn29:rdnn32:rdnn35:rdnn38:rdnn39:rdnn42:rdnn47:rdnn49:rdnn52:rdnn53:rdnn57:rdnn58:rdnn59:rdnn62:rdnn68:rdnn69:rdnn72:rdnn74:rdnn75:rdnn79:rdnn82:rdnn83:rdnn85:rdnn86:rdnn92:rdnn93:rdnn94:rdnn95:rdnn96:rdnn97:rdnn112:rdnn121:rdnn122 (353)
% SZS status THM for /tmp/SystemOnTPTP3028/NUM340+1.tptp
% Looking for THM       ... 
% found
% SZS output start Solution for /tmp/SystemOnTPTP3028/NUM340+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=600 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p 
% TreeLimitedRun: CPU time limit is 600s
% TreeLimitedRun: WC  time limit is 1200s
% TreeLimitedRun: PID is 10176
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time     : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:((((rdn_translate(X7,rdn_pos(X10))&rdn_translate(X8,rdn_pos(X11)))&rdn_add_with_carry(rdnn(n0),X10,X11,X12))&rdn_translate(X9,rdn_pos(X12)))=>sum(X7,X8,X9)),file('/tmp/SRASS.s.p', sum_entry_point_pos_pos)).
% fof(22, axiom,![X1]:![X2]:![X4]:![X5]:![X21]:((rdn_digit_add(rdnn(X2),rdnn(X4),rdnn(X21),rdnn(n0))&rdn_digit_add(rdnn(X21),rdnn(X1),rdnn(X5),rdnn(n0)))=>rdn_add_with_carry(rdnn(X1),rdnn(X2),rdnn(X4),rdnn(X5))),file('/tmp/SRASS.s.p', add_digit_digit_digit)).
% fof(45, axiom,rdn_translate(n0,rdn_pos(rdnn(n0))),file('/tmp/SRASS.s.p', rdn0)).
% fof(46, axiom,rdn_digit_add(rdnn(n0),rdnn(n0),rdnn(n0),rdnn(n0)),file('/tmp/SRASS.s.p', rdn_digit_add_n0_n0_n0_n0)).
% fof(48, axiom,![X7]:![X8]:![X9]:(sum(X8,X9,X7)<=>difference(X7,X8,X9)),file('/tmp/SRASS.s.p', minus_entry_point)).
% fof(49, conjecture,?[X7]:difference(X7,n0,X7),file('/tmp/SRASS.s.p', diff_zero_identity)).
% fof(50, negated_conjecture,~(?[X7]:difference(X7,n0,X7)),inference(assume_negation,[status(cth)],[49])).
% fof(55, plain,![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:((((~(rdn_translate(X7,rdn_pos(X10)))|~(rdn_translate(X8,rdn_pos(X11))))|~(rdn_add_with_carry(rdnn(n0),X10,X11,X12)))|~(rdn_translate(X9,rdn_pos(X12))))|sum(X7,X8,X9)),inference(fof_nnf,[status(thm)],[3])).
% fof(56, plain,![X13]:![X14]:![X15]:![X16]:![X17]:![X18]:((((~(rdn_translate(X13,rdn_pos(X16)))|~(rdn_translate(X14,rdn_pos(X17))))|~(rdn_add_with_carry(rdnn(n0),X16,X17,X18)))|~(rdn_translate(X15,rdn_pos(X18))))|sum(X13,X14,X15)),inference(variable_rename,[status(thm)],[55])).
% cnf(57,plain,(sum(X1,X2,X3)|~rdn_translate(X3,rdn_pos(X4))|~rdn_add_with_carry(rdnn(n0),X5,X6,X4)|~rdn_translate(X2,rdn_pos(X6))|~rdn_translate(X1,rdn_pos(X5))),inference(split_conjunct,[status(thm)],[56])).
% fof(84, plain,![X1]:![X2]:![X4]:![X5]:![X21]:((~(rdn_digit_add(rdnn(X2),rdnn(X4),rdnn(X21),rdnn(n0)))|~(rdn_digit_add(rdnn(X21),rdnn(X1),rdnn(X5),rdnn(n0))))|rdn_add_with_carry(rdnn(X1),rdnn(X2),rdnn(X4),rdnn(X5))),inference(fof_nnf,[status(thm)],[22])).
% fof(85, plain,![X22]:![X23]:![X24]:![X25]:![X26]:((~(rdn_digit_add(rdnn(X23),rdnn(X24),rdnn(X26),rdnn(n0)))|~(rdn_digit_add(rdnn(X26),rdnn(X22),rdnn(X25),rdnn(n0))))|rdn_add_with_carry(rdnn(X22),rdnn(X23),rdnn(X24),rdnn(X25))),inference(variable_rename,[status(thm)],[84])).
% cnf(86,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))),inference(split_conjunct,[status(thm)],[85])).
% cnf(113,plain,(rdn_translate(n0,rdn_pos(rdnn(n0)))),inference(split_conjunct,[status(thm)],[45])).
% cnf(114,plain,(rdn_digit_add(rdnn(n0),rdnn(n0),rdnn(n0),rdnn(n0))),inference(split_conjunct,[status(thm)],[46])).
% fof(118, plain,![X7]:![X8]:![X9]:((~(sum(X8,X9,X7))|difference(X7,X8,X9))&(~(difference(X7,X8,X9))|sum(X8,X9,X7))),inference(fof_nnf,[status(thm)],[48])).
% fof(119, plain,![X10]:![X11]:![X12]:((~(sum(X11,X12,X10))|difference(X10,X11,X12))&(~(difference(X10,X11,X12))|sum(X11,X12,X10))),inference(variable_rename,[status(thm)],[118])).
% cnf(121,plain,(difference(X1,X2,X3)|~sum(X2,X3,X1)),inference(split_conjunct,[status(thm)],[119])).
% fof(122, negated_conjecture,![X7]:~(difference(X7,n0,X7)),inference(fof_nnf,[status(thm)],[50])).
% fof(123, negated_conjecture,![X8]:~(difference(X8,n0,X8)),inference(variable_rename,[status(thm)],[122])).
% cnf(124,negated_conjecture,(~difference(X1,n0,X1)),inference(split_conjunct,[status(thm)],[123])).
% cnf(126,negated_conjecture,(~sum(n0,X1,X1)),inference(spm,[status(thm)],[124,121,theory(equality)])).
% cnf(143,plain,(rdn_add_with_carry(rdnn(n0),rdnn(X1),rdnn(X2),rdnn(n0))|~rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(n0),rdnn(n0))),inference(spm,[status(thm)],[86,114,theory(equality)])).
% cnf(149,plain,(sum(X1,X2,X3)|~rdn_translate(X3,rdn_pos(rdnn(n0)))|~rdn_translate(X2,rdn_pos(rdnn(X4)))|~rdn_translate(X1,rdn_pos(rdnn(X5)))|~rdn_digit_add(rdnn(X5),rdnn(X4),rdnn(n0),rdnn(n0))),inference(spm,[status(thm)],[57,143,theory(equality)])).
% cnf(159,plain,(sum(X1,X2,X3)|~rdn_translate(X3,rdn_pos(rdnn(n0)))|~rdn_translate(X2,rdn_pos(rdnn(n0)))|~rdn_translate(X1,rdn_pos(rdnn(n0)))),inference(spm,[status(thm)],[149,114,theory(equality)])).
% cnf(160,plain,(sum(X1,X2,n0)|~rdn_translate(X2,rdn_pos(rdnn(n0)))|~rdn_translate(X1,rdn_pos(rdnn(n0)))),inference(spm,[status(thm)],[159,113,theory(equality)])).
% cnf(163,plain,(sum(X1,n0,n0)|~rdn_translate(X1,rdn_pos(rdnn(n0)))),inference(spm,[status(thm)],[160,113,theory(equality)])).
% cnf(164,plain,(sum(n0,n0,n0)),inference(spm,[status(thm)],[163,113,theory(equality)])).
% cnf(165,plain,($false),inference(sr,[status(thm)],[164,126,theory(equality)])).
% cnf(166,plain,($false),165,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 128
% # ...of these trivial                : 0
% # ...subsumed                        : 0
% # ...remaining for further processing: 128
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 40
% # ...of the previous two non-trivial : 38
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 40
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 78
% #    Positive orientable unit clauses: 37
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 2
% #    Non-unit-clauses                : 39
% # Current number of unprocessed clauses: 10
% # ...number of literals in the above : 48
% # Clause-clause subsumption calls (NU) : 14
% # Rec. Clause-clause subsumption calls : 13
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 0
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:   102 leaves,   1.54+/-1.882 terms/leaf
% # Paramod-from index:           50 leaves,   1.22+/-1.269 terms/leaf
% # Paramod-into index:           93 leaves,   1.27+/-1.109 terms/leaf
% # -------------------------------------------------
% # User time              : 0.017 s
% # System time            : 0.005 s
% # Total time             : 0.022 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.21 WC
% FINAL PrfWatch: 0.14 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP3028/NUM340+1.tptp
% 
%------------------------------------------------------------------------------