%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : FLD015-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 : 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:23:08 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.44s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of clauses : 36 ( 11 unt; 0 nHn; 36 RR)
% Number of literals : 79 ( 0 equ; 46 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 : 70 ( 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(commutativity_addition,axiom,
( ~ sum(X2,X1,X3)
| sum(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',commutativity_addition) ).
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,additive_inverse(a),additive_inverse(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(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
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_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,a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_sum_4) ).
cnf(c_0_9,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_10,plain,
( ~ sum(X2,X1,X3)
| sum(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_11,plain,
( ~ defined(X1)
| sum(additive_inverse(X1),X1,additive_identity) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).
cnf(c_0_12,plain,
( ~ sum(X5,X6,X3)
| ~ sum(X4,X6,X2)
| ~ sum(X1,X4,X5)
| sum(X1,X2,X3) ),
c_0_9 ).
cnf(c_0_13,negated_conjecture,
sum(additive_identity,additive_inverse(a),additive_inverse(b)),
sum_3 ).
cnf(c_0_14,plain,
( ~ sum(X2,X1,X3)
| sum(X1,X2,X3) ),
c_0_10 ).
cnf(c_0_15,plain,
( ~ defined(X1)
| sum(additive_inverse(X1),X1,additive_identity) ),
c_0_11 ).
cnf(c_0_16,negated_conjecture,
( ~ sum(X1,X3,additive_identity)
| ~ sum(X3,additive_inverse(a),X2)
| sum(X1,X2,additive_inverse(b)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( ~ defined(X1)
| sum(X1,additive_inverse(X1),additive_identity) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_19,plain,
( ~ sum(X4,X3,X2)
| ~ sum(X1,X4,additive_inverse(X3))
| ~ defined(X3)
| sum(X1,X2,additive_identity) ),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( ~ sum(X1,a,additive_identity)
| sum(X1,additive_identity,additive_inverse(b)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_21,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_22,plain,
( ~ defined(X1)
| sum(additive_identity,X1,X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_23,negated_conjecture,
( ~ sum(X1,a,additive_identity)
| ~ sum(additive_identity,b,X2)
| sum(X1,X2,additive_identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_24,plain,
( ~ defined(X1)
| sum(additive_identity,X1,X1) ),
c_0_22 ).
cnf(c_0_25,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_26,negated_conjecture,
( ~ sum(X1,a,additive_identity)
| sum(X1,b,additive_identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_21])]) ).
cnf(c_0_27,plain,
( ~ sum(X4,X6,X3)
| ~ sum(X5,X2,X6)
| ~ sum(X4,X5,X1)
| sum(X1,X2,X3) ),
c_0_25 ).
cnf(c_0_28,negated_conjecture,
( ~ sum(X1,a,additive_identity)
| sum(b,X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_14,c_0_26]) ).
cnf(c_0_29,plain,
( ~ sum(X4,additive_identity,X3)
| ~ sum(X4,additive_inverse(X2),X1)
| ~ defined(X2)
| sum(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_27,c_0_15]) ).
cnf(c_0_30,negated_conjecture,
sum(b,additive_inverse(a),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_15]),c_0_18])]) ).
cnf(c_0_31,negated_conjecture,
~ sum(additive_identity,a,b),
inference(fof_simplification,[status(thm)],[not_sum_4]) ).
cnf(c_0_32,negated_conjecture,
( ~ sum(b,additive_identity,X1)
| sum(additive_identity,a,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_18])]) ).
cnf(c_0_33,plain,
( ~ defined(X1)
| sum(X1,additive_identity,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_24]) ).
cnf(c_0_34,negated_conjecture,
~ sum(additive_identity,a,b),
c_0_31 ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_21])]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD015-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.09/0.36 % Computer : n019.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 15:37:19 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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.14/0.44 % Version: 3.5.1
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.44 % Starting sh5l with 300s (1) cores
% 0.14/0.44 % new_bool_3 with pid 2921720 completed with status 0
% 0.14/0.44 % Result found by new_bool_3
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.44 % Search class: FHUNF-FFSS11-SFFFFFNN
% 0.14/0.44 % partial match(1): FHUNF-FFSF11-SFFFFFNN
% 0.14/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.44 % SubtermCWHack with pid 2921725 completed with status 0
% 0.14/0.44 % Result found by SubtermCWHack
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.44 % Search class: FHUNF-FFSS11-SFFFFFNN
% 0.14/0.44 % partial match(1): FHUNF-FFSF11-SFFFFFNN
% 0.14/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.44 % Preprocessing time : 0.001 s
% 0.14/0.44
% 0.14/0.44 % Proof found!
% 0.14/0.44 % SZS status Unsatisfiable
% 0.14/0.44 % SZS output start CNFRefutation
% See solution above
% 0.14/0.44 % Parsed axioms : 30
% 0.14/0.44 % Removed by relevancy pruning/SinE : 19
% 0.14/0.44 % Initial clauses : 11
% 0.14/0.44 % Removed in clause preprocessing : 0
% 0.14/0.44 % Initial clauses in saturation : 11
% 0.14/0.44 % Processed clauses : 147
% 0.14/0.44 % ...of these trivial : 0
% 0.14/0.44 % ...subsumed : 59
% 0.14/0.44 % ...remaining for further processing : 88
% 0.14/0.44 % Other redundant clauses eliminated : 0
% 0.14/0.44 % Clauses deleted for lack of memory : 0
% 0.14/0.44 % Backward-subsumed : 5
% 0.14/0.44 % Backward-rewritten : 1
% 0.14/0.44 % Generated clauses : 529
% 0.14/0.44 % ...of the previous two non-redundant : 467
% 0.14/0.44 % ...aggressively subsumed : 0
% 0.14/0.44 % Contextual simplify-reflections : 0
% 0.14/0.44 % Paramodulations : 529
% 0.14/0.44 % Factorizations : 0
% 0.14/0.44 % NegExts : 0
% 0.14/0.44 % Equation resolutions : 0
% 0.14/0.44 % Disequality decompositions : 0
% 0.14/0.44 % Total rewrite steps : 168
% 0.14/0.44 % ...of those cached : 159
% 0.14/0.44 % Propositional unsat checks : 0
% 0.14/0.44 % Propositional check models : 0
% 0.14/0.44 % Propositional check unsatisfiable : 0
% 0.14/0.44 % Propositional clauses : 0
% 0.14/0.44 % Propositional clauses after purity: 0
% 0.14/0.44 % Propositional unsat core size : 0
% 0.14/0.44 % Propositional preprocessing time : 0.000
% 0.14/0.44 % Propositional encoding time : 0.000
% 0.14/0.44 % Propositional solver time : 0.000
% 0.14/0.44 % Success case prop preproc time : 0.000
% 0.14/0.44 % Success case prop encoding time : 0.000
% 0.14/0.44 % Success case prop solver time : 0.000
% 0.14/0.44 % Current number of processed clauses : 82
% 0.14/0.44 % Positive orientable unit clauses : 10
% 0.14/0.44 % Positive unorientable unit clauses: 0
% 0.14/0.44 % Negative unit clauses : 1
% 0.14/0.44 % Non-unit-clauses : 71
% 0.14/0.44 % Current number of unprocessed clauses: 330
% 0.14/0.44 % ...number of literals in the above : 1262
% 0.14/0.44 % Current number of archived formulas : 0
% 0.14/0.44 % Current number of archived clauses : 6
% 0.14/0.44 % Clause-clause subsumption calls (NU) : 1012
% 0.14/0.44 % Rec. Clause-clause subsumption calls : 930
% 0.14/0.44 % Non-unit clause-clause subsumptions : 62
% 0.14/0.44 % Unit Clause-clause subsumption calls : 9
% 0.14/0.44 % Rewrite failures with RHS unbound : 0
% 0.14/0.44 % BW rewrite match attempts : 6
% 0.14/0.44 % BW rewrite match successes : 3
% 0.14/0.44 % Condensation attempts : 0
% 0.14/0.44 % Condensation successes : 0
% 0.14/0.44 % Termbank termtop insertions : 7654
% 0.14/0.44 % Search garbage collected termcells : 151
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.010 s
% 0.14/0.44 % System time : 0.005 s
% 0.14/0.44 % Total time : 0.015 s
% 0.14/0.44 % Maximum resident set size: 3660 pages
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.012 s
% 0.14/0.44 % System time : 0.010 s
% 0.14/0.44 % Total time : 0.021 s
% 0.14/0.44 % Maximum resident set size: 4608 pages
% 0.14/0.44 % E exiting
%------------------------------------------------------------------------------