%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD019-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 : n010.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:42 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.43s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of clauses : 37 ( 14 unt; 0 nHn; 37 RR)
% Number of literals : 68 ( 0 equ; 34 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 48 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(existence_of_identity_addition,axiom,
( ~ defined(X1)
| sum(additive_identity,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',existence_of_identity_addition) ).
cnf(associativity_addition_1,axiom,
( ~ sum(X5,X6,X3)
| ~ sum(X4,X6,X2)
| ~ sum(X1,X4,X5)
| sum(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',associativity_addition_1) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
cnf(well_definedness_of_additive_inverse,axiom,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',well_definedness_of_additive_inverse) ).
cnf(existence_of_inverse_addition,axiom,
( ~ defined(X1)
| sum(additive_inverse(X1),X1,additive_identity) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',existence_of_inverse_addition) ).
cnf(sum_2,negated_conjecture,
sum(additive_identity,additive_inverse(a),additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_2) ).
cnf(commutativity_addition,axiom,
( ~ sum(X2,X1,X3)
| sum(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',commutativity_addition) ).
cnf(not_sum_3,negated_conjecture,
~ sum(additive_identity,a,additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_sum_3) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',well_definedness_of_additive_identity) ).
cnf(c_0_9,plain,
( ~ defined(X1)
| sum(additive_identity,X1,X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_10,plain,
( ~ sum(X5,X6,X3)
| ~ sum(X4,X6,X2)
| ~ sum(X1,X4,X5)
| sum(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[associativity_addition_1]) ).
cnf(c_0_11,plain,
( ~ defined(X1)
| sum(additive_identity,X1,X1) ),
c_0_9 ).
cnf(c_0_12,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_13,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_additive_inverse]) ).
cnf(c_0_14,plain,
( ~ sum(X5,X6,X3)
| ~ sum(X4,X6,X2)
| ~ sum(X1,X4,X5)
| sum(X1,X2,X3) ),
c_0_10 ).
cnf(c_0_15,hypothesis,
sum(additive_identity,a,a),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( ~ defined(X1)
| sum(additive_inverse(X1),X1,additive_identity) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).
cnf(c_0_17,negated_conjecture,
sum(additive_identity,additive_inverse(a),additive_identity),
sum_2 ).
cnf(c_0_18,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
c_0_13 ).
cnf(c_0_19,hypothesis,
( ~ sum(X1,X3,additive_identity)
| ~ sum(X3,a,X2)
| sum(X1,X2,a) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( ~ defined(X1)
| sum(additive_inverse(X1),X1,additive_identity) ),
c_0_16 ).
cnf(c_0_21,negated_conjecture,
( ~ sum(X1,X3,additive_identity)
| ~ sum(X3,additive_inverse(a),X2)
| sum(X1,X2,additive_identity) ),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_22,plain,
( ~ defined(X1)
| sum(additive_identity,additive_inverse(X1),additive_inverse(X1)) ),
inference(spm,[status(thm)],[c_0_11,c_0_18]) ).
cnf(c_0_23,plain,
( ~ sum(X2,X1,X3)
| sum(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_24,hypothesis,
( ~ sum(X1,additive_inverse(a),additive_identity)
| sum(X1,additive_identity,a) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_12])]) ).
cnf(c_0_25,negated_conjecture,
( ~ sum(X1,additive_identity,additive_identity)
| sum(X1,additive_inverse(a),additive_identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_12])]) ).
cnf(c_0_26,plain,
( ~ sum(X2,X1,X3)
| sum(X1,X2,X3) ),
c_0_23 ).
cnf(c_0_27,hypothesis,
( ~ sum(X1,additive_identity,additive_identity)
| sum(X1,additive_identity,a) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,hypothesis,
( ~ sum(X1,additive_identity,additive_identity)
| sum(additive_identity,X1,a) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,negated_conjecture,
sum(additive_inverse(a),additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_26,c_0_17]) ).
cnf(c_0_30,negated_conjecture,
~ sum(additive_identity,a,additive_identity),
inference(fof_simplification,[status(thm)],[not_sum_3]) ).
cnf(c_0_31,negated_conjecture,
sum(additive_identity,additive_inverse(a),a),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_33,negated_conjecture,
~ sum(additive_identity,a,additive_identity),
c_0_30 ).
cnf(c_0_34,negated_conjecture,
( ~ sum(X1,additive_identity,additive_identity)
| sum(X1,a,additive_identity) ),
inference(spm,[status(thm)],[c_0_21,c_0_31]) ).
cnf(c_0_35,plain,
sum(additive_identity,additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_11,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD019-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n010.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 15:38:25 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/0.40 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.11/0.43 % Version: 3.5.1
% 0.11/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.43 % Starting sh5l with 300s (1) cores
% 0.11/0.43 % new_bool_3 with pid 1200307 completed with status 0
% 0.11/0.43 % Result found by new_bool_3
% 0.11/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.43 % Search class: FHUNF-FFSS11-SFFFFFNN
% 0.11/0.43 % partial match(1): FHUNF-FFSF11-SFFFFFNN
% 0.11/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.43 % SubtermCWHack with pid 1200311 completed with status 0
% 0.11/0.43 % Result found by SubtermCWHack
% 0.11/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.43 % Search class: FHUNF-FFSS11-SFFFFFNN
% 0.11/0.43 % partial match(1): FHUNF-FFSF11-SFFFFFNN
% 0.11/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.43 % Preprocessing time : 0.001 s
% 0.11/0.43
% 0.11/0.43 % Proof found!
% 0.11/0.43 % SZS status Unsatisfiable
% 0.11/0.43 % SZS output start CNFRefutation
% See solution above
% 0.11/0.43 % Parsed axioms : 29
% 0.11/0.43 % Removed by relevancy pruning/SinE : 19
% 0.11/0.43 % Initial clauses : 10
% 0.11/0.43 % Removed in clause preprocessing : 0
% 0.11/0.43 % Initial clauses in saturation : 10
% 0.11/0.43 % Processed clauses : 54
% 0.11/0.43 % ...of these trivial : 0
% 0.11/0.43 % ...subsumed : 6
% 0.11/0.43 % ...remaining for further processing : 48
% 0.11/0.43 % Other redundant clauses eliminated : 0
% 0.11/0.43 % Clauses deleted for lack of memory : 0
% 0.11/0.43 % Backward-subsumed : 0
% 0.11/0.43 % Backward-rewritten : 0
% 0.11/0.43 % Generated clauses : 133
% 0.11/0.43 % ...of the previous two non-redundant : 108
% 0.11/0.43 % ...aggressively subsumed : 0
% 0.11/0.43 % Contextual simplify-reflections : 0
% 0.11/0.43 % Paramodulations : 133
% 0.11/0.43 % Factorizations : 0
% 0.11/0.43 % NegExts : 0
% 0.11/0.43 % Equation resolutions : 0
% 0.11/0.43 % Disequality decompositions : 0
% 0.11/0.43 % Total rewrite steps : 27
% 0.11/0.43 % ...of those cached : 14
% 0.11/0.43 % Propositional unsat checks : 0
% 0.11/0.43 % Propositional check models : 0
% 0.11/0.43 % Propositional check unsatisfiable : 0
% 0.11/0.43 % Propositional clauses : 0
% 0.11/0.43 % Propositional clauses after purity: 0
% 0.11/0.43 % Propositional unsat core size : 0
% 0.11/0.43 % Propositional preprocessing time : 0.000
% 0.11/0.43 % Propositional encoding time : 0.000
% 0.11/0.43 % Propositional solver time : 0.000
% 0.11/0.43 % Success case prop preproc time : 0.000
% 0.11/0.43 % Success case prop encoding time : 0.000
% 0.11/0.43 % Success case prop solver time : 0.000
% 0.11/0.43 % Current number of processed clauses : 48
% 0.11/0.43 % Positive orientable unit clauses : 17
% 0.11/0.43 % Positive unorientable unit clauses: 0
% 0.11/0.43 % Negative unit clauses : 1
% 0.11/0.43 % Non-unit-clauses : 30
% 0.11/0.43 % Current number of unprocessed clauses: 64
% 0.11/0.43 % ...number of literals in the above : 218
% 0.11/0.43 % Current number of archived formulas : 0
% 0.11/0.43 % Current number of archived clauses : 0
% 0.11/0.43 % Clause-clause subsumption calls (NU) : 124
% 0.11/0.43 % Rec. Clause-clause subsumption calls : 118
% 0.11/0.43 % Non-unit clause-clause subsumptions : 6
% 0.11/0.43 % Unit Clause-clause subsumption calls : 8
% 0.11/0.43 % Rewrite failures with RHS unbound : 0
% 0.11/0.43 % BW rewrite match attempts : 4
% 0.11/0.43 % BW rewrite match successes : 0
% 0.11/0.43 % Condensation attempts : 0
% 0.11/0.43 % Condensation successes : 0
% 0.11/0.43 % Termbank termtop insertions : 1981
% 0.11/0.43 % Search garbage collected termcells : 151
% 0.11/0.43
% 0.11/0.43 % -------------------------------------------------
% 0.11/0.43 % User time : 0.005 s
% 0.11/0.43 % System time : 0.003 s
% 0.11/0.43 % Total time : 0.008 s
% 0.11/0.43 % Maximum resident set size: 3660 pages
% 0.11/0.43
% 0.11/0.43 % -------------------------------------------------
% 0.11/0.43 % User time : 0.006 s
% 0.11/0.43 % System time : 0.008 s
% 0.11/0.43 % Total time : 0.014 s
% 0.11/0.43 % Maximum resident set size: 4864 pages
% 0.11/0.43 % E exiting
%------------------------------------------------------------------------------