%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD006-1 : 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 : n018.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:37 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.47s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 25 ( 7 unt; 0 nHn; 25 RR)
% Number of literals : 47 ( 0 equ; 26 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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(existence_of_identity_addition,axiom,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_identity_addition) ).
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_inverse_addition,axiom,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_inverse_addition) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_identity) ).
cnf(additive_inverse_not_equal_to_additive_identity_1,negated_conjecture,
~ equalish(additive_inverse(additive_identity),additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_inverse_not_equal_to_additive_identity_1) ).
cnf(well_definedness_of_additive_inverse,axiom,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_inverse) ).
cnf(c_0_7,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_equality]) ).
cnf(c_0_8,plain,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_9,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_10,plain,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).
cnf(c_0_11,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
c_0_7 ).
cnf(c_0_12,plain,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
c_0_8 ).
cnf(c_0_13,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_9 ).
cnf(c_0_14,plain,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
c_0_10 ).
cnf(c_0_15,plain,
( ~ equalish(X1,add(additive_identity,X2))
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( ~ defined(X1)
| equalish(additive_identity,add(X1,additive_inverse(X1))) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_18,negated_conjecture,
~ equalish(additive_inverse(additive_identity),additive_identity),
inference(fof_simplification,[status(thm)],[additive_inverse_not_equal_to_additive_identity_1]) ).
cnf(c_0_19,plain,
( ~ defined(additive_inverse(additive_identity))
| equalish(additive_identity,additive_inverse(additive_identity)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_20,negated_conjecture,
~ equalish(additive_inverse(additive_identity),additive_identity),
c_0_18 ).
cnf(c_0_21,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_additive_inverse]) ).
cnf(c_0_22,plain,
~ defined(additive_inverse(additive_identity)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_19]),c_0_20]) ).
cnf(c_0_23,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
c_0_21 ).
cnf(c_0_24,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : FLD006-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n018.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 15:39:14 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.44 Running first-order theorem proving
% 0.13/0.44 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.47 % Version: 3.5.1
% 0.13/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.47 % Starting sh5l with 300s (1) cores
% 0.13/0.47 % new_bool_1 with pid 2238361 completed with status 0
% 0.13/0.47 % Result found by new_bool_1
% 0.13/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.47 % Search class: FGUNF-FFMF21-SFFFFFNN
% 0.13/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.47 % SubtermCWHack with pid 2238369 completed with status 0
% 0.13/0.47 % Result found by SubtermCWHack
% 0.13/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.47 % Search class: FGUNF-FFMF21-SFFFFFNN
% 0.13/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.47 % Preprocessing time : 0.002 s
% 0.13/0.47
% 0.13/0.47 % Proof found!
% 0.13/0.47 % SZS status Unsatisfiable
% 0.13/0.47 % SZS output start CNFRefutation
% See solution above
% 0.13/0.48 % Parsed axioms : 28
% 0.13/0.48 % Removed by relevancy pruning/SinE : 5
% 0.13/0.48 % Initial clauses : 23
% 0.13/0.48 % Removed in clause preprocessing : 0
% 0.13/0.48 % Initial clauses in saturation : 23
% 0.13/0.48 % Processed clauses : 27
% 0.13/0.48 % ...of these trivial : 0
% 0.13/0.48 % ...subsumed : 4
% 0.13/0.48 % ...remaining for further processing : 23
% 0.13/0.48 % Other redundant clauses eliminated : 0
% 0.13/0.48 % Clauses deleted for lack of memory : 0
% 0.13/0.48 % Backward-subsumed : 1
% 0.13/0.48 % Backward-rewritten : 0
% 0.13/0.48 % Generated clauses : 38
% 0.13/0.48 % ...of the previous two non-redundant : 30
% 0.13/0.48 % ...aggressively subsumed : 0
% 0.13/0.48 % Contextual simplify-reflections : 0
% 0.13/0.48 % Paramodulations : 38
% 0.13/0.48 % Factorizations : 0
% 0.13/0.48 % NegExts : 0
% 0.13/0.48 % Equation resolutions : 0
% 0.13/0.48 % Disequality decompositions : 0
% 0.13/0.48 % Total rewrite steps : 4
% 0.13/0.48 % ...of those cached : 1
% 0.13/0.48 % Propositional unsat checks : 0
% 0.13/0.48 % Propositional check models : 0
% 0.13/0.48 % Propositional check unsatisfiable : 0
% 0.13/0.48 % Propositional clauses : 0
% 0.13/0.48 % Propositional clauses after purity: 0
% 0.13/0.48 % Propositional unsat core size : 0
% 0.13/0.48 % Propositional preprocessing time : 0.000
% 0.13/0.48 % Propositional encoding time : 0.000
% 0.13/0.48 % Propositional solver time : 0.000
% 0.13/0.48 % Success case prop preproc time : 0.000
% 0.13/0.48 % Success case prop encoding time : 0.000
% 0.13/0.48 % Success case prop solver time : 0.000
% 0.13/0.48 % Current number of processed clauses : 22
% 0.13/0.48 % Positive orientable unit clauses : 3
% 0.13/0.48 % Positive unorientable unit clauses: 0
% 0.13/0.48 % Negative unit clauses : 2
% 0.13/0.48 % Non-unit-clauses : 17
% 0.13/0.48 % Current number of unprocessed clauses: 26
% 0.13/0.48 % ...number of literals in the above : 89
% 0.13/0.48 % Current number of archived formulas : 0
% 0.13/0.48 % Current number of archived clauses : 1
% 0.13/0.48 % Clause-clause subsumption calls (NU) : 33
% 0.13/0.48 % Rec. Clause-clause subsumption calls : 33
% 0.13/0.48 % Non-unit clause-clause subsumptions : 4
% 0.13/0.48 % Unit Clause-clause subsumption calls : 2
% 0.13/0.48 % Rewrite failures with RHS unbound : 0
% 0.13/0.48 % BW rewrite match attempts : 0
% 0.13/0.48 % BW rewrite match successes : 0
% 0.13/0.48 % Condensation attempts : 0
% 0.13/0.48 % Condensation successes : 0
% 0.13/0.48 % Termbank termtop insertions : 1278
% 0.13/0.48 % Search garbage collected termcells : 87
% 0.13/0.48
% 0.13/0.48 % -------------------------------------------------
% 0.13/0.48 % User time : 0.006 s
% 0.13/0.48 % System time : 0.002 s
% 0.13/0.48 % Total time : 0.008 s
% 0.13/0.48 % Maximum resident set size: 3660 pages
% 0.13/0.48
% 0.13/0.48 % -------------------------------------------------
% 0.13/0.48 % User time : 0.007 s
% 0.13/0.48 % System time : 0.007 s
% 0.13/0.48 % Total time : 0.014 s
% 0.13/0.48 % Maximum resident set size: 4864 pages
% 0.13/0.48 % E exiting
%------------------------------------------------------------------------------