%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : FLD035-3 : 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 : n001.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:23:15 PM UTC 2026
% Result : Unsatisfiable 0.29s 0.79s
% Output : CNFRefutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of clauses : 50 ( 29 unt; 3 nHn; 50 RR)
% Number of literals : 89 ( 0 equ; 42 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 63 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(existence_of_identity_multiplication,axiom,
( ~ defined(X1)
| product(multiplicative_identity,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',existence_of_identity_multiplication) ).
cnf(associativity_multiplication_1,axiom,
( ~ product(X5,X6,X3)
| ~ product(X4,X6,X2)
| ~ product(X1,X4,X5)
| product(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',associativity_multiplication_1) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
cnf(commutativity_multiplication,axiom,
( ~ product(X2,X1,X3)
| product(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',commutativity_multiplication) ).
cnf(product_5,negated_conjecture,
product(a,c,u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_5) ).
cnf(associativity_multiplication_2,axiom,
( ~ product(X4,X6,X3)
| ~ product(X5,X2,X6)
| ~ product(X4,X5,X1)
| product(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',associativity_multiplication_2) ).
cnf(product_6,negated_conjecture,
product(b,c,u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_6) ).
cnf(existence_of_inverse_multiplication,axiom,
( ~ defined(X1)
| sum(additive_identity,X1,additive_identity)
| product(multiplicative_inverse(X1),X1,multiplicative_identity) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',existence_of_inverse_multiplication) ).
cnf(not_sum_7,negated_conjecture,
~ sum(additive_identity,c,additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_sum_7) ).
cnf(c_is_defined,hypothesis,
defined(c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_is_defined) ).
cnf(well_definedness_of_multiplicative_identity,axiom,
defined(multiplicative_identity),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',well_definedness_of_multiplicative_identity) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
cnf(not_product_8,negated_conjecture,
~ product(multiplicative_identity,a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_product_8) ).
cnf(c_0_13,plain,
( ~ defined(X1)
| product(multiplicative_identity,X1,X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_multiplication]) ).
cnf(c_0_14,plain,
( ~ product(X5,X6,X3)
| ~ product(X4,X6,X2)
| ~ product(X1,X4,X5)
| product(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[associativity_multiplication_1]) ).
cnf(c_0_15,plain,
( ~ defined(X1)
| product(multiplicative_identity,X1,X1) ),
c_0_13 ).
cnf(c_0_16,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_17,plain,
( ~ product(X2,X1,X3)
| product(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_multiplication]) ).
cnf(c_0_18,plain,
( ~ product(X5,X6,X3)
| ~ product(X4,X6,X2)
| ~ product(X1,X4,X5)
| product(X1,X2,X3) ),
c_0_14 ).
cnf(c_0_19,hypothesis,
product(multiplicative_identity,a,a),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( ~ product(X2,X1,X3)
| product(X1,X2,X3) ),
c_0_17 ).
cnf(c_0_21,negated_conjecture,
product(a,c,u),
product_5 ).
cnf(c_0_22,plain,
( ~ product(X4,X6,X3)
| ~ product(X5,X2,X6)
| ~ product(X4,X5,X1)
| product(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[associativity_multiplication_2]) ).
cnf(c_0_23,negated_conjecture,
product(b,c,u),
product_6 ).
cnf(c_0_24,hypothesis,
( ~ product(X1,X3,multiplicative_identity)
| ~ product(X3,a,X2)
| product(X1,X2,a) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
product(c,a,u),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
( ~ defined(X1)
| sum(additive_identity,X1,additive_identity)
| product(multiplicative_inverse(X1),X1,multiplicative_identity) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_multiplication]) ).
cnf(c_0_27,negated_conjecture,
~ sum(additive_identity,c,additive_identity),
inference(fof_simplification,[status(thm)],[not_sum_7]) ).
cnf(c_0_28,plain,
( ~ product(X4,X6,X3)
| ~ product(X5,X2,X6)
| ~ product(X4,X5,X1)
| product(X1,X2,X3) ),
c_0_22 ).
cnf(c_0_29,negated_conjecture,
product(c,b,u),
inference(spm,[status(thm)],[c_0_20,c_0_23]) ).
cnf(c_0_30,negated_conjecture,
( ~ product(X1,c,multiplicative_identity)
| product(X1,u,a) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( ~ defined(X1)
| sum(additive_identity,X1,additive_identity)
| product(multiplicative_inverse(X1),X1,multiplicative_identity) ),
c_0_26 ).
cnf(c_0_32,hypothesis,
defined(c),
c_is_defined ).
cnf(c_0_33,negated_conjecture,
~ sum(additive_identity,c,additive_identity),
c_0_27 ).
cnf(c_0_34,axiom,
defined(multiplicative_identity),
well_definedness_of_multiplicative_identity ).
cnf(c_0_35,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_36,negated_conjecture,
( ~ product(X3,c,X1)
| ~ product(X3,u,X2)
| product(X1,b,X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,negated_conjecture,
product(multiplicative_inverse(c),u,a),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]),c_0_33]) ).
cnf(c_0_38,plain,
product(multiplicative_identity,multiplicative_identity,multiplicative_identity),
inference(spm,[status(thm)],[c_0_15,c_0_34]) ).
cnf(c_0_39,hypothesis,
product(multiplicative_identity,b,b),
inference(spm,[status(thm)],[c_0_15,c_0_35]) ).
cnf(c_0_40,negated_conjecture,
( ~ product(multiplicative_inverse(c),c,X1)
| product(X1,b,a) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
( ~ product(X3,multiplicative_identity,X1)
| ~ product(X3,multiplicative_identity,X2)
| product(X1,multiplicative_identity,X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_38]) ).
cnf(c_0_42,hypothesis,
product(b,multiplicative_identity,b),
inference(spm,[status(thm)],[c_0_20,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
product(multiplicative_identity,b,a),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_31]),c_0_32])]),c_0_33]) ).
cnf(c_0_44,hypothesis,
( ~ product(b,multiplicative_identity,X1)
| product(X1,multiplicative_identity,b) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
product(b,multiplicative_identity,a),
inference(spm,[status(thm)],[c_0_20,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
~ product(multiplicative_identity,a,b),
inference(fof_simplification,[status(thm)],[not_product_8]) ).
cnf(c_0_47,hypothesis,
product(a,multiplicative_identity,b),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,negated_conjecture,
~ product(multiplicative_identity,a,b),
c_0_46 ).
cnf(c_0_49,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_47]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : FLD035-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.49 % Computer : n001.cluster.edu
% 0.20/0.49 % Model : x86_64 x86_64
% 0.20/0.49 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.49 % Memory : 8046.5625MB
% 0.20/0.49 % OS : Linux 6.8.0-71-generic
% 0.20/0.49 % CPULimit : 300
% 0.20/0.49 % WCLimit : 300
% 0.20/0.49 % DateTime : Mon Sep 21 15:45:00 UTC 2026
% 0.20/0.49 % CPUTime :
% 0.20/0.49 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.58 Running first-order theorem proving
% 0.23/0.58 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.29/0.79 % Version: 3.5.1
% 0.29/0.79 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.29/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.29/0.79 % Starting new_bool_3 with 300s (1) cores
% 0.29/0.79 % Starting new_bool_1 with 300s (1) cores
% 0.29/0.79 % Starting sh5l with 300s (1) cores
% 0.29/0.79 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3490886 completed with status 0
% 0.29/0.79 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.29/0.79 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.29/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.29/0.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.29/0.79 % No SInE strategy applied
% 0.29/0.79 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.29/0.79 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.29/0.79 % Starting SubtermCWHack with 136s (1) cores
% 0.29/0.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.29/0.79 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 0.29/0.79 % Starting new_bool_3 with 269s (1) cores
% 0.29/0.79 % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 0.29/0.79 % G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with pid 3490896 completed with status 0
% 0.29/0.79 % Result found by G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN
% 0.29/0.79 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.29/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.29/0.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.29/0.79 % No SInE strategy applied
% 0.29/0.79 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.29/0.79 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.29/0.79 % Starting SubtermCWHack with 136s (1) cores
% 0.29/0.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.29/0.79 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 0.29/0.79 % Starting new_bool_3 with 269s (1) cores
% 0.29/0.79 % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 0.29/0.79 % Preprocessing time : 0.002 s
% 0.29/0.79 % Presaturation interreduction done
% 0.29/0.79
% 0.29/0.79 % Proof found!
% 0.29/0.79 % SZS status Unsatisfiable
% 0.29/0.79 % SZS output start CNFRefutation
% See solution above
% 0.29/0.79 % Parsed axioms : 34
% 0.29/0.79 % Removed by relevancy pruning/SinE : 0
% 0.29/0.79 % Initial clauses : 34
% 0.29/0.79 % Removed in clause preprocessing : 0
% 0.29/0.79 % Initial clauses in saturation : 34
% 0.29/0.79 % Processed clauses : 995
% 0.29/0.79 % ...of these trivial : 5
% 0.29/0.79 % ...subsumed : 44
% 0.29/0.79 % ...remaining for further processing : 946
% 0.29/0.79 % Other redundant clauses eliminated : 0
% 0.29/0.79 % Clauses deleted for lack of memory : 0
% 0.29/0.79 % Backward-subsumed : 0
% 0.29/0.79 % Backward-rewritten : 0
% 0.29/0.79 % Generated clauses : 7301
% 0.29/0.79 % ...of the previous two non-redundant : 6657
% 0.29/0.79 % ...aggressively subsumed : 0
% 0.29/0.79 % Contextual simplify-reflections : 0
% 0.29/0.79 % Paramodulations : 7301
% 0.29/0.79 % Factorizations : 0
% 0.29/0.79 % NegExts : 0
% 0.29/0.79 % Equation resolutions : 0
% 0.29/0.79 % Disequality decompositions : 0
% 0.29/0.79 % Total rewrite steps : 2470
% 0.29/0.79 % ...of those cached : 2208
% 0.29/0.79 % Propositional unsat checks : 0
% 0.29/0.79 % Propositional check models : 0
% 0.29/0.79 % Propositional check unsatisfiable : 0
% 0.29/0.79 % Propositional clauses : 0
% 0.29/0.79 % Propositional clauses after purity: 0
% 0.29/0.79 % Propositional unsat core size : 0
% 0.29/0.79 % Propositional preprocessing time : 0.000
% 0.29/0.79 % Propositional encoding time : 0.000
% 0.29/0.79 % Propositional solver time : 0.000
% 0.29/0.79 % Success case prop preproc time : 0.000
% 0.29/0.79 % Success case prop encoding time : 0.000
% 0.29/0.79 % Success case prop solver time : 0.000
% 0.29/0.79 % Current number of processed clauses : 912
% 0.29/0.79 % Positive orientable unit clauses : 354
% 0.29/0.79 % Positive unorientable unit clauses: 0
% 0.29/0.79 % Negative unit clauses : 3
% 0.29/0.79 % Non-unit-clauses : 555
% 0.29/0.79 % Current number of unprocessed clauses: 5729
% 0.29/0.79 % ...number of literals in the above : 19523
% 0.29/0.79 % Current number of archived formulas : 0
% 0.29/0.79 % Current number of archived clauses : 34
% 0.29/0.79 % Clause-clause subsumption calls (NU) : 9674
% 0.29/0.79 % Rec. Clause-clause subsumption calls : 7909
% 0.29/0.79 % Non-unit clause-clause subsumptions : 44
% 0.29/0.79 % Unit Clause-clause subsumption calls : 1111
% 0.29/0.79 % Rewrite failures with RHS unbound : 0
% 0.29/0.79 % BW rewrite match attempts : 179
% 0.29/0.79 % BW rewrite match successes : 0
% 0.29/0.79 % Condensation attempts : 0
% 0.29/0.79 % Condensation successes : 0
% 0.29/0.79 % Termbank termtop insertions : 114643
% 0.29/0.79 % Search garbage collected termcells : 118
% 0.29/0.79
% 0.29/0.79 % -------------------------------------------------
% 0.29/0.79 % User time : 0.122 s
% 0.29/0.79 % System time : 0.016 s
% 0.29/0.79 % Total time : 0.137 s
% 0.29/0.79 % Maximum resident set size: 3660 pages
% 0.29/0.79
% 0.29/0.79 % -------------------------------------------------
% 0.29/0.79 % User time : 0.523 s
% 0.29/0.79 % System time : 0.053 s
% 0.29/0.79 % Total time : 0.576 s
% 0.29/0.79 % Maximum resident set size: 4608 pages
% 0.29/0.79 % E exiting
%------------------------------------------------------------------------------