%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : FLD003-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 : n015.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:05 PM UTC 2026
% Result : Unsatisfiable 34.28s 4.80s
% Output : CNFRefutation 34.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 45 ( 11 unt; 0 nHn; 45 RR)
% Number of literals : 100 ( 0 equ; 61 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 62 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
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(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(compatibility_of_equality_and_addition,axiom,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(add(X1,X2),add(X3,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_addition) ).
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_inverse_addition,axiom,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/FLD001-0.ax',commutativity_addition) ).
cnf(add_not_equal_to_a_3,negated_conjecture,
~ equalish(add(a,add(b,additive_inverse(b))),a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',add_not_equal_to_a_3) ).
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(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(well_definedness_of_additive_inverse,axiom,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_inverse) ).
cnf(c_0_11,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_equality]) ).
cnf(c_0_12,plain,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_13,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
c_0_11 ).
cnf(c_0_14,plain,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
c_0_12 ).
cnf(c_0_15,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(add(X1,X2),add(X3,X2)) ),
inference(fof_simplification,[status(thm)],[compatibility_of_equality_and_addition]) ).
cnf(c_0_16,plain,
( ~ equalish(X1,add(additive_identity,X2))
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(add(X1,X2),add(X3,X2)) ),
c_0_15 ).
cnf(c_0_18,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_19,plain,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).
cnf(c_0_20,plain,
( ~ equalish(X1,additive_identity)
| ~ defined(X2)
| equalish(add(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_22,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_18 ).
cnf(c_0_23,plain,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
c_0_19 ).
cnf(c_0_24,negated_conjecture,
~ equalish(add(a,add(b,additive_inverse(b))),a),
inference(fof_simplification,[status(thm)],[add_not_equal_to_a_3]) ).
cnf(c_0_25,plain,
( ~ equalish(X3,additive_identity)
| ~ equalish(X1,add(X3,X2))
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
cnf(c_0_26,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
c_0_21 ).
cnf(c_0_27,plain,
( ~ defined(X1)
| equalish(additive_identity,add(X1,additive_inverse(X1))) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
( ~ equalish(X1,add(X2,additive_inverse(X2)))
| ~ defined(X2)
| equalish(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_13,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
~ equalish(add(a,add(b,additive_inverse(b))),a),
c_0_24 ).
cnf(c_0_30,plain,
( ~ equalish(X2,additive_identity)
| ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_32,plain,
( ~ equalish(X1,additive_identity)
| ~ defined(X2)
| equalish(X1,add(X2,additive_inverse(X2))) ),
inference(spm,[status(thm)],[c_0_13,c_0_27]) ).
cnf(c_0_33,plain,
( ~ defined(X1)
| equalish(additive_identity,additive_identity) ),
inference(spm,[status(thm)],[c_0_28,c_0_27]) ).
cnf(c_0_34,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_35,negated_conjecture,
( ~ equalish(add(b,additive_inverse(b)),additive_identity)
| ~ defined(add(b,additive_inverse(b))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_36,plain,
( ~ equalish(X2,additive_identity)
| ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_32]) ).
cnf(c_0_37,hypothesis,
equalish(additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X1,X2)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_addition]) ).
cnf(c_0_39,negated_conjecture,
~ defined(add(b,additive_inverse(b))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_34]),c_0_37])]) ).
cnf(c_0_40,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X1,X2)) ),
c_0_38 ).
cnf(c_0_41,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_additive_inverse]) ).
cnf(c_0_42,negated_conjecture,
~ defined(additive_inverse(b)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_34])]) ).
cnf(c_0_43,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
c_0_41 ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD003-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.35 % Computer : n015.cluster.edu
% 0.11/0.35 % Model : x86_64 x86_64
% 0.11/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35 % Memory : 8046.5625MB
% 0.11/0.35 % OS : Linux 6.8.0-71-generic
% 0.11/0.35 % CPULimit : 300
% 0.11/0.35 % WCLimit : 300
% 0.11/0.35 % DateTime : Mon Sep 21 15:39:36 UTC 2026
% 0.11/0.35 % CPUTime :
% 0.11/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 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
% 34.28/4.80 % Version: 3.5.1
% 34.28/4.80 % Preprocessing class: FSMSSMSSSSSNFFN.
% 34.28/4.80 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 34.28/4.80 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 34.28/4.80 % Starting new_bool_3 with 300s (1) cores
% 34.28/4.80 % Starting new_bool_1 with 300s (1) cores
% 34.28/4.80 % Starting sh5l with 300s (1) cores
% 34.28/4.80 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1808814 completed with status 0
% 34.28/4.80 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 34.28/4.80 % Preprocessing class: FSMSSMSSSSSNFFN.
% 34.28/4.80 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 34.28/4.80 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 34.28/4.80 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 34.28/4.80 % No SInE strategy applied
% 34.28/4.80 % Search class: FGUNF-FFMS21-MFFFFFNN
% 34.28/4.80 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 34.28/4.80 % Starting SubtermCWHack with 136s (1) cores
% 34.28/4.80 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 34.28/4.80 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 254s (1) cores
% 34.28/4.80 % Starting new_bool_3 with 254s (1) cores
% 34.28/4.80 % Starting new_bool_1 with 254s (1) cores
% 34.28/4.80 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 1808820 completed with status 0
% 34.28/4.80 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 34.28/4.80 % Preprocessing class: FSMSSMSSSSSNFFN.
% 34.28/4.80 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 34.28/4.80 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 34.28/4.80 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 34.28/4.80 % No SInE strategy applied
% 34.28/4.80 % Search class: FGUNF-FFMS21-MFFFFFNN
% 34.28/4.80 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 34.28/4.80 % Starting SubtermCWHack with 136s (1) cores
% 34.28/4.80 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 34.28/4.80 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 254s (1) cores
% 34.28/4.80 % Preprocessing time : 0.002 s
% 34.28/4.80 % Presaturation interreduction done
% 34.28/4.80
% 34.28/4.80 % Proof found!
% 34.28/4.80 % SZS status Unsatisfiable
% 34.28/4.80 % SZS output start CNFRefutation
% See solution above
% 34.28/4.80 % Parsed axioms : 30
% 34.28/4.80 % Removed by relevancy pruning/SinE : 0
% 34.28/4.80 % Initial clauses : 30
% 34.28/4.80 % Removed in clause preprocessing : 0
% 34.28/4.80 % Initial clauses in saturation : 30
% 34.28/4.80 % Processed clauses : 13733
% 34.28/4.80 % ...of these trivial : 44
% 34.28/4.80 % ...subsumed : 11007
% 34.28/4.80 % ...remaining for further processing : 2682
% 34.28/4.80 % Other redundant clauses eliminated : 0
% 34.28/4.80 % Clauses deleted for lack of memory : 0
% 34.28/4.80 % Backward-subsumed : 297
% 34.28/4.80 % Backward-rewritten : 7
% 34.28/4.80 % Generated clauses : 123361
% 34.28/4.80 % ...of the previous two non-redundant : 113421
% 34.28/4.80 % ...aggressively subsumed : 0
% 34.28/4.80 % Contextual simplify-reflections : 88
% 34.28/4.80 % Paramodulations : 123361
% 34.28/4.80 % Factorizations : 0
% 34.28/4.80 % NegExts : 0
% 34.28/4.80 % Equation resolutions : 0
% 34.28/4.80 % Disequality decompositions : 0
% 34.28/4.80 % Total rewrite steps : 55938
% 34.28/4.80 % ...of those cached : 55855
% 34.28/4.80 % Propositional unsat checks : 0
% 34.28/4.80 % Propositional check models : 0
% 34.28/4.80 % Propositional check unsatisfiable : 0
% 34.28/4.80 % Propositional clauses : 0
% 34.28/4.80 % Propositional clauses after purity: 0
% 34.28/4.80 % Propositional unsat core size : 0
% 34.28/4.80 % Propositional preprocessing time : 0.000
% 34.28/4.80 % Propositional encoding time : 0.000
% 34.28/4.80 % Propositional solver time : 0.000
% 34.28/4.80 % Success case prop preproc time : 0.000
% 34.28/4.80 % Success case prop encoding time : 0.000
% 34.28/4.80 % Success case prop solver time : 0.000
% 34.28/4.80 % Current number of processed clauses : 2348
% 34.28/4.80 % Positive orientable unit clauses : 87
% 34.28/4.80 % Positive unorientable unit clauses: 0
% 34.28/4.80 % Negative unit clauses : 5
% 34.28/4.80 % Non-unit-clauses : 2256
% 34.28/4.80 % Current number of unprocessed clauses: 99539
% 34.28/4.80 % ...number of literals in the above : 474743
% 34.28/4.80 % Current number of archived formulas : 0
% 34.28/4.80 % Current number of archived clauses : 334
% 34.28/4.80 % Clause-clause subsumption calls (NU) : 502212
% 34.28/4.80 % Rec. Clause-clause subsumption calls : 299652
% 34.28/4.80 % Non-unit clause-clause subsumptions : 10698
% 34.28/4.80 % Unit Clause-clause subsumption calls : 6791
% 34.28/4.80 % Rewrite failures with RHS unbound : 0
% 34.28/4.80 % BW rewrite match attempts : 59
% 34.28/4.80 % BW rewrite match successes : 19
% 34.28/4.80 % Condensation attempts : 0
% 34.28/4.80 % Condensation successes : 0
% 34.28/4.80 % Termbank termtop insertions : 2002633
% 34.28/4.80 % Search garbage collected termcells : 71
% 34.28/4.80
% 34.28/4.80 % -------------------------------------------------
% 34.28/4.80 % User time : 4.121 s
% 34.28/4.80 % System time : 0.133 s
% 34.28/4.80 % Total time : 4.255 s
% 34.28/4.80 % Maximum resident set size: 3660 pages
% 34.28/4.80
% 34.28/4.80 % -------------------------------------------------
% 34.28/4.80 % User time : 20.285 s
% 34.28/4.80 % System time : 0.718 s
% 34.28/4.80 % Total time : 21.004 s
% 34.28/4.80 % Maximum resident set size: 4864 pages
% 34.28/4.80 % E exiting
%------------------------------------------------------------------------------