%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : FLD013-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 : n005.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:07 PM UTC 2026
% Result : Unsatisfiable 0.22s 0.52s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of clauses : 49 ( 29 unt; 0 nHn; 49 RR)
% Number of literals : 78 ( 0 equ; 32 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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(c_equals_d_6,negated_conjecture,
equalish(c,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_equals_d_6) ).
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(symmetry_of_equality,axiom,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
cnf(d_is_defined,hypothesis,
defined(d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d_is_defined) ).
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(a_equals_b_5,negated_conjecture,
equalish(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_equals_b_5) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined) ).
cnf(c_is_defined,hypothesis,
defined(c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_is_defined) ).
cnf(add_not_equal_to_add_7,negated_conjecture,
~ equalish(add(a,c),add(d,b)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_not_equal_to_add_7) ).
cnf(c_0_11,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_12,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(add(X1,X2),add(X3,X2)) ),
c_0_11 ).
cnf(c_0_13,negated_conjecture,
equalish(c,d),
c_equals_d_6 ).
cnf(c_0_14,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_15,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_16,negated_conjecture,
( ~ defined(X1)
| equalish(add(c,X1),add(d,X1)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_18,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
c_0_14 ).
cnf(c_0_19,hypothesis,
defined(d),
d_is_defined ).
cnf(c_0_20,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_equality]) ).
cnf(c_0_21,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_15 ).
cnf(c_0_22,hypothesis,
equalish(add(c,a),add(d,a)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,hypothesis,
( ~ defined(X1)
| equalish(add(d,X1),add(X1,d)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
equalish(a,b),
a_equals_b_5 ).
cnf(c_0_25,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
c_0_20 ).
cnf(c_0_26,hypothesis,
equalish(add(d,a),add(c,a)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,hypothesis,
equalish(add(d,a),add(a,d)),
inference(spm,[status(thm)],[c_0_23,c_0_17]) ).
cnf(c_0_28,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_29,negated_conjecture,
( ~ defined(X1)
| equalish(add(a,X1),add(b,X1)) ),
inference(spm,[status(thm)],[c_0_12,c_0_24]) ).
cnf(c_0_30,hypothesis,
( ~ equalish(X1,add(d,a))
| equalish(X1,add(c,a)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,hypothesis,
equalish(add(a,d),add(d,a)),
inference(spm,[status(thm)],[c_0_21,c_0_27]) ).
cnf(c_0_32,hypothesis,
equalish(add(d,b),add(b,d)),
inference(spm,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_33,hypothesis,
equalish(add(a,d),add(b,d)),
inference(spm,[status(thm)],[c_0_29,c_0_19]) ).
cnf(c_0_34,hypothesis,
equalish(add(a,d),add(c,a)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,hypothesis,
equalish(add(b,d),add(d,b)),
inference(spm,[status(thm)],[c_0_21,c_0_32]) ).
cnf(c_0_36,hypothesis,
( ~ equalish(X1,add(a,d))
| equalish(X1,add(b,d)) ),
inference(spm,[status(thm)],[c_0_25,c_0_33]) ).
cnf(c_0_37,hypothesis,
equalish(add(c,a),add(a,d)),
inference(spm,[status(thm)],[c_0_21,c_0_34]) ).
cnf(c_0_38,hypothesis,
defined(c),
c_is_defined ).
cnf(c_0_39,hypothesis,
( ~ equalish(X1,add(b,d))
| equalish(X1,add(d,b)) ),
inference(spm,[status(thm)],[c_0_25,c_0_35]) ).
cnf(c_0_40,hypothesis,
equalish(add(c,a),add(b,d)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,hypothesis,
( ~ defined(X1)
| equalish(add(c,X1),add(X1,c)) ),
inference(spm,[status(thm)],[c_0_18,c_0_38]) ).
cnf(c_0_42,hypothesis,
equalish(add(c,a),add(d,b)),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,hypothesis,
equalish(add(c,a),add(a,c)),
inference(spm,[status(thm)],[c_0_41,c_0_17]) ).
cnf(c_0_44,negated_conjecture,
~ equalish(add(a,c),add(d,b)),
inference(fof_simplification,[status(thm)],[add_not_equal_to_add_7]) ).
cnf(c_0_45,hypothesis,
( ~ equalish(X1,add(c,a))
| equalish(X1,add(d,b)) ),
inference(spm,[status(thm)],[c_0_25,c_0_42]) ).
cnf(c_0_46,hypothesis,
equalish(add(a,c),add(c,a)),
inference(spm,[status(thm)],[c_0_21,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
~ equalish(add(a,c),add(d,b)),
c_0_44 ).
cnf(c_0_48,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD013-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.14/0.40 % Computer : n005.cluster.edu
% 0.14/0.40 % Model : x86_64 x86_64
% 0.14/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40 % Memory : 8046.5625MB
% 0.14/0.40 % OS : Linux 6.8.0-71-generic
% 0.14/0.40 % CPULimit : 300
% 0.14/0.40 % WCLimit : 300
% 0.14/0.40 % DateTime : Mon Sep 21 15:37:18 UTC 2026
% 0.14/0.40 % CPUTime :
% 0.14/0.40 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.44 Running first-order theorem proving
% 0.14/0.45 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.22/0.52 % Version: 3.5.1
% 0.22/0.52 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.52 % Starting sh5l with 300s (1) cores
% 0.22/0.52 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3844831 completed with status 0
% 0.22/0.52 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.52 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.52 % No SInE strategy applied
% 0.22/0.52 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.22/0.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.52 % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.52 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 0.22/0.52 % Starting new_bool_3 with 269s (1) cores
% 0.22/0.52 % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 0.22/0.52 % G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with pid 3844843 completed with status 0
% 0.22/0.52 % Result found by G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN
% 0.22/0.52 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.52 % No SInE strategy applied
% 0.22/0.52 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.22/0.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.52 % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.52 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 0.22/0.52 % Starting new_bool_3 with 269s (1) cores
% 0.22/0.52 % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 0.22/0.52 % Preprocessing time : 0.002 s
% 0.22/0.52 % Presaturation interreduction done
% 0.22/0.52
% 0.22/0.52 % Proof found!
% 0.22/0.52 % SZS status Unsatisfiable
% 0.22/0.52 % SZS output start CNFRefutation
% See solution above
% 0.22/0.52 % Parsed axioms : 34
% 0.22/0.52 % Removed by relevancy pruning/SinE : 0
% 0.22/0.52 % Initial clauses : 34
% 0.22/0.52 % Removed in clause preprocessing : 0
% 0.22/0.52 % Initial clauses in saturation : 34
% 0.22/0.52 % Processed clauses : 466
% 0.22/0.52 % ...of these trivial : 28
% 0.22/0.52 % ...subsumed : 46
% 0.22/0.52 % ...remaining for further processing : 392
% 0.22/0.52 % Other redundant clauses eliminated : 0
% 0.22/0.52 % Clauses deleted for lack of memory : 0
% 0.22/0.52 % Backward-subsumed : 0
% 0.22/0.52 % Backward-rewritten : 0
% 0.22/0.52 % Generated clauses : 2148
% 0.22/0.52 % ...of the previous two non-redundant : 1604
% 0.22/0.52 % ...aggressively subsumed : 0
% 0.22/0.52 % Contextual simplify-reflections : 0
% 0.22/0.52 % Paramodulations : 2148
% 0.22/0.52 % Factorizations : 0
% 0.22/0.52 % NegExts : 0
% 0.22/0.52 % Equation resolutions : 0
% 0.22/0.52 % Disequality decompositions : 0
% 0.22/0.52 % Total rewrite steps : 512
% 0.22/0.52 % ...of those cached : 351
% 0.22/0.52 % Propositional unsat checks : 0
% 0.22/0.52 % Propositional check models : 0
% 0.22/0.52 % Propositional check unsatisfiable : 0
% 0.22/0.52 % Propositional clauses : 0
% 0.22/0.52 % Propositional clauses after purity: 0
% 0.22/0.52 % Propositional unsat core size : 0
% 0.22/0.52 % Propositional preprocessing time : 0.000
% 0.22/0.52 % Propositional encoding time : 0.000
% 0.22/0.52 % Propositional solver time : 0.000
% 0.22/0.52 % Success case prop preproc time : 0.000
% 0.22/0.52 % Success case prop encoding time : 0.000
% 0.22/0.52 % Success case prop solver time : 0.000
% 0.22/0.52 % Current number of processed clauses : 358
% 0.22/0.52 % Positive orientable unit clauses : 177
% 0.22/0.52 % Positive unorientable unit clauses: 0
% 0.22/0.52 % Negative unit clauses : 2
% 0.22/0.52 % Non-unit-clauses : 179
% 0.22/0.52 % Current number of unprocessed clauses: 1199
% 0.22/0.52 % ...number of literals in the above : 3264
% 0.22/0.52 % Current number of archived formulas : 0
% 0.22/0.52 % Current number of archived clauses : 34
% 0.22/0.52 % Clause-clause subsumption calls (NU) : 2671
% 0.22/0.52 % Rec. Clause-clause subsumption calls : 2428
% 0.22/0.52 % Non-unit clause-clause subsumptions : 46
% 0.22/0.52 % Unit Clause-clause subsumption calls : 266
% 0.22/0.52 % Rewrite failures with RHS unbound : 0
% 0.22/0.52 % BW rewrite match attempts : 0
% 0.22/0.52 % BW rewrite match successes : 0
% 0.22/0.52 % Condensation attempts : 0
% 0.22/0.52 % Condensation successes : 0
% 0.22/0.52 % Termbank termtop insertions : 26570
% 0.22/0.52 % Search garbage collected termcells : 71
% 0.22/0.52
% 0.22/0.52 % -------------------------------------------------
% 0.22/0.52 % User time : 0.035 s
% 0.22/0.52 % System time : 0.010 s
% 0.22/0.52 % Total time : 0.045 s
% 0.22/0.52 % Maximum resident set size: 3608 pages
% 0.22/0.52
% 0.22/0.52 % -------------------------------------------------
% 0.22/0.52 % User time : 0.235 s
% 0.22/0.52 % System time : 0.036 s
% 0.22/0.52 % Total time : 0.271 s
% 0.22/0.52 % Maximum resident set size: 4864 pages
% 0.22/0.52 % E exiting
%------------------------------------------------------------------------------