%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD065-1 : 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 : n008.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:56 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.44s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of clauses : 57 ( 17 unt; 4 nHn; 57 RR)
% Number of literals : 124 ( 0 equ; 66 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 74 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(transitivity_of_equality,axiom,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',transitivity_of_equality) ).
cnf(existence_of_inverse_addition,axiom,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_inverse_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(well_definedness_of_additive_inverse,axiom,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_inverse) ).
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(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(symmetry_of_equality,axiom,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/FLD001-0.ax',totality_of_order_relation) ).
cnf(antisymmetry_of_order_relation,axiom,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',antisymmetry_of_order_relation) ).
cnf(less_or_equal_2,negated_conjecture,
less_or_equal(additive_inverse(a),additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_2) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
cnf(not_less_or_equal_3,negated_conjecture,
~ less_or_equal(additive_identity,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_3) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_identity) ).
cnf(c_0_14,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_equality]) ).
cnf(c_0_15,plain,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).
cnf(c_0_16,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
c_0_14 ).
cnf(c_0_17,plain,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
c_0_15 ).
cnf(c_0_18,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_19,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_additive_inverse]) ).
cnf(c_0_20,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_21,plain,
( ~ equalish(X1,add(X2,additive_inverse(X2)))
| ~ defined(X2)
| equalish(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
c_0_18 ).
cnf(c_0_23,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
c_0_19 ).
cnf(c_0_24,plain,
( ~ equalish(X3,X1)
| ~ less_or_equal(X3,X2)
| less_or_equal(X1,X2) ),
c_0_20 ).
cnf(c_0_25,plain,
( ~ defined(X1)
| equalish(add(additive_inverse(X1),X1),additive_identity) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
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)
| ~ less_or_equal(add(additive_inverse(X2),X2),X1)
| less_or_equal(additive_identity,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
( ~ less_or_equal(X1,X3)
| ~ defined(X2)
| less_or_equal(add(X1,X2),add(X3,X2)) ),
c_0_26 ).
cnf(c_0_29,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_30,plain,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_31,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_32,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_33,plain,
( ~ defined(X2)
| ~ less_or_equal(additive_inverse(X2),X1)
| less_or_equal(additive_identity,add(X1,X2)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,negated_conjecture,
less_or_equal(additive_inverse(a),additive_identity),
less_or_equal_2 ).
cnf(c_0_35,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_36,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_29 ).
cnf(c_0_37,plain,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
c_0_30 ).
cnf(c_0_38,plain,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
c_0_31 ).
cnf(c_0_39,negated_conjecture,
~ less_or_equal(additive_identity,a),
inference(fof_simplification,[status(thm)],[not_less_or_equal_3]) ).
cnf(c_0_40,plain,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| equalish(X1,X2) ),
c_0_32 ).
cnf(c_0_41,negated_conjecture,
less_or_equal(additive_identity,add(additive_identity,a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_42,plain,
( ~ defined(X1)
| equalish(X1,add(additive_identity,X1)) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,hypothesis,
( ~ defined(X1)
| less_or_equal(X1,a)
| less_or_equal(a,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_35]) ).
cnf(c_0_44,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_45,negated_conjecture,
~ less_or_equal(additive_identity,a),
c_0_39 ).
cnf(c_0_46,negated_conjecture,
( ~ less_or_equal(add(additive_identity,a),additive_identity)
| equalish(add(additive_identity,a),additive_identity) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,plain,
( ~ defined(X1)
| ~ less_or_equal(X1,X2)
| less_or_equal(add(additive_identity,X1),X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_42]) ).
cnf(c_0_48,hypothesis,
less_or_equal(a,additive_identity),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_49,negated_conjecture,
equalish(add(additive_identity,a),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_35])]) ).
cnf(c_0_50,plain,
( ~ equalish(X1,add(additive_identity,X2))
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_37]) ).
cnf(c_0_51,negated_conjecture,
equalish(additive_identity,add(additive_identity,a)),
inference(spm,[status(thm)],[c_0_36,c_0_49]) ).
cnf(c_0_52,negated_conjecture,
equalish(additive_identity,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_35])]) ).
cnf(c_0_53,negated_conjecture,
equalish(a,additive_identity),
inference(spm,[status(thm)],[c_0_36,c_0_52]) ).
cnf(c_0_54,negated_conjecture,
( ~ less_or_equal(a,X1)
| less_or_equal(additive_identity,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_53]) ).
cnf(c_0_55,hypothesis,
less_or_equal(a,a),
inference(spm,[status(thm)],[c_0_43,c_0_35]) ).
cnf(c_0_56,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD065-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n008.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 15:44:39 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 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.12/0.44 % Version: 3.5.1
% 0.12/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.44 % Starting sh5l with 300s (1) cores
% 0.12/0.44 % sh5l with pid 1333845 completed with status 0
% 0.12/0.44 % Result found by sh5l
% 0.12/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.44 % Starting sh5l with 300s (1) cores
% 0.12/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.12/0.44 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.12/0.44 % Search class: FGUNF-FFMS21-SFFFFFNN
% 0.12/0.44 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.44 % Starting SubtermCWHack with 28s (1) cores
% 0.12/0.44 % SubtermCWHack with pid 1333850 completed with status 0
% 0.12/0.44 % Result found by SubtermCWHack
% 0.12/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.44 % Starting sh5l with 300s (1) cores
% 0.12/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.12/0.44 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.12/0.44 % Search class: FGUNF-FFMS21-SFFFFFNN
% 0.12/0.44 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.44 % Starting SubtermCWHack with 28s (1) cores
% 0.12/0.44 % Preprocessing time : 0.001 s
% 0.12/0.44
% 0.12/0.44 % Proof found!
% 0.12/0.44 % SZS status Unsatisfiable
% 0.12/0.44 % SZS output start CNFRefutation
% See solution above
% 0.12/0.44 % Parsed axioms : 30
% 0.12/0.44 % Removed by relevancy pruning/SinE : 0
% 0.12/0.44 % Initial clauses : 30
% 0.12/0.44 % Removed in clause preprocessing : 0
% 0.12/0.44 % Initial clauses in saturation : 30
% 0.12/0.44 % Processed clauses : 250
% 0.12/0.44 % ...of these trivial : 0
% 0.12/0.44 % ...subsumed : 83
% 0.12/0.44 % ...remaining for further processing : 167
% 0.12/0.44 % Other redundant clauses eliminated : 0
% 0.12/0.44 % Clauses deleted for lack of memory : 0
% 0.12/0.44 % Backward-subsumed : 0
% 0.12/0.44 % Backward-rewritten : 1
% 0.12/0.44 % Generated clauses : 763
% 0.12/0.44 % ...of the previous two non-redundant : 657
% 0.12/0.44 % ...aggressively subsumed : 0
% 0.12/0.44 % Contextual simplify-reflections : 1
% 0.12/0.44 % Paramodulations : 763
% 0.12/0.44 % Factorizations : 0
% 0.12/0.44 % NegExts : 0
% 0.12/0.44 % Equation resolutions : 0
% 0.12/0.44 % Disequality decompositions : 0
% 0.12/0.44 % Total rewrite steps : 152
% 0.12/0.44 % ...of those cached : 135
% 0.12/0.44 % Propositional unsat checks : 0
% 0.12/0.44 % Propositional check models : 0
% 0.12/0.44 % Propositional check unsatisfiable : 0
% 0.12/0.44 % Propositional clauses : 0
% 0.12/0.44 % Propositional clauses after purity: 0
% 0.12/0.44 % Propositional unsat core size : 0
% 0.12/0.44 % Propositional preprocessing time : 0.000
% 0.12/0.44 % Propositional encoding time : 0.000
% 0.12/0.44 % Propositional solver time : 0.000
% 0.12/0.44 % Success case prop preproc time : 0.000
% 0.12/0.44 % Success case prop encoding time : 0.000
% 0.12/0.44 % Success case prop solver time : 0.000
% 0.12/0.44 % Current number of processed clauses : 166
% 0.12/0.44 % Positive orientable unit clauses : 22
% 0.12/0.44 % Positive unorientable unit clauses: 0
% 0.12/0.44 % Negative unit clauses : 2
% 0.12/0.44 % Non-unit-clauses : 142
% 0.12/0.44 % Current number of unprocessed clauses: 433
% 0.12/0.44 % ...number of literals in the above : 1621
% 0.12/0.44 % Current number of archived formulas : 0
% 0.12/0.44 % Current number of archived clauses : 1
% 0.12/0.44 % Clause-clause subsumption calls (NU) : 1898
% 0.12/0.44 % Rec. Clause-clause subsumption calls : 1751
% 0.12/0.44 % Non-unit clause-clause subsumptions : 79
% 0.12/0.44 % Unit Clause-clause subsumption calls : 157
% 0.12/0.44 % Rewrite failures with RHS unbound : 0
% 0.12/0.44 % BW rewrite match attempts : 1
% 0.12/0.44 % BW rewrite match successes : 1
% 0.12/0.44 % Condensation attempts : 0
% 0.12/0.44 % Condensation successes : 0
% 0.12/0.44 % Termbank termtop insertions : 10682
% 0.12/0.44 % Search garbage collected termcells : 71
% 0.12/0.44
% 0.12/0.44 % -------------------------------------------------
% 0.12/0.44 % User time : 0.012 s
% 0.12/0.44 % System time : 0.002 s
% 0.12/0.44 % Total time : 0.015 s
% 0.12/0.44 % Maximum resident set size: 3660 pages
% 0.12/0.44
% 0.12/0.44 % -------------------------------------------------
% 0.12/0.44 % User time : 0.012 s
% 0.12/0.44 % System time : 0.006 s
% 0.12/0.44 % Total time : 0.019 s
% 0.12/0.44 % Maximum resident set size: 4864 pages
% 0.12/0.44 % E exiting
%------------------------------------------------------------------------------