%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD060-4 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:22:54 PM UTC 2026
% Result : Unsatisfiable 0.23s 0.63s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 33 ( 16 unt; 0 nHn; 33 RR)
% Number of literals : 65 ( 0 equ; 35 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(compatibility_of_order_relation_and_addition,axiom,
( ~ sum(X4,X5,X2)
| ~ sum(X3,X5,X1)
| ~ less_or_equal(X3,X4)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',compatibility_of_order_relation_and_addition) ).
cnf(less_or_equal_5,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_5) ).
cnf(commutativity_addition,axiom,
( ~ sum(X2,X1,X3)
| sum(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',commutativity_addition) ).
cnf(totality_of_addition,axiom,
( ~ defined(X2)
| ~ defined(X1)
| sum(X1,X2,add(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',totality_of_addition) ).
cnf(sum_7,negated_conjecture,
sum(b,b,v),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_7) ).
cnf(transitivity_of_order_relation,axiom,
( ~ less_or_equal(X3,X2)
| ~ less_or_equal(X1,X3)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',transitivity_of_order_relation) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
cnf(sum_6,negated_conjecture,
sum(a,a,u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_6) ).
cnf(not_less_or_equal_8,negated_conjecture,
~ less_or_equal(u,v),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_8) ).
cnf(c_0_10,plain,
( ~ sum(X4,X5,X2)
| ~ sum(X3,X5,X1)
| ~ less_or_equal(X3,X4)
| less_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[compatibility_of_order_relation_and_addition]) ).
cnf(c_0_11,plain,
( ~ sum(X4,X5,X2)
| ~ sum(X3,X5,X1)
| ~ less_or_equal(X3,X4)
| less_or_equal(X1,X2) ),
c_0_10 ).
cnf(c_0_12,negated_conjecture,
less_or_equal(a,b),
less_or_equal_5 ).
cnf(c_0_13,plain,
( ~ sum(X2,X1,X3)
| sum(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_14,plain,
( ~ defined(X2)
| ~ defined(X1)
| sum(X1,X2,add(X1,X2)) ),
inference(fof_simplification,[status(thm)],[totality_of_addition]) ).
cnf(c_0_15,negated_conjecture,
( ~ sum(a,X3,X1)
| ~ sum(b,X3,X2)
| less_or_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
sum(b,b,v),
sum_7 ).
cnf(c_0_17,plain,
( ~ sum(X2,X1,X3)
| sum(X1,X2,X3) ),
c_0_13 ).
cnf(c_0_18,plain,
( ~ defined(X2)
| ~ defined(X1)
| sum(X1,X2,add(X1,X2)) ),
c_0_14 ).
cnf(c_0_19,plain,
( ~ less_or_equal(X3,X2)
| ~ less_or_equal(X1,X3)
| less_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_order_relation]) ).
cnf(c_0_20,negated_conjecture,
( ~ sum(a,b,X1)
| less_or_equal(X1,v) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( ~ defined(X2)
| ~ defined(X1)
| sum(X1,X2,add(X2,X1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_23,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_24,plain,
( ~ less_or_equal(X3,X2)
| ~ less_or_equal(X1,X3)
| less_or_equal(X1,X2) ),
c_0_19 ).
cnf(c_0_25,negated_conjecture,
less_or_equal(add(b,a),v),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_26,negated_conjecture,
( ~ sum(a,X2,X1)
| ~ defined(X2)
| less_or_equal(X1,add(b,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_18]),c_0_23])]) ).
cnf(c_0_27,negated_conjecture,
sum(a,a,u),
sum_6 ).
cnf(c_0_28,negated_conjecture,
~ less_or_equal(u,v),
inference(fof_simplification,[status(thm)],[not_less_or_equal_8]) ).
cnf(c_0_29,negated_conjecture,
( ~ less_or_equal(X1,add(b,a))
| less_or_equal(X1,v) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
less_or_equal(u,add(b,a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_22])]) ).
cnf(c_0_31,negated_conjecture,
~ less_or_equal(u,v),
c_0_28 ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : FLD060-4 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n016.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Mon Sep 21 15:48:23 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 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.23/0.63 % Version: 3.5.1
% 0.23/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.63 % Starting sh5l with 300s (1) cores
% 0.23/0.63 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2782808 completed with status 0
% 0.23/0.63 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.63 % No SInE strategy applied
% 0.23/0.63 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.23/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.63 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 0.23/0.63 % Starting new_bool_3 with 269s (1) cores
% 0.23/0.63 % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 0.23/0.63 % new_bool_3 with pid 2782815 completed with status 0
% 0.23/0.63 % Result found by new_bool_3
% 0.23/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.63 % No SInE strategy applied
% 0.23/0.63 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.23/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.63 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 0.23/0.63 % Starting new_bool_3 with 269s (1) cores
% 0.23/0.63 % Preprocessing time : 0.002 s
% 0.23/0.63 % Presaturation interreduction done
% 0.23/0.63
% 0.23/0.63 % Proof found!
% 0.23/0.63 % SZS status Unsatisfiable
% 0.23/0.63 % SZS output start CNFRefutation
% See solution above
% 0.23/0.63 % Parsed axioms : 34
% 0.23/0.63 % Removed by relevancy pruning/SinE : 0
% 0.23/0.63 % Initial clauses : 34
% 0.23/0.63 % Removed in clause preprocessing : 0
% 0.23/0.63 % Initial clauses in saturation : 34
% 0.23/0.63 % Processed clauses : 249
% 0.23/0.63 % ...of these trivial : 6
% 0.23/0.63 % ...subsumed : 40
% 0.23/0.63 % ...remaining for further processing : 203
% 0.23/0.63 % Other redundant clauses eliminated : 0
% 0.23/0.63 % Clauses deleted for lack of memory : 0
% 0.23/0.63 % Backward-subsumed : 0
% 0.23/0.63 % Backward-rewritten : 5
% 0.23/0.63 % Generated clauses : 670
% 0.23/0.63 % ...of the previous two non-redundant : 550
% 0.23/0.63 % ...aggressively subsumed : 0
% 0.23/0.63 % Contextual simplify-reflections : 0
% 0.23/0.63 % Paramodulations : 666
% 0.23/0.63 % Factorizations : 4
% 0.23/0.63 % NegExts : 0
% 0.23/0.63 % Equation resolutions : 0
% 0.23/0.63 % Disequality decompositions : 0
% 0.23/0.63 % Total rewrite steps : 418
% 0.23/0.63 % ...of those cached : 383
% 0.23/0.63 % Propositional unsat checks : 0
% 0.23/0.63 % Propositional check models : 0
% 0.23/0.63 % Propositional check unsatisfiable : 0
% 0.23/0.63 % Propositional clauses : 0
% 0.23/0.63 % Propositional clauses after purity: 0
% 0.23/0.63 % Propositional unsat core size : 0
% 0.23/0.63 % Propositional preprocessing time : 0.000
% 0.23/0.63 % Propositional encoding time : 0.000
% 0.23/0.63 % Propositional solver time : 0.000
% 0.23/0.63 % Success case prop preproc time : 0.000
% 0.23/0.63 % Success case prop encoding time : 0.000
% 0.23/0.63 % Success case prop solver time : 0.000
% 0.23/0.63 % Current number of processed clauses : 164
% 0.23/0.63 % Positive orientable unit clauses : 40
% 0.23/0.63 % Positive unorientable unit clauses: 0
% 0.23/0.63 % Negative unit clauses : 2
% 0.23/0.63 % Non-unit-clauses : 122
% 0.23/0.63 % Current number of unprocessed clauses: 362
% 0.23/0.63 % ...number of literals in the above : 1266
% 0.23/0.63 % Current number of archived formulas : 0
% 0.23/0.63 % Current number of archived clauses : 39
% 0.23/0.63 % Clause-clause subsumption calls (NU) : 1518
% 0.23/0.63 % Rec. Clause-clause subsumption calls : 1102
% 0.23/0.63 % Non-unit clause-clause subsumptions : 40
% 0.23/0.63 % Unit Clause-clause subsumption calls : 106
% 0.23/0.63 % Rewrite failures with RHS unbound : 0
% 0.23/0.63 % BW rewrite match attempts : 10
% 0.23/0.63 % BW rewrite match successes : 4
% 0.23/0.63 % Condensation attempts : 0
% 0.23/0.63 % Condensation successes : 0
% 0.23/0.63 % Termbank termtop insertions : 9761
% 0.23/0.63 % Search garbage collected termcells : 116
% 0.23/0.63
% 0.23/0.63 % -------------------------------------------------
% 0.23/0.63 % User time : 0.030 s
% 0.23/0.63 % System time : 0.007 s
% 0.23/0.63 % Total time : 0.037 s
% 0.23/0.63 % Maximum resident set size: 3660 pages
% 0.23/0.63
% 0.23/0.63 % -------------------------------------------------
% 0.23/0.63 % User time : 0.248 s
% 0.23/0.63 % System time : 0.029 s
% 0.23/0.63 % Total time : 0.278 s
% 0.23/0.63 % Maximum resident set size: 4864 pages
% 0.23/0.63 % E exiting
%------------------------------------------------------------------------------