%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD067-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 : n020.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:56 PM UTC 2026
% Result : Unsatisfiable 2.25s 0.77s
% Output : CNFRefutation 2.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 28 ( 10 unt; 0 nHn; 28 RR)
% Number of literals : 60 ( 0 equ; 35 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(compatibility_of_order_relation_and_addition,axiom,
( ~ sum(X4,X5,X2)
| ~ sum(X3,X5,X1)
| ~ less_or_equal(X3,X4)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',compatibility_of_order_relation_and_addition) ).
cnf(totality_of_addition,axiom,
( ~ defined(X2)
| ~ defined(X1)
| sum(X1,X2,add(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',totality_of_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(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(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(not_less_or_equal_4,negated_conjecture,
~ less_or_equal(additive_identity,add(b,additive_inverse(a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_4) ).
cnf(less_or_equal_3,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_3) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
cnf(c_0_9,plain,
( ~ sum(X4,X5,X2)
| ~ sum(X3,X5,X1)
| ~ less_or_equal(X3,X4)
| less_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[compatibility_of_order_relation_and_addition]) ).
cnf(c_0_10,plain,
( ~ defined(X2)
| ~ defined(X1)
| sum(X1,X2,add(X1,X2)) ),
inference(fof_simplification,[status(thm)],[totality_of_addition]) ).
cnf(c_0_11,plain,
( ~ sum(X2,X1,X3)
| sum(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_12,plain,
( ~ defined(X1)
| sum(additive_inverse(X1),X1,additive_identity) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).
cnf(c_0_13,plain,
( ~ sum(X4,X5,X2)
| ~ sum(X3,X5,X1)
| ~ less_or_equal(X3,X4)
| less_or_equal(X1,X2) ),
c_0_9 ).
cnf(c_0_14,plain,
( ~ defined(X2)
| ~ defined(X1)
| sum(X1,X2,add(X1,X2)) ),
c_0_10 ).
cnf(c_0_15,plain,
( ~ sum(X2,X1,X3)
| sum(X1,X2,X3) ),
c_0_11 ).
cnf(c_0_16,plain,
( ~ defined(X1)
| sum(additive_inverse(X1),X1,additive_identity) ),
c_0_12 ).
cnf(c_0_17,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_additive_inverse]) ).
cnf(c_0_18,negated_conjecture,
~ less_or_equal(additive_identity,add(b,additive_inverse(a))),
inference(fof_simplification,[status(thm)],[not_less_or_equal_4]) ).
cnf(c_0_19,plain,
( ~ sum(X4,X3,X1)
| ~ defined(X2)
| ~ defined(X3)
| ~ less_or_equal(X4,X2)
| less_or_equal(X1,add(X2,X3)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
( ~ defined(X1)
| sum(X1,additive_inverse(X1),additive_identity) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
c_0_17 ).
cnf(c_0_22,negated_conjecture,
~ less_or_equal(additive_identity,add(b,additive_inverse(a))),
c_0_18 ).
cnf(c_0_23,plain,
( ~ defined(X2)
| ~ defined(X1)
| ~ less_or_equal(X2,X1)
| less_or_equal(additive_identity,add(X1,additive_inverse(X2))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_24,negated_conjecture,
less_or_equal(a,b),
less_or_equal_3 ).
cnf(c_0_25,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_26,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : FLD067-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.36 % Computer : n020.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 15:45:18 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/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
% 2.25/0.77 % Version: 3.5.1
% 2.25/0.77 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.25/0.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.25/0.77 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.25/0.77 % Starting new_bool_3 with 300s (1) cores
% 2.25/0.77 % Starting new_bool_1 with 300s (1) cores
% 2.25/0.77 % Starting sh5l with 300s (1) cores
% 2.25/0.77 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3291001 completed with status 0
% 2.25/0.77 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.25/0.77 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.25/0.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.25/0.77 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.25/0.77 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.25/0.77 % No SInE strategy applied
% 2.25/0.77 % Search class: FGUNF-FFMS21-SFFFFFNN
% 2.25/0.77 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 2.25/0.77 % Starting SubtermCWHack with 136s (1) cores
% 2.25/0.77 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.25/0.77 % Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 2.25/0.77 % Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.25/0.77 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.25/0.77 % G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 3291012 completed with status 0
% 2.25/0.77 % Result found by G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 2.25/0.77 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.25/0.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.25/0.77 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.25/0.77 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.25/0.77 % No SInE strategy applied
% 2.25/0.77 % Search class: FGUNF-FFMS21-SFFFFFNN
% 2.25/0.77 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 2.25/0.77 % Starting SubtermCWHack with 136s (1) cores
% 2.25/0.77 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.25/0.77 % Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 2.25/0.77 % Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.25/0.77 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.25/0.77 % Preprocessing time : 0.002 s
% 2.25/0.77 % Presaturation interreduction done
% 2.25/0.77
% 2.25/0.77 % Proof found!
% 2.25/0.77 % SZS status Unsatisfiable
% 2.25/0.77 % SZS output start CNFRefutation
% See solution above
% 2.25/0.77 % Parsed axioms : 30
% 2.25/0.77 % Removed by relevancy pruning/SinE : 0
% 2.25/0.77 % Initial clauses : 30
% 2.25/0.77 % Removed in clause preprocessing : 0
% 2.25/0.77 % Initial clauses in saturation : 30
% 2.25/0.77 % Processed clauses : 2415
% 2.25/0.77 % ...of these trivial : 2
% 2.25/0.77 % ...subsumed : 1345
% 2.25/0.77 % ...remaining for further processing : 1068
% 2.25/0.77 % Other redundant clauses eliminated : 0
% 2.25/0.77 % Clauses deleted for lack of memory : 0
% 2.25/0.77 % Backward-subsumed : 109
% 2.25/0.77 % Backward-rewritten : 59
% 2.25/0.77 % Generated clauses : 10708
% 2.25/0.77 % ...of the previous two non-redundant : 9853
% 2.25/0.77 % ...aggressively subsumed : 0
% 2.25/0.77 % Contextual simplify-reflections : 13
% 2.25/0.77 % Paramodulations : 10708
% 2.25/0.77 % Factorizations : 0
% 2.25/0.77 % NegExts : 0
% 2.25/0.77 % Equation resolutions : 0
% 2.25/0.77 % Disequality decompositions : 0
% 2.25/0.77 % Total rewrite steps : 3774
% 2.25/0.77 % ...of those cached : 3758
% 2.25/0.77 % Propositional unsat checks : 0
% 2.25/0.77 % Propositional check models : 0
% 2.25/0.77 % Propositional check unsatisfiable : 0
% 2.25/0.77 % Propositional clauses : 0
% 2.25/0.77 % Propositional clauses after purity: 0
% 2.25/0.77 % Propositional unsat core size : 0
% 2.25/0.77 % Propositional preprocessing time : 0.000
% 2.25/0.77 % Propositional encoding time : 0.000
% 2.25/0.77 % Propositional solver time : 0.000
% 2.25/0.77 % Success case prop preproc time : 0.000
% 2.25/0.77 % Success case prop encoding time : 0.000
% 2.25/0.77 % Success case prop solver time : 0.000
% 2.25/0.77 % Current number of processed clauses : 870
% 2.25/0.77 % Positive orientable unit clauses : 16
% 2.25/0.77 % Positive unorientable unit clauses: 0
% 2.25/0.77 % Negative unit clauses : 2
% 2.25/0.77 % Non-unit-clauses : 852
% 2.25/0.77 % Current number of unprocessed clauses: 7431
% 2.25/0.77 % ...number of literals in the above : 29112
% 2.25/0.77 % Current number of archived formulas : 0
% 2.25/0.77 % Current number of archived clauses : 198
% 2.25/0.77 % Clause-clause subsumption calls (NU) : 50695
% 2.25/0.77 % Rec. Clause-clause subsumption calls : 31393
% 2.25/0.77 % Non-unit clause-clause subsumptions : 1461
% 2.25/0.77 % Unit Clause-clause subsumption calls : 515
% 2.25/0.77 % Rewrite failures with RHS unbound : 0
% 2.25/0.77 % BW rewrite match attempts : 7
% 2.25/0.77 % BW rewrite match successes : 4
% 2.25/0.77 % Condensation attempts : 0
% 2.25/0.77 % Condensation successes : 0
% 2.25/0.77 % Termbank termtop insertions : 168880
% 2.25/0.77 % Search garbage collected termcells : 116
% 2.25/0.77
% 2.25/0.77 % -------------------------------------------------
% 2.25/0.77 % User time : 0.268 s
% 2.25/0.77 % System time : 0.012 s
% 2.25/0.77 % Total time : 0.280 s
% 2.25/0.77 % Maximum resident set size: 3660 pages
% 2.25/0.77
% 2.25/0.77 % -------------------------------------------------
% 2.25/0.77 % User time : 1.522 s
% 2.25/0.77 % System time : 0.085 s
% 2.25/0.77 % Total time : 1.607 s
% 2.25/0.77 % Maximum resident set size: 4608 pages
% 2.25/0.77 % E exiting
%------------------------------------------------------------------------------