%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD005-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 : n010.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:37 PM UTC 2026
% Result : Unsatisfiable 10.89s 1.89s
% Output : CNFRefutation 10.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 32 ( 9 unt; 0 nHn; 32 RR)
% Number of literals : 74 ( 0 equ; 47 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 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 : 50 ( 3 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_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(compatibility_of_equality_and_addition,axiom,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(add(X1,X2),add(X3,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_addition) ).
cnf(associativity_addition,axiom,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',associativity_addition) ).
cnf(add_not_equal_to_b_3,negated_conjecture,
~ equalish(add(a,X1),b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_not_equal_to_b_3) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
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(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(c_0_9,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_equality]) ).
cnf(c_0_10,plain,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_11,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
c_0_9 ).
cnf(c_0_12,plain,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
c_0_10 ).
cnf(c_0_13,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_14,plain,
( ~ equalish(X1,add(additive_identity,X2))
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(add(X1,X2),add(X3,X2)) ),
c_0_13 ).
cnf(c_0_16,plain,
( ~ equalish(X1,additive_identity)
| ~ defined(X2)
| equalish(add(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,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_18,negated_conjecture,
~ equalish(add(a,X1),b),
inference(fof_simplification,[status(thm)],[add_not_equal_to_b_3]) ).
cnf(c_0_19,plain,
( ~ equalish(X3,additive_identity)
| ~ equalish(X1,add(X3,X2))
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_20,plain,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3)) ),
c_0_17 ).
cnf(c_0_21,negated_conjecture,
~ equalish(add(a,X1),b),
c_0_18 ).
cnf(c_0_22,plain,
( ~ equalish(add(X1,X2),additive_identity)
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3)
| equalish(add(X1,add(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_24,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_25,plain,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).
cnf(c_0_26,negated_conjecture,
( ~ equalish(add(a,X1),additive_identity)
| ~ defined(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_27,plain,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
c_0_25 ).
cnf(c_0_28,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_additive_inverse]) ).
cnf(c_0_29,negated_conjecture,
~ defined(additive_inverse(a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_24])]) ).
cnf(c_0_30,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
c_0_28 ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD005-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.13/0.38 % Computer : n010.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon Sep 21 15:36:40 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/0.43 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
% 10.89/1.89 % Version: 3.5.1
% 10.89/1.89 % Preprocessing class: FSMSSMSSSSSNFFN.
% 10.89/1.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.89/1.89 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.89/1.89 % Starting new_bool_3 with 300s (1) cores
% 10.89/1.89 % Starting new_bool_1 with 300s (1) cores
% 10.89/1.89 % Starting sh5l with 300s (1) cores
% 10.89/1.89 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1196038 completed with status 0
% 10.89/1.89 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 10.89/1.89 % Preprocessing class: FSMSSMSSSSSNFFN.
% 10.89/1.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.89/1.89 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.89/1.89 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 10.89/1.89 % No SInE strategy applied
% 10.89/1.89 % Search class: FGUNF-FFMS21-SFFFFFNN
% 10.89/1.89 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 10.89/1.89 % Starting SubtermCWHack with 136s (1) cores
% 10.89/1.89 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 10.89/1.89 % Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 10.89/1.89 % Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 10.89/1.89 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 10.89/1.89 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1196045 completed with status 0
% 10.89/1.89 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 10.89/1.89 % Preprocessing class: FSMSSMSSSSSNFFN.
% 10.89/1.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.89/1.89 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.89/1.89 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 10.89/1.89 % No SInE strategy applied
% 10.89/1.89 % Search class: FGUNF-FFMS21-SFFFFFNN
% 10.89/1.89 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 10.89/1.89 % Starting SubtermCWHack with 136s (1) cores
% 10.89/1.89 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 10.89/1.89 % Preprocessing time : 0.001 s
% 10.89/1.89 % Presaturation interreduction done
% 10.89/1.89
% 10.89/1.89 % Proof found!
% 10.89/1.89 % SZS status Unsatisfiable
% 10.89/1.89 % SZS output start CNFRefutation
% See solution above
% 10.89/1.89 % Parsed axioms : 30
% 10.89/1.89 % Removed by relevancy pruning/SinE : 0
% 10.89/1.89 % Initial clauses : 30
% 10.89/1.89 % Removed in clause preprocessing : 0
% 10.89/1.89 % Initial clauses in saturation : 30
% 10.89/1.89 % Processed clauses : 10271
% 10.89/1.89 % ...of these trivial : 51
% 10.89/1.89 % ...subsumed : 7234
% 10.89/1.89 % ...remaining for further processing : 2986
% 10.89/1.89 % Other redundant clauses eliminated : 0
% 10.89/1.89 % Clauses deleted for lack of memory : 0
% 10.89/1.89 % Backward-subsumed : 259
% 10.89/1.89 % Backward-rewritten : 12
% 10.89/1.89 % Generated clauses : 63244
% 10.89/1.89 % ...of the previous two non-redundant : 59906
% 10.89/1.89 % ...aggressively subsumed : 0
% 10.89/1.89 % Contextual simplify-reflections : 53
% 10.89/1.89 % Paramodulations : 63225
% 10.89/1.89 % Factorizations : 0
% 10.89/1.89 % NegExts : 0
% 10.89/1.89 % Equation resolutions : 0
% 10.89/1.89 % Disequality decompositions : 0
% 10.89/1.89 % Total rewrite steps : 23432
% 10.89/1.89 % ...of those cached : 23283
% 10.89/1.89 % Propositional unsat checks : 0
% 10.89/1.89 % Propositional check models : 0
% 10.89/1.89 % Propositional check unsatisfiable : 0
% 10.89/1.89 % Propositional clauses : 0
% 10.89/1.89 % Propositional clauses after purity: 0
% 10.89/1.89 % Propositional unsat core size : 0
% 10.89/1.89 % Propositional preprocessing time : 0.000
% 10.89/1.89 % Propositional encoding time : 0.000
% 10.89/1.89 % Propositional solver time : 0.000
% 10.89/1.89 % Success case prop preproc time : 0.000
% 10.89/1.89 % Success case prop encoding time : 0.000
% 10.89/1.89 % Success case prop solver time : 0.000
% 10.89/1.89 % Current number of processed clauses : 2666
% 10.89/1.89 % Positive orientable unit clauses : 180
% 10.89/1.89 % Positive unorientable unit clauses: 0
% 10.89/1.89 % Negative unit clauses : 185
% 10.89/1.89 % Non-unit-clauses : 2301
% 10.89/1.89 % Current number of unprocessed clauses: 49525
% 10.89/1.89 % ...number of literals in the above : 181022
% 10.89/1.89 % Current number of archived formulas : 0
% 10.89/1.89 % Current number of archived clauses : 320
% 10.89/1.89 % Clause-clause subsumption calls (NU) : 496114
% 10.89/1.89 % Rec. Clause-clause subsumption calls : 322046
% 10.89/1.89 % Non-unit clause-clause subsumptions : 4663
% 10.89/1.89 % Unit Clause-clause subsumption calls : 93202
% 10.89/1.89 % Rewrite failures with RHS unbound : 0
% 10.89/1.89 % BW rewrite match attempts : 244
% 10.89/1.89 % BW rewrite match successes : 17
% 10.89/1.89 % Condensation attempts : 0
% 10.89/1.89 % Condensation successes : 0
% 10.89/1.89 % Termbank termtop insertions : 972937
% 10.89/1.89 % Search garbage collected termcells : 71
% 10.89/1.89
% 10.89/1.89 % -------------------------------------------------
% 10.89/1.89 % User time : 1.266 s
% 10.89/1.89 % System time : 0.038 s
% 10.89/1.89 % Total time : 1.304 s
% 10.89/1.89 % Maximum resident set size: 3660 pages
% 10.89/1.89
% 10.89/1.89 % -------------------------------------------------
% 10.89/1.89 % User time : 6.714 s
% 10.89/1.89 % System time : 0.271 s
% 10.89/1.89 % Total time : 6.986 s
% 10.89/1.89 % Maximum resident set size: 4864 pages
% 10.89/1.89 % E exiting
%------------------------------------------------------------------------------