%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : FLD070-1 : 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 : n007.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:25 PM UTC 2026
% Result : Unsatisfiable 0.17s 0.50s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of clauses : 59 ( 16 unt; 9 nHn; 59 RR)
% Number of literals : 139 ( 0 equ; 74 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 85 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(symmetry_of_equality,axiom,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
cnf(existence_of_identity_addition,axiom,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',existence_of_identity_addition) ).
cnf(totality_of_order_relation,axiom,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',totality_of_order_relation) ).
cnf(transitivity_of_equality,axiom,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',transitivity_of_equality) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
cnf(compatibility_of_equality_and_order_relation,axiom,
( ~ equalish(X3,X1)
| ~ less_or_equal(X3,X2)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation) ).
cnf(antisymmetry_of_order_relation,axiom,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| equalish(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',antisymmetry_of_order_relation) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_identity) ).
cnf(well_definedness_of_addition,axiom,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',well_definedness_of_addition) ).
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/FLD001-0.ax',transitivity_of_order_relation) ).
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/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_order_relation_and_addition) ).
cnf(not_less_or_equal_5,negated_conjecture,
~ less_or_equal(additive_identity,add(a,b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_5) ).
cnf(less_or_equal_4,negated_conjecture,
less_or_equal(additive_identity,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_4) ).
cnf(less_or_equal_3,negated_conjecture,
less_or_equal(additive_identity,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_3) ).
cnf(c_0_14,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_15,plain,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_16,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_17,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_equality]) ).
cnf(c_0_18,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_14 ).
cnf(c_0_19,plain,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
c_0_15 ).
cnf(c_0_20,plain,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
c_0_16 ).
cnf(c_0_21,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_22,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_23,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
c_0_17 ).
cnf(c_0_24,plain,
( ~ defined(X1)
| equalish(X1,add(additive_identity,X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[antisymmetry_of_order_relation]) ).
cnf(c_0_26,hypothesis,
( ~ defined(X1)
| less_or_equal(X1,b)
| less_or_equal(b,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( ~ equalish(X3,X1)
| ~ less_or_equal(X3,X2)
| less_or_equal(X1,X2) ),
c_0_22 ).
cnf(c_0_28,plain,
( ~ equalish(X1,X2)
| ~ defined(X2)
| equalish(X1,add(additive_identity,X2)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| equalish(X1,X2) ),
c_0_25 ).
cnf(c_0_30,hypothesis,
less_or_equal(b,b),
inference(spm,[status(thm)],[c_0_26,c_0_21]) ).
cnf(c_0_31,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_32,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X1,X2)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_addition]) ).
cnf(c_0_33,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_34,plain,
( ~ equalish(X3,X1)
| ~ defined(X1)
| ~ less_or_equal(X3,X2)
| less_or_equal(add(additive_identity,X1),X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,hypothesis,
equalish(b,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_30])]) ).
cnf(c_0_36,plain,
( ~ defined(X1)
| less_or_equal(X1,additive_identity)
| less_or_equal(additive_identity,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_31]) ).
cnf(c_0_37,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X1,X2)) ),
c_0_32 ).
cnf(c_0_38,plain,
( ~ less_or_equal(X3,X2)
| ~ less_or_equal(X1,X3)
| less_or_equal(X1,X2) ),
c_0_33 ).
cnf(c_0_39,hypothesis,
( ~ less_or_equal(b,X1)
| less_or_equal(add(additive_identity,b),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_21])]) ).
cnf(c_0_40,plain,
( ~ defined(X1)
| ~ less_or_equal(add(additive_identity,X1),X2)
| less_or_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_19]) ).
cnf(c_0_41,plain,
( ~ defined(X1)
| ~ defined(X2)
| less_or_equal(additive_identity,add(X1,X2))
| less_or_equal(add(X1,X2),additive_identity) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,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_43,hypothesis,
( ~ less_or_equal(b,X2)
| ~ less_or_equal(X1,add(additive_identity,b))
| less_or_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
( ~ defined(X1)
| less_or_equal(X1,additive_identity)
| less_or_equal(additive_identity,add(additive_identity,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_31])]) ).
cnf(c_0_45,plain,
( ~ less_or_equal(X1,X3)
| ~ defined(X2)
| less_or_equal(add(X1,X2),add(X3,X2)) ),
c_0_42 ).
cnf(c_0_46,negated_conjecture,
~ less_or_equal(additive_identity,add(a,b)),
inference(fof_simplification,[status(thm)],[not_less_or_equal_5]) ).
cnf(c_0_47,hypothesis,
( ~ less_or_equal(b,X1)
| less_or_equal(additive_identity,X1)
| less_or_equal(b,additive_identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_21])]) ).
cnf(c_0_48,plain,
( ~ defined(X1)
| ~ less_or_equal(additive_identity,X2)
| less_or_equal(X1,add(X2,X1)) ),
inference(spm,[status(thm)],[c_0_40,c_0_45]) ).
cnf(c_0_49,negated_conjecture,
less_or_equal(additive_identity,b),
less_or_equal_4 ).
cnf(c_0_50,negated_conjecture,
~ less_or_equal(additive_identity,add(a,b)),
c_0_46 ).
cnf(c_0_51,hypothesis,
( ~ less_or_equal(additive_identity,X1)
| less_or_equal(b,additive_identity)
| less_or_equal(additive_identity,add(X1,b)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_21])]) ).
cnf(c_0_52,negated_conjecture,
less_or_equal(additive_identity,a),
less_or_equal_3 ).
cnf(c_0_53,negated_conjecture,
( ~ less_or_equal(b,additive_identity)
| equalish(b,additive_identity) ),
inference(spm,[status(thm)],[c_0_29,c_0_49]) ).
cnf(c_0_54,negated_conjecture,
less_or_equal(b,additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]) ).
cnf(c_0_55,negated_conjecture,
equalish(b,additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]) ).
cnf(c_0_56,negated_conjecture,
( ~ less_or_equal(b,X1)
| less_or_equal(additive_identity,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_55]) ).
cnf(c_0_57,negated_conjecture,
( ~ less_or_equal(additive_identity,X1)
| less_or_equal(additive_identity,add(X1,b)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_48]),c_0_21])]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_57]),c_0_52])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : FLD070-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.34 % Computer : n007.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.34 % CPULimit : 300
% 0.09/0.34 % WCLimit : 300
% 0.09/0.34 % DateTime : Mon Sep 21 15:42:35 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.42 Running first-order theorem proving
% 0.17/0.42 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.17/0.50 % Version: 3.5.1
% 0.17/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.50 % Starting sh5l with 300s (1) cores
% 0.17/0.50 % new_bool_1 with pid 1453918 completed with status 0
% 0.17/0.50 % Result found by new_bool_1
% 0.17/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.50 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.17/0.50 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.50 % Search class: FGUNF-FFMS22-SFFFFFNN
% 0.17/0.50 % partial match(1): FGUNF-FFMS21-SFFFFFNN
% 0.17/0.50 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.50 % Starting SubtermCWHack with 28s (1) cores
% 0.17/0.50 % SubtermCWHack with pid 1453926 completed with status 0
% 0.17/0.50 % Result found by SubtermCWHack
% 0.17/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.50 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.17/0.50 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.50 % Search class: FGUNF-FFMS22-SFFFFFNN
% 0.17/0.50 % partial match(1): FGUNF-FFMS21-SFFFFFNN
% 0.17/0.50 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.50 % Starting SubtermCWHack with 28s (1) cores
% 0.17/0.50 % Preprocessing time : 0.001 s
% 0.17/0.50
% 0.17/0.50 % Proof found!
% 0.17/0.50 % SZS status Unsatisfiable
% 0.17/0.50 % SZS output start CNFRefutation
% See solution above
% 0.17/0.50 % Parsed axioms : 32
% 0.17/0.50 % Removed by relevancy pruning/SinE : 7
% 0.17/0.50 % Initial clauses : 25
% 0.17/0.50 % Removed in clause preprocessing : 0
% 0.17/0.50 % Initial clauses in saturation : 25
% 0.17/0.50 % Processed clauses : 345
% 0.17/0.50 % ...of these trivial : 5
% 0.17/0.50 % ...subsumed : 120
% 0.17/0.50 % ...remaining for further processing : 220
% 0.17/0.50 % Other redundant clauses eliminated : 0
% 0.17/0.50 % Clauses deleted for lack of memory : 0
% 0.17/0.50 % Backward-subsumed : 9
% 0.17/0.50 % Backward-rewritten : 14
% 0.17/0.50 % Generated clauses : 1755
% 0.17/0.50 % ...of the previous two non-redundant : 1234
% 0.17/0.50 % ...aggressively subsumed : 0
% 0.17/0.50 % Contextual simplify-reflections : 0
% 0.17/0.50 % Paramodulations : 1755
% 0.17/0.50 % Factorizations : 0
% 0.17/0.50 % NegExts : 0
% 0.17/0.50 % Equation resolutions : 0
% 0.17/0.50 % Disequality decompositions : 0
% 0.17/0.50 % Total rewrite steps : 1216
% 0.17/0.50 % ...of those cached : 1186
% 0.17/0.50 % Propositional unsat checks : 0
% 0.17/0.50 % Propositional check models : 0
% 0.17/0.50 % Propositional check unsatisfiable : 0
% 0.17/0.50 % Propositional clauses : 0
% 0.17/0.50 % Propositional clauses after purity: 0
% 0.17/0.50 % Propositional unsat core size : 0
% 0.17/0.50 % Propositional preprocessing time : 0.000
% 0.17/0.50 % Propositional encoding time : 0.000
% 0.17/0.50 % Propositional solver time : 0.000
% 0.17/0.50 % Success case prop preproc time : 0.000
% 0.17/0.50 % Success case prop encoding time : 0.000
% 0.17/0.50 % Success case prop solver time : 0.000
% 0.17/0.50 % Current number of processed clauses : 197
% 0.17/0.50 % Positive orientable unit clauses : 33
% 0.17/0.50 % Positive unorientable unit clauses: 0
% 0.17/0.50 % Negative unit clauses : 1
% 0.17/0.50 % Non-unit-clauses : 163
% 0.17/0.50 % Current number of unprocessed clauses: 908
% 0.17/0.50 % ...number of literals in the above : 3177
% 0.17/0.50 % Current number of archived formulas : 0
% 0.17/0.50 % Current number of archived clauses : 23
% 0.17/0.50 % Clause-clause subsumption calls (NU) : 1977
% 0.17/0.50 % Rec. Clause-clause subsumption calls : 1872
% 0.17/0.50 % Non-unit clause-clause subsumptions : 125
% 0.17/0.50 % Unit Clause-clause subsumption calls : 46
% 0.17/0.50 % Rewrite failures with RHS unbound : 0
% 0.17/0.50 % BW rewrite match attempts : 4
% 0.17/0.50 % BW rewrite match successes : 4
% 0.17/0.50 % Condensation attempts : 0
% 0.17/0.50 % Condensation successes : 0
% 0.17/0.50 % Termbank termtop insertions : 22108
% 0.17/0.50 % Search garbage collected termcells : 93
% 0.17/0.50
% 0.17/0.50 % -------------------------------------------------
% 0.17/0.50 % User time : 0.030 s
% 0.17/0.50 % System time : 0.001 s
% 0.17/0.50 % Total time : 0.030 s
% 0.17/0.50 % Maximum resident set size: 3660 pages
% 0.17/0.50
% 0.17/0.50 % -------------------------------------------------
% 0.17/0.50 % User time : 0.033 s
% 0.17/0.50 % System time : 0.007 s
% 0.17/0.50 % Total time : 0.040 s
% 0.17/0.50 % Maximum resident set size: 4608 pages
% 0.17/0.50 % E exiting
%------------------------------------------------------------------------------