%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD067-2 : 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 : n026.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 0.90s 0.66s
% Output : CNFRefutation 0.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 42 ( 15 unt; 3 nHn; 42 RR)
% Number of literals : 85 ( 0 equ; 43 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 51 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(symmetry_of_equality,axiom,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
cnf(compatibility_of_equality_and_order_relation,axiom,
( ~ equalish(X3,X1)
| ~ less_or_equal(X3,X2)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation) ).
cnf(add_equals_u_5,negated_conjecture,
equalish(add(b,additive_inverse(a)),u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',add_equals_u_5) ).
cnf(totality_of_order_relation,axiom,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',totality_of_order_relation) ).
cnf(existence_of_inverse_addition,axiom,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',existence_of_inverse_addition) ).
cnf(compatibility_of_order_relation_and_addition,axiom,
( ~ less_or_equal(X1,X3)
| ~ defined(X2)
| less_or_equal(add(X1,X2),add(X3,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_order_relation_and_addition) ).
cnf(less_or_equal_4,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_4) ).
cnf(transitivity_of_order_relation,axiom,
( ~ less_or_equal(X3,X2)
| ~ less_or_equal(X1,X3)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',transitivity_of_order_relation) ).
cnf(u_is_defined,hypothesis,
defined(u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_is_defined) ).
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/FLD001-0.ax',well_definedness_of_additive_inverse) ).
cnf(not_less_or_equal_6,negated_conjecture,
~ less_or_equal(additive_identity,u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_6) ).
cnf(c_0_12,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_13,plain,
( ~ equalish(X3,X1)
| ~ less_or_equal(X3,X2)
| less_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[compatibility_of_equality_and_order_relation]) ).
cnf(c_0_14,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_12 ).
cnf(c_0_15,negated_conjecture,
equalish(add(b,additive_inverse(a)),u),
add_equals_u_5 ).
cnf(c_0_16,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_17,plain,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).
cnf(c_0_18,plain,
( ~ less_or_equal(X1,X3)
| ~ defined(X2)
| less_or_equal(add(X1,X2),add(X3,X2)) ),
inference(fof_simplification,[status(thm)],[compatibility_of_order_relation_and_addition]) ).
cnf(c_0_19,plain,
( ~ equalish(X3,X1)
| ~ less_or_equal(X3,X2)
| less_or_equal(X1,X2) ),
c_0_13 ).
cnf(c_0_20,negated_conjecture,
equalish(u,add(b,additive_inverse(a))),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
c_0_16 ).
cnf(c_0_22,plain,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
c_0_17 ).
cnf(c_0_23,plain,
( ~ less_or_equal(X1,X3)
| ~ defined(X2)
| less_or_equal(add(X1,X2),add(X3,X2)) ),
c_0_18 ).
cnf(c_0_24,negated_conjecture,
less_or_equal(a,b),
less_or_equal_4 ).
cnf(c_0_25,plain,
( ~ less_or_equal(X3,X2)
| ~ less_or_equal(X1,X3)
| less_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_order_relation]) ).
cnf(c_0_26,negated_conjecture,
( ~ less_or_equal(u,X1)
| less_or_equal(add(b,additive_inverse(a)),X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
( ~ defined(X1)
| less_or_equal(X1,X1) ),
inference(ef,[status(thm)],[c_0_21]) ).
cnf(c_0_28,hypothesis,
defined(u),
u_is_defined ).
cnf(c_0_29,plain,
( ~ defined(X2)
| ~ less_or_equal(add(X2,additive_inverse(X2)),X1)
| less_or_equal(additive_identity,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_22]) ).
cnf(c_0_30,negated_conjecture,
( ~ defined(X1)
| less_or_equal(add(a,X1),add(b,X1)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_32,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_additive_inverse]) ).
cnf(c_0_33,plain,
( ~ less_or_equal(X3,X2)
| ~ less_or_equal(X1,X3)
| less_or_equal(X1,X2) ),
c_0_25 ).
cnf(c_0_34,negated_conjecture,
less_or_equal(add(b,additive_inverse(a)),u),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_35,negated_conjecture,
( ~ defined(additive_inverse(a))
| less_or_equal(additive_identity,add(b,additive_inverse(a))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_36,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
c_0_32 ).
cnf(c_0_37,negated_conjecture,
~ less_or_equal(additive_identity,u),
inference(fof_simplification,[status(thm)],[not_less_or_equal_6]) ).
cnf(c_0_38,negated_conjecture,
( ~ less_or_equal(X1,add(b,additive_inverse(a)))
| less_or_equal(X1,u) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
less_or_equal(additive_identity,add(b,additive_inverse(a))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_31])]) ).
cnf(c_0_40,negated_conjecture,
~ less_or_equal(additive_identity,u),
c_0_37 ).
cnf(c_0_41,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : FLD067-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.44 % Computer : n026.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Mon Sep 21 15:47:07 UTC 2026
% 0.19/0.44 % CPUTime :
% 0.19/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/0.51 Running first-order theorem proving
% 0.26/0.51 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.90/0.66 % Version: 3.5.1
% 0.90/0.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.90/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.90/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.90/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.90/0.66 % Starting new_bool_1 with 300s (1) cores
% 0.90/0.66 % Starting sh5l with 300s (1) cores
% 0.90/0.66 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2642840 completed with status 0
% 0.90/0.66 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.90/0.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.90/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.90/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.90/0.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.90/0.66 % No SInE strategy applied
% 0.90/0.66 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.90/0.66 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.90/0.66 % Starting SubtermCWHack with 136s (1) cores
% 0.90/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.90/0.66 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 0.90/0.66 % Starting new_bool_3 with 269s (1) cores
% 0.90/0.66 % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 0.90/0.66 % H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with pid 2642847 completed with status 0
% 0.90/0.66 % Result found by H----_102_C18_F1_PI_AE_CS_SP_PS_S2S
% 0.90/0.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.90/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.90/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.90/0.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.90/0.66 % No SInE strategy applied
% 0.90/0.66 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.90/0.66 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.90/0.66 % Starting SubtermCWHack with 136s (1) cores
% 0.90/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.90/0.66 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 0.90/0.66 % Preprocessing time : 0.002 s
% 0.90/0.66 % Presaturation interreduction done
% 0.90/0.66
% 0.90/0.66 % Proof found!
% 0.90/0.66 % SZS status Unsatisfiable
% 0.90/0.66 % SZS output start CNFRefutation
% See solution above
% 0.90/0.66 % Parsed axioms : 33
% 0.90/0.66 % Removed by relevancy pruning/SinE : 0
% 0.90/0.66 % Initial clauses : 33
% 0.90/0.66 % Removed in clause preprocessing : 0
% 0.90/0.66 % Initial clauses in saturation : 33
% 0.90/0.66 % Processed clauses : 671
% 0.90/0.66 % ...of these trivial : 44
% 0.90/0.66 % ...subsumed : 191
% 0.90/0.66 % ...remaining for further processing : 436
% 0.90/0.66 % Other redundant clauses eliminated : 0
% 0.90/0.66 % Clauses deleted for lack of memory : 0
% 0.90/0.66 % Backward-subsumed : 4
% 0.90/0.66 % Backward-rewritten : 7
% 0.90/0.66 % Generated clauses : 4618
% 0.90/0.66 % ...of the previous two non-redundant : 3933
% 0.90/0.66 % ...aggressively subsumed : 0
% 0.90/0.66 % Contextual simplify-reflections : 4
% 0.90/0.66 % Paramodulations : 4616
% 0.90/0.66 % Factorizations : 2
% 0.90/0.66 % NegExts : 0
% 0.90/0.66 % Equation resolutions : 0
% 0.90/0.66 % Disequality decompositions : 0
% 0.90/0.66 % Total rewrite steps : 2311
% 0.90/0.66 % ...of those cached : 2209
% 0.90/0.66 % Propositional unsat checks : 0
% 0.90/0.66 % Propositional check models : 0
% 0.90/0.66 % Propositional check unsatisfiable : 0
% 0.90/0.66 % Propositional clauses : 0
% 0.90/0.66 % Propositional clauses after purity: 0
% 0.90/0.66 % Propositional unsat core size : 0
% 0.90/0.66 % Propositional preprocessing time : 0.000
% 0.90/0.66 % Propositional encoding time : 0.000
% 0.90/0.66 % Propositional solver time : 0.000
% 0.90/0.66 % Success case prop preproc time : 0.000
% 0.90/0.66 % Success case prop encoding time : 0.000
% 0.90/0.66 % Success case prop solver time : 0.000
% 0.90/0.66 % Current number of processed clauses : 392
% 0.90/0.66 % Positive orientable unit clauses : 104
% 0.90/0.66 % Positive unorientable unit clauses: 0
% 0.90/0.66 % Negative unit clauses : 2
% 0.90/0.66 % Non-unit-clauses : 286
% 0.90/0.66 % Current number of unprocessed clauses: 3313
% 0.90/0.66 % ...number of literals in the above : 7908
% 0.90/0.66 % Current number of archived formulas : 0
% 0.90/0.66 % Current number of archived clauses : 44
% 0.90/0.66 % Clause-clause subsumption calls (NU) : 7686
% 0.90/0.66 % Rec. Clause-clause subsumption calls : 6619
% 0.90/0.66 % Non-unit clause-clause subsumptions : 199
% 0.90/0.66 % Unit Clause-clause subsumption calls : 294
% 0.90/0.66 % Rewrite failures with RHS unbound : 0
% 0.90/0.66 % BW rewrite match attempts : 8
% 0.90/0.66 % BW rewrite match successes : 7
% 0.90/0.66 % Condensation attempts : 0
% 0.90/0.66 % Condensation successes : 0
% 0.90/0.66 % Termbank termtop insertions : 59455
% 0.90/0.66 % Search garbage collected termcells : 71
% 0.90/0.66
% 0.90/0.66 % -------------------------------------------------
% 0.90/0.66 % User time : 0.109 s
% 0.90/0.66 % System time : 0.008 s
% 0.90/0.66 % Total time : 0.117 s
% 0.90/0.66 % Maximum resident set size: 3660 pages
% 0.90/0.66
% 0.90/0.66 % -------------------------------------------------
% 0.90/0.66 % User time : 0.482 s
% 0.90/0.66 % System time : 0.040 s
% 0.90/0.66 % Total time : 0.522 s
% 0.90/0.66 % Maximum resident set size: 4608 pages
% 0.90/0.66 % E exiting
%------------------------------------------------------------------------------