%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : FLD061-2 : 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 : n026.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:23:22 PM UTC 2026
% Result : Unsatisfiable 0.20s 0.57s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of clauses : 49 ( 23 unt; 3 nHn; 49 RR)
% Number of literals : 95 ( 0 equ; 46 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 55 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(symmetry_of_equality,axiom,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
cnf(compatibility_of_equality_and_order_relation,axiom,
( ~ equalish(X3,X1)
| ~ less_or_equal(X3,X2)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation) ).
cnf(add_equals_v_8,negated_conjecture,
equalish(add(d,b),v),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_equals_v_8) ).
cnf(totality_of_order_relation,axiom,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',totality_of_order_relation) ).
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/FLD001-0.ax',transitivity_of_order_relation) ).
cnf(v_is_defined,hypothesis,
defined(v),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v_is_defined) ).
cnf(compatibility_of_order_relation_and_addition,axiom,
( ~ less_or_equal(X1,X3)
| ~ defined(X2)
| less_or_equal(add(X1,X2),add(X3,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_order_relation_and_addition) ).
cnf(commutativity_addition,axiom,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',commutativity_addition) ).
cnf(less_or_equal_10,negated_conjecture,
less_or_equal(c,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_10) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined) ).
cnf(c_is_defined,hypothesis,
defined(c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_is_defined) ).
cnf(add_equals_u_7,negated_conjecture,
equalish(add(a,c),u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_equals_u_7) ).
cnf(less_or_equal_9,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_9) ).
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_14,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_15,plain,
( ~ equalish(X3,X1)
| ~ less_or_equal(X3,X2)
| less_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[compatibility_of_equality_and_order_relation]) ).
cnf(c_0_16,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_14 ).
cnf(c_0_17,negated_conjecture,
equalish(add(d,b),v),
add_equals_v_8 ).
cnf(c_0_18,plain,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[totality_of_order_relation]) ).
cnf(c_0_19,plain,
( ~ equalish(X3,X1)
| ~ less_or_equal(X3,X2)
| less_or_equal(X1,X2) ),
c_0_15 ).
cnf(c_0_20,negated_conjecture,
equalish(v,add(d,b)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
c_0_18 ).
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,
( ~ less_or_equal(v,X1)
| less_or_equal(add(d,b),X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( ~ defined(X1)
| less_or_equal(X1,X1) ),
inference(ef,[status(thm)],[c_0_21]) ).
cnf(c_0_25,hypothesis,
defined(v),
v_is_defined ).
cnf(c_0_26,plain,
( ~ less_or_equal(X1,X3)
| ~ defined(X2)
| less_or_equal(add(X1,X2),add(X3,X2)) ),
inference(fof_simplification,[status(thm)],[compatibility_of_order_relation_and_addition]) ).
cnf(c_0_27,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_28,plain,
( ~ less_or_equal(X3,X2)
| ~ less_or_equal(X1,X3)
| less_or_equal(X1,X2) ),
c_0_22 ).
cnf(c_0_29,negated_conjecture,
less_or_equal(add(d,b),v),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_30,plain,
( ~ less_or_equal(X1,X3)
| ~ defined(X2)
| less_or_equal(add(X1,X2),add(X3,X2)) ),
c_0_26 ).
cnf(c_0_31,negated_conjecture,
less_or_equal(c,d),
less_or_equal_10 ).
cnf(c_0_32,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
c_0_27 ).
cnf(c_0_33,negated_conjecture,
( ~ less_or_equal(X1,add(d,b))
| less_or_equal(X1,v) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
( ~ defined(X1)
| less_or_equal(add(c,X1),add(d,X1)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_36,plain,
( ~ defined(X2)
| ~ defined(X1)
| ~ less_or_equal(add(X2,X1),X3)
| less_or_equal(add(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
less_or_equal(add(c,b),v),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_38,hypothesis,
defined(c),
c_is_defined ).
cnf(c_0_39,negated_conjecture,
equalish(add(a,c),u),
add_equals_u_7 ).
cnf(c_0_40,negated_conjecture,
less_or_equal(a,b),
less_or_equal_9 ).
cnf(c_0_41,negated_conjecture,
less_or_equal(add(b,c),v),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_35]),c_0_38])]) ).
cnf(c_0_42,negated_conjecture,
( ~ less_or_equal(add(a,c),X1)
| less_or_equal(u,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( ~ defined(X1)
| less_or_equal(add(a,X1),add(b,X1)) ),
inference(spm,[status(thm)],[c_0_30,c_0_40]) ).
cnf(c_0_44,negated_conjecture,
~ less_or_equal(u,v),
inference(fof_simplification,[status(thm)],[not_less_or_equal_11]) ).
cnf(c_0_45,negated_conjecture,
( ~ less_or_equal(X1,add(b,c))
| less_or_equal(X1,v) ),
inference(spm,[status(thm)],[c_0_28,c_0_41]) ).
cnf(c_0_46,negated_conjecture,
less_or_equal(u,add(b,c)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_38])]) ).
cnf(c_0_47,negated_conjecture,
~ less_or_equal(u,v),
c_0_44 ).
cnf(c_0_48,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD061-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n026.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 15:46:37 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.45 Running first-order theorem proving
% 0.14/0.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.20/0.57 % Version: 3.5.1
% 0.20/0.57 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.57 % Starting sh5l with 300s (1) cores
% 0.20/0.57 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 2641627 completed with status 0
% 0.20/0.57 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.20/0.57 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.57 % No SInE strategy applied
% 0.20/0.57 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.20/0.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.20/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.20/0.57 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 0.20/0.57 % Starting new_bool_3 with 269s (1) cores
% 0.20/0.57 % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 0.20/0.57 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 2641632 completed with status 0
% 0.20/0.57 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.20/0.57 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.57 % No SInE strategy applied
% 0.20/0.57 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.20/0.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.20/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.20/0.57 % Preprocessing time : 0.002 s
% 0.20/0.57 % Presaturation interreduction done
% 0.20/0.57
% 0.20/0.57 % Proof found!
% 0.20/0.57 % SZS status Unsatisfiable
% 0.20/0.57 % SZS output start CNFRefutation
% See solution above
% 0.20/0.57 % Parsed axioms : 38
% 0.20/0.57 % Removed by relevancy pruning/SinE : 0
% 0.20/0.57 % Initial clauses : 38
% 0.20/0.57 % Removed in clause preprocessing : 0
% 0.20/0.57 % Initial clauses in saturation : 38
% 0.20/0.57 % Processed clauses : 408
% 0.20/0.57 % ...of these trivial : 38
% 0.20/0.57 % ...subsumed : 11
% 0.20/0.57 % ...remaining for further processing : 359
% 0.20/0.57 % Other redundant clauses eliminated : 0
% 0.20/0.57 % Clauses deleted for lack of memory : 0
% 0.20/0.57 % Backward-subsumed : 0
% 0.20/0.57 % Backward-rewritten : 11
% 0.20/0.57 % Generated clauses : 2210
% 0.20/0.57 % ...of the previous two non-redundant : 1693
% 0.20/0.57 % ...aggressively subsumed : 0
% 0.20/0.57 % Contextual simplify-reflections : 0
% 0.20/0.57 % Paramodulations : 2208
% 0.20/0.57 % Factorizations : 2
% 0.20/0.57 % NegExts : 0
% 0.20/0.57 % Equation resolutions : 0
% 0.20/0.57 % Disequality decompositions : 0
% 0.20/0.57 % Total rewrite steps : 1182
% 0.20/0.57 % ...of those cached : 1044
% 0.20/0.57 % Propositional unsat checks : 0
% 0.20/0.57 % Propositional check models : 0
% 0.20/0.57 % Propositional check unsatisfiable : 0
% 0.20/0.57 % Propositional clauses : 0
% 0.20/0.57 % Propositional clauses after purity: 0
% 0.20/0.57 % Propositional unsat core size : 0
% 0.20/0.57 % Propositional preprocessing time : 0.000
% 0.20/0.57 % Propositional encoding time : 0.000
% 0.20/0.57 % Propositional solver time : 0.000
% 0.20/0.57 % Success case prop preproc time : 0.000
% 0.20/0.57 % Success case prop encoding time : 0.000
% 0.20/0.57 % Success case prop solver time : 0.000
% 0.20/0.57 % Current number of processed clauses : 310
% 0.20/0.57 % Positive orientable unit clauses : 151
% 0.20/0.57 % Positive unorientable unit clauses: 0
% 0.20/0.57 % Negative unit clauses : 2
% 0.20/0.57 % Non-unit-clauses : 157
% 0.20/0.57 % Current number of unprocessed clauses: 1355
% 0.20/0.57 % ...number of literals in the above : 3339
% 0.20/0.57 % Current number of archived formulas : 0
% 0.20/0.57 % Current number of archived clauses : 49
% 0.20/0.57 % Clause-clause subsumption calls (NU) : 2661
% 0.20/0.57 % Rec. Clause-clause subsumption calls : 2257
% 0.20/0.57 % Non-unit clause-clause subsumptions : 11
% 0.20/0.57 % Unit Clause-clause subsumption calls : 207
% 0.20/0.57 % Rewrite failures with RHS unbound : 0
% 0.20/0.57 % BW rewrite match attempts : 11
% 0.20/0.57 % BW rewrite match successes : 11
% 0.20/0.57 % Condensation attempts : 0
% 0.20/0.57 % Condensation successes : 0
% 0.20/0.57 % Termbank termtop insertions : 29100
% 0.20/0.57 % Search garbage collected termcells : 71
% 0.20/0.57
% 0.20/0.57 % -------------------------------------------------
% 0.20/0.57 % User time : 0.063 s
% 0.20/0.57 % System time : 0.009 s
% 0.20/0.57 % Total time : 0.072 s
% 0.20/0.57 % Maximum resident set size: 3404 pages
% 0.20/0.57
% 0.20/0.57 % -------------------------------------------------
% 0.20/0.57 % User time : 0.242 s
% 0.20/0.57 % System time : 0.030 s
% 0.20/0.57 % Total time : 0.272 s
% 0.20/0.57 % Maximum resident set size: 4608 pages
% 0.20/0.57 % E exiting
%------------------------------------------------------------------------------