%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD025-2 : 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:43 PM UTC 2026
% Result : Unsatisfiable 0.50s 0.47s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 41 ( 23 unt; 0 nHn; 41 RR)
% Number of literals : 70 ( 0 equ; 32 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 : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(compatibility_of_equality_and_multiplication,axiom,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(multiply(X1,X2),multiply(X3,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_multiplication) ).
cnf(a_equals_b_7,negated_conjecture,
equalish(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_equals_b_7) ).
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(c_equals_d_8,negated_conjecture,
equalish(c,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_equals_d_8) ).
cnf(symmetry_of_equality,axiom,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
cnf(c_is_defined,hypothesis,
defined(c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_is_defined) ).
cnf(multiply_equals_v_10,negated_conjecture,
equalish(multiply(d,b),v),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_equals_v_10) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined) ).
cnf(multiply_equals_u_9,negated_conjecture,
equalish(multiply(a,c),u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_equals_u_9) ).
cnf(commutativity_multiplication,axiom,
( ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,X2),multiply(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',commutativity_multiplication) ).
cnf(v_not_equal_to_u_11,negated_conjecture,
~ equalish(v,u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v_not_equal_to_u_11) ).
cnf(c_0_11,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(multiply(X1,X2),multiply(X3,X2)) ),
inference(fof_simplification,[status(thm)],[compatibility_of_equality_and_multiplication]) ).
cnf(c_0_12,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(multiply(X1,X2),multiply(X3,X2)) ),
c_0_11 ).
cnf(c_0_13,negated_conjecture,
equalish(a,b),
a_equals_b_7 ).
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,negated_conjecture,
equalish(c,d),
c_equals_d_8 ).
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,
( ~ defined(X1)
| equalish(multiply(a,X1),multiply(b,X1)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,hypothesis,
defined(c),
c_is_defined ).
cnf(c_0_19,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
c_0_14 ).
cnf(c_0_20,negated_conjecture,
equalish(multiply(d,b),v),
multiply_equals_v_10 ).
cnf(c_0_21,negated_conjecture,
( ~ defined(X1)
| equalish(multiply(c,X1),multiply(d,X1)) ),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_22,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_23,negated_conjecture,
equalish(multiply(a,c),u),
multiply_equals_u_9 ).
cnf(c_0_24,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_16 ).
cnf(c_0_25,hypothesis,
equalish(multiply(a,c),multiply(b,c)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_26,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,X2),multiply(X2,X1)) ),
inference(fof_simplification,[status(thm)],[commutativity_multiplication]) ).
cnf(c_0_27,negated_conjecture,
( ~ equalish(X1,multiply(d,b))
| equalish(X1,v) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,hypothesis,
equalish(multiply(c,b),multiply(d,b)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( ~ equalish(X1,multiply(a,c))
| equalish(X1,u) ),
inference(spm,[status(thm)],[c_0_19,c_0_23]) ).
cnf(c_0_30,hypothesis,
equalish(multiply(b,c),multiply(a,c)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,X2),multiply(X2,X1)) ),
c_0_26 ).
cnf(c_0_32,negated_conjecture,
equalish(multiply(c,b),v),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
equalish(multiply(b,c),u),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
( ~ equalish(X1,multiply(X3,X2))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,multiply(X2,X3)) ),
inference(spm,[status(thm)],[c_0_19,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
equalish(v,multiply(c,b)),
inference(spm,[status(thm)],[c_0_24,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
~ equalish(v,u),
inference(fof_simplification,[status(thm)],[v_not_equal_to_u_11]) ).
cnf(c_0_37,negated_conjecture,
( ~ equalish(X1,multiply(b,c))
| equalish(X1,u) ),
inference(spm,[status(thm)],[c_0_19,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
equalish(v,multiply(b,c)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_22]),c_0_18])]) ).
cnf(c_0_39,negated_conjecture,
~ equalish(v,u),
c_0_36 ).
cnf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD025-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n010.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 15:39:26 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.50/0.47 % Version: 3.5.1
% 0.50/0.47 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.50/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.50/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.50/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.50/0.47 % Starting sh5l with 300s (1) cores
% 0.50/0.47 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1203149 completed with status 0
% 0.50/0.47 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.50/0.47 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.50/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.50/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.50/0.47 % No SInE strategy applied
% 0.50/0.47 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.50/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.50/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.50/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.50/0.47 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 0.50/0.47 % Starting new_bool_3 with 269s (1) cores
% 0.50/0.47 % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 0.50/0.47 % G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with pid 1203160 completed with status 0
% 0.50/0.47 % Result found by G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN
% 0.50/0.47 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.50/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.50/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.50/0.47 % No SInE strategy applied
% 0.50/0.47 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.50/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.50/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.50/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.50/0.47 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 0.50/0.47 % Starting new_bool_3 with 269s (1) cores
% 0.50/0.47 % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 0.50/0.47 % Preprocessing time : 0.002 s
% 0.50/0.47 % Presaturation interreduction done
% 0.50/0.47
% 0.50/0.47 % Proof found!
% 0.50/0.47 % SZS status Unsatisfiable
% 0.50/0.47 % SZS output start CNFRefutation
% See solution above
% 0.50/0.48 % Parsed axioms : 38
% 0.50/0.48 % Removed by relevancy pruning/SinE : 0
% 0.50/0.48 % Initial clauses : 38
% 0.50/0.48 % Removed in clause preprocessing : 0
% 0.50/0.48 % Initial clauses in saturation : 38
% 0.50/0.48 % Processed clauses : 362
% 0.50/0.48 % ...of these trivial : 19
% 0.50/0.48 % ...subsumed : 2
% 0.50/0.48 % ...remaining for further processing : 341
% 0.50/0.48 % Other redundant clauses eliminated : 0
% 0.50/0.48 % Clauses deleted for lack of memory : 0
% 0.50/0.48 % Backward-subsumed : 0
% 0.50/0.48 % Backward-rewritten : 0
% 0.50/0.48 % Generated clauses : 1883
% 0.50/0.48 % ...of the previous two non-redundant : 1556
% 0.50/0.48 % ...aggressively subsumed : 0
% 0.50/0.48 % Contextual simplify-reflections : 0
% 0.50/0.48 % Paramodulations : 1883
% 0.50/0.48 % Factorizations : 0
% 0.50/0.48 % NegExts : 0
% 0.50/0.48 % Equation resolutions : 0
% 0.50/0.48 % Disequality decompositions : 0
% 0.50/0.48 % Total rewrite steps : 509
% 0.50/0.48 % ...of those cached : 356
% 0.50/0.48 % Propositional unsat checks : 0
% 0.50/0.48 % Propositional check models : 0
% 0.50/0.48 % Propositional check unsatisfiable : 0
% 0.50/0.48 % Propositional clauses : 0
% 0.50/0.48 % Propositional clauses after purity: 0
% 0.50/0.48 % Propositional unsat core size : 0
% 0.50/0.48 % Propositional preprocessing time : 0.000
% 0.50/0.48 % Propositional encoding time : 0.000
% 0.50/0.48 % Propositional solver time : 0.000
% 0.50/0.48 % Success case prop preproc time : 0.000
% 0.50/0.48 % Success case prop encoding time : 0.000
% 0.50/0.48 % Success case prop solver time : 0.000
% 0.50/0.48 % Current number of processed clauses : 303
% 0.50/0.48 % Positive orientable unit clauses : 194
% 0.50/0.48 % Positive unorientable unit clauses: 0
% 0.50/0.48 % Negative unit clauses : 2
% 0.50/0.48 % Non-unit-clauses : 107
% 0.50/0.48 % Current number of unprocessed clauses: 1264
% 0.50/0.48 % ...number of literals in the above : 3037
% 0.50/0.48 % Current number of archived formulas : 0
% 0.50/0.48 % Current number of archived clauses : 38
% 0.50/0.48 % Clause-clause subsumption calls (NU) : 1483
% 0.50/0.48 % Rec. Clause-clause subsumption calls : 1235
% 0.50/0.48 % Non-unit clause-clause subsumptions : 2
% 0.50/0.48 % Unit Clause-clause subsumption calls : 236
% 0.50/0.48 % Rewrite failures with RHS unbound : 0
% 0.50/0.48 % BW rewrite match attempts : 0
% 0.50/0.48 % BW rewrite match successes : 0
% 0.50/0.48 % Condensation attempts : 0
% 0.50/0.48 % Condensation successes : 0
% 0.50/0.48 % Termbank termtop insertions : 24989
% 0.50/0.48 % Search garbage collected termcells : 71
% 0.50/0.48
% 0.50/0.48 % -------------------------------------------------
% 0.50/0.48 % User time : 0.032 s
% 0.50/0.48 % System time : 0.008 s
% 0.50/0.48 % Total time : 0.040 s
% 0.50/0.48 % Maximum resident set size: 3660 pages
% 0.50/0.48
% 0.50/0.48 % -------------------------------------------------
% 0.50/0.48 % User time : 0.166 s
% 0.50/0.48 % System time : 0.017 s
% 0.50/0.48 % Total time : 0.183 s
% 0.50/0.48 % Maximum resident set size: 4864 pages
% 0.50/0.48 % E exiting
%------------------------------------------------------------------------------