%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : FLD020-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 : n006.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:10 PM UTC 2026
% Result : Unsatisfiable 10.22s 6.75s
% Output : CNFRefutation 10.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 13
% Syntax : Number of clauses : 59 ( 15 unt; 0 nHn; 59 RR)
% Number of literals : 129 ( 0 equ; 73 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 : 75 ( 0 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_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(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(add_equals_a_3,negated_conjecture,
equalish(add(m,a),a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',add_equals_a_3) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
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(associativity_addition,axiom,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',associativity_addition) ).
cnf(m_is_defined,hypothesis,
defined(m),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m_is_defined) ).
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(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(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(m_not_equal_to_additive_identity_4,negated_conjecture,
~ equalish(m,additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m_not_equal_to_additive_identity_4) ).
cnf(c_0_13,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_equality]) ).
cnf(c_0_14,plain,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).
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(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
c_0_13 ).
cnf(c_0_17,plain,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
c_0_14 ).
cnf(c_0_18,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(add(X1,X2),add(X3,X2)) ),
c_0_15 ).
cnf(c_0_19,negated_conjecture,
equalish(add(m,a),a),
add_equals_a_3 ).
cnf(c_0_20,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_21,negated_conjecture,
( ~ defined(X1)
| equalish(add(add(m,a),X1),add(a,X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_23,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_additive_inverse]) ).
cnf(c_0_24,negated_conjecture,
( ~ defined(additive_inverse(a))
| equalish(add(add(m,a),additive_inverse(a)),additive_identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_25,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
c_0_23 ).
cnf(c_0_26,negated_conjecture,
equalish(add(add(m,a),additive_inverse(a)),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_22])]) ).
cnf(c_0_27,plain,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3)) ),
inference(fof_simplification,[status(thm)],[associativity_addition]) ).
cnf(c_0_28,negated_conjecture,
( ~ equalish(X1,add(add(m,a),additive_inverse(a)))
| equalish(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_16,c_0_26]) ).
cnf(c_0_29,plain,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3)) ),
c_0_27 ).
cnf(c_0_30,hypothesis,
defined(m),
m_is_defined ).
cnf(c_0_31,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_32,negated_conjecture,
( ~ defined(additive_inverse(a))
| equalish(add(m,add(a,additive_inverse(a))),additive_identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_22]),c_0_30])]) ).
cnf(c_0_33,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
c_0_31 ).
cnf(c_0_34,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X1,X2)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_addition]) ).
cnf(c_0_35,negated_conjecture,
equalish(add(m,add(a,additive_inverse(a))),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_25]),c_0_22])]) ).
cnf(c_0_36,plain,
( ~ equalish(X1,add(X3,X2))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,add(X2,X3)) ),
inference(spm,[status(thm)],[c_0_16,c_0_33]) ).
cnf(c_0_37,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X1,X2)) ),
c_0_34 ).
cnf(c_0_38,negated_conjecture,
( ~ equalish(X1,add(m,add(a,additive_inverse(a))))
| equalish(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_16,c_0_35]) ).
cnf(c_0_39,plain,
( ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3)
| equalish(add(X1,add(X2,X3)),add(X3,add(X1,X2))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_29]),c_0_37]) ).
cnf(c_0_40,negated_conjecture,
( ~ defined(additive_inverse(a))
| equalish(add(a,add(additive_inverse(a),m)),additive_identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_30]),c_0_22])]) ).
cnf(c_0_41,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_42,negated_conjecture,
equalish(add(a,add(additive_inverse(a),m)),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_25]),c_0_22])]) ).
cnf(c_0_43,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_41 ).
cnf(c_0_44,negated_conjecture,
( ~ equalish(X1,add(a,add(additive_inverse(a),m)))
| equalish(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_16,c_0_42]) ).
cnf(c_0_45,plain,
( ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3)
| equalish(add(add(X1,X2),X3),add(X1,add(X2,X3))) ),
inference(spm,[status(thm)],[c_0_43,c_0_29]) ).
cnf(c_0_46,negated_conjecture,
( ~ defined(additive_inverse(a))
| equalish(add(add(a,additive_inverse(a)),m),additive_identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_30]),c_0_22])]) ).
cnf(c_0_47,negated_conjecture,
equalish(add(add(a,additive_inverse(a)),m),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_25]),c_0_22])]) ).
cnf(c_0_48,plain,
( ~ defined(X1)
| equalish(additive_identity,add(X1,additive_inverse(X1))) ),
inference(spm,[status(thm)],[c_0_43,c_0_17]) ).
cnf(c_0_49,negated_conjecture,
( ~ equalish(X1,add(add(a,additive_inverse(a)),m))
| equalish(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_16,c_0_47]) ).
cnf(c_0_50,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(additive_identity,X1),add(add(X2,additive_inverse(X2)),X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_48]) ).
cnf(c_0_51,plain,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_52,negated_conjecture,
equalish(add(additive_identity,m),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_30]),c_0_22])]) ).
cnf(c_0_53,plain,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
c_0_51 ).
cnf(c_0_54,negated_conjecture,
~ equalish(m,additive_identity),
inference(fof_simplification,[status(thm)],[m_not_equal_to_additive_identity_4]) ).
cnf(c_0_55,negated_conjecture,
( ~ equalish(X1,add(additive_identity,m))
| equalish(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_16,c_0_52]) ).
cnf(c_0_56,plain,
( ~ defined(X1)
| equalish(X1,add(additive_identity,X1)) ),
inference(spm,[status(thm)],[c_0_43,c_0_53]) ).
cnf(c_0_57,negated_conjecture,
~ equalish(m,additive_identity),
c_0_54 ).
cnf(c_0_58,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_30])]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : FLD020-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.12/5.38 % Computer : n006.cluster.edu
% 0.12/5.38 % Model : x86_64 x86_64
% 0.12/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.38 % Memory : 8046.5625MB
% 0.12/5.38 % OS : Linux 6.8.0-71-generic
% 0.12/5.38 % CPULimit : 300
% 0.12/5.38 % WCLimit : 300
% 0.12/5.38 % DateTime : Mon Sep 21 15:37:47 UTC 2026
% 0.12/5.38 % CPUTime :
% 0.12/5.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.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
% 10.22/6.75 % Version: 3.5.1
% 10.22/6.75 % Preprocessing class: FSMSSMSSSSSNFFN.
% 10.22/6.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.22/6.75 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.22/6.75 % Starting new_bool_3 with 300s (1) cores
% 10.22/6.75 % Starting new_bool_1 with 300s (1) cores
% 10.22/6.75 % Starting sh5l with 300s (1) cores
% 10.22/6.75 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3176934 completed with status 0
% 10.22/6.75 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 10.22/6.75 % Preprocessing class: FSMSSMSSSSSNFFN.
% 10.22/6.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.22/6.75 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.22/6.75 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 10.22/6.75 % No SInE strategy applied
% 10.22/6.75 % Search class: FGUNF-FFMS21-SFFFFFNN
% 10.22/6.75 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 10.22/6.75 % Starting SubtermCWHack with 136s (1) cores
% 10.22/6.75 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 10.22/6.75 % Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 10.22/6.75 % Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 10.22/6.75 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 10.22/6.75 % G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 3176940 completed with status 0
% 10.22/6.75 % Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 10.22/6.75 % Preprocessing class: FSMSSMSSSSSNFFN.
% 10.22/6.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.22/6.75 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.22/6.75 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 10.22/6.75 % No SInE strategy applied
% 10.22/6.75 % Search class: FGUNF-FFMS21-SFFFFFNN
% 10.22/6.75 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 10.22/6.75 % Starting SubtermCWHack with 136s (1) cores
% 10.22/6.75 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 10.22/6.75 % Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 10.22/6.75 % Preprocessing time : 0.001 s
% 10.22/6.75 % Presaturation interreduction done
% 10.22/6.75
% 10.22/6.75 % Proof found!
% 10.22/6.75 % SZS status Unsatisfiable
% 10.22/6.75 % SZS output start CNFRefutation
% See solution above
% 10.22/6.75 % Parsed axioms : 31
% 10.22/6.75 % Removed by relevancy pruning/SinE : 0
% 10.22/6.75 % Initial clauses : 31
% 10.22/6.75 % Removed in clause preprocessing : 0
% 10.22/6.75 % Initial clauses in saturation : 31
% 10.22/6.75 % Processed clauses : 12671
% 10.22/6.75 % ...of these trivial : 4469
% 10.22/6.75 % ...subsumed : 1650
% 10.22/6.75 % ...remaining for further processing : 6552
% 10.22/6.75 % Other redundant clauses eliminated : 0
% 10.22/6.75 % Clauses deleted for lack of memory : 0
% 10.22/6.75 % Backward-subsumed : 44
% 10.22/6.75 % Backward-rewritten : 223
% 10.22/6.75 % Generated clauses : 171467
% 10.22/6.75 % ...of the previous two non-redundant : 132774
% 10.22/6.75 % ...aggressively subsumed : 0
% 10.22/6.75 % Contextual simplify-reflections : 90
% 10.22/6.75 % Paramodulations : 171449
% 10.22/6.75 % Factorizations : 18
% 10.22/6.75 % NegExts : 0
% 10.22/6.75 % Equation resolutions : 0
% 10.22/6.75 % Disequality decompositions : 0
% 10.22/6.75 % Total rewrite steps : 93886
% 10.22/6.75 % ...of those cached : 91420
% 10.22/6.75 % Propositional unsat checks : 0
% 10.22/6.75 % Propositional check models : 0
% 10.22/6.75 % Propositional check unsatisfiable : 0
% 10.22/6.75 % Propositional clauses : 0
% 10.22/6.75 % Propositional clauses after purity: 0
% 10.22/6.75 % Propositional unsat core size : 0
% 10.22/6.75 % Propositional preprocessing time : 0.000
% 10.22/6.75 % Propositional encoding time : 0.000
% 10.22/6.75 % Propositional solver time : 0.000
% 10.22/6.75 % Success case prop preproc time : 0.000
% 10.22/6.75 % Success case prop encoding time : 0.000
% 10.22/6.75 % Success case prop solver time : 0.000
% 10.22/6.75 % Current number of processed clauses : 6254
% 10.22/6.75 % Positive orientable unit clauses : 3043
% 10.22/6.75 % Positive unorientable unit clauses: 0
% 10.22/6.75 % Negative unit clauses : 2
% 10.22/6.75 % Non-unit-clauses : 3209
% 10.22/6.75 % Current number of unprocessed clauses: 120090
% 10.22/6.75 % ...number of literals in the above : 270134
% 10.22/6.75 % Current number of archived formulas : 0
% 10.22/6.75 % Current number of archived clauses : 298
% 10.22/6.75 % Clause-clause subsumption calls (NU) : 386938
% 10.22/6.75 % Rec. Clause-clause subsumption calls : 332242
% 10.22/6.75 % Non-unit clause-clause subsumptions : 1783
% 10.22/6.75 % Unit Clause-clause subsumption calls : 34910
% 10.22/6.75 % Rewrite failures with RHS unbound : 0
% 10.22/6.75 % BW rewrite match attempts : 46917
% 10.22/6.75 % BW rewrite match successes : 218
% 10.22/6.75 % Condensation attempts : 0
% 10.22/6.75 % Condensation successes : 0
% 10.22/6.75 % Termbank termtop insertions : 2700989
% 10.22/6.75 % Search garbage collected termcells : 71
% 10.22/6.75
% 10.22/6.75 % -------------------------------------------------
% 10.22/6.75 % User time : 1.207 s
% 10.22/6.75 % System time : 0.076 s
% 10.22/6.75 % Total time : 1.283 s
% 10.22/6.75 % Maximum resident set size: 3644 pages
% 10.22/6.75
% 10.22/6.75 % -------------------------------------------------
% 10.22/6.75 % User time : 6.206 s
% 10.22/6.75 % System time : 0.255 s
% 10.22/6.75 % Total time : 6.460 s
% 10.22/6.75 % Maximum resident set size: 4864 pages
% 10.22/6.75 % E exiting
%------------------------------------------------------------------------------