%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : FLD008-4 : 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 : n011.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:06 PM UTC 2026
% Result : Unsatisfiable 0.44s 0.51s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of clauses : 50 ( 25 unt; 5 nHn; 50 RR)
% Number of literals : 96 ( 0 equ; 44 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 59 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(totality_of_order_relation,axiom,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',totality_of_order_relation) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
cnf(antisymmetry_of_order_relation,axiom,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| sum(additive_identity,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',antisymmetry_of_order_relation) ).
cnf(associativity_addition_1,axiom,
( ~ sum(X5,X6,X3)
| ~ sum(X4,X6,X2)
| ~ sum(X1,X4,X5)
| sum(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',associativity_addition_1) ).
cnf(commutativity_addition,axiom,
( ~ sum(X2,X1,X3)
| sum(X1,X2,X3) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/FLD002-0.ax',existence_of_inverse_addition) ).
cnf(sum_5,negated_conjecture,
sum(a,b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_5) ).
cnf(d_is_defined,hypothesis,
defined(d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d_is_defined) ).
cnf(sum_6,negated_conjecture,
sum(additive_inverse(a),additive_inverse(b),d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_6) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined) ).
cnf(c_is_defined,hypothesis,
defined(c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_is_defined) ).
cnf(not_sum_7,negated_conjecture,
~ sum(additive_identity,additive_inverse(c),d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_sum_7) ).
cnf(c_0_12,plain,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[totality_of_order_relation]) ).
cnf(c_0_13,plain,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
c_0_12 ).
cnf(c_0_14,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_15,plain,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| sum(additive_identity,X1,X2) ),
inference(fof_simplification,[status(thm)],[antisymmetry_of_order_relation]) ).
cnf(c_0_16,hypothesis,
( ~ defined(X1)
| less_or_equal(X1,a)
| less_or_equal(a,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,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_18,plain,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| sum(additive_identity,X1,X2) ),
c_0_15 ).
cnf(c_0_19,hypothesis,
less_or_equal(a,a),
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_20,plain,
( ~ sum(X2,X1,X3)
| sum(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_21,plain,
( ~ defined(X1)
| sum(additive_inverse(X1),X1,additive_identity) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).
cnf(c_0_22,plain,
( ~ sum(X5,X6,X3)
| ~ sum(X4,X6,X2)
| ~ sum(X1,X4,X5)
| sum(X1,X2,X3) ),
c_0_17 ).
cnf(c_0_23,hypothesis,
sum(additive_identity,a,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_19])]) ).
cnf(c_0_24,plain,
( ~ sum(X2,X1,X3)
| sum(X1,X2,X3) ),
c_0_20 ).
cnf(c_0_25,negated_conjecture,
sum(a,b,c),
sum_5 ).
cnf(c_0_26,hypothesis,
defined(d),
d_is_defined ).
cnf(c_0_27,plain,
( ~ defined(X1)
| sum(additive_inverse(X1),X1,additive_identity) ),
c_0_21 ).
cnf(c_0_28,hypothesis,
( ~ sum(X1,X3,additive_identity)
| ~ sum(X3,a,X2)
| sum(X1,X2,a) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
sum(b,a,c),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,hypothesis,
( ~ defined(X1)
| less_or_equal(X1,d)
| less_or_equal(d,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_26]) ).
cnf(c_0_31,plain,
( ~ defined(X1)
| sum(X1,additive_inverse(X1),additive_identity) ),
inference(spm,[status(thm)],[c_0_24,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
sum(additive_inverse(a),additive_inverse(b),d),
sum_6 ).
cnf(c_0_33,negated_conjecture,
( ~ sum(X1,b,additive_identity)
| sum(X1,c,a) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,hypothesis,
less_or_equal(d,d),
inference(spm,[status(thm)],[c_0_30,c_0_26]) ).
cnf(c_0_35,plain,
( ~ sum(X1,X4,X3)
| ~ sum(X4,additive_inverse(X3),X2)
| ~ defined(X3)
| sum(X1,X2,additive_identity) ),
inference(spm,[status(thm)],[c_0_22,c_0_31]) ).
cnf(c_0_36,negated_conjecture,
sum(additive_inverse(b),additive_inverse(a),d),
inference(spm,[status(thm)],[c_0_24,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
( ~ sum(X1,b,additive_identity)
| sum(c,X1,a) ),
inference(spm,[status(thm)],[c_0_24,c_0_33]) ).
cnf(c_0_38,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_39,hypothesis,
sum(additive_identity,d,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_34]),c_0_34])]) ).
cnf(c_0_40,negated_conjecture,
( ~ sum(X1,additive_inverse(b),a)
| sum(X1,d,additive_identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_14])]) ).
cnf(c_0_41,negated_conjecture,
sum(c,additive_inverse(b),a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_27]),c_0_38])]) ).
cnf(c_0_42,hypothesis,
( ~ sum(X1,X3,additive_identity)
| ~ sum(X3,d,X2)
| sum(X1,X2,d) ),
inference(spm,[status(thm)],[c_0_22,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
sum(c,d,additive_identity),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,hypothesis,
( ~ sum(X1,c,additive_identity)
| sum(X1,additive_identity,d) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_45,hypothesis,
defined(c),
c_is_defined ).
cnf(c_0_46,negated_conjecture,
~ sum(additive_identity,additive_inverse(c),d),
inference(fof_simplification,[status(thm)],[not_sum_7]) ).
cnf(c_0_47,hypothesis,
sum(additive_inverse(c),additive_identity,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_27]),c_0_45])]) ).
cnf(c_0_48,negated_conjecture,
~ sum(additive_identity,additive_inverse(c),d),
c_0_46 ).
cnf(c_0_49,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_47]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : FLD008-4 : 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.37 % Computer : n011.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 15:36:56 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.43 Running first-order theorem proving
% 0.14/0.43 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.44/0.51 % Version: 3.5.1
% 0.44/0.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.44/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.44/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.44/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.44/0.51 % Starting sh5l with 300s (1) cores
% 0.44/0.51 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2260320 completed with status 0
% 0.44/0.51 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.44/0.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.44/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.44/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.44/0.51 % No SInE strategy applied
% 0.44/0.51 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.44/0.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.44/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.44/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.44/0.51 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 0.44/0.51 % Starting new_bool_3 with 269s (1) cores
% 0.44/0.51 % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 0.44/0.51 % SubtermCWHack with pid 2260324 completed with status 0
% 0.44/0.51 % Result found by SubtermCWHack
% 0.44/0.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.44/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.44/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.44/0.51 % No SInE strategy applied
% 0.44/0.51 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.44/0.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.44/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.44/0.51 % Preprocessing time : 0.001 s
% 0.44/0.51
% 0.44/0.51 % Proof found!
% 0.44/0.51 % SZS status Unsatisfiable
% 0.44/0.51 % SZS output start CNFRefutation
% See solution above
% 0.44/0.51 % Parsed axioms : 33
% 0.44/0.51 % Removed by relevancy pruning/SinE : 0
% 0.44/0.51 % Initial clauses : 33
% 0.44/0.51 % Removed in clause preprocessing : 0
% 0.44/0.51 % Initial clauses in saturation : 33
% 0.44/0.51 % Processed clauses : 691
% 0.44/0.51 % ...of these trivial : 0
% 0.44/0.51 % ...subsumed : 193
% 0.44/0.51 % ...remaining for further processing : 498
% 0.44/0.51 % Other redundant clauses eliminated : 0
% 0.44/0.51 % Clauses deleted for lack of memory : 0
% 0.44/0.51 % Backward-subsumed : 3
% 0.44/0.51 % Backward-rewritten : 0
% 0.44/0.51 % Generated clauses : 2676
% 0.44/0.51 % ...of the previous two non-redundant : 2250
% 0.44/0.51 % ...aggressively subsumed : 0
% 0.44/0.51 % Contextual simplify-reflections : 0
% 0.44/0.51 % Paramodulations : 2676
% 0.44/0.51 % Factorizations : 0
% 0.44/0.51 % NegExts : 0
% 0.44/0.51 % Equation resolutions : 0
% 0.44/0.51 % Disequality decompositions : 0
% 0.44/0.51 % Total rewrite steps : 716
% 0.44/0.51 % ...of those cached : 679
% 0.44/0.51 % Propositional unsat checks : 0
% 0.44/0.51 % Propositional check models : 0
% 0.44/0.51 % Propositional check unsatisfiable : 0
% 0.44/0.51 % Propositional clauses : 0
% 0.44/0.51 % Propositional clauses after purity: 0
% 0.44/0.51 % Propositional unsat core size : 0
% 0.44/0.51 % Propositional preprocessing time : 0.000
% 0.44/0.51 % Propositional encoding time : 0.000
% 0.44/0.51 % Propositional solver time : 0.000
% 0.44/0.51 % Success case prop preproc time : 0.000
% 0.44/0.51 % Success case prop encoding time : 0.000
% 0.44/0.51 % Success case prop solver time : 0.000
% 0.44/0.51 % Current number of processed clauses : 495
% 0.44/0.51 % Positive orientable unit clauses : 50
% 0.44/0.51 % Positive unorientable unit clauses: 0
% 0.44/0.51 % Negative unit clauses : 2
% 0.44/0.51 % Non-unit-clauses : 443
% 0.44/0.51 % Current number of unprocessed clauses: 1592
% 0.44/0.51 % ...number of literals in the above : 6073
% 0.44/0.51 % Current number of archived formulas : 0
% 0.44/0.51 % Current number of archived clauses : 3
% 0.44/0.51 % Clause-clause subsumption calls (NU) : 12856
% 0.44/0.51 % Rec. Clause-clause subsumption calls : 9012
% 0.44/0.51 % Non-unit clause-clause subsumptions : 196
% 0.44/0.51 % Unit Clause-clause subsumption calls : 141
% 0.44/0.51 % Rewrite failures with RHS unbound : 0
% 0.44/0.51 % BW rewrite match attempts : 1
% 0.44/0.51 % BW rewrite match successes : 0
% 0.44/0.51 % Condensation attempts : 0
% 0.44/0.51 % Condensation successes : 0
% 0.44/0.51 % Termbank termtop insertions : 34226
% 0.44/0.51 % Search garbage collected termcells : 116
% 0.44/0.51
% 0.44/0.51 % -------------------------------------------------
% 0.44/0.51 % User time : 0.051 s
% 0.44/0.51 % System time : 0.009 s
% 0.44/0.51 % Total time : 0.059 s
% 0.44/0.51 % Maximum resident set size: 3404 pages
% 0.44/0.51
% 0.44/0.51 % -------------------------------------------------
% 0.44/0.51 % User time : 0.204 s
% 0.44/0.51 % System time : 0.029 s
% 0.44/0.51 % Total time : 0.233 s
% 0.44/0.51 % Maximum resident set size: 4608 pages
% 0.44/0.51 % E exiting
%------------------------------------------------------------------------------