%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM315+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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 : Thu Sep 24 01:44:40 PM UTC 2026
% Result : Theorem 0.17s 0.53s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 27 ( 16 unt; 0 def)
% Number of atoms : 56 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 56 ( 27 ~; 23 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 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 : 46 ( 0 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(add_digit_digit_digit,axiom,
! [X21,X22,X23,X24,X25] :
( ( rdn_digit_add(rdnn(X25),rdnn(X21),rdnn(X24),rdnn(n0))
& rdn_digit_add(rdnn(X22),rdnn(X23),rdnn(X25),rdnn(n0)) )
=> rdn_add_with_carry(rdnn(X21),rdnn(X22),rdnn(X23),rdnn(X24)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+2.ax',add_digit_digit_digit) ).
fof(sum_entry_point_neg_neg,axiom,
! [X1,X2,X3,X10,X11,X12] :
( ( rdn_translate(X3,rdn_neg(X12))
& rdn_add_with_carry(rdnn(n0),X10,X11,X12)
& rdn_translate(X2,rdn_neg(X11))
& rdn_translate(X1,rdn_neg(X10)) )
=> sum(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+2.ax',sum_entry_point_neg_neg) ).
fof(rdn_digit_add_n7_n0_n7_n0,axiom,
rdn_digit_add(rdnn(n7),rdnn(n0),rdnn(n7),rdnn(n0)),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+2.ax',rdn_digit_add_n7_n0_n7_n0) ).
fof(rdn_digit_add_n2_n5_n7_n0,axiom,
rdn_digit_add(rdnn(n2),rdnn(n5),rdnn(n7),rdnn(n0)),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+2.ax',rdn_digit_add_n2_n5_n7_n0) ).
fof(sum_nn2_nn5_nn7,conjecture,
sum(nn2,nn5,nn7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_nn2_nn5_nn7) ).
fof(rdnn7,axiom,
rdn_translate(nn7,rdn_neg(rdnn(n7))),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+0.ax',rdnn7) ).
fof(rdnn5,axiom,
rdn_translate(nn5,rdn_neg(rdnn(n5))),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+0.ax',rdnn5) ).
fof(rdnn2,axiom,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+0.ax',rdnn2) ).
fof(c_0_8,plain,
! [X77,X78,X79,X80,X81] :
( rdn_add_with_carry(rdnn(X77),rdnn(X78),rdnn(X79),rdnn(X80))
| ~ rdn_digit_add(rdnn(X81),rdnn(X77),rdnn(X80),rdnn(n0))
| ~ rdn_digit_add(rdnn(X78),rdnn(X79),rdnn(X81),rdnn(n0)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[add_digit_digit_digit])])]) ).
fof(c_0_9,plain,
! [X39,X40,X41,X42,X43,X44] :
( sum(X39,X40,X41)
| ~ rdn_translate(X41,rdn_neg(X44))
| ~ rdn_add_with_carry(rdnn(n0),X42,X43,X44)
| ~ rdn_translate(X40,rdn_neg(X43))
| ~ rdn_translate(X39,rdn_neg(X42)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sum_entry_point_neg_neg])])]) ).
cnf(c_0_10,plain,
( ~ rdn_digit_add(rdnn(X3),rdnn(X4),rdnn(X5),rdnn(n0))
| ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(X3),rdnn(n0))
| rdn_add_with_carry(rdnn(X4),rdnn(X1),rdnn(X2),rdnn(X5)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
rdn_digit_add(rdnn(n7),rdnn(n0),rdnn(n7),rdnn(n0)),
inference(split_conjunct,[status(thm)],[rdn_digit_add_n7_n0_n7_n0]) ).
cnf(c_0_12,plain,
( ~ rdn_translate(X6,rdn_neg(X5))
| ~ rdn_add_with_carry(rdnn(n0),X2,X4,X5)
| ~ rdn_translate(X3,rdn_neg(X4))
| ~ rdn_translate(X1,rdn_neg(X2))
| sum(X1,X3,X6) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(n7),rdnn(n0))
| rdn_add_with_carry(rdnn(n0),rdnn(X1),rdnn(X2),rdnn(n7)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( ~ rdn_translate(X1,rdn_neg(rdnn(X4)))
| ~ rdn_translate(X2,rdn_neg(rdnn(X5)))
| ~ rdn_translate(X3,rdn_neg(rdnn(n7)))
| ~ rdn_digit_add(rdnn(X4),rdnn(X5),rdnn(n7),rdnn(n0))
| sum(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
rdn_digit_add(rdnn(n2),rdnn(n5),rdnn(n7),rdnn(n0)),
inference(split_conjunct,[status(thm)],[rdn_digit_add_n2_n5_n7_n0]) ).
fof(c_0_16,negated_conjecture,
~ sum(nn2,nn5,nn7),
inference(assume_negation,[status(cth)],[sum_nn2_nn5_nn7]) ).
cnf(c_0_17,plain,
( ~ rdn_translate(X1,rdn_neg(rdnn(n2)))
| ~ rdn_translate(X2,rdn_neg(rdnn(n5)))
| ~ rdn_translate(X3,rdn_neg(rdnn(n7)))
| sum(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
rdn_translate(nn7,rdn_neg(rdnn(n7))),
inference(split_conjunct,[status(thm)],[rdnn7]) ).
fof(c_0_19,negated_conjecture,
~ sum(nn2,nn5,nn7),
inference(fof_simplification,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
( ~ rdn_translate(X1,rdn_neg(rdnn(n2)))
| ~ rdn_translate(X2,rdn_neg(rdnn(n5)))
| sum(X1,X2,nn7) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
rdn_translate(nn5,rdn_neg(rdnn(n5))),
inference(split_conjunct,[status(thm)],[rdnn5]) ).
fof(c_0_22,negated_conjecture,
~ sum(nn2,nn5,nn7),
inference(fof_nnf,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
( ~ rdn_translate(X1,rdn_neg(rdnn(n2)))
| sum(X1,nn5,nn7) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(split_conjunct,[status(thm)],[rdnn2]) ).
cnf(c_0_25,negated_conjecture,
~ sum(nn2,nn5,nn7),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM315+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n020.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 02:22:47 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.53 % Version: 3.5.1
% 0.17/0.53 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.17/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.53 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.17/0.53 % Starting new_bool_3 with 600s (2) cores
% 0.17/0.53 % Starting new_bool_1 with 600s (2) cores
% 0.17/0.53 % Starting sh5l with 300s (1) cores
% 0.17/0.53 % new_bool_3 with pid 1784962 completed with status 0
% 0.17/0.53 % Result found by new_bool_3
% 0.17/0.53 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.17/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.53 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.17/0.53 % Starting new_bool_3 with 600s (2) cores
% 0.17/0.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.17/0.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.53 % Search class: FHUSF-FFMM21-SFFFFFNN
% 0.17/0.53 % partial match(1): FHUNF-FFMM21-SFFFFFNN
% 0.17/0.53 % Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.17/0.53 % Starting SubtermCWHack with 61s (1) cores
% 0.17/0.53 % Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 0.17/0.53 % SubtermCWHack with pid 1784968 completed with status 0
% 0.17/0.53 % Result found by SubtermCWHack
% 0.17/0.53 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.17/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.53 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.17/0.53 % Starting new_bool_3 with 600s (2) cores
% 0.17/0.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.17/0.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.53 % Search class: FHUSF-FFMM21-SFFFFFNN
% 0.17/0.53 % partial match(1): FHUNF-FFMM21-SFFFFFNN
% 0.17/0.53 % Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.17/0.53 % Starting SubtermCWHack with 61s (1) cores
% 0.17/0.53 % Preprocessing time : 0.002 s
% 0.17/0.53
% 0.17/0.53 % Proof found!
% 0.17/0.53 % SZS status Theorem
% 0.17/0.53 % SZS output start CNFRefutation
% See solution above
% 0.17/0.53 % Parsed axioms : 402
% 0.17/0.53 % Removed by relevancy pruning/SinE : 259
% 0.17/0.53 % Initial clauses : 143
% 0.17/0.53 % Removed in clause preprocessing : 0
% 0.17/0.53 % Initial clauses in saturation : 143
% 0.17/0.53 % Processed clauses : 1338
% 0.17/0.53 % ...of these trivial : 0
% 0.17/0.53 % ...subsumed : 478
% 0.17/0.53 % ...remaining for further processing : 860
% 0.17/0.53 % Other redundant clauses eliminated : 0
% 0.17/0.53 % Clauses deleted for lack of memory : 0
% 0.17/0.53 % Backward-subsumed : 39
% 0.17/0.53 % Backward-rewritten : 0
% 0.17/0.53 % Generated clauses : 2096
% 0.17/0.53 % ...of the previous two non-redundant : 2095
% 0.17/0.53 % ...aggressively subsumed : 0
% 0.17/0.53 % Contextual simplify-reflections : 0
% 0.17/0.53 % Paramodulations : 2096
% 0.17/0.53 % Factorizations : 0
% 0.17/0.53 % NegExts : 0
% 0.17/0.53 % Equation resolutions : 0
% 0.17/0.53 % Disequality decompositions : 0
% 0.17/0.53 % Total rewrite steps : 0
% 0.17/0.53 % ...of those cached : 0
% 0.17/0.53 % Propositional unsat checks : 0
% 0.17/0.53 % Propositional check models : 0
% 0.17/0.53 % Propositional check unsatisfiable : 0
% 0.17/0.53 % Propositional clauses : 0
% 0.17/0.53 % Propositional clauses after purity: 0
% 0.17/0.53 % Propositional unsat core size : 0
% 0.17/0.53 % Propositional preprocessing time : 0.000
% 0.17/0.53 % Propositional encoding time : 0.000
% 0.17/0.53 % Propositional solver time : 0.000
% 0.17/0.53 % Success case prop preproc time : 0.000
% 0.17/0.53 % Success case prop encoding time : 0.000
% 0.17/0.53 % Success case prop solver time : 0.000
% 0.17/0.53 % Current number of processed clauses : 821
% 0.17/0.53 % Positive orientable unit clauses : 158
% 0.17/0.53 % Positive unorientable unit clauses: 0
% 0.17/0.53 % Negative unit clauses : 1
% 0.17/0.53 % Non-unit-clauses : 662
% 0.17/0.53 % Current number of unprocessed clauses: 900
% 0.17/0.53 % ...number of literals in the above : 4662
% 0.17/0.53 % Current number of archived formulas : 0
% 0.17/0.53 % Current number of archived clauses : 39
% 0.17/0.53 % Clause-clause subsumption calls (NU) : 122031
% 0.17/0.53 % Rec. Clause-clause subsumption calls : 65549
% 0.17/0.53 % Non-unit clause-clause subsumptions : 517
% 0.17/0.53 % Unit Clause-clause subsumption calls : 120
% 0.17/0.53 % Rewrite failures with RHS unbound : 0
% 0.17/0.53 % BW rewrite match attempts : 0
% 0.17/0.53 % BW rewrite match successes : 0
% 0.17/0.53 % Condensation attempts : 0
% 0.17/0.53 % Condensation successes : 0
% 0.17/0.53 % Termbank termtop insertions : 64206
% 0.17/0.53 % Search garbage collected termcells : 1747
% 0.17/0.53
% 0.17/0.53 % -------------------------------------------------
% 0.17/0.53 % User time : 0.075 s
% 0.17/0.53 % System time : 0.005 s
% 0.17/0.53 % Total time : 0.080 s
% 0.17/0.53 % Maximum resident set size: 4508 pages
% 0.17/0.53
% 0.17/0.53 % -------------------------------------------------
% 0.17/0.53 % User time : 0.135 s
% 0.17/0.53 % System time : 0.026 s
% 0.17/0.53 % Total time : 0.161 s
% 0.17/0.53 % Maximum resident set size: 4864 pages
% 0.17/0.53 % E exiting
%------------------------------------------------------------------------------