%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ANA003-4 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.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 12:03:01 PM UTC 2026
% Result : Unsatisfiable 0.25s 0.55s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 44 ( 5 unt; 18 nHn; 40 RR)
% Number of literals : 102 ( 0 equ; 43 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 3 con; 0-2 aty)
% Number of variables : 69 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(less_or_equal_sum_of_halves,axiom,
( ~ less_or_equal(X3,half(X2))
| ~ less_or_equal(X1,half(X2))
| less_or_equal(add(X1,X3),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_sum_of_halves) ).
cnf(clause_4,hypothesis,
( ~ less_or_equal(absolute(add(X2,negate(a_real_number))),delta_2(X1))
| less_or_equal(absolute(add(g(X2),negate(g(a_real_number)))),X1)
| less_or_equal(X1,n0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_7_2,negated_conjecture,
( ~ less_or_equal(add(absolute(add(f(xs(X1)),negate(f(a_real_number)))),absolute(add(g(xs(X1)),negate(g(a_real_number))))),epsilon_0)
| less_or_equal(X1,n0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7_2) ).
cnf(clause_3,hypothesis,
( ~ less_or_equal(absolute(add(X2,negate(a_real_number))),delta_1(X1))
| less_or_equal(absolute(add(f(X2),negate(f(a_real_number)))),X1)
| less_or_equal(X1,n0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
cnf(minimum3,axiom,
( ~ less_or_equal(X1,minimum(X2,X3))
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',minimum3) ).
cnf(clause_6,hypothesis,
( less_or_equal(absolute(add(xs(X1),negate(a_real_number))),X1)
| less_or_equal(X1,n0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
cnf(minimum7,axiom,
( ~ less_or_equal(X1,minimum(X2,X3))
| less_or_equal(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',minimum7) ).
cnf(minimum9,axiom,
( ~ less_or_equal(minimum(X1,X2),n0)
| less_or_equal(X2,n0)
| less_or_equal(X1,n0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',minimum9) ).
cnf(clause_2,hypothesis,
( ~ less_or_equal(delta_2(X1),n0)
| less_or_equal(X1,n0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_1,hypothesis,
( ~ less_or_equal(delta_1(X1),n0)
| less_or_equal(X1,n0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
cnf(zero_and_half,axiom,
( ~ less_or_equal(half(X1),n0)
| less_or_equal(X1,n0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zero_and_half) ).
cnf(clause_5,hypothesis,
~ less_or_equal(epsilon_0,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
cnf(c_0_12,plain,
( ~ less_or_equal(X3,half(X2))
| ~ less_or_equal(X1,half(X2))
| less_or_equal(add(X1,X3),X2) ),
inference(fof_simplification,[status(thm)],[less_or_equal_sum_of_halves]) ).
cnf(c_0_13,hypothesis,
( ~ less_or_equal(absolute(add(X2,negate(a_real_number))),delta_2(X1))
| less_or_equal(absolute(add(g(X2),negate(g(a_real_number)))),X1)
| less_or_equal(X1,n0) ),
inference(fof_simplification,[status(thm)],[clause_4]) ).
cnf(c_0_14,negated_conjecture,
( ~ less_or_equal(add(absolute(add(f(xs(X1)),negate(f(a_real_number)))),absolute(add(g(xs(X1)),negate(g(a_real_number))))),epsilon_0)
| less_or_equal(X1,n0) ),
inference(fof_simplification,[status(thm)],[clause_7_2]) ).
cnf(c_0_15,plain,
( ~ less_or_equal(X3,half(X2))
| ~ less_or_equal(X1,half(X2))
| less_or_equal(add(X1,X3),X2) ),
c_0_12 ).
cnf(c_0_16,hypothesis,
( ~ less_or_equal(absolute(add(X2,negate(a_real_number))),delta_2(X1))
| less_or_equal(absolute(add(g(X2),negate(g(a_real_number)))),X1)
| less_or_equal(X1,n0) ),
c_0_13 ).
cnf(c_0_17,negated_conjecture,
( ~ less_or_equal(add(absolute(add(f(xs(X1)),negate(f(a_real_number)))),absolute(add(g(xs(X1)),negate(g(a_real_number))))),epsilon_0)
| less_or_equal(X1,n0) ),
c_0_14 ).
cnf(c_0_18,hypothesis,
( ~ less_or_equal(X1,half(X3))
| ~ less_or_equal(absolute(add(X2,negate(a_real_number))),delta_2(half(X3)))
| less_or_equal(half(X3),n0)
| less_or_equal(add(X1,absolute(add(g(X2),negate(g(a_real_number))))),X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,hypothesis,
( ~ less_or_equal(absolute(add(X2,negate(a_real_number))),delta_1(X1))
| less_or_equal(absolute(add(f(X2),negate(f(a_real_number)))),X1)
| less_or_equal(X1,n0) ),
inference(fof_simplification,[status(thm)],[clause_3]) ).
cnf(c_0_20,plain,
( ~ less_or_equal(X1,minimum(X2,X3))
| less_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[minimum3]) ).
cnf(c_0_21,negated_conjecture,
( ~ less_or_equal(absolute(add(xs(X1),negate(a_real_number))),delta_2(half(epsilon_0)))
| ~ less_or_equal(absolute(add(f(xs(X1)),negate(f(a_real_number)))),half(epsilon_0))
| less_or_equal(X1,n0)
| less_or_equal(half(epsilon_0),n0) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,hypothesis,
( ~ less_or_equal(absolute(add(X2,negate(a_real_number))),delta_1(X1))
| less_or_equal(absolute(add(f(X2),negate(f(a_real_number)))),X1)
| less_or_equal(X1,n0) ),
c_0_19 ).
cnf(c_0_23,plain,
( ~ less_or_equal(X1,minimum(X2,X3))
| less_or_equal(X1,X2) ),
c_0_20 ).
cnf(c_0_24,hypothesis,
( less_or_equal(absolute(add(xs(X1),negate(a_real_number))),X1)
| less_or_equal(X1,n0) ),
clause_6 ).
cnf(c_0_25,plain,
( ~ less_or_equal(X1,minimum(X2,X3))
| less_or_equal(X1,X3) ),
inference(fof_simplification,[status(thm)],[minimum7]) ).
cnf(c_0_26,hypothesis,
( ~ less_or_equal(absolute(add(xs(X1),negate(a_real_number))),delta_1(half(epsilon_0)))
| ~ less_or_equal(absolute(add(xs(X1),negate(a_real_number))),delta_2(half(epsilon_0)))
| less_or_equal(X1,n0)
| less_or_equal(half(epsilon_0),n0) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,hypothesis,
( less_or_equal(minimum(X1,X2),n0)
| less_or_equal(absolute(add(xs(minimum(X1,X2)),negate(a_real_number))),X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( ~ less_or_equal(X1,minimum(X2,X3))
| less_or_equal(X1,X3) ),
c_0_25 ).
cnf(c_0_29,plain,
( ~ less_or_equal(minimum(X1,X2),n0)
| less_or_equal(X2,n0)
| less_or_equal(X1,n0) ),
inference(fof_simplification,[status(thm)],[minimum9]) ).
cnf(c_0_30,hypothesis,
( ~ less_or_equal(absolute(add(xs(minimum(delta_2(half(epsilon_0)),X1)),negate(a_real_number))),delta_1(half(epsilon_0)))
| less_or_equal(half(epsilon_0),n0)
| less_or_equal(minimum(delta_2(half(epsilon_0)),X1),n0) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,hypothesis,
( less_or_equal(minimum(X1,X2),n0)
| less_or_equal(absolute(add(xs(minimum(X1,X2)),negate(a_real_number))),X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_24]) ).
cnf(c_0_32,hypothesis,
( ~ less_or_equal(delta_2(X1),n0)
| less_or_equal(X1,n0) ),
inference(fof_simplification,[status(thm)],[clause_2]) ).
cnf(c_0_33,hypothesis,
( ~ less_or_equal(delta_1(X1),n0)
| less_or_equal(X1,n0) ),
inference(fof_simplification,[status(thm)],[clause_1]) ).
cnf(c_0_34,plain,
( ~ less_or_equal(half(X1),n0)
| less_or_equal(X1,n0) ),
inference(fof_simplification,[status(thm)],[zero_and_half]) ).
cnf(c_0_35,plain,
( ~ less_or_equal(minimum(X1,X2),n0)
| less_or_equal(X2,n0)
| less_or_equal(X1,n0) ),
c_0_29 ).
cnf(c_0_36,hypothesis,
( less_or_equal(half(epsilon_0),n0)
| less_or_equal(minimum(delta_2(half(epsilon_0)),delta_1(half(epsilon_0))),n0) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,hypothesis,
( ~ less_or_equal(delta_2(X1),n0)
| less_or_equal(X1,n0) ),
c_0_32 ).
cnf(c_0_38,hypothesis,
( ~ less_or_equal(delta_1(X1),n0)
| less_or_equal(X1,n0) ),
c_0_33 ).
cnf(c_0_39,hypothesis,
~ less_or_equal(epsilon_0,n0),
inference(fof_simplification,[status(thm)],[clause_5]) ).
cnf(c_0_40,plain,
( ~ less_or_equal(half(X1),n0)
| less_or_equal(X1,n0) ),
c_0_34 ).
cnf(c_0_41,hypothesis,
less_or_equal(half(epsilon_0),n0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38]) ).
cnf(c_0_42,hypothesis,
~ less_or_equal(epsilon_0,n0),
c_0_39 ).
cnf(c_0_43,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : ANA003-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.44 % Computer : n006.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Mon Sep 21 13:22:12 UTC 2026
% 0.17/0.45 % CPUTime :
% 0.17/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.51 Running first-order theorem proving
% 0.25/0.51 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.25/0.55 % Version: 3.5.1
% 0.25/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.25/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.55 % Starting sh5l with 300s (1) cores
% 0.25/0.55 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2936103 completed with status 0
% 0.25/0.55 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.25/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.25/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.55 % No SInE strategy applied
% 0.25/0.55 % Search class: FGUNF-FFSF21-MFFFFFNN
% 0.25/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.25/0.55 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.25/0.55 % Starting new_bool_3 with 136s (1) cores
% 0.25/0.55 % Starting new_bool_1 with 136s (1) cores
% 0.25/0.55 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 2936109 completed with status 0
% 0.25/0.55 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.25/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.25/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.55 % No SInE strategy applied
% 0.25/0.55 % Search class: FGUNF-FFSF21-MFFFFFNN
% 0.25/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.25/0.55 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.25/0.55 % Preprocessing time : 0.002 s
% 0.25/0.55 % Presaturation interreduction done
% 0.25/0.55
% 0.25/0.55 % Proof found!
% 0.25/0.55 % SZS status Unsatisfiable
% 0.25/0.55 % SZS output start CNFRefutation
% See solution above
% 0.25/0.55 % Parsed axioms : 12
% 0.25/0.55 % Removed by relevancy pruning/SinE : 0
% 0.25/0.55 % Initial clauses : 12
% 0.25/0.55 % Removed in clause preprocessing : 0
% 0.25/0.55 % Initial clauses in saturation : 12
% 0.25/0.55 % Processed clauses : 43
% 0.25/0.55 % ...of these trivial : 0
% 0.25/0.55 % ...subsumed : 0
% 0.25/0.55 % ...remaining for further processing : 43
% 0.25/0.55 % Other redundant clauses eliminated : 0
% 0.25/0.55 % Clauses deleted for lack of memory : 0
% 0.25/0.55 % Backward-subsumed : 0
% 0.25/0.55 % Backward-rewritten : 5
% 0.25/0.55 % Generated clauses : 72
% 0.25/0.55 % ...of the previous two non-redundant : 71
% 0.25/0.55 % ...aggressively subsumed : 0
% 0.25/0.55 % Contextual simplify-reflections : 3
% 0.25/0.55 % Paramodulations : 72
% 0.25/0.55 % Factorizations : 0
% 0.25/0.55 % NegExts : 0
% 0.25/0.55 % Equation resolutions : 0
% 0.25/0.55 % Disequality decompositions : 0
% 0.25/0.55 % Total rewrite steps : 5
% 0.25/0.55 % ...of those cached : 4
% 0.25/0.55 % Propositional unsat checks : 0
% 0.25/0.55 % Propositional check models : 0
% 0.25/0.55 % Propositional check unsatisfiable : 0
% 0.25/0.55 % Propositional clauses : 0
% 0.25/0.55 % Propositional clauses after purity: 0
% 0.25/0.55 % Propositional unsat core size : 0
% 0.25/0.55 % Propositional preprocessing time : 0.000
% 0.25/0.55 % Propositional encoding time : 0.000
% 0.25/0.55 % Propositional solver time : 0.000
% 0.25/0.55 % Success case prop preproc time : 0.000
% 0.25/0.55 % Success case prop encoding time : 0.000
% 0.25/0.55 % Success case prop solver time : 0.000
% 0.25/0.55 % Current number of processed clauses : 26
% 0.25/0.55 % Positive orientable unit clauses : 1
% 0.25/0.55 % Positive unorientable unit clauses: 0
% 0.25/0.55 % Negative unit clauses : 1
% 0.25/0.55 % Non-unit-clauses : 24
% 0.25/0.55 % Current number of unprocessed clauses: 52
% 0.25/0.55 % ...number of literals in the above : 158
% 0.25/0.55 % Current number of archived formulas : 0
% 0.25/0.55 % Current number of archived clauses : 17
% 0.25/0.55 % Clause-clause subsumption calls (NU) : 662
% 0.25/0.55 % Rec. Clause-clause subsumption calls : 451
% 0.25/0.55 % Non-unit clause-clause subsumptions : 3
% 0.25/0.55 % Unit Clause-clause subsumption calls : 17
% 0.25/0.55 % Rewrite failures with RHS unbound : 0
% 0.25/0.55 % BW rewrite match attempts : 1
% 0.25/0.55 % BW rewrite match successes : 1
% 0.25/0.55 % Condensation attempts : 0
% 0.25/0.55 % Condensation successes : 0
% 0.25/0.55 % Termbank termtop insertions : 2699
% 0.25/0.55 % Search garbage collected termcells : 33
% 0.25/0.55
% 0.25/0.55 % -------------------------------------------------
% 0.25/0.55 % User time : 0.010 s
% 0.25/0.55 % System time : 0.003 s
% 0.25/0.55 % Total time : 0.013 s
% 0.25/0.55 % Maximum resident set size: 3644 pages
% 0.25/0.55
% 0.25/0.55 % -------------------------------------------------
% 0.25/0.55 % User time : 0.054 s
% 0.25/0.55 % System time : 0.016 s
% 0.25/0.55 % Total time : 0.071 s
% 0.25/0.55 % Maximum resident set size: 4608 pages
% 0.25/0.55 % E exiting
%------------------------------------------------------------------------------