%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD010-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 : 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:38 PM UTC 2026
% Result : Unsatisfiable 0.23s 0.57s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 16 ( 9 unt; 4 nHn; 16 RR)
% Number of literals : 27 ( 0 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 13 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(commutativity_multiplication,axiom,
( ~ product(X2,X1,X3)
| product(X1,X2,X3) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/FLD002-0.ax',existence_of_inverse_multiplication) ).
cnf(not_product_2,negated_conjecture,
~ product(multiplicative_identity,multiplicative_inverse(multiplicative_identity),multiplicative_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_product_2) ).
cnf(not_sum_1,negated_conjecture,
~ sum(additive_identity,multiplicative_identity,additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_sum_1) ).
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(c_0_5,plain,
( ~ product(X2,X1,X3)
| product(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_multiplication]) ).
cnf(c_0_6,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_7,negated_conjecture,
~ product(multiplicative_identity,multiplicative_inverse(multiplicative_identity),multiplicative_identity),
inference(fof_simplification,[status(thm)],[not_product_2]) ).
cnf(c_0_8,plain,
( ~ product(X2,X1,X3)
| product(X1,X2,X3) ),
c_0_5 ).
cnf(c_0_9,plain,
( ~ defined(X1)
| sum(additive_identity,X1,additive_identity)
| product(multiplicative_inverse(X1),X1,multiplicative_identity) ),
c_0_6 ).
cnf(c_0_10,negated_conjecture,
~ sum(additive_identity,multiplicative_identity,additive_identity),
inference(fof_simplification,[status(thm)],[not_sum_1]) ).
cnf(c_0_11,negated_conjecture,
~ product(multiplicative_identity,multiplicative_inverse(multiplicative_identity),multiplicative_identity),
c_0_7 ).
cnf(c_0_12,plain,
( ~ defined(X1)
| sum(additive_identity,X1,additive_identity)
| product(X1,multiplicative_inverse(X1),multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,axiom,
defined(multiplicative_identity),
well_definedness_of_multiplicative_identity ).
cnf(c_0_14,negated_conjecture,
~ sum(additive_identity,multiplicative_identity,additive_identity),
c_0_10 ).
cnf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : FLD010-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.18/0.46 % Computer : n013.cluster.edu
% 0.18/0.46 % Model : x86_64 x86_64
% 0.18/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.46 % Memory : 8046.5625MB
% 0.18/0.46 % OS : Linux 6.8.0-71-generic
% 0.18/0.46 % CPULimit : 300
% 0.18/0.46 % WCLimit : 300
% 0.18/0.46 % DateTime : Mon Sep 21 15:37:21 UTC 2026
% 0.18/0.46 % CPUTime :
% 0.18/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.51 Running first-order theorem proving
% 0.23/0.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.23/0.57 % Version: 3.5.1
% 0.23/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.57 % Starting sh5l with 300s (1) cores
% 0.23/0.57 % new_bool_3 with pid 1102426 completed with status 0
% 0.23/0.57 % Result found by new_bool_3
% 0.23/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.57 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.57 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.57 % Search class: FGUNF-FFSF11-SFFFFFNN
% 0.23/0.57 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.57 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.57 % SubtermCWHack with pid 1102431 completed with status 0
% 0.23/0.57 % Result found by SubtermCWHack
% 0.23/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.57 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.57 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.57 % Search class: FGUNF-FFSF11-SFFFFFNN
% 0.23/0.57 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.57 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.57 % Preprocessing time : 0.001 s
% 0.23/0.57
% 0.23/0.57 % Proof found!
% 0.23/0.57 % SZS status Unsatisfiable
% 0.23/0.57 % SZS output start CNFRefutation
% See solution above
% 0.23/0.57 % Parsed axioms : 28
% 0.23/0.57 % Removed by relevancy pruning/SinE : 11
% 0.23/0.57 % Initial clauses : 17
% 0.23/0.57 % Removed in clause preprocessing : 0
% 0.23/0.57 % Initial clauses in saturation : 17
% 0.23/0.57 % Processed clauses : 18
% 0.23/0.57 % ...of these trivial : 0
% 0.23/0.57 % ...subsumed : 0
% 0.23/0.57 % ...remaining for further processing : 18
% 0.23/0.57 % Other redundant clauses eliminated : 0
% 0.23/0.57 % Clauses deleted for lack of memory : 0
% 0.23/0.57 % Backward-subsumed : 0
% 0.23/0.57 % Backward-rewritten : 0
% 0.23/0.57 % Generated clauses : 15
% 0.23/0.57 % ...of the previous two non-redundant : 9
% 0.23/0.57 % ...aggressively subsumed : 0
% 0.23/0.57 % Contextual simplify-reflections : 0
% 0.23/0.57 % Paramodulations : 15
% 0.23/0.57 % Factorizations : 0
% 0.23/0.57 % NegExts : 0
% 0.23/0.57 % Equation resolutions : 0
% 0.23/0.57 % Disequality decompositions : 0
% 0.23/0.57 % Total rewrite steps : 5
% 0.23/0.57 % ...of those cached : 0
% 0.23/0.57 % Propositional unsat checks : 0
% 0.23/0.57 % Propositional check models : 0
% 0.23/0.57 % Propositional check unsatisfiable : 0
% 0.23/0.57 % Propositional clauses : 0
% 0.23/0.57 % Propositional clauses after purity: 0
% 0.23/0.57 % Propositional unsat core size : 0
% 0.23/0.57 % Propositional preprocessing time : 0.000
% 0.23/0.57 % Propositional encoding time : 0.000
% 0.23/0.57 % Propositional solver time : 0.000
% 0.23/0.57 % Success case prop preproc time : 0.000
% 0.23/0.57 % Success case prop encoding time : 0.000
% 0.23/0.57 % Success case prop solver time : 0.000
% 0.23/0.57 % Current number of processed clauses : 18
% 0.23/0.57 % Positive orientable unit clauses : 8
% 0.23/0.57 % Positive unorientable unit clauses: 0
% 0.23/0.57 % Negative unit clauses : 3
% 0.23/0.57 % Non-unit-clauses : 7
% 0.23/0.57 % Current number of unprocessed clauses: 8
% 0.23/0.57 % ...number of literals in the above : 32
% 0.23/0.57 % Current number of archived formulas : 0
% 0.23/0.57 % Current number of archived clauses : 0
% 0.23/0.57 % Clause-clause subsumption calls (NU) : 12
% 0.23/0.57 % Rec. Clause-clause subsumption calls : 12
% 0.23/0.57 % Non-unit clause-clause subsumptions : 0
% 0.23/0.57 % Unit Clause-clause subsumption calls : 1
% 0.23/0.57 % Rewrite failures with RHS unbound : 0
% 0.23/0.57 % BW rewrite match attempts : 2
% 0.23/0.57 % BW rewrite match successes : 0
% 0.23/0.57 % Condensation attempts : 0
% 0.23/0.57 % Condensation successes : 0
% 0.23/0.57 % Termbank termtop insertions : 769
% 0.23/0.57 % Search garbage collected termcells : 142
% 0.23/0.57
% 0.23/0.57 % -------------------------------------------------
% 0.23/0.57 % User time : 0.004 s
% 0.23/0.57 % System time : 0.001 s
% 0.23/0.57 % Total time : 0.005 s
% 0.23/0.57 % Maximum resident set size: 3660 pages
% 0.23/0.57
% 0.23/0.57 % -------------------------------------------------
% 0.23/0.57 % User time : 0.006 s
% 0.23/0.57 % System time : 0.006 s
% 0.23/0.57 % Total time : 0.012 s
% 0.23/0.57 % Maximum resident set size: 4864 pages
% 0.23/0.57 % E exiting
%------------------------------------------------------------------------------