%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : FLD014-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 : n009.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:23:08 PM UTC 2026
% Result : Unsatisfiable 0.61s 0.54s
% Output : CNFRefutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 42 ( 16 unt; 0 nHn; 42 RR)
% Number of literals : 90 ( 0 equ; 52 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 75 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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(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(commutativity_addition,axiom,
( ~ sum(X2,X1,X3)
| sum(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',commutativity_addition) ).
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(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_3,negated_conjecture,
sum(additive_identity,a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_3) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
cnf(associativity_addition_2,axiom,
( ~ sum(X4,X6,X3)
| ~ sum(X5,X2,X6)
| ~ sum(X4,X5,X1)
| sum(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',associativity_addition_2) ).
cnf(not_sum_4,negated_conjecture,
~ sum(additive_identity,additive_inverse(a),additive_inverse(b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_sum_4) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_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(c_0_11,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_12,plain,
( ~ defined(X1)
| sum(additive_identity,X1,X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_13,plain,
( ~ sum(X5,X6,X3)
| ~ sum(X4,X6,X2)
| ~ sum(X1,X4,X5)
| sum(X1,X2,X3) ),
c_0_11 ).
cnf(c_0_14,plain,
( ~ defined(X1)
| sum(additive_identity,X1,X1) ),
c_0_12 ).
cnf(c_0_15,plain,
( ~ sum(X2,X1,X3)
| sum(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_16,plain,
( ~ sum(X4,X3,X2)
| ~ sum(X1,X4,additive_identity)
| ~ defined(X3)
| sum(X1,X2,X3) ),
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,plain,
( ~ defined(X1)
| sum(additive_inverse(X1),X1,additive_identity) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).
cnf(c_0_19,plain,
( ~ sum(X2,X1,X3)
| sum(X1,X2,X3) ),
c_0_15 ).
cnf(c_0_20,plain,
( ~ sum(additive_identity,X2,X1)
| ~ defined(X2)
| sum(additive_identity,X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_14]),c_0_17])]) ).
cnf(c_0_21,negated_conjecture,
sum(additive_identity,a,b),
sum_3 ).
cnf(c_0_22,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_23,plain,
( ~ sum(X4,X6,X3)
| ~ sum(X5,X2,X6)
| ~ sum(X4,X5,X1)
| sum(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[associativity_addition_2]) ).
cnf(c_0_24,plain,
( ~ defined(X1)
| sum(additive_inverse(X1),X1,additive_identity) ),
c_0_18 ).
cnf(c_0_25,plain,
( ~ defined(X1)
| sum(X1,additive_identity,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_14]) ).
cnf(c_0_26,negated_conjecture,
sum(additive_identity,b,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_27,plain,
( ~ sum(X4,X6,X3)
| ~ sum(X5,X2,X6)
| ~ sum(X4,X5,X1)
| sum(X1,X2,X3) ),
c_0_23 ).
cnf(c_0_28,plain,
( ~ defined(X1)
| sum(X1,additive_inverse(X1),additive_identity) ),
inference(spm,[status(thm)],[c_0_19,c_0_24]) ).
cnf(c_0_29,plain,
( ~ sum(X1,X4,X3)
| ~ sum(X4,additive_identity,X2)
| ~ defined(X3)
| sum(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
sum(b,additive_identity,a),
inference(spm,[status(thm)],[c_0_19,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
~ sum(additive_identity,additive_inverse(a),additive_inverse(b)),
inference(fof_simplification,[status(thm)],[not_sum_4]) ).
cnf(c_0_32,plain,
( ~ sum(X4,X2,X1)
| ~ sum(X4,additive_identity,X3)
| ~ defined(X2)
| sum(X1,additive_inverse(X2),X3) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( ~ sum(X1,b,X2)
| ~ defined(X2)
| sum(X1,a,X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_35,negated_conjecture,
~ sum(additive_identity,additive_inverse(a),additive_inverse(b)),
c_0_31 ).
cnf(c_0_36,plain,
( ~ sum(X3,X2,X1)
| ~ defined(X3)
| ~ defined(X2)
| sum(X1,additive_inverse(X2),X3) ),
inference(spm,[status(thm)],[c_0_32,c_0_25]) ).
cnf(c_0_37,negated_conjecture,
sum(additive_inverse(b),a,additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_24]),c_0_17]),c_0_34])]) ).
cnf(c_0_38,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_additive_inverse]) ).
cnf(c_0_39,negated_conjecture,
~ defined(additive_inverse(b)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_22]),c_0_37])]) ).
cnf(c_0_40,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
c_0_38 ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD014-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n009.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:37:27 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.61/0.54 % Version: 3.5.1
% 0.61/0.54 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.61/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.61/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.61/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.61/0.54 % Starting sh5l with 300s (1) cores
% 0.61/0.54 % new_bool_1 with pid 2113081 completed with status 0
% 0.61/0.54 % Result found by new_bool_1
% 0.61/0.54 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.61/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.61/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.61/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.61/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.61/0.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.61/0.54 % Search class: FHUNF-FFSS11-SFFFFFNN
% 0.61/0.54 % partial match(1): FHUNF-FFSF11-SFFFFFNN
% 0.61/0.54 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.61/0.54 % Starting SubtermCWHack with 31s (1) cores
% 0.61/0.54 % SubtermCWHack with pid 2113088 completed with status 0
% 0.61/0.54 % Result found by SubtermCWHack
% 0.61/0.54 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.61/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.61/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.61/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.61/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.61/0.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.61/0.54 % Search class: FHUNF-FFSS11-SFFFFFNN
% 0.61/0.54 % partial match(1): FHUNF-FFSF11-SFFFFFNN
% 0.61/0.54 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.61/0.54 % Starting SubtermCWHack with 31s (1) cores
% 0.61/0.54 % Preprocessing time : 0.001 s
% 0.61/0.54
% 0.61/0.54 % Proof found!
% 0.61/0.54 % SZS status Unsatisfiable
% 0.61/0.54 % SZS output start CNFRefutation
% See solution above
% 0.61/0.54 % Parsed axioms : 30
% 0.61/0.54 % Removed by relevancy pruning/SinE : 19
% 0.61/0.54 % Initial clauses : 11
% 0.61/0.54 % Removed in clause preprocessing : 0
% 0.61/0.54 % Initial clauses in saturation : 11
% 0.61/0.54 % Processed clauses : 2597
% 0.61/0.54 % ...of these trivial : 3
% 0.61/0.54 % ...subsumed : 1978
% 0.61/0.54 % ...remaining for further processing : 616
% 0.61/0.54 % Other redundant clauses eliminated : 0
% 0.61/0.54 % Clauses deleted for lack of memory : 0
% 0.61/0.54 % Backward-subsumed : 26
% 0.61/0.54 % Backward-rewritten : 0
% 0.61/0.54 % Generated clauses : 10877
% 0.61/0.54 % ...of the previous two non-redundant : 9476
% 0.61/0.54 % ...aggressively subsumed : 0
% 0.61/0.54 % Contextual simplify-reflections : 9
% 0.61/0.54 % Paramodulations : 10877
% 0.61/0.54 % Factorizations : 0
% 0.61/0.54 % NegExts : 0
% 0.61/0.54 % Equation resolutions : 0
% 0.61/0.54 % Disequality decompositions : 0
% 0.61/0.54 % Total rewrite steps : 5165
% 0.61/0.54 % ...of those cached : 5135
% 0.61/0.54 % Propositional unsat checks : 0
% 0.61/0.54 % Propositional check models : 0
% 0.61/0.54 % Propositional check unsatisfiable : 0
% 0.61/0.54 % Propositional clauses : 0
% 0.61/0.54 % Propositional clauses after purity: 0
% 0.61/0.54 % Propositional unsat core size : 0
% 0.61/0.54 % Propositional preprocessing time : 0.000
% 0.61/0.54 % Propositional encoding time : 0.000
% 0.61/0.54 % Propositional solver time : 0.000
% 0.61/0.54 % Success case prop preproc time : 0.000
% 0.61/0.54 % Success case prop encoding time : 0.000
% 0.61/0.54 % Success case prop solver time : 0.000
% 0.61/0.54 % Current number of processed clauses : 590
% 0.61/0.54 % Positive orientable unit clauses : 30
% 0.61/0.54 % Positive unorientable unit clauses: 0
% 0.61/0.54 % Negative unit clauses : 2
% 0.61/0.54 % Non-unit-clauses : 558
% 0.61/0.54 % Current number of unprocessed clauses: 6815
% 0.61/0.54 % ...number of literals in the above : 23680
% 0.61/0.54 % Current number of archived formulas : 0
% 0.61/0.54 % Current number of archived clauses : 26
% 0.61/0.54 % Clause-clause subsumption calls (NU) : 21483
% 0.61/0.54 % Rec. Clause-clause subsumption calls : 20736
% 0.61/0.54 % Non-unit clause-clause subsumptions : 2004
% 0.61/0.54 % Unit Clause-clause subsumption calls : 53
% 0.61/0.54 % Rewrite failures with RHS unbound : 0
% 0.61/0.54 % BW rewrite match attempts : 17
% 0.61/0.54 % BW rewrite match successes : 6
% 0.61/0.54 % Condensation attempts : 0
% 0.61/0.54 % Condensation successes : 0
% 0.61/0.54 % Termbank termtop insertions : 126178
% 0.61/0.54 % Search garbage collected termcells : 151
% 0.61/0.54
% 0.61/0.54 % -------------------------------------------------
% 0.61/0.54 % User time : 0.091 s
% 0.61/0.54 % System time : 0.008 s
% 0.61/0.54 % Total time : 0.098 s
% 0.61/0.54 % Maximum resident set size: 3660 pages
% 0.61/0.54
% 0.61/0.54 % -------------------------------------------------
% 0.61/0.54 % User time : 0.094 s
% 0.61/0.54 % System time : 0.010 s
% 0.61/0.54 % Total time : 0.104 s
% 0.61/0.54 % Maximum resident set size: 4608 pages
% 0.61/0.54 % E exiting
%------------------------------------------------------------------------------