%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD013-2 : 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 : n011.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:39 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.44s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of clauses : 45 ( 26 unt; 0 nHn; 45 RR)
% Number of literals : 75 ( 0 equ; 33 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 39 ( 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(add_equals_u_8,negated_conjecture,
equalish(add(a,c),u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',add_equals_u_8) ).
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(symmetry_of_equality,axiom,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
cnf(c_is_defined,hypothesis,
defined(c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_is_defined) ).
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(c_equals_d_7,negated_conjecture,
equalish(c,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_equals_d_7) ).
cnf(d_is_defined,hypothesis,
defined(d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d_is_defined) ).
cnf(a_equals_b_6,negated_conjecture,
equalish(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_equals_b_6) ).
cnf(add_not_equal_to_u_9,negated_conjecture,
~ equalish(add(d,b),u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',add_not_equal_to_u_9) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
cnf(c_0_12,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_equality]) ).
cnf(c_0_13,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
c_0_12 ).
cnf(c_0_14,negated_conjecture,
equalish(add(a,c),u),
add_equals_u_8 ).
cnf(c_0_15,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_16,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_17,negated_conjecture,
( ~ equalish(X1,add(a,c))
| equalish(X1,u) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
c_0_15 ).
cnf(c_0_19,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_20,hypothesis,
defined(c),
c_is_defined ).
cnf(c_0_21,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_22,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_16 ).
cnf(c_0_23,negated_conjecture,
equalish(c,d),
c_equals_d_7 ).
cnf(c_0_24,negated_conjecture,
equalish(add(c,a),u),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]) ).
cnf(c_0_25,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(add(X1,X2),add(X3,X2)) ),
c_0_21 ).
cnf(c_0_26,negated_conjecture,
equalish(d,c),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( ~ equalish(X1,add(c,a))
| equalish(X1,u) ),
inference(spm,[status(thm)],[c_0_13,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
( ~ defined(X1)
| equalish(add(d,X1),add(c,X1)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
equalish(add(d,a),u),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_19])]) ).
cnf(c_0_30,plain,
( ~ equalish(X1,add(X3,X2))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,add(X2,X3)) ),
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_31,negated_conjecture,
equalish(u,add(d,a)),
inference(spm,[status(thm)],[c_0_22,c_0_29]) ).
cnf(c_0_32,hypothesis,
defined(d),
d_is_defined ).
cnf(c_0_33,negated_conjecture,
equalish(u,add(a,d)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_19]),c_0_32])]) ).
cnf(c_0_34,negated_conjecture,
equalish(a,b),
a_equals_b_6 ).
cnf(c_0_35,negated_conjecture,
equalish(add(a,d),u),
inference(spm,[status(thm)],[c_0_22,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
equalish(b,a),
inference(spm,[status(thm)],[c_0_22,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
( ~ equalish(X1,add(a,d))
| equalish(X1,u) ),
inference(spm,[status(thm)],[c_0_13,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
( ~ defined(X1)
| equalish(add(b,X1),add(a,X1)) ),
inference(spm,[status(thm)],[c_0_25,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
equalish(add(b,d),u),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_32])]) ).
cnf(c_0_40,negated_conjecture,
~ equalish(add(d,b),u),
inference(fof_simplification,[status(thm)],[add_not_equal_to_u_9]) ).
cnf(c_0_41,negated_conjecture,
( ~ equalish(X1,add(b,d))
| equalish(X1,u) ),
inference(spm,[status(thm)],[c_0_13,c_0_39]) ).
cnf(c_0_42,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_43,negated_conjecture,
~ equalish(add(d,b),u),
c_0_40 ).
cnf(c_0_44,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_41,c_0_18]),c_0_42]),c_0_32])]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : FLD013-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n011.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 15:37:40 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/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
% 0.13/0.44 % Version: 3.5.1
% 0.13/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.44 % Starting sh5l with 300s (1) cores
% 0.13/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2262746 completed with status 0
% 0.13/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.44 % No SInE strategy applied
% 0.13/0.44 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.13/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.44 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 0.13/0.44 % Starting new_bool_3 with 269s (1) cores
% 0.13/0.44 % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 0.13/0.44 % new_bool_3 with pid 2262756 completed with status 0
% 0.13/0.44 % Result found by new_bool_3
% 0.13/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.44 % No SInE strategy applied
% 0.13/0.44 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.13/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.44 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 0.13/0.44 % Starting new_bool_3 with 269s (1) cores
% 0.13/0.44 % Preprocessing time : 0.002 s
% 0.13/0.44 % Presaturation interreduction done
% 0.13/0.44
% 0.13/0.44 % Proof found!
% 0.13/0.44 % SZS status Unsatisfiable
% 0.13/0.44 % SZS output start CNFRefutation
% See solution above
% 0.13/0.44 % Parsed axioms : 36
% 0.13/0.44 % Removed by relevancy pruning/SinE : 0
% 0.13/0.44 % Initial clauses : 36
% 0.13/0.44 % Removed in clause preprocessing : 0
% 0.13/0.44 % Initial clauses in saturation : 36
% 0.13/0.44 % Processed clauses : 360
% 0.13/0.44 % ...of these trivial : 40
% 0.13/0.44 % ...subsumed : 18
% 0.13/0.44 % ...remaining for further processing : 302
% 0.13/0.44 % Other redundant clauses eliminated : 0
% 0.13/0.44 % Clauses deleted for lack of memory : 0
% 0.13/0.44 % Backward-subsumed : 3
% 0.13/0.44 % Backward-rewritten : 7
% 0.13/0.44 % Generated clauses : 1702
% 0.13/0.44 % ...of the previous two non-redundant : 1245
% 0.13/0.44 % ...aggressively subsumed : 0
% 0.13/0.44 % Contextual simplify-reflections : 0
% 0.13/0.44 % Paramodulations : 1700
% 0.13/0.44 % Factorizations : 2
% 0.13/0.44 % NegExts : 0
% 0.13/0.44 % Equation resolutions : 0
% 0.13/0.44 % Disequality decompositions : 0
% 0.13/0.44 % Total rewrite steps : 979
% 0.13/0.44 % ...of those cached : 857
% 0.13/0.44 % Propositional unsat checks : 0
% 0.13/0.44 % Propositional check models : 0
% 0.13/0.44 % Propositional check unsatisfiable : 0
% 0.13/0.44 % Propositional clauses : 0
% 0.13/0.44 % Propositional clauses after purity: 0
% 0.13/0.44 % Propositional unsat core size : 0
% 0.13/0.44 % Propositional preprocessing time : 0.000
% 0.13/0.44 % Propositional encoding time : 0.000
% 0.13/0.44 % Propositional solver time : 0.000
% 0.13/0.44 % Success case prop preproc time : 0.000
% 0.13/0.44 % Success case prop encoding time : 0.000
% 0.13/0.44 % Success case prop solver time : 0.000
% 0.13/0.44 % Current number of processed clauses : 256
% 0.13/0.44 % Positive orientable unit clauses : 129
% 0.13/0.44 % Positive unorientable unit clauses: 0
% 0.13/0.44 % Negative unit clauses : 2
% 0.13/0.44 % Non-unit-clauses : 125
% 0.13/0.44 % Current number of unprocessed clauses: 954
% 0.13/0.44 % ...number of literals in the above : 2286
% 0.13/0.44 % Current number of archived formulas : 0
% 0.13/0.44 % Current number of archived clauses : 46
% 0.13/0.44 % Clause-clause subsumption calls (NU) : 1322
% 0.13/0.44 % Rec. Clause-clause subsumption calls : 1088
% 0.13/0.44 % Non-unit clause-clause subsumptions : 19
% 0.13/0.44 % Unit Clause-clause subsumption calls : 109
% 0.13/0.44 % Rewrite failures with RHS unbound : 0
% 0.13/0.44 % BW rewrite match attempts : 14
% 0.13/0.44 % BW rewrite match successes : 9
% 0.13/0.44 % Condensation attempts : 0
% 0.13/0.44 % Condensation successes : 0
% 0.13/0.44 % Termbank termtop insertions : 21500
% 0.13/0.44 % Search garbage collected termcells : 71
% 0.13/0.44
% 0.13/0.44 % -------------------------------------------------
% 0.13/0.44 % User time : 0.030 s
% 0.13/0.44 % System time : 0.004 s
% 0.13/0.44 % Total time : 0.034 s
% 0.13/0.44 % Maximum resident set size: 3660 pages
% 0.13/0.44
% 0.13/0.44 % -------------------------------------------------
% 0.13/0.44 % User time : 0.145 s
% 0.13/0.44 % System time : 0.023 s
% 0.13/0.44 % Total time : 0.168 s
% 0.13/0.44 % Maximum resident set size: 4608 pages
% 0.13/0.44 % E exiting
%------------------------------------------------------------------------------