%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD022-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 : n012.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:42 PM UTC 2026
% Result : Unsatisfiable 45.78s 7.73s
% Output : CNFRefutation 45.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 14
% Syntax : Number of clauses : 57 ( 15 unt; 0 nHn; 57 RR)
% Number of literals : 137 ( 0 equ; 83 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 88 ( 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_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(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(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(well_definedness_of_addition,axiom,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_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(add_equals_add_4,negated_conjecture,
equalish(add(a,c),add(b,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_equals_add_4) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
cnf(c_is_defined,hypothesis,
defined(c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_is_defined) ).
cnf(a_not_equal_to_b_5,negated_conjecture,
~ equalish(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_not_equal_to_b_5) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined) ).
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(additive_identity,X1),X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_16,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_17,plain,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).
cnf(c_0_18,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| 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,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(add(X1,X2),add(X3,X2)) ),
c_0_16 ).
cnf(c_0_21,plain,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
c_0_17 ).
cnf(c_0_22,plain,
( ~ equalish(X1,add(additive_identity,X2))
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( ~ defined(X1)
| ~ defined(X2)
| equalish(add(add(X1,additive_inverse(X1)),X2),add(additive_identity,X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_25,plain,
( ~ defined(X1)
| ~ defined(X2)
| equalish(add(add(X1,additive_inverse(X1)),X2),X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
c_0_24 ).
cnf(c_0_27,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_additive_inverse]) ).
cnf(c_0_28,plain,
( ~ equalish(X1,add(add(X3,additive_inverse(X3)),X2))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_25]) ).
cnf(c_0_29,plain,
( ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3)
| equalish(add(add(X1,X2),X3),add(add(X2,X1),X3)) ),
inference(spm,[status(thm)],[c_0_20,c_0_26]) ).
cnf(c_0_30,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
c_0_27 ).
cnf(c_0_31,plain,
( ~ defined(X1)
| ~ defined(X2)
| equalish(add(add(additive_inverse(X1),X1),X2),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_32,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_33,plain,
( ~ equalish(X1,add(add(additive_inverse(X3),X3),X2))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_31]) ).
cnf(c_0_34,plain,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3)) ),
c_0_32 ).
cnf(c_0_35,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X1,X2)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_addition]) ).
cnf(c_0_36,plain,
( ~ defined(X1)
| ~ defined(X2)
| equalish(add(additive_inverse(X1),add(X1,X2)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_30]) ).
cnf(c_0_37,plain,
( ~ equalish(X1,add(X3,X2))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,add(X2,X3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_26]) ).
cnf(c_0_38,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X1,X2)) ),
c_0_35 ).
cnf(c_0_39,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_40,plain,
( ~ equalish(X1,add(additive_inverse(X3),add(X3,X2)))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_36]) ).
cnf(c_0_41,plain,
( ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3)
| equalish(add(add(X1,X2),X3),add(X3,add(X2,X1))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_29]),c_0_38]) ).
cnf(c_0_42,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_39 ).
cnf(c_0_43,negated_conjecture,
equalish(add(a,c),add(b,c)),
add_equals_add_4 ).
cnf(c_0_44,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(add(X1,X2),additive_inverse(X2)),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_30]) ).
cnf(c_0_45,negated_conjecture,
equalish(add(b,c),add(a,c)),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,plain,
( ~ equalish(X1,add(add(X2,X3),additive_inverse(X3)))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
( ~ defined(X1)
| equalish(add(add(b,c),X1),add(add(a,c),X1)) ),
inference(spm,[status(thm)],[c_0_20,c_0_45]) ).
cnf(c_0_48,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_49,hypothesis,
defined(c),
c_is_defined ).
cnf(c_0_50,negated_conjecture,
( ~ defined(additive_inverse(c))
| equalish(add(add(b,c),additive_inverse(c)),a) ),
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_49])]) ).
cnf(c_0_51,negated_conjecture,
equalish(add(add(b,c),additive_inverse(c)),a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_30]),c_0_49])]) ).
cnf(c_0_52,negated_conjecture,
~ equalish(a,b),
inference(fof_simplification,[status(thm)],[a_not_equal_to_b_5]) ).
cnf(c_0_53,negated_conjecture,
equalish(a,add(add(b,c),additive_inverse(c))),
inference(spm,[status(thm)],[c_0_42,c_0_51]) ).
cnf(c_0_54,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_55,negated_conjecture,
~ equalish(a,b),
c_0_52 ).
cnf(c_0_56,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_53]),c_0_54]),c_0_49])]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : FLD022-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.98 % Computer : n012.cluster.edu
% 0.09/0.98 % Model : x86_64 x86_64
% 0.09/0.98 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.98 % Memory : 8046.5625MB
% 0.09/0.98 % OS : Linux 6.8.0-71-generic
% 0.09/0.98 % CPULimit : 300
% 0.09/0.98 % WCLimit : 300
% 0.09/0.98 % DateTime : Mon Sep 21 15:38:09 UTC 2026
% 0.09/0.99 % CPUTime :
% 0.09/0.99 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/1.02 Running first-order theorem proving
% 0.09/1.02 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
% 45.78/7.73 % Version: 3.5.1
% 45.78/7.73 % Preprocessing class: FSMSSMSSSSSNFFN.
% 45.78/7.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 45.78/7.73 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 45.78/7.73 % Starting new_bool_3 with 300s (1) cores
% 45.78/7.73 % Starting new_bool_1 with 300s (1) cores
% 45.78/7.73 % Starting sh5l with 300s (1) cores
% 45.78/7.73 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2672991 completed with status 0
% 45.78/7.73 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 45.78/7.73 % Preprocessing class: FSMSSMSSSSSNFFN.
% 45.78/7.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 45.78/7.73 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 45.78/7.73 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 45.78/7.73 % No SInE strategy applied
% 45.78/7.73 % Search class: FGUNF-FFMM21-SFFFFFNN
% 45.78/7.73 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 45.78/7.73 % Starting SubtermCWHack with 136s (1) cores
% 45.78/7.73 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 45.78/7.73 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 45.78/7.73 % Starting new_bool_3 with 269s (1) cores
% 45.78/7.73 % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 45.78/7.73 % new_bool_3 with pid 2673001 completed with status 0
% 45.78/7.73 % Result found by new_bool_3
% 45.78/7.73 % Preprocessing class: FSMSSMSSSSSNFFN.
% 45.78/7.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 45.78/7.73 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 45.78/7.73 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 45.78/7.73 % No SInE strategy applied
% 45.78/7.73 % Search class: FGUNF-FFMM21-SFFFFFNN
% 45.78/7.73 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 45.78/7.73 % Starting SubtermCWHack with 136s (1) cores
% 45.78/7.73 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 45.78/7.73 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 45.78/7.73 % Starting new_bool_3 with 269s (1) cores
% 45.78/7.73 % Preprocessing time : 0.001 s
% 45.78/7.73 % Presaturation interreduction done
% 45.78/7.73
% 45.78/7.73 % Proof found!
% 45.78/7.73 % SZS status Unsatisfiable
% 45.78/7.73 % SZS output start CNFRefutation
% See solution above
% 45.78/7.73 % Parsed axioms : 32
% 45.78/7.73 % Removed by relevancy pruning/SinE : 0
% 45.78/7.73 % Initial clauses : 32
% 45.78/7.73 % Removed in clause preprocessing : 0
% 45.78/7.73 % Initial clauses in saturation : 32
% 45.78/7.73 % Processed clauses : 21298
% 45.78/7.73 % ...of these trivial : 6130
% 45.78/7.73 % ...subsumed : 7694
% 45.78/7.73 % ...remaining for further processing : 7474
% 45.78/7.73 % Other redundant clauses eliminated : 0
% 45.78/7.73 % Clauses deleted for lack of memory : 0
% 45.78/7.73 % Backward-subsumed : 218
% 45.78/7.73 % Backward-rewritten : 1012
% 45.78/7.73 % Generated clauses : 446966
% 45.78/7.73 % ...of the previous two non-redundant : 414687
% 45.78/7.73 % ...aggressively subsumed : 0
% 45.78/7.73 % Contextual simplify-reflections : 204
% 45.78/7.73 % Paramodulations : 446948
% 45.78/7.73 % Factorizations : 18
% 45.78/7.73 % NegExts : 0
% 45.78/7.73 % Equation resolutions : 0
% 45.78/7.73 % Disequality decompositions : 0
% 45.78/7.73 % Total rewrite steps : 143706
% 45.78/7.73 % ...of those cached : 141809
% 45.78/7.73 % Propositional unsat checks : 1
% 45.78/7.73 % Propositional check models : 0
% 45.78/7.73 % Propositional check unsatisfiable : 0
% 45.78/7.73 % Propositional clauses : 0
% 45.78/7.73 % Propositional clauses after purity: 0
% 45.78/7.73 % Propositional unsat core size : 0
% 45.78/7.73 % Propositional preprocessing time : 0.000
% 45.78/7.73 % Propositional encoding time : 0.094
% 45.78/7.73 % Propositional solver time : 0.092
% 45.78/7.73 % Success case prop preproc time : 0.000
% 45.78/7.73 % Success case prop encoding time : 0.000
% 45.78/7.73 % Success case prop solver time : 0.000
% 45.78/7.73 % Current number of processed clauses : 6212
% 45.78/7.73 % Positive orientable unit clauses : 1964
% 45.78/7.73 % Positive unorientable unit clauses: 0
% 45.78/7.73 % Negative unit clauses : 2
% 45.78/7.73 % Non-unit-clauses : 4246
% 45.78/7.73 % Current number of unprocessed clauses: 392741
% 45.78/7.73 % ...number of literals in the above : 1005585
% 45.78/7.73 % Current number of archived formulas : 0
% 45.78/7.73 % Current number of archived clauses : 1262
% 45.78/7.73 % Clause-clause subsumption calls (NU) : 1144416
% 45.78/7.73 % Rec. Clause-clause subsumption calls : 1010219
% 45.78/7.73 % Non-unit clause-clause subsumptions : 8116
% 45.78/7.73 % Unit Clause-clause subsumption calls : 242088
% 45.78/7.73 % Rewrite failures with RHS unbound : 0
% 45.78/7.73 % BW rewrite match attempts : 10209
% 45.78/7.73 % BW rewrite match successes : 879
% 45.78/7.73 % Condensation attempts : 0
% 45.78/7.73 % Condensation successes : 0
% 45.78/7.73 % Termbank termtop insertions : 8792031
% 45.78/7.73 % Search garbage collected termcells : 71
% 45.78/7.73
% 45.78/7.73 % -------------------------------------------------
% 45.78/7.73 % User time : 5.927 s
% 45.78/7.73 % System time : 0.298 s
% 45.78/7.73 % Total time : 6.225 s
% 45.78/7.73 % Maximum resident set size: 3660 pages
% 45.78/7.73
% 45.78/7.73 % -------------------------------------------------
% 45.78/7.73 % User time : 31.145 s
% 45.78/7.73 % System time : 1.243 s
% 45.78/7.73 % Total time : 32.388 s
% 45.78/7.73 % Maximum resident set size: 4864 pages
% 45.78/7.73 % E exiting
%------------------------------------------------------------------------------