%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM292+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 : n026.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:37 PM UTC 2026
% Result : Theorem 0.63s 0.72s
% Output : CNFRefutation 0.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 24 ( 13 unt; 0 def)
% Number of atoms : 43 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 38 ( 19 ~; 14 |; 2 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 28 ( 3 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(less_entry_point_pos_pos,axiom,
! [X1,X2,X10,X11] :
( ( rdn_positive_less(X10,X11)
& rdn_translate(X2,rdn_pos(X11))
& rdn_translate(X1,rdn_pos(X10)) )
=> less(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',less_entry_point_pos_pos) ).
fof(n2_less_n13,conjecture,
less(n2,n13),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n2_less_n13) ).
fof(rdn13,axiom,
rdn_translate(n13,rdn_pos(rdn(rdnn(n3),rdnn(n1)))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn13) ).
fof(rdn_extra_digits_positive_less,axiom,
! [X9,X6,X7] :
( rdn_non_zero(X7)
=> rdn_positive_less(rdnn(X9),rdn(rdnn(X6),X7)) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_extra_digits_positive_less) ).
fof(rdn2,axiom,
rdn_translate(n2,rdn_pos(rdnn(n2))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn2) ).
fof(rdn_non_zero_by_digit,axiom,
! [X1] :
( rdn_non_zero_digit(rdnn(X1))
=> rdn_non_zero(rdnn(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_non_zero_by_digit) ).
fof(rdn_digit1,axiom,
rdn_non_zero_digit(rdnn(n1)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_digit1) ).
fof(c_0_7,plain,
! [X33,X34,X35,X36] :
( less(X33,X34)
| ~ rdn_positive_less(X35,X36)
| ~ rdn_translate(X34,rdn_pos(X36))
| ~ rdn_translate(X33,rdn_pos(X35)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_entry_point_pos_pos])])]) ).
fof(c_0_8,negated_conjecture,
~ less(n2,n13),
inference(assume_negation,[status(cth)],[n2_less_n13]) ).
cnf(c_0_9,plain,
( ~ rdn_positive_less(X2,X4)
| ~ rdn_translate(X3,rdn_pos(X4))
| ~ rdn_translate(X1,rdn_pos(X2))
| less(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
rdn_translate(n13,rdn_pos(rdn(rdnn(n3),rdnn(n1)))),
inference(split_conjunct,[status(thm)],[rdn13]) ).
fof(c_0_11,plain,
! [X62,X63,X64] :
( rdn_positive_less(rdnn(X62),rdn(rdnn(X63),X64))
| ~ rdn_non_zero(X64) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdn_extra_digits_positive_less])])]) ).
fof(c_0_12,negated_conjecture,
~ less(n2,n13),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ rdn_translate(X1,rdn_pos(X2))
| ~ rdn_positive_less(X2,rdn(rdnn(n3),rdnn(n1)))
| less(X1,n13) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( ~ rdn_non_zero(X1)
| rdn_positive_less(rdnn(X2),rdn(rdnn(X3),X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,negated_conjecture,
~ less(n2,n13),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( ~ rdn_translate(X1,rdn_pos(rdnn(X2)))
| ~ rdn_non_zero(rdnn(n1))
| less(X1,n13) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(split_conjunct,[status(thm)],[rdn2]) ).
cnf(c_0_18,negated_conjecture,
~ less(n2,n13),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_19,plain,
! [X109] :
( rdn_non_zero(rdnn(X109))
| ~ rdn_non_zero_digit(rdnn(X109)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdn_non_zero_by_digit])])]) ).
cnf(c_0_20,plain,
~ rdn_non_zero(rdnn(n1)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_21,plain,
( ~ rdn_non_zero_digit(rdnn(X1))
| rdn_non_zero(rdnn(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_22,plain,
rdn_non_zero_digit(rdnn(n1)),
inference(split_conjunct,[status(thm)],[rdn_digit1]) ).
cnf(c_0_23,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM292+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.46 % Computer : n026.cluster.edu
% 0.18/0.46 % Model : x86_64 x86_64
% 0.18/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.46 % Memory : 8046.5625MB
% 0.18/0.46 % OS : Linux 6.8.0-71-generic
% 0.18/0.46 % CPULimit : 300
% 0.18/0.46 % WCLimit : 300
% 0.18/0.46 % DateTime : Mon Sep 21 02:23:36 UTC 2026
% 0.18/0.47 % CPUTime :
% 0.18/0.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.55 Running first-order theorem proving
% 0.25/0.55 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.63/0.72 % Version: 3.5.1
% 0.63/0.72 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.63/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.63/0.72 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.63/0.72 % Starting new_bool_3 with 600s (2) cores
% 0.63/0.72 % Starting new_bool_1 with 600s (2) cores
% 0.63/0.72 % Starting sh5l with 300s (1) cores
% 0.63/0.72 % sh5l with pid 1157413 completed with status 0
% 0.63/0.72 % Result found by sh5l
% 0.63/0.72 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.63/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.63/0.72 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.63/0.72 % Starting new_bool_3 with 600s (2) cores
% 0.63/0.72 % Starting new_bool_1 with 600s (2) cores
% 0.63/0.72 % Starting sh5l with 300s (1) cores
% 0.63/0.72 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.63/0.72 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.63/0.72 % Search class: FGHSF-FFLM21-MFFFFFNN
% 0.63/0.72 % partial match(1): FGHSF-FSLM21-MFFFFFNN
% 0.63/0.72 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.63/0.72 % Starting SubtermCWHack with 28s (1) cores
% 0.63/0.72 % SubtermCWHack with pid 1157421 completed with status 0
% 0.63/0.72 % Result found by SubtermCWHack
% 0.63/0.72 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.63/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.63/0.72 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.63/0.72 % Starting new_bool_3 with 600s (2) cores
% 0.63/0.72 % Starting new_bool_1 with 600s (2) cores
% 0.63/0.72 % Starting sh5l with 300s (1) cores
% 0.63/0.72 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.63/0.72 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.63/0.72 % Search class: FGHSF-FFLM21-MFFFFFNN
% 0.63/0.72 % partial match(1): FGHSF-FSLM21-MFFFFFNN
% 0.63/0.72 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.63/0.72 % Starting SubtermCWHack with 28s (1) cores
% 0.63/0.72 % Preprocessing time : 0.005 s
% 0.63/0.72
% 0.63/0.72 % Proof found!
% 0.63/0.72 % SZS status Theorem
% 0.63/0.72 % SZS output start CNFRefutation
% See solution above
% 0.63/0.72 % Parsed axioms : 402
% 0.63/0.72 % Removed by relevancy pruning/SinE : 246
% 0.63/0.72 % Initial clauses : 160
% 0.63/0.72 % Removed in clause preprocessing : 0
% 0.63/0.72 % Initial clauses in saturation : 160
% 0.63/0.72 % Processed clauses : 442
% 0.63/0.72 % ...of these trivial : 0
% 0.63/0.72 % ...subsumed : 88
% 0.63/0.72 % ...remaining for further processing : 354
% 0.63/0.72 % Other redundant clauses eliminated : 2
% 0.63/0.72 % Clauses deleted for lack of memory : 0
% 0.63/0.72 % Backward-subsumed : 1
% 0.63/0.72 % Backward-rewritten : 0
% 0.63/0.72 % Generated clauses : 533
% 0.63/0.72 % ...of the previous two non-redundant : 509
% 0.63/0.72 % ...aggressively subsumed : 0
% 0.63/0.72 % Contextual simplify-reflections : 0
% 0.63/0.72 % Paramodulations : 529
% 0.63/0.72 % Factorizations : 2
% 0.63/0.72 % NegExts : 0
% 0.63/0.72 % Equation resolutions : 2
% 0.63/0.72 % Disequality decompositions : 0
% 0.63/0.72 % Total rewrite steps : 28
% 0.63/0.72 % ...of those cached : 9
% 0.63/0.72 % Propositional unsat checks : 0
% 0.63/0.72 % Propositional check models : 0
% 0.63/0.72 % Propositional check unsatisfiable : 0
% 0.63/0.72 % Propositional clauses : 0
% 0.63/0.72 % Propositional clauses after purity: 0
% 0.63/0.72 % Propositional unsat core size : 0
% 0.63/0.72 % Propositional preprocessing time : 0.000
% 0.63/0.72 % Propositional encoding time : 0.000
% 0.63/0.72 % Propositional solver time : 0.000
% 0.63/0.72 % Success case prop preproc time : 0.000
% 0.63/0.72 % Success case prop encoding time : 0.000
% 0.63/0.72 % Success case prop solver time : 0.000
% 0.63/0.72 % Current number of processed clauses : 351
% 0.63/0.72 % Positive orientable unit clauses : 139
% 0.63/0.72 % Positive unorientable unit clauses: 0
% 0.63/0.72 % Negative unit clauses : 67
% 0.63/0.72 % Non-unit-clauses : 145
% 0.63/0.72 % Current number of unprocessed clauses: 227
% 0.63/0.72 % ...number of literals in the above : 997
% 0.63/0.72 % Current number of archived formulas : 0
% 0.63/0.72 % Current number of archived clauses : 1
% 0.63/0.72 % Clause-clause subsumption calls (NU) : 3440
% 0.63/0.72 % Rec. Clause-clause subsumption calls : 2648
% 0.63/0.72 % Non-unit clause-clause subsumptions : 42
% 0.63/0.72 % Unit Clause-clause subsumption calls : 4183
% 0.63/0.72 % Rewrite failures with RHS unbound : 0
% 0.63/0.72 % BW rewrite match attempts : 0
% 0.63/0.72 % BW rewrite match successes : 0
% 0.63/0.72 % Condensation attempts : 0
% 0.63/0.72 % Condensation successes : 0
% 0.63/0.72 % Termbank termtop insertions : 20540
% 0.63/0.72 % Search garbage collected termcells : 1840
% 0.63/0.72
% 0.63/0.72 % -------------------------------------------------
% 0.63/0.72 % User time : 0.053 s
% 0.63/0.72 % System time : 0.004 s
% 0.63/0.72 % Total time : 0.057 s
% 0.63/0.72 % Maximum resident set size: 4764 pages
% 0.63/0.72
% 0.63/0.72 % -------------------------------------------------
% 0.63/0.72 % User time : 0.065 s
% 0.63/0.72 % System time : 0.013 s
% 0.63/0.72 % Total time : 0.079 s
% 0.63/0.72 % Maximum resident set size: 5120 pages
% 0.63/0.72 % E exiting
%------------------------------------------------------------------------------