%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD031-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 : n013.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:45 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.44s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 37 ( 15 unt; 6 nHn; 37 RR)
% Number of literals : 72 ( 0 equ; 35 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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(a_not_equal_to_additive_identity_3,negated_conjecture,
~ equalish(a,additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_not_equal_to_additive_identity_3) ).
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(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_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(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(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(symmetry_of_equality,axiom,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
cnf(a_equals_multiplicative_identity_2,negated_conjecture,
equalish(a,multiplicative_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_equals_multiplicative_identity_2) ).
cnf(multiplicative_inverses_not_equal,negated_conjecture,
~ equalish(multiplicative_inverse(a),multiplicative_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_inverses_not_equal) ).
cnf(c_0_10,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_11,negated_conjecture,
~ equalish(a,additive_identity),
inference(fof_simplification,[status(thm)],[a_not_equal_to_additive_identity_3]) ).
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,
( ~ defined(X1)
| equalish(X1,additive_identity)
| equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity) ),
c_0_10 ).
cnf(c_0_14,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_15,negated_conjecture,
~ equalish(a,additive_identity),
c_0_11 ).
cnf(c_0_16,plain,
( ~ defined(X1)
| equalish(X1,additive_identity)
| defined(multiplicative_inverse(X1)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_multiplicative_inverse]) ).
cnf(c_0_17,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
c_0_12 ).
cnf(c_0_18,hypothesis,
equalish(multiply(a,multiplicative_inverse(a)),multiplicative_identity),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_19,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_20,plain,
( ~ defined(X1)
| equalish(X1,additive_identity)
| defined(multiplicative_inverse(X1)) ),
c_0_16 ).
cnf(c_0_21,plain,
( ~ defined(X1)
| equalish(multiply(multiplicative_identity,X1),X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_multiplication]) ).
cnf(c_0_22,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_23,hypothesis,
( ~ equalish(X1,multiply(a,multiplicative_inverse(a)))
| equalish(X1,multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(multiply(X1,X2),multiply(X3,X2)) ),
c_0_19 ).
cnf(c_0_25,hypothesis,
defined(multiplicative_inverse(a)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_14]),c_0_15]) ).
cnf(c_0_26,plain,
( ~ defined(X1)
| equalish(multiply(multiplicative_identity,X1),X1) ),
c_0_21 ).
cnf(c_0_27,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_22 ).
cnf(c_0_28,hypothesis,
( ~ equalish(X1,a)
| equalish(multiply(X1,multiplicative_inverse(a)),multiplicative_identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_29,negated_conjecture,
equalish(a,multiplicative_identity),
a_equals_multiplicative_identity_2 ).
cnf(c_0_30,plain,
( ~ equalish(X1,multiply(multiplicative_identity,X2))
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_26]) ).
cnf(c_0_31,hypothesis,
( ~ equalish(X1,a)
| equalish(multiplicative_identity,multiply(X1,multiplicative_inverse(a))) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
equalish(multiplicative_identity,a),
inference(spm,[status(thm)],[c_0_27,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
~ equalish(multiplicative_inverse(a),multiplicative_identity),
inference(fof_simplification,[status(thm)],[multiplicative_inverses_not_equal]) ).
cnf(c_0_34,hypothesis,
equalish(multiplicative_identity,multiplicative_inverse(a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_25]),c_0_32])]) ).
cnf(c_0_35,negated_conjecture,
~ equalish(multiplicative_inverse(a),multiplicative_identity),
c_0_33 ).
cnf(c_0_36,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_34]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : FLD031-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.10/0.37 % Computer : n013.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:38:52 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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.14/0.44 % Version: 3.5.1
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.44 % Starting sh5l with 300s (1) cores
% 0.14/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1106122 completed with status 0
% 0.14/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.44 % No SInE strategy applied
% 0.14/0.44 % Search class: FGUNF-FFMS21-SFFFFFNN
% 0.14/0.44 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.44 % Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.14/0.44 % Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.44 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.44 % U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 1106132 completed with status 0
% 0.14/0.44 % Result found by U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.44 % No SInE strategy applied
% 0.14/0.44 % Search class: FGUNF-FFMS21-SFFFFFNN
% 0.14/0.44 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.44 % Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.14/0.44 % Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.44 % Preprocessing time : 0.001 s
% 0.14/0.44 % Presaturation interreduction done
% 0.14/0.44
% 0.14/0.44 % Proof found!
% 0.14/0.44 % SZS status Unsatisfiable
% 0.14/0.44 % SZS output start CNFRefutation
% See solution above
% 0.14/0.44 % Parsed axioms : 31
% 0.14/0.44 % Removed by relevancy pruning/SinE : 0
% 0.14/0.44 % Initial clauses : 31
% 0.14/0.44 % Removed in clause preprocessing : 0
% 0.14/0.44 % Initial clauses in saturation : 31
% 0.14/0.44 % Processed clauses : 155
% 0.14/0.44 % ...of these trivial : 0
% 0.14/0.44 % ...subsumed : 11
% 0.14/0.44 % ...remaining for further processing : 144
% 0.14/0.44 % Other redundant clauses eliminated : 0
% 0.14/0.44 % Clauses deleted for lack of memory : 0
% 0.14/0.44 % Backward-subsumed : 0
% 0.14/0.44 % Backward-rewritten : 0
% 0.14/0.44 % Generated clauses : 333
% 0.14/0.44 % ...of the previous two non-redundant : 252
% 0.14/0.44 % ...aggressively subsumed : 0
% 0.14/0.44 % Contextual simplify-reflections : 0
% 0.14/0.44 % Paramodulations : 333
% 0.14/0.44 % Factorizations : 0
% 0.14/0.44 % NegExts : 0
% 0.14/0.44 % Equation resolutions : 0
% 0.14/0.44 % Disequality decompositions : 0
% 0.14/0.44 % Total rewrite steps : 114
% 0.14/0.44 % ...of those cached : 86
% 0.14/0.44 % Propositional unsat checks : 0
% 0.14/0.44 % Propositional check models : 0
% 0.14/0.44 % Propositional check unsatisfiable : 0
% 0.14/0.44 % Propositional clauses : 0
% 0.14/0.44 % Propositional clauses after purity: 0
% 0.14/0.44 % Propositional unsat core size : 0
% 0.14/0.44 % Propositional preprocessing time : 0.000
% 0.14/0.44 % Propositional encoding time : 0.000
% 0.14/0.44 % Propositional solver time : 0.000
% 0.14/0.44 % Success case prop preproc time : 0.000
% 0.14/0.44 % Success case prop encoding time : 0.000
% 0.14/0.44 % Success case prop solver time : 0.000
% 0.14/0.44 % Current number of processed clauses : 113
% 0.14/0.44 % Positive orientable unit clauses : 49
% 0.14/0.44 % Positive unorientable unit clauses: 0
% 0.14/0.44 % Negative unit clauses : 3
% 0.14/0.44 % Non-unit-clauses : 61
% 0.14/0.44 % Current number of unprocessed clauses: 159
% 0.14/0.44 % ...number of literals in the above : 469
% 0.14/0.44 % Current number of archived formulas : 0
% 0.14/0.44 % Current number of archived clauses : 31
% 0.14/0.44 % Clause-clause subsumption calls (NU) : 450
% 0.14/0.44 % Rec. Clause-clause subsumption calls : 410
% 0.14/0.44 % Non-unit clause-clause subsumptions : 11
% 0.14/0.44 % Unit Clause-clause subsumption calls : 167
% 0.14/0.44 % Rewrite failures with RHS unbound : 0
% 0.14/0.44 % BW rewrite match attempts : 0
% 0.14/0.44 % BW rewrite match successes : 0
% 0.14/0.44 % Condensation attempts : 0
% 0.14/0.44 % Condensation successes : 0
% 0.14/0.44 % Termbank termtop insertions : 5179
% 0.14/0.44 % Search garbage collected termcells : 73
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.010 s
% 0.14/0.44 % System time : 0.005 s
% 0.14/0.44 % Total time : 0.015 s
% 0.14/0.44 % Maximum resident set size: 3660 pages
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.056 s
% 0.14/0.44 % System time : 0.018 s
% 0.14/0.44 % Total time : 0.075 s
% 0.14/0.44 % Maximum resident set size: 4864 pages
% 0.14/0.44 % E exiting
%------------------------------------------------------------------------------