%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD010-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:38 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.44s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 29 ( 10 unt; 9 nHn; 29 RR)
% Number of literals : 58 ( 0 equ; 26 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 26 ( 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/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_inverse_multiplication) ).
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(well_definedness_of_multiplicative_identity,axiom,
defined(multiplicative_identity),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_multiplicative_identity) ).
cnf(symmetry_of_equality,axiom,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
cnf(existence_of_identity_multiplication,axiom,
( ~ defined(X1)
| equalish(multiply(multiplicative_identity,X1),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_identity_multiplication) ).
cnf(well_definedness_of_multiplicative_inverse,axiom,
( ~ defined(X1)
| equalish(X1,additive_identity)
| defined(multiplicative_inverse(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_multiplicative_inverse) ).
cnf(multiplicative_inv_not_equal_to_multiplicative_id_2,negated_conjecture,
~ equalish(multiplicative_inverse(multiplicative_identity),multiplicative_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_inv_not_equal_to_multiplicative_id_2) ).
cnf(different_identities,axiom,
~ equalish(additive_identity,multiplicative_identity),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',different_identities) ).
cnf(c_0_8,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_9,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_equality]) ).
cnf(c_0_10,plain,
( ~ defined(X1)
| equalish(X1,additive_identity)
| equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity) ),
c_0_8 ).
cnf(c_0_11,axiom,
defined(multiplicative_identity),
well_definedness_of_multiplicative_identity ).
cnf(c_0_12,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_13,plain,
( ~ defined(X1)
| equalish(multiply(multiplicative_identity,X1),X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_multiplication]) ).
cnf(c_0_14,plain,
( ~ defined(X1)
| equalish(X1,additive_identity)
| defined(multiplicative_inverse(X1)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_multiplicative_inverse]) ).
cnf(c_0_15,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
c_0_9 ).
cnf(c_0_16,plain,
( equalish(multiplicative_identity,additive_identity)
| equalish(multiply(multiplicative_identity,multiplicative_inverse(multiplicative_identity)),multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_12 ).
cnf(c_0_18,plain,
( ~ defined(X1)
| equalish(multiply(multiplicative_identity,X1),X1) ),
c_0_13 ).
cnf(c_0_19,negated_conjecture,
~ equalish(multiplicative_inverse(multiplicative_identity),multiplicative_identity),
inference(fof_simplification,[status(thm)],[multiplicative_inv_not_equal_to_multiplicative_id_2]) ).
cnf(c_0_20,plain,
( ~ defined(X1)
| equalish(X1,additive_identity)
| defined(multiplicative_inverse(X1)) ),
c_0_14 ).
cnf(c_0_21,plain,
( ~ equalish(X1,multiply(multiplicative_identity,multiplicative_inverse(multiplicative_identity)))
| equalish(X1,multiplicative_identity)
| equalish(multiplicative_identity,additive_identity) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( ~ defined(X1)
| equalish(X1,multiply(multiplicative_identity,X1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
~ equalish(multiplicative_inverse(multiplicative_identity),multiplicative_identity),
c_0_19 ).
cnf(c_0_24,plain,
( equalish(multiplicative_identity,additive_identity)
| defined(multiplicative_inverse(multiplicative_identity)) ),
inference(spm,[status(thm)],[c_0_20,c_0_11]) ).
cnf(c_0_25,plain,
~ equalish(additive_identity,multiplicative_identity),
inference(fof_simplification,[status(thm)],[different_identities]) ).
cnf(c_0_26,plain,
equalish(multiplicative_identity,additive_identity),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24]) ).
cnf(c_0_27,plain,
~ equalish(additive_identity,multiplicative_identity),
c_0_25 ).
cnf(c_0_28,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_26]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD010-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n017.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:32:13 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 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.10/0.44 % Version: 3.5.1
% 0.10/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.44 % Starting sh5l with 300s (1) cores
% 0.10/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2658322 completed with status 0
% 0.10/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.44 % No SInE strategy applied
% 0.10/0.44 % Search class: FGUNF-FFMF21-SFFFFFNN
% 0.10/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.44 % Starting G-E--_200_C45_F1_SE_CS_SP_PI_CO_S0V with 136s (1) cores
% 0.10/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.10/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2658328 completed with status 0
% 0.10/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.44 % No SInE strategy applied
% 0.10/0.44 % Search class: FGUNF-FFMF21-SFFFFFNN
% 0.10/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.44 % Preprocessing time : 0.001 s
% 0.10/0.44 % Presaturation interreduction done
% 0.10/0.44
% 0.10/0.44 % Proof found!
% 0.10/0.44 % SZS status Unsatisfiable
% 0.10/0.44 % SZS output start CNFRefutation
% See solution above
% 0.10/0.44 % Parsed axioms : 28
% 0.10/0.44 % Removed by relevancy pruning/SinE : 0
% 0.10/0.44 % Initial clauses : 28
% 0.10/0.44 % Removed in clause preprocessing : 0
% 0.10/0.44 % Initial clauses in saturation : 28
% 0.10/0.44 % Processed clauses : 69
% 0.10/0.44 % ...of these trivial : 0
% 0.10/0.44 % ...subsumed : 4
% 0.10/0.44 % ...remaining for further processing : 65
% 0.10/0.44 % Other redundant clauses eliminated : 0
% 0.10/0.44 % Clauses deleted for lack of memory : 0
% 0.10/0.44 % Backward-subsumed : 0
% 0.10/0.44 % Backward-rewritten : 7
% 0.10/0.44 % Generated clauses : 70
% 0.10/0.44 % ...of the previous two non-redundant : 66
% 0.10/0.44 % ...aggressively subsumed : 0
% 0.10/0.44 % Contextual simplify-reflections : 1
% 0.10/0.44 % Paramodulations : 70
% 0.10/0.44 % Factorizations : 0
% 0.10/0.44 % NegExts : 0
% 0.10/0.44 % Equation resolutions : 0
% 0.10/0.44 % Disequality decompositions : 0
% 0.10/0.44 % Total rewrite steps : 8
% 0.10/0.44 % ...of those cached : 6
% 0.10/0.44 % Propositional unsat checks : 0
% 0.10/0.44 % Propositional check models : 0
% 0.10/0.44 % Propositional check unsatisfiable : 0
% 0.10/0.44 % Propositional clauses : 0
% 0.10/0.44 % Propositional clauses after purity: 0
% 0.10/0.44 % Propositional unsat core size : 0
% 0.10/0.44 % Propositional preprocessing time : 0.000
% 0.10/0.44 % Propositional encoding time : 0.000
% 0.10/0.44 % Propositional solver time : 0.000
% 0.10/0.44 % Success case prop preproc time : 0.000
% 0.10/0.44 % Success case prop encoding time : 0.000
% 0.10/0.44 % Success case prop solver time : 0.000
% 0.10/0.44 % Current number of processed clauses : 30
% 0.10/0.44 % Positive orientable unit clauses : 3
% 0.10/0.44 % Positive unorientable unit clauses: 0
% 0.10/0.44 % Negative unit clauses : 2
% 0.10/0.44 % Non-unit-clauses : 25
% 0.10/0.44 % Current number of unprocessed clauses: 53
% 0.10/0.44 % ...number of literals in the above : 193
% 0.10/0.44 % Current number of archived formulas : 0
% 0.10/0.44 % Current number of archived clauses : 35
% 0.10/0.44 % Clause-clause subsumption calls (NU) : 171
% 0.10/0.44 % Rec. Clause-clause subsumption calls : 147
% 0.10/0.44 % Non-unit clause-clause subsumptions : 5
% 0.10/0.44 % Unit Clause-clause subsumption calls : 1
% 0.10/0.44 % Rewrite failures with RHS unbound : 0
% 0.10/0.44 % BW rewrite match attempts : 1
% 0.10/0.44 % BW rewrite match successes : 1
% 0.10/0.44 % Condensation attempts : 0
% 0.10/0.44 % Condensation successes : 0
% 0.10/0.44 % Termbank termtop insertions : 2176
% 0.10/0.44 % Search garbage collected termcells : 71
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.006 s
% 0.10/0.44 % System time : 0.001 s
% 0.10/0.44 % Total time : 0.007 s
% 0.10/0.44 % Maximum resident set size: 3660 pages
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.018 s
% 0.10/0.44 % System time : 0.010 s
% 0.10/0.44 % Total time : 0.029 s
% 0.10/0.44 % Maximum resident set size: 4608 pages
% 0.10/0.44 % E exiting
%------------------------------------------------------------------------------