%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM295+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:44:38 PM UTC 2026
% Result : Theorem 0.16s 5.49s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 10 unt; 0 def)
% Number of atoms : 35 ( 6 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 33 ( 15 ~; 10 |; 5 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 33 ( 9 sgn 16 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(less_property,axiom,
! [X1,X2] :
( less(X1,X2)
<=> ( X2 != X1
& ~ less(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+1.ax',less_property) ).
fof(something_less_something,conjecture,
? [X1,X2] : less(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',something_less_something) ).
fof(rdn9,axiom,
rdn_translate(n9,rdn_pos(rdnn(n9))),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+0.ax',rdn9) ).
fof(less_entry_point_neg_pos,axiom,
! [X1,X2,X10,X11] :
( ( rdn_translate(X2,rdn_pos(X11))
& rdn_translate(X1,rdn_neg(X10)) )
=> less(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+1.ax',less_entry_point_neg_pos) ).
fof(c_0_4,plain,
! [X1,X2] :
( less(X1,X2)
<=> ( X2 != X1
& ~ less(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[less_property]) ).
fof(c_0_5,negated_conjecture,
~ ? [X1,X2] : less(X1,X2),
inference(assume_negation,[status(cth)],[something_less_something]) ).
fof(c_0_6,plain,
! [X47,X48] :
( ( less(X47,X48)
| X48 = X47
| less(X48,X47) )
& ( ~ less(X47,X48)
| X48 != X47 )
& ( ~ less(X47,X48)
| ~ less(X48,X47) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_7,negated_conjecture,
! [X33,X34] : ~ less(X33,X34),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_8,plain,
( less(X2,X1)
| X1 = X2
| less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
~ less(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
rdn_translate(n9,rdn_pos(rdnn(n9))),
inference(split_conjunct,[status(thm)],[rdn9]) ).
cnf(c_0_11,plain,
X1 = X2,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_8,c_0_9]),c_0_9]) ).
fof(c_0_12,plain,
! [X39,X40,X41,X42] :
( less(X39,X40)
| ~ rdn_translate(X40,rdn_pos(X42))
| ~ rdn_translate(X39,rdn_neg(X41)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_entry_point_neg_pos])])]) ).
cnf(c_0_13,plain,
rdn_translate(n9,X1),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( ~ rdn_translate(X3,rdn_pos(X4))
| ~ rdn_translate(X1,rdn_neg(X2))
| less(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
rdn_translate(X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_16,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15])]),c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM295+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/5.39 % Computer : n014.cluster.edu
% 0.12/5.39 % Model : x86_64 x86_64
% 0.12/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.39 % Memory : 8046.5625MB
% 0.12/5.39 % OS : Linux 6.8.0-71-generic
% 0.12/5.39 % CPULimit : 300
% 0.12/5.39 % WCLimit : 300
% 0.12/5.39 % DateTime : Mon Sep 21 02:20:56 UTC 2026
% 0.12/5.40 % CPUTime :
% 0.16/5.40 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/5.45 Running first-order theorem proving
% 0.16/5.45 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.16/5.49 % Version: 3.5.1
% 0.16/5.49 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.16/5.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.49 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.16/5.49 % Starting new_bool_3 with 600s (2) cores
% 0.16/5.49 % Starting new_bool_1 with 600s (2) cores
% 0.16/5.49 % Starting sh5l with 300s (1) cores
% 0.16/5.49 % new_bool_3 with pid 2933046 completed with status 0
% 0.16/5.49 % Result found by new_bool_3
% 0.16/5.49 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.16/5.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.49 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.16/5.49 % Starting new_bool_3 with 600s (2) cores
% 0.16/5.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/5.49 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/5.49 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.16/5.49 % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 0.16/5.49 % Starting SubtermCWHack with 55s (1) cores
% 0.16/5.49 % Starting new_bool_3 with 61s (1) cores
% 0.16/5.49 % SubtermCWHack with pid 2933049 completed with status 0
% 0.16/5.49 % Result found by SubtermCWHack
% 0.16/5.49 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.16/5.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.49 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.16/5.49 % Starting new_bool_3 with 600s (2) cores
% 0.16/5.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/5.49 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/5.49 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.16/5.49 % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 0.16/5.49 % Starting SubtermCWHack with 55s (1) cores
% 0.16/5.49 % Preprocessing time : 0.002 s
% 0.16/5.49
% 0.16/5.49 % Proof found!
% 0.16/5.49 % SZS status Theorem
% 0.16/5.49 % SZS output start CNFRefutation
% See solution above
% 0.16/5.49 % Parsed axioms : 402
% 0.16/5.49 % Removed by relevancy pruning/SinE : 276
% 0.16/5.49 % Initial clauses : 128
% 0.16/5.49 % Removed in clause preprocessing : 0
% 0.16/5.49 % Initial clauses in saturation : 128
% 0.16/5.49 % Processed clauses : 44
% 0.16/5.49 % ...of these trivial : 2
% 0.16/5.49 % ...subsumed : 2
% 0.16/5.49 % ...remaining for further processing : 39
% 0.16/5.49 % Other redundant clauses eliminated : 0
% 0.16/5.49 % Clauses deleted for lack of memory : 0
% 0.16/5.49 % Backward-subsumed : 0
% 0.16/5.49 % Backward-rewritten : 34
% 0.16/5.49 % Generated clauses : 196
% 0.16/5.49 % ...of the previous two non-redundant : 196
% 0.16/5.49 % ...aggressively subsumed : 0
% 0.16/5.49 % Contextual simplify-reflections : 0
% 0.16/5.49 % Paramodulations : 196
% 0.16/5.49 % Factorizations : 0
% 0.16/5.49 % NegExts : 0
% 0.16/5.49 % Equation resolutions : 0
% 0.16/5.49 % Disequality decompositions : 0
% 0.16/5.49 % Total rewrite steps : 38
% 0.16/5.49 % ...of those cached : 0
% 0.16/5.49 % Propositional unsat checks : 0
% 0.16/5.49 % Propositional check models : 0
% 0.16/5.49 % Propositional check unsatisfiable : 0
% 0.16/5.49 % Propositional clauses : 0
% 0.16/5.49 % Propositional clauses after purity: 0
% 0.16/5.49 % Propositional unsat core size : 0
% 0.16/5.49 % Propositional preprocessing time : 0.000
% 0.16/5.49 % Propositional encoding time : 0.000
% 0.16/5.49 % Propositional solver time : 0.000
% 0.16/5.49 % Success case prop preproc time : 0.000
% 0.16/5.49 % Success case prop encoding time : 0.000
% 0.16/5.49 % Success case prop solver time : 0.000
% 0.16/5.49 % Current number of processed clauses : 5
% 0.16/5.49 % Positive orientable unit clauses : 3
% 0.16/5.49 % Positive unorientable unit clauses: 1
% 0.16/5.49 % Negative unit clauses : 1
% 0.16/5.49 % Non-unit-clauses : 0
% 0.16/5.49 % Current number of unprocessed clauses: 116
% 0.16/5.49 % ...number of literals in the above : 125
% 0.16/5.49 % Current number of archived formulas : 0
% 0.16/5.49 % Current number of archived clauses : 34
% 0.16/5.49 % Clause-clause subsumption calls (NU) : 0
% 0.16/5.49 % Rec. Clause-clause subsumption calls : 0
% 0.16/5.49 % Non-unit clause-clause subsumptions : 0
% 0.16/5.49 % Unit Clause-clause subsumption calls : 19
% 0.16/5.49 % Rewrite failures with RHS unbound : 128
% 0.16/5.49 % BW rewrite match attempts : 136
% 0.16/5.49 % BW rewrite match successes : 94
% 0.16/5.49 % Condensation attempts : 0
% 0.16/5.49 % Condensation successes : 0
% 0.16/5.49 % Termbank termtop insertions : 9179
% 0.16/5.49 % Search garbage collected termcells : 1555
% 0.16/5.49
% 0.16/5.49 % -------------------------------------------------
% 0.16/5.49 % User time : 0.011 s
% 0.16/5.49 % System time : 0.001 s
% 0.16/5.49 % Total time : 0.012 s
% 0.16/5.49 % Maximum resident set size: 4508 pages
% 0.16/5.49
% 0.16/5.49 % -------------------------------------------------
% 0.16/5.49 % User time : 0.023 s
% 0.16/5.49 % System time : 0.008 s
% 0.16/5.49 % Total time : 0.031 s
% 0.16/5.49 % Maximum resident set size: 4864 pages
% 0.16/5.49 % E exiting
%------------------------------------------------------------------------------