%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ANA003-2 : 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 : n015.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:00 PM UTC 2026
% Result : Unsatisfiable 34.15s 5.56s
% Output : CNFRefutation 34.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of clauses : 49 ( 4 unt; 0 nHn; 49 RR)
% Number of literals : 129 ( 0 equ; 87 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 5 con; 0-2 aty)
% Number of variables : 81 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(transitivity_of_less_than,axiom,
( ~ less_than(X2,X3)
| ~ less_than(X1,X2)
| less_than(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_less_than) ).
cnf(axiom_2_3,axiom,
( ~ less_than(n0,X2)
| ~ less_than(n0,X1)
| less_than(minimum(X1,X2),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2_3) ).
cnf(axiom_3,axiom,
( ~ less_than(X3,half(X2))
| ~ less_than(X1,half(X2))
| less_than(add(X1,X3),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
cnf(c_13,negated_conjecture,
( ~ less_than(absolute(add(X2,minus(a))),fp32(X1))
| ~ less_than(n0,X1)
| less_than(absolute(add(g(X2),minus(l2))),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_13) ).
cnf(c_15,negated_conjecture,
( ~ less_than(n0,X1)
| less_than(absolute(add(fp33(X1),minus(a))),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_15) ).
cnf(axiom_2_1,axiom,
( ~ less_than(n0,X2)
| ~ less_than(n0,X1)
| less_than(n0,minimum(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2_1) ).
cnf(c_12,negated_conjecture,
( ~ less_than(n0,X1)
| less_than(n0,fp32(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_12) ).
cnf(c_16,negated_conjecture,
( ~ less_than(add(absolute(add(f(fp33(X1)),minus(l1))),absolute(add(g(fp33(X1)),minus(l2)))),b)
| ~ less_than(n0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_16) ).
cnf(axiom_2_2,axiom,
( ~ less_than(n0,X2)
| ~ less_than(n0,X1)
| less_than(minimum(X1,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2_2) ).
cnf(c_11,negated_conjecture,
( ~ less_than(absolute(add(X2,minus(a))),fp31(X1))
| ~ less_than(n0,X1)
| less_than(absolute(add(f(X2),minus(l1))),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_11) ).
cnf(c_10,negated_conjecture,
( ~ less_than(n0,X1)
| less_than(n0,fp31(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_10) ).
cnf(axiom_7,axiom,
( ~ less_than(n0,X1)
| less_than(n0,half(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).
cnf(c_14,negated_conjecture,
less_than(n0,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_14) ).
cnf(c_0_13,plain,
( ~ less_than(X2,X3)
| ~ less_than(X1,X2)
| less_than(X1,X3) ),
inference(fof_simplification,[status(thm)],[transitivity_of_less_than]) ).
cnf(c_0_14,plain,
( ~ less_than(n0,X2)
| ~ less_than(n0,X1)
| less_than(minimum(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[axiom_2_3]) ).
cnf(c_0_15,plain,
( ~ less_than(X3,half(X2))
| ~ less_than(X1,half(X2))
| less_than(add(X1,X3),X2) ),
inference(fof_simplification,[status(thm)],[axiom_3]) ).
cnf(c_0_16,negated_conjecture,
( ~ less_than(absolute(add(X2,minus(a))),fp32(X1))
| ~ less_than(n0,X1)
| less_than(absolute(add(g(X2),minus(l2))),X1) ),
inference(fof_simplification,[status(thm)],[c_13]) ).
cnf(c_0_17,plain,
( ~ less_than(X2,X3)
| ~ less_than(X1,X2)
| less_than(X1,X3) ),
c_0_13 ).
cnf(c_0_18,plain,
( ~ less_than(n0,X2)
| ~ less_than(n0,X1)
| less_than(minimum(X1,X2),X2) ),
c_0_14 ).
cnf(c_0_19,negated_conjecture,
( ~ less_than(n0,X1)
| less_than(absolute(add(fp33(X1),minus(a))),X1) ),
inference(fof_simplification,[status(thm)],[c_15]) ).
cnf(c_0_20,plain,
( ~ less_than(n0,X2)
| ~ less_than(n0,X1)
| less_than(n0,minimum(X1,X2)) ),
inference(fof_simplification,[status(thm)],[axiom_2_1]) ).
cnf(c_0_21,plain,
( ~ less_than(X3,half(X2))
| ~ less_than(X1,half(X2))
| less_than(add(X1,X3),X2) ),
c_0_15 ).
cnf(c_0_22,negated_conjecture,
( ~ less_than(absolute(add(X2,minus(a))),fp32(X1))
| ~ less_than(n0,X1)
| less_than(absolute(add(g(X2),minus(l2))),X1) ),
c_0_16 ).
cnf(c_0_23,plain,
( ~ less_than(n0,X3)
| ~ less_than(n0,X2)
| ~ less_than(X1,minimum(X3,X2))
| less_than(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( ~ less_than(n0,X1)
| less_than(absolute(add(fp33(X1),minus(a))),X1) ),
c_0_19 ).
cnf(c_0_25,plain,
( ~ less_than(n0,X2)
| ~ less_than(n0,X1)
| less_than(n0,minimum(X1,X2)) ),
c_0_20 ).
cnf(c_0_26,negated_conjecture,
( ~ less_than(n0,X1)
| less_than(n0,fp32(X1)) ),
inference(fof_simplification,[status(thm)],[c_12]) ).
cnf(c_0_27,negated_conjecture,
( ~ less_than(add(absolute(add(f(fp33(X1)),minus(l1))),absolute(add(g(fp33(X1)),minus(l2)))),b)
| ~ less_than(n0,X1) ),
inference(fof_simplification,[status(thm)],[c_16]) ).
cnf(c_0_28,negated_conjecture,
( ~ less_than(X1,half(X3))
| ~ less_than(n0,half(X3))
| ~ less_than(absolute(add(X2,minus(a))),fp32(half(X3)))
| less_than(add(X1,absolute(add(g(X2),minus(l2)))),X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( ~ less_than(n0,X1)
| ~ less_than(n0,X2)
| less_than(absolute(add(fp33(minimum(X1,X2)),minus(a))),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( ~ less_than(n0,X1)
| less_than(n0,fp32(X1)) ),
c_0_26 ).
cnf(c_0_31,plain,
( ~ less_than(n0,X2)
| ~ less_than(n0,X1)
| less_than(minimum(X1,X2),X1) ),
inference(fof_simplification,[status(thm)],[axiom_2_2]) ).
cnf(c_0_32,negated_conjecture,
( ~ less_than(add(absolute(add(f(fp33(X1)),minus(l1))),absolute(add(g(fp33(X1)),minus(l2)))),b)
| ~ less_than(n0,X1) ),
c_0_27 ).
cnf(c_0_33,negated_conjecture,
( ~ less_than(n0,X2)
| ~ less_than(X1,half(X3))
| ~ less_than(n0,half(X3))
| less_than(add(X1,absolute(add(g(fp33(minimum(X2,fp32(half(X3))))),minus(l2)))),X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( ~ less_than(absolute(add(X2,minus(a))),fp31(X1))
| ~ less_than(n0,X1)
| less_than(absolute(add(f(X2),minus(l1))),X1) ),
inference(fof_simplification,[status(thm)],[c_11]) ).
cnf(c_0_35,plain,
( ~ less_than(n0,X2)
| ~ less_than(n0,X1)
| less_than(minimum(X1,X2),X1) ),
c_0_31 ).
cnf(c_0_36,negated_conjecture,
( ~ less_than(n0,X1)
| ~ less_than(n0,half(b))
| ~ less_than(n0,minimum(X1,fp32(half(b))))
| ~ less_than(absolute(add(f(fp33(minimum(X1,fp32(half(b))))),minus(l1))),half(b)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( ~ less_than(absolute(add(X2,minus(a))),fp31(X1))
| ~ less_than(n0,X1)
| less_than(absolute(add(f(X2),minus(l1))),X1) ),
c_0_34 ).
cnf(c_0_38,plain,
( ~ less_than(n0,X2)
| ~ less_than(n0,X3)
| ~ less_than(X1,minimum(X2,X3))
| less_than(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( ~ less_than(n0,X1)
| less_than(n0,fp31(X1)) ),
inference(fof_simplification,[status(thm)],[c_10]) ).
cnf(c_0_40,negated_conjecture,
( ~ less_than(n0,X1)
| ~ less_than(n0,half(b))
| ~ less_than(n0,minimum(X1,fp32(half(b))))
| ~ less_than(absolute(add(fp33(minimum(X1,fp32(half(b)))),minus(a))),fp31(half(b))) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
( ~ less_than(n0,X1)
| ~ less_than(n0,X2)
| less_than(absolute(add(fp33(minimum(X1,X2)),minus(a))),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_24]),c_0_25]) ).
cnf(c_0_42,negated_conjecture,
( ~ less_than(n0,X1)
| less_than(n0,fp31(X1)) ),
c_0_39 ).
cnf(c_0_43,negated_conjecture,
( ~ less_than(n0,half(b))
| ~ less_than(n0,minimum(fp31(half(b)),fp32(half(b)))) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_30]),c_0_42]) ).
cnf(c_0_44,plain,
( ~ less_than(n0,X1)
| less_than(n0,half(X1)) ),
inference(fof_simplification,[status(thm)],[axiom_7]) ).
cnf(c_0_45,negated_conjecture,
~ less_than(n0,half(b)),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_25]),c_0_42]),c_0_30]) ).
cnf(c_0_46,plain,
( ~ less_than(n0,X1)
| less_than(n0,half(X1)) ),
c_0_44 ).
cnf(c_0_47,negated_conjecture,
less_than(n0,b),
c_14 ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ANA003-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n015.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 13:24:52 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.44 Running first-order theorem proving
% 0.11/0.44 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
% 34.15/5.56 % Version: 3.5.1
% 34.15/5.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 34.15/5.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 34.15/5.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 34.15/5.56 % Starting new_bool_3 with 300s (1) cores
% 34.15/5.56 % Starting new_bool_1 with 300s (1) cores
% 34.15/5.56 % Starting sh5l with 300s (1) cores
% 34.15/5.56 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1556221 completed with status 0
% 34.15/5.56 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 34.15/5.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 34.15/5.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 34.15/5.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 34.15/5.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 34.15/5.56 % No SInE strategy applied
% 34.15/5.56 % Search class: FHHNS-FFSF21-MFFFFFNN
% 34.15/5.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 34.15/5.56 % Starting SubtermCWHack with 136s (1) cores
% 34.15/5.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 34.15/5.56 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 226s (1) cores
% 34.15/5.56 % Starting new_bool_3 with 226s (1) cores
% 34.15/5.56 % Starting new_bool_1 with 226s (1) cores
% 34.15/5.56 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 1556229 completed with status 0
% 34.15/5.56 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 34.15/5.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 34.15/5.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 34.15/5.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 34.15/5.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 34.15/5.56 % No SInE strategy applied
% 34.15/5.56 % Search class: FHHNS-FFSF21-MFFFFFNN
% 34.15/5.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 34.15/5.56 % Starting SubtermCWHack with 136s (1) cores
% 34.15/5.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 34.15/5.56 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 226s (1) cores
% 34.15/5.56 % Preprocessing time : 0.002 s
% 34.15/5.56 % Presaturation interreduction done
% 34.15/5.56
% 34.15/5.56 % Proof found!
% 34.15/5.56 % SZS status Unsatisfiable
% 34.15/5.56 % SZS output start CNFRefutation
% See solution above
% 34.15/5.56 % Parsed axioms : 17
% 34.15/5.56 % Removed by relevancy pruning/SinE : 0
% 34.15/5.56 % Initial clauses : 17
% 34.15/5.56 % Removed in clause preprocessing : 0
% 34.15/5.56 % Initial clauses in saturation : 17
% 34.15/5.56 % Processed clauses : 5026
% 34.15/5.56 % ...of these trivial : 0
% 34.15/5.56 % ...subsumed : 1845
% 34.15/5.56 % ...remaining for further processing : 3181
% 34.15/5.56 % Other redundant clauses eliminated : 0
% 34.15/5.56 % Clauses deleted for lack of memory : 0
% 34.15/5.56 % Backward-subsumed : 576
% 34.15/5.56 % Backward-rewritten : 0
% 34.15/5.56 % Generated clauses : 40020
% 34.15/5.56 % ...of the previous two non-redundant : 40011
% 34.15/5.56 % ...aggressively subsumed : 0
% 34.15/5.56 % Contextual simplify-reflections : 1848
% 34.15/5.56 % Paramodulations : 40020
% 34.15/5.56 % Factorizations : 0
% 34.15/5.56 % NegExts : 0
% 34.15/5.56 % Equation resolutions : 0
% 34.15/5.56 % Disequality decompositions : 0
% 34.15/5.56 % Total rewrite steps : 19
% 34.15/5.56 % ...of those cached : 18
% 34.15/5.56 % Propositional unsat checks : 0
% 34.15/5.56 % Propositional check models : 0
% 34.15/5.56 % Propositional check unsatisfiable : 0
% 34.15/5.56 % Propositional clauses : 0
% 34.15/5.56 % Propositional clauses after purity: 0
% 34.15/5.56 % Propositional unsat core size : 0
% 34.15/5.56 % Propositional preprocessing time : 0.000
% 34.15/5.56 % Propositional encoding time : 0.000
% 34.15/5.56 % Propositional solver time : 0.000
% 34.15/5.56 % Success case prop preproc time : 0.000
% 34.15/5.56 % Success case prop encoding time : 0.000
% 34.15/5.56 % Success case prop solver time : 0.000
% 34.15/5.56 % Current number of processed clauses : 2588
% 34.15/5.56 % Positive orientable unit clauses : 3
% 34.15/5.56 % Positive unorientable unit clauses: 0
% 34.15/5.56 % Negative unit clauses : 163
% 34.15/5.56 % Non-unit-clauses : 2422
% 34.15/5.56 % Current number of unprocessed clauses: 34501
% 34.15/5.56 % ...number of literals in the above : 222213
% 34.15/5.56 % Current number of archived formulas : 0
% 34.15/5.56 % Current number of archived clauses : 593
% 34.15/5.56 % Clause-clause subsumption calls (NU) : 5467573
% 34.15/5.56 % Rec. Clause-clause subsumption calls : 523803
% 34.15/5.56 % Non-unit clause-clause subsumptions : 3230
% 34.15/5.56 % Unit Clause-clause subsumption calls : 15334
% 34.15/5.56 % Rewrite failures with RHS unbound : 0
% 34.15/5.56 % BW rewrite match attempts : 0
% 34.15/5.56 % BW rewrite match successes : 0
% 34.15/5.56 % Condensation attempts : 0
% 34.15/5.56 % Condensation successes : 0
% 34.15/5.56 % Termbank termtop insertions : 1465265
% 34.15/5.56 % Search garbage collected termcells : 42
% 34.15/5.56
% 34.15/5.56 % -------------------------------------------------
% 34.15/5.56 % User time : 4.891 s
% 34.15/5.56 % System time : 0.083 s
% 34.15/5.56 % Total time : 4.974 s
% 34.15/5.56 % Maximum resident set size: 3392 pages
% 34.15/5.56
% 34.15/5.56 % -------------------------------------------------
% 34.15/5.56 % User time : 23.951 s
% 34.15/5.56 % System time : 1.101 s
% 34.15/5.56 % Total time : 25.052 s
% 34.15/5.56 % Maximum resident set size: 4608 pages
% 34.15/5.56 % E exiting
%------------------------------------------------------------------------------