%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD004-1 : 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 : n018.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 15.51s 2.75s
% Output : CNFRefutation 15.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 39 ( 14 unt; 6 nHn; 39 RR)
% Number of literals : 88 ( 0 equ; 50 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 : 48 ( 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(existence_of_identity_multiplication,axiom,
( ~ defined(X1)
| equalish(multiply(multiplicative_identity,X1),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',existence_of_identity_multiplication) ).
cnf(compatibility_of_equality_and_multiplication,axiom,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(multiply(X1,X2),multiply(X3,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_multiplication) ).
cnf(commutativity_multiplication,axiom,
( ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,X2),multiply(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',commutativity_multiplication) ).
cnf(existence_of_inverse_multiplication,axiom,
( ~ defined(X1)
| equalish(X1,additive_identity)
| equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',existence_of_inverse_multiplication) ).
cnf(b_not_equal_to_additive_identity_3,negated_conjecture,
~ equalish(b,additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_not_equal_to_additive_identity_3) ).
cnf(multiply_not_equal_to_a_4,negated_conjecture,
~ equalish(multiply(a,multiply(b,multiplicative_inverse(b))),a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply_not_equal_to_a_4) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
cnf(well_definedness_of_multiplicative_inverse,axiom,
( ~ defined(X1)
| equalish(X1,additive_identity)
| defined(multiplicative_inverse(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',well_definedness_of_multiplicative_inverse) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
cnf(well_definedness_of_multiplication,axiom,
( ~ defined(X2)
| ~ defined(X1)
| defined(multiply(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',well_definedness_of_multiplication) ).
cnf(c_0_11,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_equality]) ).
cnf(c_0_12,plain,
( ~ defined(X1)
| equalish(multiply(multiplicative_identity,X1),X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_multiplication]) ).
cnf(c_0_13,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
c_0_11 ).
cnf(c_0_14,plain,
( ~ defined(X1)
| equalish(multiply(multiplicative_identity,X1),X1) ),
c_0_12 ).
cnf(c_0_15,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_16,plain,
( ~ equalish(X1,multiply(multiplicative_identity,X2))
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(multiply(X1,X2),multiply(X3,X2)) ),
c_0_15 ).
cnf(c_0_18,plain,
( ~ equalish(X1,multiplicative_identity)
| ~ defined(X2)
| equalish(multiply(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,X2),multiply(X2,X1)) ),
inference(fof_simplification,[status(thm)],[commutativity_multiplication]) ).
cnf(c_0_20,plain,
( ~ defined(X1)
| equalish(X1,additive_identity)
| equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_multiplication]) ).
cnf(c_0_21,negated_conjecture,
~ equalish(b,additive_identity),
inference(fof_simplification,[status(thm)],[b_not_equal_to_additive_identity_3]) ).
cnf(c_0_22,negated_conjecture,
~ equalish(multiply(a,multiply(b,multiplicative_inverse(b))),a),
inference(fof_simplification,[status(thm)],[multiply_not_equal_to_a_4]) ).
cnf(c_0_23,plain,
( ~ equalish(X3,multiplicative_identity)
| ~ equalish(X1,multiply(X3,X2))
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_24,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,X2),multiply(X2,X1)) ),
c_0_19 ).
cnf(c_0_25,plain,
( ~ defined(X1)
| equalish(X1,additive_identity)
| equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity) ),
c_0_20 ).
cnf(c_0_26,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_27,negated_conjecture,
~ equalish(b,additive_identity),
c_0_21 ).
cnf(c_0_28,plain,
( ~ defined(X1)
| equalish(X1,additive_identity)
| defined(multiplicative_inverse(X1)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_multiplicative_inverse]) ).
cnf(c_0_29,negated_conjecture,
~ equalish(multiply(a,multiply(b,multiplicative_inverse(b))),a),
c_0_22 ).
cnf(c_0_30,plain,
( ~ equalish(X2,multiplicative_identity)
| ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,X2),X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_32,hypothesis,
equalish(multiply(b,multiplicative_inverse(b)),multiplicative_identity),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_33,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(multiply(X1,X2)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_multiplication]) ).
cnf(c_0_34,plain,
( ~ defined(X1)
| equalish(X1,additive_identity)
| defined(multiplicative_inverse(X1)) ),
c_0_28 ).
cnf(c_0_35,negated_conjecture,
~ defined(multiply(b,multiplicative_inverse(b))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32])]) ).
cnf(c_0_36,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(multiply(X1,X2)) ),
c_0_33 ).
cnf(c_0_37,hypothesis,
defined(multiplicative_inverse(b)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_26]),c_0_27]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD004-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.38 % Computer : n018.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.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Mon Sep 21 15:38:29 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/0.43 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
% 15.51/2.75 % Version: 3.5.1
% 15.51/2.75 % Preprocessing class: FSMSSMSSSSSNFFN.
% 15.51/2.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.51/2.75 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 15.51/2.75 % Starting new_bool_3 with 300s (1) cores
% 15.51/2.75 % Starting new_bool_1 with 300s (1) cores
% 15.51/2.75 % Starting sh5l with 300s (1) cores
% 15.51/2.75 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2236006 completed with status 0
% 15.51/2.75 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 15.51/2.75 % Preprocessing class: FSMSSMSSSSSNFFN.
% 15.51/2.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.51/2.75 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 15.51/2.75 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 15.51/2.75 % No SInE strategy applied
% 15.51/2.75 % Search class: FGUNF-FFMS21-MFFFFFNN
% 15.51/2.75 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 15.51/2.75 % Starting SubtermCWHack with 136s (1) cores
% 15.51/2.75 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 15.51/2.75 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 254s (1) cores
% 15.51/2.75 % Starting new_bool_3 with 254s (1) cores
% 15.51/2.75 % Starting new_bool_1 with 254s (1) cores
% 15.51/2.75 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2236017 completed with status 0
% 15.51/2.75 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 15.51/2.75 % Preprocessing class: FSMSSMSSSSSNFFN.
% 15.51/2.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.51/2.75 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 15.51/2.75 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 15.51/2.75 % No SInE strategy applied
% 15.51/2.75 % Search class: FGUNF-FFMS21-MFFFFFNN
% 15.51/2.75 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 15.51/2.75 % Starting SubtermCWHack with 136s (1) cores
% 15.51/2.75 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 15.51/2.75 % Preprocessing time : 0.001 s
% 15.51/2.75 % Presaturation interreduction done
% 15.51/2.75
% 15.51/2.75 % Proof found!
% 15.51/2.75 % SZS status Unsatisfiable
% 15.51/2.75 % SZS output start CNFRefutation
% See solution above
% 15.51/2.75 % Parsed axioms : 31
% 15.51/2.75 % Removed by relevancy pruning/SinE : 0
% 15.51/2.75 % Initial clauses : 31
% 15.51/2.75 % Removed in clause preprocessing : 0
% 15.51/2.75 % Initial clauses in saturation : 31
% 15.51/2.75 % Processed clauses : 15137
% 15.51/2.75 % ...of these trivial : 114
% 15.51/2.75 % ...subsumed : 10334
% 15.51/2.75 % ...remaining for further processing : 4689
% 15.51/2.75 % Other redundant clauses eliminated : 0
% 15.51/2.75 % Clauses deleted for lack of memory : 0
% 15.51/2.75 % Backward-subsumed : 443
% 15.51/2.75 % Backward-rewritten : 21
% 15.51/2.75 % Generated clauses : 100004
% 15.51/2.75 % ...of the previous two non-redundant : 93902
% 15.51/2.75 % ...aggressively subsumed : 0
% 15.51/2.75 % Contextual simplify-reflections : 207
% 15.51/2.75 % Paramodulations : 99976
% 15.51/2.75 % Factorizations : 0
% 15.51/2.75 % NegExts : 0
% 15.51/2.75 % Equation resolutions : 0
% 15.51/2.75 % Disequality decompositions : 0
% 15.51/2.75 % Total rewrite steps : 32199
% 15.51/2.75 % ...of those cached : 31917
% 15.51/2.75 % Propositional unsat checks : 0
% 15.51/2.75 % Propositional check models : 0
% 15.51/2.75 % Propositional check unsatisfiable : 0
% 15.51/2.75 % Propositional clauses : 0
% 15.51/2.75 % Propositional clauses after purity: 0
% 15.51/2.75 % Propositional unsat core size : 0
% 15.51/2.75 % Propositional preprocessing time : 0.000
% 15.51/2.75 % Propositional encoding time : 0.000
% 15.51/2.75 % Propositional solver time : 0.000
% 15.51/2.75 % Success case prop preproc time : 0.000
% 15.51/2.75 % Success case prop encoding time : 0.000
% 15.51/2.75 % Success case prop solver time : 0.000
% 15.51/2.75 % Current number of processed clauses : 4166
% 15.51/2.75 % Positive orientable unit clauses : 296
% 15.51/2.75 % Positive unorientable unit clauses: 0
% 15.51/2.75 % Negative unit clauses : 173
% 15.51/2.75 % Non-unit-clauses : 3697
% 15.51/2.75 % Current number of unprocessed clauses: 78560
% 15.51/2.75 % ...number of literals in the above : 305165
% 15.51/2.75 % Current number of archived formulas : 0
% 15.51/2.75 % Current number of archived clauses : 523
% 15.51/2.75 % Clause-clause subsumption calls (NU) : 1336540
% 15.51/2.75 % Rec. Clause-clause subsumption calls : 932195
% 15.51/2.75 % Non-unit clause-clause subsumptions : 8476
% 15.51/2.75 % Unit Clause-clause subsumption calls : 71539
% 15.51/2.75 % Rewrite failures with RHS unbound : 0
% 15.51/2.75 % BW rewrite match attempts : 487
% 15.51/2.75 % BW rewrite match successes : 55
% 15.51/2.75 % Condensation attempts : 0
% 15.51/2.75 % Condensation successes : 0
% 15.51/2.75 % Termbank termtop insertions : 1694113
% 15.51/2.75 % Search garbage collected termcells : 73
% 15.51/2.75
% 15.51/2.75 % -------------------------------------------------
% 15.51/2.75 % User time : 2.170 s
% 15.51/2.75 % System time : 0.057 s
% 15.51/2.75 % Total time : 2.227 s
% 15.51/2.75 % Maximum resident set size: 3660 pages
% 15.51/2.75
% 15.51/2.75 % -------------------------------------------------
% 15.51/2.75 % User time : 10.726 s
% 15.51/2.75 % System time : 0.403 s
% 15.51/2.75 % Total time : 11.129 s
% 15.51/2.75 % Maximum resident set size: 4864 pages
% 15.51/2.75 % E exiting
%------------------------------------------------------------------------------