%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD061-4 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:55 PM UTC 2026
% Result : Unsatisfiable 0.26s 0.57s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 38 ( 20 unt; 0 nHn; 38 RR)
% Number of literals : 74 ( 0 equ; 39 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(commutativity_addition,axiom,
( ~ sum(X2,X1,X3)
| sum(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',commutativity_addition) ).
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/sandbox2/benchmark/Axioms/FLD002-0.ax',compatibility_of_order_relation_and_addition) ).
cnf(sum_10,negated_conjecture,
sum(d,b,v),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_10) ).
cnf(totality_of_addition,axiom,
( ~ defined(X2)
| ~ defined(X1)
| sum(X1,X2,add(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',totality_of_addition) ).
cnf(less_or_equal_7,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_7) ).
cnf(sum_9,negated_conjecture,
sum(a,c,u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_9) ).
cnf(transitivity_of_order_relation,axiom,
( ~ less_or_equal(X3,X2)
| ~ less_or_equal(X1,X3)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',transitivity_of_order_relation) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
cnf(d_is_defined,hypothesis,
defined(d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d_is_defined) ).
cnf(less_or_equal_8,negated_conjecture,
less_or_equal(c,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_8) ).
cnf(not_less_or_equal_11,negated_conjecture,
~ less_or_equal(u,v),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_11) ).
cnf(c_0_11,plain,
( ~ sum(X2,X1,X3)
| sum(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_12,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_13,plain,
( ~ sum(X2,X1,X3)
| sum(X1,X2,X3) ),
c_0_11 ).
cnf(c_0_14,negated_conjecture,
sum(d,b,v),
sum_10 ).
cnf(c_0_15,plain,
( ~ sum(X4,X5,X2)
| ~ sum(X3,X5,X1)
| ~ less_or_equal(X3,X4)
| less_or_equal(X1,X2) ),
c_0_12 ).
cnf(c_0_16,negated_conjecture,
sum(b,d,v),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( ~ defined(X2)
| ~ defined(X1)
| sum(X1,X2,add(X1,X2)) ),
inference(fof_simplification,[status(thm)],[totality_of_addition]) ).
cnf(c_0_18,negated_conjecture,
( ~ sum(X2,d,X1)
| ~ less_or_equal(X2,b)
| less_or_equal(X1,v) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
less_or_equal(a,b),
less_or_equal_7 ).
cnf(c_0_20,plain,
( ~ defined(X2)
| ~ defined(X1)
| sum(X1,X2,add(X1,X2)) ),
c_0_17 ).
cnf(c_0_21,negated_conjecture,
sum(a,c,u),
sum_9 ).
cnf(c_0_22,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_23,negated_conjecture,
( ~ sum(a,d,X1)
| less_or_equal(X1,v) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( ~ defined(X2)
| ~ defined(X1)
| sum(X1,X2,add(X2,X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
cnf(c_0_25,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_26,hypothesis,
defined(d),
d_is_defined ).
cnf(c_0_27,plain,
( ~ sum(X4,X3,X1)
| ~ defined(X2)
| ~ defined(X3)
| ~ less_or_equal(X4,X2)
| less_or_equal(X1,add(X2,X3)) ),
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
cnf(c_0_28,negated_conjecture,
sum(c,a,u),
inference(spm,[status(thm)],[c_0_13,c_0_21]) ).
cnf(c_0_29,plain,
( ~ less_or_equal(X3,X2)
| ~ less_or_equal(X1,X3)
| less_or_equal(X1,X2) ),
c_0_22 ).
cnf(c_0_30,negated_conjecture,
less_or_equal(add(d,a),v),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_31,negated_conjecture,
( ~ defined(X1)
| ~ less_or_equal(c,X1)
| less_or_equal(u,add(X1,a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_25])]) ).
cnf(c_0_32,negated_conjecture,
less_or_equal(c,d),
less_or_equal_8 ).
cnf(c_0_33,negated_conjecture,
~ less_or_equal(u,v),
inference(fof_simplification,[status(thm)],[not_less_or_equal_11]) ).
cnf(c_0_34,negated_conjecture,
( ~ less_or_equal(X1,add(d,a))
| less_or_equal(X1,v) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
less_or_equal(u,add(d,a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_26])]) ).
cnf(c_0_36,negated_conjecture,
~ less_or_equal(u,v),
c_0_33 ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : FLD061-4 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.43 % Computer : n003.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Mon Sep 21 15:45:31 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.51 Running first-order theorem proving
% 0.26/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.26/0.57 % Version: 3.5.1
% 0.26/0.57 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.26/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.26/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.57 % Starting sh5l with 300s (1) cores
% 0.26/0.57 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 473083 completed with status 0
% 0.26/0.57 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.26/0.57 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.26/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.26/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.57 % No SInE strategy applied
% 0.26/0.57 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.26/0.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.26/0.57 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 0.26/0.57 % Starting new_bool_3 with 269s (1) cores
% 0.26/0.57 % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 0.26/0.57 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 473088 completed with status 0
% 0.26/0.57 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.26/0.57 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.26/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.26/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.57 % No SInE strategy applied
% 0.26/0.57 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.26/0.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.26/0.57 % Preprocessing time : 0.002 s
% 0.26/0.57 % Presaturation interreduction done
% 0.26/0.57
% 0.26/0.57 % Proof found!
% 0.26/0.57 % SZS status Unsatisfiable
% 0.26/0.57 % SZS output start CNFRefutation
% See solution above
% 0.26/0.57 % Parsed axioms : 37
% 0.26/0.57 % Removed by relevancy pruning/SinE : 0
% 0.26/0.57 % Initial clauses : 37
% 0.26/0.57 % Removed in clause preprocessing : 0
% 0.26/0.57 % Initial clauses in saturation : 37
% 0.26/0.57 % Processed clauses : 227
% 0.26/0.57 % ...of these trivial : 1
% 0.26/0.57 % ...subsumed : 18
% 0.26/0.57 % ...remaining for further processing : 208
% 0.26/0.57 % Other redundant clauses eliminated : 0
% 0.26/0.57 % Clauses deleted for lack of memory : 0
% 0.26/0.57 % Backward-subsumed : 0
% 0.26/0.57 % Backward-rewritten : 3
% 0.26/0.57 % Generated clauses : 588
% 0.26/0.57 % ...of the previous two non-redundant : 485
% 0.26/0.57 % ...aggressively subsumed : 0
% 0.26/0.57 % Contextual simplify-reflections : 0
% 0.26/0.57 % Paramodulations : 586
% 0.26/0.57 % Factorizations : 2
% 0.26/0.57 % NegExts : 0
% 0.26/0.57 % Equation resolutions : 0
% 0.26/0.57 % Disequality decompositions : 0
% 0.26/0.57 % Total rewrite steps : 316
% 0.26/0.57 % ...of those cached : 274
% 0.26/0.57 % Propositional unsat checks : 0
% 0.26/0.57 % Propositional check models : 0
% 0.26/0.57 % Propositional check unsatisfiable : 0
% 0.26/0.57 % Propositional clauses : 0
% 0.26/0.57 % Propositional clauses after purity: 0
% 0.26/0.57 % Propositional unsat core size : 0
% 0.26/0.57 % Propositional preprocessing time : 0.000
% 0.26/0.57 % Propositional encoding time : 0.000
% 0.26/0.57 % Propositional solver time : 0.000
% 0.26/0.57 % Success case prop preproc time : 0.000
% 0.26/0.57 % Success case prop encoding time : 0.000
% 0.26/0.57 % Success case prop solver time : 0.000
% 0.26/0.57 % Current number of processed clauses : 168
% 0.26/0.57 % Positive orientable unit clauses : 54
% 0.26/0.57 % Positive unorientable unit clauses: 0
% 0.26/0.57 % Negative unit clauses : 2
% 0.26/0.57 % Non-unit-clauses : 112
% 0.26/0.57 % Current number of unprocessed clauses: 329
% 0.26/0.57 % ...number of literals in the above : 1138
% 0.26/0.57 % Current number of archived formulas : 0
% 0.26/0.57 % Current number of archived clauses : 40
% 0.26/0.57 % Clause-clause subsumption calls (NU) : 1663
% 0.26/0.57 % Rec. Clause-clause subsumption calls : 1228
% 0.26/0.57 % Non-unit clause-clause subsumptions : 18
% 0.26/0.57 % Unit Clause-clause subsumption calls : 106
% 0.26/0.57 % Rewrite failures with RHS unbound : 0
% 0.26/0.57 % BW rewrite match attempts : 17
% 0.26/0.57 % BW rewrite match successes : 3
% 0.26/0.57 % Condensation attempts : 0
% 0.26/0.57 % Condensation successes : 0
% 0.26/0.57 % Termbank termtop insertions : 8739
% 0.26/0.57 % Search garbage collected termcells : 116
% 0.26/0.57
% 0.26/0.57 % -------------------------------------------------
% 0.26/0.57 % User time : 0.026 s
% 0.26/0.57 % System time : 0.009 s
% 0.26/0.57 % Total time : 0.035 s
% 0.26/0.57 % Maximum resident set size: 3660 pages
% 0.26/0.57
% 0.26/0.57 % -------------------------------------------------
% 0.26/0.57 % User time : 0.129 s
% 0.26/0.57 % System time : 0.025 s
% 0.26/0.57 % Total time : 0.155 s
% 0.26/0.57 % Maximum resident set size: 4608 pages
% 0.26/0.57 % E exiting
%------------------------------------------------------------------------------