%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM336+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:42 PM UTC 2026
% Result : Theorem 0.24s 0.63s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 36 ( 15 unt; 0 def)
% Number of atoms : 80 ( 8 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 78 ( 34 ~; 31 |; 7 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 70 ( 0 sgn 38 !; 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/sandbox/benchmark/Axioms/NUM005+2.ax',add_digit_digit_digit) ).
fof(sum_entry_point_pos_pos,axiom,
! [X1,X2,X3,X10,X11,X12] :
( ( rdn_translate(X3,rdn_pos(X12))
& rdn_add_with_carry(rdnn(n0),X10,X11,X12)
& rdn_translate(X2,rdn_pos(X11))
& rdn_translate(X1,rdn_pos(X10)) )
=> sum(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',sum_entry_point_pos_pos) ).
fof(rdn_digit_add_n5_n0_n5_n0,axiom,
rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',rdn_digit_add_n5_n0_n5_n0) ).
fof(diff_only_n5_n2_n3,conjecture,
! [X1] :
( difference(X1,n2,n3)
=> X1 = n5 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diff_only_n5_n2_n3) ).
fof(rdn_digit_add_n2_n3_n5_n0,axiom,
rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',rdn_digit_add_n2_n3_n5_n0) ).
fof(minus_entry_point,axiom,
! [X1,X2,X3] :
( sum(X2,X3,X1)
<=> difference(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',minus_entry_point) ).
fof(rdn5,axiom,
rdn_translate(n5,rdn_pos(rdnn(n5))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn5) ).
fof(unique_sum,axiom,
! [X1,X2,X15,X16] :
( ( sum(X1,X2,X16)
& sum(X1,X2,X15) )
=> X15 = X16 ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',unique_sum) ).
fof(rdn3,axiom,
rdn_translate(n3,rdn_pos(rdnn(n3))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn3) ).
fof(rdn2,axiom,
rdn_translate(n2,rdn_pos(rdnn(n2))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn2) ).
fof(c_0_10,plain,
! [X81,X82,X83,X84,X85] :
( rdn_add_with_carry(rdnn(X81),rdnn(X82),rdnn(X83),rdnn(X84))
| ~ rdn_digit_add(rdnn(X85),rdnn(X81),rdnn(X84),rdnn(n0))
| ~ rdn_digit_add(rdnn(X82),rdnn(X83),rdnn(X85),rdnn(n0)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[add_digit_digit_digit])])]) ).
fof(c_0_11,plain,
! [X37,X38,X39,X40,X41,X42] :
( sum(X37,X38,X39)
| ~ rdn_translate(X39,rdn_pos(X42))
| ~ rdn_add_with_carry(rdnn(n0),X40,X41,X42)
| ~ rdn_translate(X38,rdn_pos(X41))
| ~ rdn_translate(X37,rdn_pos(X40)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sum_entry_point_pos_pos])])]) ).
cnf(c_0_12,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_10]) ).
cnf(c_0_13,plain,
rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
inference(split_conjunct,[status(thm)],[rdn_digit_add_n5_n0_n5_n0]) ).
cnf(c_0_14,plain,
( ~ rdn_translate(X6,rdn_pos(X5))
| ~ rdn_add_with_carry(rdnn(n0),X2,X4,X5)
| ~ rdn_translate(X3,rdn_pos(X4))
| ~ rdn_translate(X1,rdn_pos(X2))
| sum(X1,X3,X6) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(n5),rdnn(n0))
| rdn_add_with_carry(rdnn(n0),rdnn(X1),rdnn(X2),rdnn(n5)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_16,negated_conjecture,
~ ! [X1] :
( difference(X1,n2,n3)
=> X1 = n5 ),
inference(assume_negation,[status(cth)],[diff_only_n5_n2_n3]) ).
cnf(c_0_17,plain,
( ~ rdn_translate(X1,rdn_pos(rdnn(X4)))
| ~ rdn_translate(X2,rdn_pos(rdnn(X5)))
| ~ rdn_translate(X3,rdn_pos(rdnn(n5)))
| ~ rdn_digit_add(rdnn(X4),rdnn(X5),rdnn(n5),rdnn(n0))
| sum(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
inference(split_conjunct,[status(thm)],[rdn_digit_add_n2_n3_n5_n0]) ).
fof(c_0_19,plain,
! [X34,X35,X36] :
( ( sum(X35,X36,X34)
| ~ difference(X34,X35,X36) )
& ( difference(X34,X35,X36)
| ~ sum(X35,X36,X34) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[minus_entry_point])])]) ).
fof(c_0_20,negated_conjecture,
( esk1_0 != n5
& difference(esk1_0,n2,n3) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
cnf(c_0_21,plain,
( ~ rdn_translate(X1,rdn_pos(rdnn(n2)))
| ~ rdn_translate(X2,rdn_pos(rdnn(n3)))
| ~ rdn_translate(X3,rdn_pos(rdnn(n5)))
| sum(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
rdn_translate(n5,rdn_pos(rdnn(n5))),
inference(split_conjunct,[status(thm)],[rdn5]) ).
fof(c_0_23,plain,
! [X69,X70,X71,X72] :
( X71 = X72
| ~ sum(X69,X70,X72)
| ~ sum(X69,X70,X71) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unique_sum])])]) ).
cnf(c_0_24,plain,
( ~ difference(X1,X2,X3)
| sum(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,negated_conjecture,
difference(esk1_0,n2,n3),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
( ~ rdn_translate(X1,rdn_pos(rdnn(n2)))
| ~ rdn_translate(X2,rdn_pos(rdnn(n3)))
| sum(X1,X2,n5) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
rdn_translate(n3,rdn_pos(rdnn(n3))),
inference(split_conjunct,[status(thm)],[rdn3]) ).
cnf(c_0_28,plain,
( ~ sum(X1,X2,X4)
| ~ sum(X1,X2,X3)
| X3 = X4 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,negated_conjecture,
sum(n2,n3,esk1_0),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
( ~ rdn_translate(X1,rdn_pos(rdnn(n2)))
| sum(X1,n3,n5) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(split_conjunct,[status(thm)],[rdn2]) ).
cnf(c_0_32,negated_conjecture,
( ~ sum(n2,n3,X1)
| X1 = esk1_0 ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
sum(n2,n3,n5),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
esk1_0 != n5,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM336+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.45 % Computer : n019.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Mon Sep 21 02:22:51 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.51 Running first-order theorem proving
% 0.24/0.51 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.24/0.63 % Version: 3.5.1
% 0.24/0.63 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.24/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.63 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.24/0.63 % Starting new_bool_3 with 600s (2) cores
% 0.24/0.63 % Starting new_bool_1 with 600s (2) cores
% 0.24/0.63 % Starting sh5l with 300s (1) cores
% 0.24/0.63 % new_bool_1 with pid 1481978 completed with status 0
% 0.24/0.63 % Result found by new_bool_1
% 0.24/0.63 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.24/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.63 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.24/0.63 % Starting new_bool_3 with 600s (2) cores
% 0.24/0.63 % Starting new_bool_1 with 600s (2) cores
% 0.24/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.63 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.63 % Search class: FHUSF-FFMM21-SFFFFFNN
% 0.24/0.63 % partial match(1): FHUNF-FFMM21-SFFFFFNN
% 0.24/0.63 % Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.24/0.63 % Starting SubtermCWHack with 61s (1) cores
% 0.24/0.63 % Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 0.24/0.63 % SAT001_MinMin_p005000_rr_RG with pid 1481984 completed with status 0
% 0.24/0.63 % Result found by SAT001_MinMin_p005000_rr_RG
% 0.24/0.63 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.24/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.63 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.24/0.63 % Starting new_bool_3 with 600s (2) cores
% 0.24/0.63 % Starting new_bool_1 with 600s (2) cores
% 0.24/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.63 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.63 % Search class: FHUSF-FFMM21-SFFFFFNN
% 0.24/0.63 % partial match(1): FHUNF-FFMM21-SFFFFFNN
% 0.24/0.63 % Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.24/0.63 % Starting SubtermCWHack with 61s (1) cores
% 0.24/0.63 % Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 0.24/0.63 % Preprocessing time : 0.002 s
% 0.24/0.63 % Presaturation interreduction done
% 0.24/0.63
% 0.24/0.63 % Proof found!
% 0.24/0.63 % SZS status Theorem
% 0.24/0.63 % SZS output start CNFRefutation
% See solution above
% 0.24/0.63 % Parsed axioms : 402
% 0.24/0.63 % Removed by relevancy pruning/SinE : 265
% 0.24/0.63 % Initial clauses : 139
% 0.24/0.63 % Removed in clause preprocessing : 0
% 0.24/0.63 % Initial clauses in saturation : 139
% 0.24/0.63 % Processed clauses : 863
% 0.24/0.63 % ...of these trivial : 0
% 0.24/0.63 % ...subsumed : 120
% 0.24/0.63 % ...remaining for further processing : 743
% 0.24/0.63 % Other redundant clauses eliminated : 0
% 0.24/0.63 % Clauses deleted for lack of memory : 0
% 0.24/0.63 % Backward-subsumed : 0
% 0.24/0.63 % Backward-rewritten : 0
% 0.24/0.63 % Generated clauses : 984
% 0.24/0.63 % ...of the previous two non-redundant : 982
% 0.24/0.63 % ...aggressively subsumed : 0
% 0.24/0.63 % Contextual simplify-reflections : 0
% 0.24/0.63 % Paramodulations : 984
% 0.24/0.63 % Factorizations : 0
% 0.24/0.63 % NegExts : 0
% 0.24/0.63 % Equation resolutions : 0
% 0.24/0.63 % Disequality decompositions : 0
% 0.24/0.63 % Total rewrite steps : 0
% 0.24/0.63 % ...of those cached : 0
% 0.24/0.63 % Propositional unsat checks : 0
% 0.24/0.63 % Propositional check models : 0
% 0.24/0.63 % Propositional check unsatisfiable : 0
% 0.24/0.63 % Propositional clauses : 0
% 0.24/0.63 % Propositional clauses after purity: 0
% 0.24/0.63 % Propositional unsat core size : 0
% 0.24/0.63 % Propositional preprocessing time : 0.000
% 0.24/0.63 % Propositional encoding time : 0.000
% 0.24/0.63 % Propositional solver time : 0.000
% 0.24/0.63 % Success case prop preproc time : 0.000
% 0.24/0.63 % Success case prop encoding time : 0.000
% 0.24/0.63 % Success case prop solver time : 0.000
% 0.24/0.63 % Current number of processed clauses : 604
% 0.24/0.63 % Positive orientable unit clauses : 159
% 0.24/0.63 % Positive unorientable unit clauses: 0
% 0.24/0.63 % Negative unit clauses : 1
% 0.24/0.63 % Non-unit-clauses : 444
% 0.24/0.63 % Current number of unprocessed clauses: 394
% 0.24/0.63 % ...number of literals in the above : 1855
% 0.24/0.63 % Current number of archived formulas : 0
% 0.24/0.63 % Current number of archived clauses : 139
% 0.24/0.63 % Clause-clause subsumption calls (NU) : 49552
% 0.24/0.63 % Rec. Clause-clause subsumption calls : 34300
% 0.24/0.63 % Non-unit clause-clause subsumptions : 120
% 0.24/0.63 % Unit Clause-clause subsumption calls : 48
% 0.24/0.63 % Rewrite failures with RHS unbound : 0
% 0.24/0.63 % BW rewrite match attempts : 2
% 0.24/0.63 % BW rewrite match successes : 0
% 0.24/0.63 % Condensation attempts : 0
% 0.24/0.63 % Condensation successes : 0
% 0.24/0.63 % Termbank termtop insertions : 36992
% 0.24/0.63 % Search garbage collected termcells : 1777
% 0.24/0.63
% 0.24/0.63 % -------------------------------------------------
% 0.24/0.63 % User time : 0.066 s
% 0.24/0.63 % System time : 0.006 s
% 0.24/0.63 % Total time : 0.072 s
% 0.24/0.63 % Maximum resident set size: 4764 pages
% 0.24/0.63
% 0.24/0.63 % -------------------------------------------------
% 0.24/0.63 % User time : 0.136 s
% 0.24/0.63 % System time : 0.019 s
% 0.24/0.63 % Total time : 0.156 s
% 0.24/0.63 % Maximum resident set size: 4864 pages
% 0.24/0.63 % E exiting
%------------------------------------------------------------------------------