%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD027-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:44 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.43s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 40 ( 22 unt; 4 nHn; 40 RR)
% Number of literals : 70 ( 0 equ; 35 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 : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 43 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(existence_of_identity_multiplication,axiom,
( ~ defined(X1)
| product(multiplicative_identity,X1,X1) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/FLD002-0.ax',associativity_multiplication_1) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined) ).
cnf(well_definedness_of_multiplicative_identity,axiom,
defined(multiplicative_identity),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',well_definedness_of_multiplicative_identity) ).
cnf(commutativity_multiplication,axiom,
( ~ product(X2,X1,X3)
| product(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',commutativity_multiplication) ).
cnf(existence_of_inverse_multiplication,axiom,
( ~ defined(X1)
| sum(additive_identity,X1,additive_identity)
| product(multiplicative_inverse(X1),X1,multiplicative_identity) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',existence_of_inverse_multiplication) ).
cnf(not_sum_4,negated_conjecture,
~ sum(additive_identity,b,additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_sum_4) ).
cnf(product_5,negated_conjecture,
product(multiplicative_identity,multiplicative_inverse(a),multiplicative_inverse(b)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_5) ).
cnf(not_sum_3,negated_conjecture,
~ sum(additive_identity,a,additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_sum_3) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
cnf(not_product_6,negated_conjecture,
~ product(multiplicative_identity,a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_product_6) ).
cnf(c_0_11,plain,
( ~ defined(X1)
| product(multiplicative_identity,X1,X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_multiplication]) ).
cnf(c_0_12,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_13,plain,
( ~ defined(X1)
| product(multiplicative_identity,X1,X1) ),
c_0_11 ).
cnf(c_0_14,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_15,axiom,
defined(multiplicative_identity),
well_definedness_of_multiplicative_identity ).
cnf(c_0_16,plain,
( ~ product(X2,X1,X3)
| product(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_multiplication]) ).
cnf(c_0_17,plain,
( ~ product(X5,X6,X3)
| ~ product(X4,X6,X2)
| ~ product(X1,X4,X5)
| product(X1,X2,X3) ),
c_0_12 ).
cnf(c_0_18,hypothesis,
product(multiplicative_identity,b,b),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,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_20,negated_conjecture,
~ sum(additive_identity,b,additive_identity),
inference(fof_simplification,[status(thm)],[not_sum_4]) ).
cnf(c_0_21,plain,
product(multiplicative_identity,multiplicative_identity,multiplicative_identity),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_22,plain,
( ~ product(X2,X1,X3)
| product(X1,X2,X3) ),
c_0_16 ).
cnf(c_0_23,negated_conjecture,
product(multiplicative_identity,multiplicative_inverse(a),multiplicative_inverse(b)),
product_5 ).
cnf(c_0_24,hypothesis,
( ~ product(X1,X3,multiplicative_identity)
| ~ product(X3,b,X2)
| product(X1,X2,b) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,plain,
( ~ defined(X1)
| sum(additive_identity,X1,additive_identity)
| product(multiplicative_inverse(X1),X1,multiplicative_identity) ),
c_0_19 ).
cnf(c_0_26,negated_conjecture,
~ sum(additive_identity,b,additive_identity),
c_0_20 ).
cnf(c_0_27,plain,
( ~ product(X1,X3,multiplicative_identity)
| ~ product(X3,multiplicative_identity,X2)
| product(X1,X2,multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_28,negated_conjecture,
product(multiplicative_inverse(a),multiplicative_identity,multiplicative_inverse(b)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,hypothesis,
( ~ product(X1,multiplicative_inverse(b),multiplicative_identity)
| product(X1,multiplicative_identity,b) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_14])]),c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( ~ product(X1,multiplicative_inverse(a),multiplicative_identity)
| product(X1,multiplicative_inverse(b),multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
~ sum(additive_identity,a,additive_identity),
inference(fof_simplification,[status(thm)],[not_sum_3]) ).
cnf(c_0_32,hypothesis,
( ~ product(X1,multiplicative_inverse(a),multiplicative_identity)
| product(X1,multiplicative_identity,b) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
( ~ defined(X1)
| sum(additive_identity,X1,additive_identity)
| product(X1,multiplicative_inverse(X1),multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_22,c_0_25]) ).
cnf(c_0_34,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_35,negated_conjecture,
~ sum(additive_identity,a,additive_identity),
c_0_31 ).
cnf(c_0_36,negated_conjecture,
~ product(multiplicative_identity,a,b),
inference(fof_simplification,[status(thm)],[not_product_6]) ).
cnf(c_0_37,hypothesis,
product(a,multiplicative_identity,b),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]),c_0_35]) ).
cnf(c_0_38,negated_conjecture,
~ product(multiplicative_identity,a,b),
c_0_36 ).
cnf(c_0_39,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_37]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : FLD027-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.36 % Computer : n019.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 21 15:38:50 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 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.13/0.43 % Version: 3.5.1
% 0.13/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.43 % Starting sh5l with 300s (1) cores
% 0.13/0.43 % new_bool_3 with pid 2925028 completed with status 0
% 0.13/0.43 % Result found by new_bool_3
% 0.13/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.43 % Search class: FGUNF-FFSS11-SFFFFFNN
% 0.13/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.43 % SubtermCWHack with pid 2925031 completed with status 0
% 0.13/0.43 % Result found by SubtermCWHack
% 0.13/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.43 % Search class: FGUNF-FFSS11-SFFFFFNN
% 0.13/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.43 % Preprocessing time : 0.001 s
% 0.13/0.43
% 0.13/0.43 % Proof found!
% 0.13/0.43 % SZS status Unsatisfiable
% 0.13/0.43 % SZS output start CNFRefutation
% See solution above
% 0.13/0.43 % Parsed axioms : 32
% 0.13/0.43 % Removed by relevancy pruning/SinE : 11
% 0.13/0.43 % Initial clauses : 21
% 0.13/0.43 % Removed in clause preprocessing : 0
% 0.13/0.43 % Initial clauses in saturation : 21
% 0.13/0.43 % Processed clauses : 105
% 0.13/0.43 % ...of these trivial : 0
% 0.13/0.43 % ...subsumed : 8
% 0.13/0.43 % ...remaining for further processing : 97
% 0.13/0.43 % Other redundant clauses eliminated : 0
% 0.13/0.43 % Clauses deleted for lack of memory : 0
% 0.13/0.43 % Backward-subsumed : 0
% 0.13/0.43 % Backward-rewritten : 0
% 0.13/0.43 % Generated clauses : 256
% 0.13/0.43 % ...of the previous two non-redundant : 185
% 0.13/0.43 % ...aggressively subsumed : 0
% 0.13/0.43 % Contextual simplify-reflections : 0
% 0.13/0.43 % Paramodulations : 256
% 0.13/0.43 % Factorizations : 0
% 0.13/0.43 % NegExts : 0
% 0.13/0.43 % Equation resolutions : 0
% 0.13/0.43 % Disequality decompositions : 0
% 0.13/0.43 % Total rewrite steps : 42
% 0.13/0.43 % ...of those cached : 25
% 0.13/0.43 % Propositional unsat checks : 0
% 0.13/0.43 % Propositional check models : 0
% 0.13/0.43 % Propositional check unsatisfiable : 0
% 0.13/0.43 % Propositional clauses : 0
% 0.13/0.43 % Propositional clauses after purity: 0
% 0.13/0.43 % Propositional unsat core size : 0
% 0.13/0.43 % Propositional preprocessing time : 0.000
% 0.13/0.43 % Propositional encoding time : 0.000
% 0.13/0.43 % Propositional solver time : 0.000
% 0.13/0.43 % Success case prop preproc time : 0.000
% 0.13/0.43 % Success case prop encoding time : 0.000
% 0.13/0.43 % Success case prop solver time : 0.000
% 0.13/0.43 % Current number of processed clauses : 97
% 0.13/0.43 % Positive orientable unit clauses : 21
% 0.13/0.43 % Positive unorientable unit clauses: 0
% 0.13/0.43 % Negative unit clauses : 4
% 0.13/0.43 % Non-unit-clauses : 72
% 0.13/0.43 % Current number of unprocessed clauses: 101
% 0.13/0.43 % ...number of literals in the above : 408
% 0.13/0.43 % Current number of archived formulas : 0
% 0.13/0.43 % Current number of archived clauses : 0
% 0.13/0.43 % Clause-clause subsumption calls (NU) : 313
% 0.13/0.43 % Rec. Clause-clause subsumption calls : 303
% 0.13/0.43 % Non-unit clause-clause subsumptions : 8
% 0.13/0.43 % Unit Clause-clause subsumption calls : 1
% 0.13/0.43 % Rewrite failures with RHS unbound : 0
% 0.13/0.43 % BW rewrite match attempts : 5
% 0.13/0.43 % BW rewrite match successes : 0
% 0.13/0.43 % Condensation attempts : 0
% 0.13/0.43 % Condensation successes : 0
% 0.13/0.43 % Termbank termtop insertions : 4138
% 0.13/0.43 % Search garbage collected termcells : 144
% 0.13/0.43
% 0.13/0.43 % -------------------------------------------------
% 0.13/0.43 % User time : 0.008 s
% 0.13/0.43 % System time : 0.002 s
% 0.13/0.43 % Total time : 0.010 s
% 0.13/0.43 % Maximum resident set size: 3660 pages
% 0.13/0.43
% 0.13/0.43 % -------------------------------------------------
% 0.13/0.43 % User time : 0.011 s
% 0.13/0.43 % System time : 0.005 s
% 0.13/0.43 % Total time : 0.017 s
% 0.13/0.43 % Maximum resident set size: 4864 pages
% 0.13/0.43 % E exiting
%------------------------------------------------------------------------------