%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD069-1 : 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 : 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:22:57 PM UTC 2026
% Result : Unsatisfiable 0.27s 0.65s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of clauses : 44 ( 18 unt; 3 nHn; 44 RR)
% Number of literals : 89 ( 0 equ; 46 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 54 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(symmetry_of_equality,axiom,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation) ).
cnf(add_equals_additive_identity_6,negated_conjecture,
equalish(add(a,b),additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_equals_additive_identity_6) ).
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/FLD001-0.ax',totality_of_order_relation) ).
cnf(transitivity_of_order_relation,axiom,
( ~ less_or_equal(X3,X2)
| ~ less_or_equal(X1,X3)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',transitivity_of_order_relation) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_identity) ).
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/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_order_relation_and_addition) ).
cnf(existence_of_identity_addition,axiom,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_identity_addition) ).
cnf(less_or_equal_3,negated_conjecture,
less_or_equal(additive_identity,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_3) ).
cnf(antisymmetry_of_order_relation,axiom,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',antisymmetry_of_order_relation) ).
cnf(b_not_equal_to_additive_identity_5,negated_conjecture,
~ equalish(b,additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_not_equal_to_additive_identity_5) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined) ).
cnf(less_or_equal_4,negated_conjecture,
less_or_equal(additive_identity,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_4) ).
cnf(c_0_13,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_14,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_15,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_13 ).
cnf(c_0_16,negated_conjecture,
equalish(add(a,b),additive_identity),
add_equals_additive_identity_6 ).
cnf(c_0_17,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_18,plain,
( ~ equalish(X3,X1)
| ~ less_or_equal(X3,X2)
| less_or_equal(X1,X2) ),
c_0_14 ).
cnf(c_0_19,negated_conjecture,
equalish(additive_identity,add(a,b)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
c_0_17 ).
cnf(c_0_21,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_22,negated_conjecture,
( ~ less_or_equal(additive_identity,X1)
| less_or_equal(add(a,b),X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( ~ defined(X1)
| less_or_equal(X1,X1) ),
inference(ef,[status(thm)],[c_0_20]) ).
cnf(c_0_24,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_25,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_26,plain,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_27,plain,
( ~ less_or_equal(X3,X2)
| ~ less_or_equal(X1,X3)
| less_or_equal(X1,X2) ),
c_0_21 ).
cnf(c_0_28,negated_conjecture,
less_or_equal(add(a,b),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_29,plain,
( ~ less_or_equal(X1,X3)
| ~ defined(X2)
| less_or_equal(add(X1,X2),add(X3,X2)) ),
c_0_25 ).
cnf(c_0_30,negated_conjecture,
less_or_equal(additive_identity,a),
less_or_equal_3 ).
cnf(c_0_31,plain,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[antisymmetry_of_order_relation]) ).
cnf(c_0_32,negated_conjecture,
~ equalish(b,additive_identity),
inference(fof_simplification,[status(thm)],[b_not_equal_to_additive_identity_5]) ).
cnf(c_0_33,plain,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
c_0_26 ).
cnf(c_0_34,negated_conjecture,
( ~ less_or_equal(X1,add(a,b))
| less_or_equal(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,negated_conjecture,
( ~ defined(X1)
| less_or_equal(add(additive_identity,X1),add(a,X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_37,plain,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| equalish(X1,X2) ),
c_0_31 ).
cnf(c_0_38,negated_conjecture,
less_or_equal(additive_identity,b),
less_or_equal_4 ).
cnf(c_0_39,negated_conjecture,
~ equalish(b,additive_identity),
c_0_32 ).
cnf(c_0_40,plain,
( ~ defined(X1)
| ~ less_or_equal(add(additive_identity,X1),X2)
| less_or_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_33]) ).
cnf(c_0_41,negated_conjecture,
less_or_equal(add(additive_identity,b),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_42,negated_conjecture,
~ less_or_equal(b,additive_identity),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_36])]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : FLD069-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n009.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Mon Sep 21 15:44:42 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.27/0.54 Running first-order theorem proving
% 0.27/0.54 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.27/0.65 % Version: 3.5.1
% 0.27/0.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.65 % Starting sh5l with 300s (1) cores
% 0.27/0.65 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2127078 completed with status 0
% 0.27/0.65 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.27/0.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.65 % No SInE strategy applied
% 0.27/0.65 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.27/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.27/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.27/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.27/0.65 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 0.27/0.65 % Starting new_bool_3 with 269s (1) cores
% 0.27/0.65 % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 0.27/0.65 % H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with pid 2127084 completed with status 0
% 0.27/0.65 % Result found by H----_102_C18_F1_PI_AE_CS_SP_PS_S2S
% 0.27/0.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.65 % No SInE strategy applied
% 0.27/0.65 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.27/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.27/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.27/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.27/0.65 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 0.27/0.65 % Preprocessing time : 0.002 s
% 0.27/0.65 % Presaturation interreduction done
% 0.27/0.65
% 0.27/0.65 % Proof found!
% 0.27/0.65 % SZS status Unsatisfiable
% 0.27/0.65 % SZS output start CNFRefutation
% See solution above
% 0.27/0.65 % Parsed axioms : 33
% 0.27/0.65 % Removed by relevancy pruning/SinE : 0
% 0.27/0.65 % Initial clauses : 33
% 0.27/0.65 % Removed in clause preprocessing : 0
% 0.27/0.65 % Initial clauses in saturation : 33
% 0.27/0.65 % Processed clauses : 201
% 0.27/0.65 % ...of these trivial : 10
% 0.27/0.65 % ...subsumed : 10
% 0.27/0.65 % ...remaining for further processing : 181
% 0.27/0.65 % Other redundant clauses eliminated : 0
% 0.27/0.65 % Clauses deleted for lack of memory : 0
% 0.27/0.65 % Backward-subsumed : 0
% 0.27/0.65 % Backward-rewritten : 1
% 0.27/0.65 % Generated clauses : 923
% 0.27/0.65 % ...of the previous two non-redundant : 779
% 0.27/0.65 % ...aggressively subsumed : 0
% 0.27/0.65 % Contextual simplify-reflections : 0
% 0.27/0.65 % Paramodulations : 921
% 0.27/0.65 % Factorizations : 2
% 0.27/0.65 % NegExts : 0
% 0.27/0.65 % Equation resolutions : 0
% 0.27/0.65 % Disequality decompositions : 0
% 0.27/0.65 % Total rewrite steps : 310
% 0.27/0.65 % ...of those cached : 261
% 0.27/0.65 % Propositional unsat checks : 0
% 0.27/0.65 % Propositional check models : 0
% 0.27/0.65 % Propositional check unsatisfiable : 0
% 0.27/0.65 % Propositional clauses : 0
% 0.27/0.65 % Propositional clauses after purity: 0
% 0.27/0.65 % Propositional unsat core size : 0
% 0.27/0.65 % Propositional preprocessing time : 0.000
% 0.27/0.65 % Propositional encoding time : 0.000
% 0.27/0.65 % Propositional solver time : 0.000
% 0.27/0.65 % Success case prop preproc time : 0.000
% 0.27/0.65 % Success case prop encoding time : 0.000
% 0.27/0.65 % Success case prop solver time : 0.000
% 0.27/0.65 % Current number of processed clauses : 147
% 0.27/0.65 % Positive orientable unit clauses : 58
% 0.27/0.65 % Positive unorientable unit clauses: 0
% 0.27/0.65 % Negative unit clauses : 3
% 0.27/0.65 % Non-unit-clauses : 86
% 0.27/0.65 % Current number of unprocessed clauses: 628
% 0.27/0.65 % ...number of literals in the above : 1350
% 0.27/0.65 % Current number of archived formulas : 0
% 0.27/0.65 % Current number of archived clauses : 34
% 0.27/0.65 % Clause-clause subsumption calls (NU) : 579
% 0.27/0.65 % Rec. Clause-clause subsumption calls : 527
% 0.27/0.65 % Non-unit clause-clause subsumptions : 10
% 0.27/0.65 % Unit Clause-clause subsumption calls : 12
% 0.27/0.65 % Rewrite failures with RHS unbound : 0
% 0.27/0.65 % BW rewrite match attempts : 1
% 0.27/0.65 % BW rewrite match successes : 1
% 0.27/0.65 % Condensation attempts : 0
% 0.27/0.65 % Condensation successes : 0
% 0.27/0.65 % Termbank termtop insertions : 11894
% 0.27/0.65 % Search garbage collected termcells : 71
% 0.27/0.65
% 0.27/0.65 % -------------------------------------------------
% 0.27/0.65 % User time : 0.026 s
% 0.27/0.65 % System time : 0.008 s
% 0.27/0.65 % Total time : 0.034 s
% 0.27/0.65 % Maximum resident set size: 3608 pages
% 0.27/0.65
% 0.27/0.65 % -------------------------------------------------
% 0.27/0.65 % User time : 0.102 s
% 0.27/0.65 % System time : 0.024 s
% 0.27/0.65 % Total time : 0.126 s
% 0.27/0.65 % Maximum resident set size: 4864 pages
% 0.27/0.65 % E exiting
%------------------------------------------------------------------------------