%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD050-4 : 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:22:51 PM UTC 2026
% Result : Unsatisfiable 0.20s 5.60s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of clauses : 51 ( 31 unt; 3 nHn; 51 RR)
% Number of literals : 83 ( 0 equ; 38 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 : 9 ( 9 usr; 8 con; 0-1 aty)
% Number of variables : 47 ( 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(c_is_defined,hypothesis,
defined(c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_is_defined) ).
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_10,negated_conjecture,
product(a,d,k),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_10) ).
cnf(product_11,negated_conjecture,
product(b,c,k),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_11) ).
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,b,additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_sum_7) ).
cnf(not_sum_8,negated_conjecture,
~ sum(additive_identity,d,additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_sum_8) ).
cnf(product_9,negated_conjecture,
product(a,multiplicative_inverse(b),s),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_9) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
cnf(d_is_defined,hypothesis,
defined(d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d_is_defined) ).
cnf(not_product_12,negated_conjecture,
~ product(c,multiplicative_inverse(d),s),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_product_12) ).
cnf(c_0_14,plain,
( ~ defined(X1)
| product(multiplicative_identity,X1,X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_multiplication]) ).
cnf(c_0_15,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_16,plain,
( ~ defined(X1)
| product(multiplicative_identity,X1,X1) ),
c_0_14 ).
cnf(c_0_17,hypothesis,
defined(c),
c_is_defined ).
cnf(c_0_18,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_19,plain,
( ~ product(X2,X1,X3)
| product(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_multiplication]) ).
cnf(c_0_20,plain,
( ~ product(X5,X6,X3)
| ~ product(X4,X6,X2)
| ~ product(X1,X4,X5)
| product(X1,X2,X3) ),
c_0_15 ).
cnf(c_0_21,hypothesis,
product(multiplicative_identity,c,c),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,hypothesis,
product(multiplicative_identity,a,a),
inference(spm,[status(thm)],[c_0_16,c_0_18]) ).
cnf(c_0_23,plain,
( ~ product(X2,X1,X3)
| product(X1,X2,X3) ),
c_0_19 ).
cnf(c_0_24,negated_conjecture,
product(a,d,k),
product_10 ).
cnf(c_0_25,hypothesis,
( ~ product(X1,X3,multiplicative_identity)
| ~ product(X3,c,X2)
| product(X1,X2,c) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
product(b,c,k),
product_11 ).
cnf(c_0_27,hypothesis,
( ~ product(X1,X3,multiplicative_identity)
| ~ product(X3,a,X2)
| product(X1,X2,a) ),
inference(spm,[status(thm)],[c_0_20,c_0_22]) ).
cnf(c_0_28,negated_conjecture,
product(d,a,k),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,negated_conjecture,
( ~ product(X1,b,multiplicative_identity)
| product(X1,k,c) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,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_31,negated_conjecture,
~ sum(additive_identity,b,additive_identity),
inference(fof_simplification,[status(thm)],[not_sum_7]) ).
cnf(c_0_32,negated_conjecture,
( ~ product(X1,d,multiplicative_identity)
| product(X1,k,a) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
~ sum(additive_identity,d,additive_identity),
inference(fof_simplification,[status(thm)],[not_sum_8]) ).
cnf(c_0_34,negated_conjecture,
product(a,multiplicative_inverse(b),s),
product_9 ).
cnf(c_0_35,negated_conjecture,
( ~ product(X1,b,multiplicative_identity)
| product(k,X1,c) ),
inference(spm,[status(thm)],[c_0_23,c_0_29]) ).
cnf(c_0_36,plain,
( ~ defined(X1)
| sum(additive_identity,X1,additive_identity)
| product(multiplicative_inverse(X1),X1,multiplicative_identity) ),
c_0_30 ).
cnf(c_0_37,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_38,negated_conjecture,
~ sum(additive_identity,b,additive_identity),
c_0_31 ).
cnf(c_0_39,negated_conjecture,
( ~ product(X1,d,multiplicative_identity)
| product(k,X1,a) ),
inference(spm,[status(thm)],[c_0_23,c_0_32]) ).
cnf(c_0_40,hypothesis,
defined(d),
d_is_defined ).
cnf(c_0_41,negated_conjecture,
~ sum(additive_identity,d,additive_identity),
c_0_33 ).
cnf(c_0_42,negated_conjecture,
( ~ product(X1,X3,a)
| ~ product(X3,multiplicative_inverse(b),X2)
| product(X1,X2,s) ),
inference(spm,[status(thm)],[c_0_20,c_0_34]) ).
cnf(c_0_43,negated_conjecture,
product(k,multiplicative_inverse(b),c),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]),c_0_38]) ).
cnf(c_0_44,negated_conjecture,
product(k,multiplicative_inverse(d),a),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_36]),c_0_40])]),c_0_41]) ).
cnf(c_0_45,negated_conjecture,
( ~ product(X1,k,a)
| product(X1,c,s) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
product(multiplicative_inverse(d),k,a),
inference(spm,[status(thm)],[c_0_23,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
~ product(c,multiplicative_inverse(d),s),
inference(fof_simplification,[status(thm)],[not_product_12]) ).
cnf(c_0_48,negated_conjecture,
product(multiplicative_inverse(d),c,s),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,negated_conjecture,
~ product(c,multiplicative_inverse(d),s),
c_0_47 ).
cnf(c_0_50,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_48]),c_0_49]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : FLD050-4 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/5.44 % Computer : n001.cluster.edu
% 0.17/5.44 % Model : x86_64 x86_64
% 0.17/5.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/5.44 % Memory : 8046.5625MB
% 0.17/5.44 % OS : Linux 6.8.0-71-generic
% 0.17/5.44 % CPULimit : 300
% 0.17/5.44 % WCLimit : 300
% 0.17/5.44 % DateTime : Mon Sep 21 15:47:50 UTC 2026
% 0.17/5.44 % CPUTime :
% 0.17/5.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/5.51 Running first-order theorem proving
% 0.20/5.51 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.20/5.60 % Version: 3.5.1
% 0.20/5.60 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/5.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/5.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/5.60 % Starting new_bool_3 with 300s (1) cores
% 0.20/5.60 % Starting new_bool_1 with 300s (1) cores
% 0.20/5.60 % Starting sh5l with 300s (1) cores
% 0.20/5.60 % new_bool_1 with pid 3494573 completed with status 0
% 0.20/5.60 % Result found by new_bool_1
% 0.20/5.60 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/5.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/5.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/5.60 % Starting new_bool_3 with 300s (1) cores
% 0.20/5.60 % Starting new_bool_1 with 300s (1) cores
% 0.20/5.60 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.20/5.60 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/5.60 % Search class: FGUNF-FFSM11-SFFFFFNN
% 0.20/5.60 % partial match(1): FGUNF-FFSF11-SFFFFFNN
% 0.20/5.60 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/5.60 % Starting SubtermCWHack with 31s (1) cores
% 0.20/5.60 % SubtermCWHack with pid 3494577 completed with status 0
% 0.20/5.60 % Result found by SubtermCWHack
% 0.20/5.60 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/5.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/5.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/5.60 % Starting new_bool_3 with 300s (1) cores
% 0.20/5.60 % Starting new_bool_1 with 300s (1) cores
% 0.20/5.60 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.20/5.60 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/5.60 % Search class: FGUNF-FFSM11-SFFFFFNN
% 0.20/5.60 % partial match(1): FGUNF-FFSF11-SFFFFFNN
% 0.20/5.60 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/5.60 % Starting SubtermCWHack with 31s (1) cores
% 0.20/5.60 % Preprocessing time : 0.002 s
% 0.20/5.60
% 0.20/5.60 % Proof found!
% 0.20/5.60 % SZS status Unsatisfiable
% 0.20/5.60 % SZS output start CNFRefutation
% See solution above
% 0.20/5.60 % Parsed axioms : 38
% 0.20/5.60 % Removed by relevancy pruning/SinE : 11
% 0.20/5.60 % Initial clauses : 27
% 0.20/5.60 % Removed in clause preprocessing : 0
% 0.20/5.60 % Initial clauses in saturation : 27
% 0.20/5.60 % Processed clauses : 171
% 0.20/5.60 % ...of these trivial : 0
% 0.20/5.60 % ...subsumed : 23
% 0.20/5.60 % ...remaining for further processing : 148
% 0.20/5.60 % Other redundant clauses eliminated : 0
% 0.20/5.60 % Clauses deleted for lack of memory : 0
% 0.20/5.60 % Backward-subsumed : 0
% 0.20/5.60 % Backward-rewritten : 0
% 0.20/5.60 % Generated clauses : 531
% 0.20/5.60 % ...of the previous two non-redundant : 418
% 0.20/5.60 % ...aggressively subsumed : 0
% 0.20/5.60 % Contextual simplify-reflections : 0
% 0.20/5.60 % Paramodulations : 531
% 0.20/5.60 % Factorizations : 0
% 0.20/5.60 % NegExts : 0
% 0.20/5.60 % Equation resolutions : 0
% 0.20/5.60 % Disequality decompositions : 0
% 0.20/5.60 % Total rewrite steps : 98
% 0.20/5.60 % ...of those cached : 68
% 0.20/5.60 % Propositional unsat checks : 0
% 0.20/5.60 % Propositional check models : 0
% 0.20/5.60 % Propositional check unsatisfiable : 0
% 0.20/5.60 % Propositional clauses : 0
% 0.20/5.60 % Propositional clauses after purity: 0
% 0.20/5.60 % Propositional unsat core size : 0
% 0.20/5.60 % Propositional preprocessing time : 0.000
% 0.20/5.60 % Propositional encoding time : 0.000
% 0.20/5.60 % Propositional solver time : 0.000
% 0.20/5.60 % Success case prop preproc time : 0.000
% 0.20/5.60 % Success case prop encoding time : 0.000
% 0.20/5.60 % Success case prop solver time : 0.000
% 0.20/5.60 % Current number of processed clauses : 148
% 0.20/5.60 % Positive orientable unit clauses : 35
% 0.20/5.60 % Positive unorientable unit clauses: 0
% 0.20/5.60 % Negative unit clauses : 4
% 0.20/5.60 % Non-unit-clauses : 109
% 0.20/5.60 % Current number of unprocessed clauses: 274
% 0.20/5.60 % ...number of literals in the above : 1008
% 0.20/5.60 % Current number of archived formulas : 0
% 0.20/5.60 % Current number of archived clauses : 0
% 0.20/5.60 % Clause-clause subsumption calls (NU) : 1600
% 0.20/5.60 % Rec. Clause-clause subsumption calls : 1328
% 0.20/5.60 % Non-unit clause-clause subsumptions : 23
% 0.20/5.60 % Unit Clause-clause subsumption calls : 31
% 0.20/5.60 % Rewrite failures with RHS unbound : 0
% 0.20/5.60 % BW rewrite match attempts : 1
% 0.20/5.60 % BW rewrite match successes : 0
% 0.20/5.60 % Condensation attempts : 0
% 0.20/5.60 % Condensation successes : 0
% 0.20/5.60 % Termbank termtop insertions : 7463
% 0.20/5.60 % Search garbage collected termcells : 144
% 0.20/5.60
% 0.20/5.60 % -------------------------------------------------
% 0.20/5.60 % User time : 0.026 s
% 0.20/5.60 % System time : 0.003 s
% 0.20/5.60 % Total time : 0.029 s
% 0.20/5.60 % Maximum resident set size: 3664 pages
% 0.20/5.60
% 0.20/5.60 % -------------------------------------------------
% 0.20/5.60 % User time : 0.028 s
% 0.20/5.60 % System time : 0.010 s
% 0.20/5.60 % Total time : 0.038 s
% 0.20/5.60 % Maximum resident set size: 4608 pages
% 0.20/5.60 % E exiting
%------------------------------------------------------------------------------