%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM297+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 : n010.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:38 PM UTC 2026
% Result : Theorem 0.11s 0.47s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 23 ( 15 unt; 0 def)
% Number of atoms : 41 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 35 ( 17 ~; 13 |; 3 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 24 ( 0 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(rdn_positive_less_transitivity,axiom,
! [X1,X2,X3] :
( ( rdn_positive_less(rdnn(X2),rdnn(X3))
& rdn_positive_less(rdnn(X1),rdnn(X2)) )
=> rdn_positive_less(rdnn(X1),rdnn(X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less_transitivity) ).
fof(nn4_less_nn2,conjecture,
less(nn4,nn2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nn4_less_nn2) ).
fof(less_entry_point_neg_neg,axiom,
! [X1,X2,X10,X11] :
( ( rdn_positive_less(X11,X10)
& rdn_translate(X2,rdn_neg(X11))
& rdn_translate(X1,rdn_neg(X10)) )
=> less(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',less_entry_point_neg_neg) ).
fof(rdn_positive_less34,axiom,
rdn_positive_less(rdnn(n3),rdnn(n4)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less34) ).
fof(rdnn2,axiom,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdnn2) ).
fof(rdn_positive_less23,axiom,
rdn_positive_less(rdnn(n2),rdnn(n3)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less23) ).
fof(rdnn4,axiom,
rdn_translate(nn4,rdn_neg(rdnn(n4))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdnn4) ).
fof(c_0_7,plain,
! [X47,X48,X49] :
( rdn_positive_less(rdnn(X47),rdnn(X49))
| ~ rdn_positive_less(rdnn(X48),rdnn(X49))
| ~ rdn_positive_less(rdnn(X47),rdnn(X48)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdn_positive_less_transitivity])])]) ).
fof(c_0_8,negated_conjecture,
~ less(nn4,nn2),
inference(assume_negation,[status(cth)],[nn4_less_nn2]) ).
fof(c_0_9,plain,
! [X41,X42,X43,X44] :
( less(X41,X42)
| ~ rdn_positive_less(X44,X43)
| ~ rdn_translate(X42,rdn_neg(X44))
| ~ rdn_translate(X41,rdn_neg(X43)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_entry_point_neg_neg])])]) ).
cnf(c_0_10,plain,
( ~ rdn_positive_less(rdnn(X2),rdnn(X3))
| ~ rdn_positive_less(rdnn(X1),rdnn(X2))
| rdn_positive_less(rdnn(X1),rdnn(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
rdn_positive_less(rdnn(n3),rdnn(n4)),
inference(split_conjunct,[status(thm)],[rdn_positive_less34]) ).
fof(c_0_12,negated_conjecture,
~ less(nn4,nn2),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ rdn_positive_less(X4,X2)
| ~ rdn_translate(X3,rdn_neg(X4))
| ~ rdn_translate(X1,rdn_neg(X2))
| less(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(split_conjunct,[status(thm)],[rdnn2]) ).
cnf(c_0_15,plain,
( ~ rdn_positive_less(rdnn(X1),rdnn(n3))
| rdn_positive_less(rdnn(X1),rdnn(n4)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(split_conjunct,[status(thm)],[rdn_positive_less23]) ).
fof(c_0_17,negated_conjecture,
~ less(nn4,nn2),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( ~ rdn_translate(X1,rdn_neg(X2))
| ~ rdn_positive_less(rdnn(n2),X2)
| less(X1,nn2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
rdn_translate(nn4,rdn_neg(rdnn(n4))),
inference(split_conjunct,[status(thm)],[rdnn4]) ).
cnf(c_0_20,plain,
rdn_positive_less(rdnn(n2),rdnn(n4)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
~ less(nn4,nn2),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM297+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n010.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 02:21:40 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.11/0.47 % Version: 3.5.1
% 0.11/0.47 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.11/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.47 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.11/0.47 % Starting new_bool_3 with 600s (2) cores
% 0.11/0.47 % Starting new_bool_1 with 600s (2) cores
% 0.11/0.47 % Starting sh5l with 300s (1) cores
% 0.11/0.47 % new_bool_1 with pid 4030443 completed with status 0
% 0.11/0.47 % Result found by new_bool_1
% 0.11/0.47 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.11/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.47 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.11/0.47 % Starting new_bool_3 with 600s (2) cores
% 0.11/0.47 % Starting new_bool_1 with 600s (2) cores
% 0.11/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.47 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.11/0.47 % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 0.11/0.47 % Starting SubtermCWHack with 55s (1) cores
% 0.11/0.47 % Starting new_bool_1 with 61s (1) cores
% 0.11/0.47 % SubtermCWHack with pid 4030445 completed with status 0
% 0.11/0.47 % Result found by SubtermCWHack
% 0.11/0.47 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.11/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.47 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.11/0.47 % Starting new_bool_3 with 600s (2) cores
% 0.11/0.47 % Starting new_bool_1 with 600s (2) cores
% 0.11/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.47 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.11/0.47 % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 0.11/0.47 % Starting SubtermCWHack with 55s (1) cores
% 0.11/0.47 % Preprocessing time : 0.002 s
% 0.11/0.47
% 0.11/0.47 % Proof found!
% 0.11/0.47 % SZS status Theorem
% 0.11/0.47 % SZS output start CNFRefutation
% See solution above
% 0.11/0.47 % Parsed axioms : 402
% 0.11/0.47 % Removed by relevancy pruning/SinE : 274
% 0.11/0.47 % Initial clauses : 130
% 0.11/0.47 % Removed in clause preprocessing : 0
% 0.11/0.47 % Initial clauses in saturation : 130
% 0.11/0.47 % Processed clauses : 198
% 0.11/0.47 % ...of these trivial : 0
% 0.11/0.47 % ...subsumed : 3
% 0.11/0.47 % ...remaining for further processing : 195
% 0.11/0.47 % Other redundant clauses eliminated : 1
% 0.11/0.47 % Clauses deleted for lack of memory : 0
% 0.11/0.47 % Backward-subsumed : 0
% 0.11/0.47 % Backward-rewritten : 0
% 0.11/0.47 % Generated clauses : 94
% 0.11/0.47 % ...of the previous two non-redundant : 88
% 0.11/0.47 % ...aggressively subsumed : 0
% 0.11/0.47 % Contextual simplify-reflections : 0
% 0.11/0.47 % Paramodulations : 91
% 0.11/0.47 % Factorizations : 2
% 0.11/0.47 % NegExts : 0
% 0.11/0.47 % Equation resolutions : 1
% 0.11/0.47 % Disequality decompositions : 0
% 0.11/0.47 % Total rewrite steps : 1
% 0.11/0.47 % ...of those cached : 0
% 0.11/0.47 % Propositional unsat checks : 0
% 0.11/0.47 % Propositional check models : 0
% 0.11/0.47 % Propositional check unsatisfiable : 0
% 0.11/0.47 % Propositional clauses : 0
% 0.11/0.47 % Propositional clauses after purity: 0
% 0.11/0.47 % Propositional unsat core size : 0
% 0.11/0.47 % Propositional preprocessing time : 0.000
% 0.11/0.47 % Propositional encoding time : 0.000
% 0.11/0.47 % Propositional solver time : 0.000
% 0.11/0.47 % Success case prop preproc time : 0.000
% 0.11/0.47 % Success case prop encoding time : 0.000
% 0.11/0.47 % Success case prop solver time : 0.000
% 0.11/0.47 % Current number of processed clauses : 194
% 0.11/0.47 % Positive orientable unit clauses : 142
% 0.11/0.47 % Positive unorientable unit clauses: 0
% 0.11/0.47 % Negative unit clauses : 23
% 0.11/0.47 % Non-unit-clauses : 29
% 0.11/0.47 % Current number of unprocessed clauses: 20
% 0.11/0.47 % ...number of literals in the above : 57
% 0.11/0.47 % Current number of archived formulas : 0
% 0.11/0.47 % Current number of archived clauses : 0
% 0.11/0.47 % Clause-clause subsumption calls (NU) : 59
% 0.11/0.47 % Rec. Clause-clause subsumption calls : 52
% 0.11/0.47 % Non-unit clause-clause subsumptions : 1
% 0.11/0.47 % Unit Clause-clause subsumption calls : 432
% 0.11/0.47 % Rewrite failures with RHS unbound : 0
% 0.11/0.47 % BW rewrite match attempts : 0
% 0.11/0.47 % BW rewrite match successes : 0
% 0.11/0.47 % Condensation attempts : 0
% 0.11/0.47 % Condensation successes : 0
% 0.11/0.47 % Termbank termtop insertions : 9440
% 0.11/0.47 % Search garbage collected termcells : 1538
% 0.11/0.47
% 0.11/0.47 % -------------------------------------------------
% 0.11/0.47 % User time : 0.009 s
% 0.11/0.47 % System time : 0.008 s
% 0.11/0.47 % Total time : 0.017 s
% 0.11/0.47 % Maximum resident set size: 4456 pages
% 0.11/0.47
% 0.11/0.47 % -------------------------------------------------
% 0.11/0.47 % User time : 0.035 s
% 0.11/0.47 % System time : 0.019 s
% 0.11/0.47 % Total time : 0.054 s
% 0.11/0.47 % Maximum resident set size: 4864 pages
% 0.11/0.47 % E exiting
%------------------------------------------------------------------------------