%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM299+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 : n002.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.15s 0.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 27 ( 15 unt; 0 def)
% Number of atoms : 56 ( 4 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 56 ( 27 ~; 18 |; 7 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 32 ( 0 sgn 20 !; 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(less_property,axiom,
! [X1,X2] :
( less(X1,X2)
<=> ( X2 != X1
& ~ less(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',less_property) ).
fof(nn2_not_less_nn4,conjecture,
~ less(nn2,nn4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nn2_not_less_nn4) ).
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_8,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_9,plain,
! [X1,X2] :
( less(X1,X2)
<=> ( X2 != X1
& ~ less(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[less_property]) ).
fof(c_0_10,negated_conjecture,
~ ~ less(nn2,nn4),
inference(assume_negation,[status(cth)],[nn2_not_less_nn4]) ).
fof(c_0_11,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_12,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_8]) ).
cnf(c_0_13,plain,
rdn_positive_less(rdnn(n3),rdnn(n4)),
inference(split_conjunct,[status(thm)],[rdn_positive_less34]) ).
fof(c_0_14,plain,
! [X45,X46] :
( ( less(X45,X46)
| X46 = X45
| less(X46,X45) )
& ( ~ less(X45,X46)
| X46 != X45 )
& ( ~ less(X45,X46)
| ~ less(X46,X45) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
fof(c_0_15,negated_conjecture,
less(nn2,nn4),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
cnf(c_0_16,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_11]) ).
cnf(c_0_17,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(split_conjunct,[status(thm)],[rdnn2]) ).
cnf(c_0_18,plain,
( ~ rdn_positive_less(rdnn(X1),rdnn(n3))
| rdn_positive_less(rdnn(X1),rdnn(n4)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(split_conjunct,[status(thm)],[rdn_positive_less23]) ).
cnf(c_0_20,plain,
( ~ less(X2,X1)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
less(nn2,nn4),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( ~ rdn_translate(X1,rdn_neg(X2))
| ~ rdn_positive_less(rdnn(n2),X2)
| less(X1,nn2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
rdn_translate(nn4,rdn_neg(rdnn(n4))),
inference(split_conjunct,[status(thm)],[rdnn4]) ).
cnf(c_0_24,plain,
rdn_positive_less(rdnn(n2),rdnn(n4)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
~ less(nn4,nn2),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM299+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 : n002.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:24:03 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.15/0.45 % Version: 3.5.1
% 0.15/0.45 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.15/0.45 % Starting new_bool_3 with 600s (2) cores
% 0.15/0.45 % Starting new_bool_1 with 600s (2) cores
% 0.15/0.45 % Starting sh5l with 300s (1) cores
% 0.15/0.45 % new_bool_3 with pid 2225170 completed with status 0
% 0.15/0.45 % Result found by new_bool_3
% 0.15/0.45 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.15/0.45 % Starting new_bool_3 with 600s (2) cores
% 0.15/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.45 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.15/0.45 % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 0.15/0.45 % Starting SubtermCWHack with 55s (1) cores
% 0.15/0.45 % Starting new_bool_3 with 61s (1) cores
% 0.15/0.45 % SubtermCWHack with pid 2225173 completed with status 0
% 0.15/0.45 % Result found by SubtermCWHack
% 0.15/0.45 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.15/0.45 % Starting new_bool_3 with 600s (2) cores
% 0.15/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.45 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.15/0.45 % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 0.15/0.45 % Starting SubtermCWHack with 55s (1) cores
% 0.15/0.45 % Preprocessing time : 0.003 s
% 0.15/0.45
% 0.15/0.45 % Proof found!
% 0.15/0.45 % SZS status Theorem
% 0.15/0.45 % SZS output start CNFRefutation
% See solution above
% 0.15/0.45 % Parsed axioms : 402
% 0.15/0.45 % Removed by relevancy pruning/SinE : 274
% 0.15/0.45 % Initial clauses : 130
% 0.15/0.45 % Removed in clause preprocessing : 0
% 0.15/0.45 % Initial clauses in saturation : 130
% 0.15/0.45 % Processed clauses : 198
% 0.15/0.45 % ...of these trivial : 0
% 0.15/0.45 % ...subsumed : 0
% 0.15/0.45 % ...remaining for further processing : 198
% 0.15/0.45 % Other redundant clauses eliminated : 1
% 0.15/0.45 % Clauses deleted for lack of memory : 0
% 0.15/0.45 % Backward-subsumed : 0
% 0.15/0.45 % Backward-rewritten : 0
% 0.15/0.45 % Generated clauses : 96
% 0.15/0.45 % ...of the previous two non-redundant : 89
% 0.15/0.45 % ...aggressively subsumed : 0
% 0.15/0.45 % Contextual simplify-reflections : 0
% 0.15/0.45 % Paramodulations : 93
% 0.15/0.45 % Factorizations : 2
% 0.15/0.45 % NegExts : 0
% 0.15/0.45 % Equation resolutions : 1
% 0.15/0.45 % Disequality decompositions : 0
% 0.15/0.45 % Total rewrite steps : 2
% 0.15/0.45 % ...of those cached : 0
% 0.15/0.45 % Propositional unsat checks : 0
% 0.15/0.45 % Propositional check models : 0
% 0.15/0.45 % Propositional check unsatisfiable : 0
% 0.15/0.45 % Propositional clauses : 0
% 0.15/0.45 % Propositional clauses after purity: 0
% 0.15/0.45 % Propositional unsat core size : 0
% 0.15/0.45 % Propositional preprocessing time : 0.000
% 0.15/0.45 % Propositional encoding time : 0.000
% 0.15/0.45 % Propositional solver time : 0.000
% 0.15/0.45 % Success case prop preproc time : 0.000
% 0.15/0.45 % Success case prop encoding time : 0.000
% 0.15/0.45 % Success case prop solver time : 0.000
% 0.15/0.45 % Current number of processed clauses : 197
% 0.15/0.45 % Positive orientable unit clauses : 143
% 0.15/0.45 % Positive unorientable unit clauses: 0
% 0.15/0.45 % Negative unit clauses : 25
% 0.15/0.45 % Non-unit-clauses : 29
% 0.15/0.45 % Current number of unprocessed clauses: 21
% 0.15/0.45 % ...number of literals in the above : 60
% 0.15/0.45 % Current number of archived formulas : 0
% 0.15/0.45 % Current number of archived clauses : 0
% 0.15/0.45 % Clause-clause subsumption calls (NU) : 61
% 0.15/0.45 % Rec. Clause-clause subsumption calls : 54
% 0.15/0.45 % Non-unit clause-clause subsumptions : 0
% 0.15/0.45 % Unit Clause-clause subsumption calls : 458
% 0.15/0.45 % Rewrite failures with RHS unbound : 0
% 0.15/0.45 % BW rewrite match attempts : 0
% 0.15/0.45 % BW rewrite match successes : 0
% 0.15/0.45 % Condensation attempts : 0
% 0.15/0.45 % Condensation successes : 0
% 0.15/0.45 % Termbank termtop insertions : 9495
% 0.15/0.45 % Search garbage collected termcells : 1540
% 0.15/0.45
% 0.15/0.45 % -------------------------------------------------
% 0.15/0.45 % User time : 0.008 s
% 0.15/0.45 % System time : 0.008 s
% 0.15/0.45 % Total time : 0.016 s
% 0.15/0.45 % Maximum resident set size: 4508 pages
% 0.15/0.45
% 0.15/0.45 % -------------------------------------------------
% 0.15/0.45 % User time : 0.019 s
% 0.15/0.45 % System time : 0.019 s
% 0.15/0.45 % Total time : 0.038 s
% 0.15/0.45 % Maximum resident set size: 4864 pages
% 0.15/0.45 % E exiting
%------------------------------------------------------------------------------