%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM294+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 : n014.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:51:35 PM UTC 2026
% Result : Theorem 61.61s 12.92s
% Output : CNFRefutation 61.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 19 ( 11 unt; 0 def)
% Number of atoms : 35 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 31 ( 15 ~; 12 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 33 ( 4 sgn 17 !; 2 ?)
% 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(rdn29,axiom,
rdn_translate(n29,rdn_pos(rdn(rdnn(n9),rdnn(n2)))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn29) ).
fof(rdn_positive_less_multi_digit_high,axiom,
! [X4,X5,X6,X7] :
( rdn_positive_less(X5,X7)
=> rdn_positive_less(rdn(rdnn(X4),X5),rdn(rdnn(X6),X7)) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less_multi_digit_high) ).
fof(n12_less_something,conjecture,
? [X1] : less(n12,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n12_less_something) ).
fof(rdn12,axiom,
rdn_translate(n12,rdn_pos(rdn(rdnn(n2),rdnn(n1)))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn12) ).
fof(rdn_positive_less12,axiom,
rdn_positive_less(rdnn(n1),rdnn(n2)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less12) ).
fof(c_0_6,plain,
! [X49,X50,X51,X52] :
( less(X49,X50)
| ~ rdn_positive_less(X51,X52)
| ~ rdn_translate(X50,rdn_pos(X52))
| ~ rdn_translate(X49,rdn_pos(X51)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_entry_point_pos_pos])])]) ).
cnf(c_0_7,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_6]) ).
cnf(c_0_8,plain,
rdn_translate(n29,rdn_pos(rdn(rdnn(n9),rdnn(n2)))),
inference(split_conjunct,[status(thm)],[rdn29]) ).
fof(c_0_9,plain,
! [X36,X37,X38,X39] :
( rdn_positive_less(rdn(rdnn(X36),X37),rdn(rdnn(X38),X39))
| ~ rdn_positive_less(X37,X39) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdn_positive_less_multi_digit_high])])]) ).
fof(c_0_10,negated_conjecture,
~ ? [X1] : less(n12,X1),
inference(assume_negation,[status(cth)],[n12_less_something]) ).
cnf(c_0_11,plain,
( ~ rdn_translate(X1,rdn_pos(X2))
| ~ rdn_positive_less(X2,rdn(rdnn(n9),rdnn(n2)))
| less(X1,n29) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( ~ rdn_positive_less(X1,X2)
| rdn_positive_less(rdn(rdnn(X3),X1),rdn(rdnn(X4),X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,negated_conjecture,
! [X154] : ~ less(n12,X154),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_14,plain,
( ~ rdn_translate(X1,rdn_pos(rdn(rdnn(X3),X2)))
| ~ rdn_positive_less(X2,rdnn(n2))
| less(X1,n29) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
rdn_translate(n12,rdn_pos(rdn(rdnn(n2),rdnn(n1)))),
inference(split_conjunct,[status(thm)],[rdn12]) ).
cnf(c_0_16,plain,
rdn_positive_less(rdnn(n1),rdnn(n2)),
inference(split_conjunct,[status(thm)],[rdn_positive_less12]) ).
cnf(c_0_17,negated_conjecture,
~ less(n12,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM294+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.53 % Computer : n014.cluster.edu
% 0.09/0.53 % Model : x86_64 x86_64
% 0.09/0.53 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.53 % Memory : 8046.5625MB
% 0.09/0.53 % OS : Linux 6.8.0-71-generic
% 0.09/0.53 % CPULimit : 300
% 0.09/0.53 % WCLimit : 300
% 0.09/0.53 % DateTime : Mon Sep 21 02:20:51 UTC 2026
% 0.09/0.53 % CPUTime :
% 0.09/0.53 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.57 Running first-order theorem proving
% 0.13/0.57 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
% 61.61/12.92 % Version: 3.5.1
% 61.61/12.92 % Preprocessing class: FSLMSMSLSSSNFFN.
% 61.61/12.92 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 61.61/12.92 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 61.61/12.92 % Starting new_bool_3 with 600s (2) cores
% 61.61/12.92 % Starting new_bool_1 with 600s (2) cores
% 61.61/12.92 % Starting sh5l with 300s (1) cores
% 61.61/12.92 % G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 2933002 completed with status 0
% 61.61/12.92 % Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 61.61/12.92 % Preprocessing class: FSLMSMSLSSSNFFN.
% 61.61/12.92 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 61.61/12.92 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 61.61/12.92 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 61.61/12.92 % No SInE strategy applied
% 61.61/12.92 % Search class: FGHSF-FSLM21-MFFFFFNN
% 61.61/12.92 % Scheduled 11 strats onto 3 cores with 900 seconds (900 total)
% 61.61/12.92 % Starting SubtermCWHack with 82s (1) cores
% 61.61/12.92 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 91s (1) cores
% 61.61/12.92 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 82s (1) cores
% 61.61/12.92 % SubtermCWHack with pid 2933011 completed with status 0
% 61.61/12.92 % Result found by SubtermCWHack
% 61.61/12.92 % Preprocessing class: FSLMSMSLSSSNFFN.
% 61.61/12.92 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 61.61/12.92 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 61.61/12.92 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 61.61/12.92 % No SInE strategy applied
% 61.61/12.92 % Search class: FGHSF-FSLM21-MFFFFFNN
% 61.61/12.92 % Scheduled 11 strats onto 3 cores with 900 seconds (900 total)
% 61.61/12.92 % Starting SubtermCWHack with 82s (1) cores
% 61.61/12.92 % Preprocessing time : 0.005 s
% 61.61/12.92
% 61.61/12.92 % Proof found!
% 61.61/12.92 % SZS status Theorem
% 61.61/12.92 % SZS output start CNFRefutation
% See solution above
% 61.61/12.92 % Parsed axioms : 402
% 61.61/12.92 % Removed by relevancy pruning/SinE : 0
% 61.61/12.92 % Initial clauses : 407
% 61.61/12.92 % Removed in clause preprocessing : 0
% 61.61/12.92 % Initial clauses in saturation : 407
% 61.61/12.92 % Processed clauses : 22077
% 61.61/12.92 % ...of these trivial : 0
% 61.61/12.92 % ...subsumed : 130
% 61.61/12.92 % ...remaining for further processing : 21947
% 61.61/12.92 % Other redundant clauses eliminated : 2
% 61.61/12.92 % Clauses deleted for lack of memory : 0
% 61.61/12.92 % Backward-subsumed : 0
% 61.61/12.92 % Backward-rewritten : 0
% 61.61/12.92 % Generated clauses : 72237
% 61.61/12.92 % ...of the previous two non-redundant : 71544
% 61.61/12.92 % ...aggressively subsumed : 0
% 61.61/12.92 % Contextual simplify-reflections : 0
% 61.61/12.92 % Paramodulations : 72233
% 61.61/12.92 % Factorizations : 2
% 61.61/12.92 % NegExts : 0
% 61.61/12.92 % Equation resolutions : 2
% 61.61/12.92 % Disequality decompositions : 0
% 61.61/12.92 % Total rewrite steps : 2429
% 61.61/12.92 % ...of those cached : 2070
% 61.61/12.92 % Propositional unsat checks : 0
% 61.61/12.92 % Propositional check models : 0
% 61.61/12.92 % Propositional check unsatisfiable : 0
% 61.61/12.92 % Propositional clauses : 0
% 61.61/12.92 % Propositional clauses after purity: 0
% 61.61/12.92 % Propositional unsat core size : 0
% 61.61/12.92 % Propositional preprocessing time : 0.000
% 61.61/12.92 % Propositional encoding time : 0.000
% 61.61/12.92 % Propositional solver time : 0.000
% 61.61/12.92 % Success case prop preproc time : 0.000
% 61.61/12.92 % Success case prop encoding time : 0.000
% 61.61/12.92 % Success case prop solver time : 0.000
% 61.61/12.92 % Current number of processed clauses : 21945
% 61.61/12.92 % Positive orientable unit clauses : 14455
% 61.61/12.92 % Positive unorientable unit clauses: 0
% 61.61/12.92 % Negative unit clauses : 6235
% 61.61/12.92 % Non-unit-clauses : 1255
% 61.61/12.92 % Current number of unprocessed clauses: 49759
% 61.61/12.92 % ...number of literals in the above : 94978
% 61.61/12.92 % Current number of archived formulas : 0
% 61.61/12.92 % Current number of archived clauses : 0
% 61.61/12.92 % Clause-clause subsumption calls (NU) : 342629
% 61.61/12.92 % Rec. Clause-clause subsumption calls : 254502
% 61.61/12.92 % Non-unit clause-clause subsumptions : 1
% 61.61/12.92 % Unit Clause-clause subsumption calls : 14509253
% 61.61/12.92 % Rewrite failures with RHS unbound : 0
% 61.61/12.92 % BW rewrite match attempts : 0
% 61.61/12.93 % BW rewrite match successes : 0
% 61.61/12.93 % Condensation attempts : 0
% 61.61/12.93 % Condensation successes : 0
% 61.61/12.93 % Termbank termtop insertions : 738004
% 61.61/12.93 % Search garbage collected termcells : 764
% 61.61/12.93
% 61.61/12.93 % -------------------------------------------------
% 61.61/12.93 % User time : 12.095 s
% 61.61/12.93 % System time : 0.169 s
% 61.61/12.93 % Total time : 12.264 s
% 61.61/12.93 % Maximum resident set size: 4508 pages
% 61.61/12.93
% 61.61/12.93 % -------------------------------------------------
% 61.61/12.93 % User time : 36.351 s
% 61.61/12.93 % System time : 0.460 s
% 61.61/12.93 % Total time : 36.811 s
% 61.61/12.93 % Maximum resident set size: 5120 pages
% 61.61/12.93 % E exiting
%------------------------------------------------------------------------------