%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : FLD060-2 : 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 : n008.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:22 PM UTC 2026
% Result : Unsatisfiable 0.40s 0.50s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of clauses : 46 ( 21 unt; 3 nHn; 46 RR)
% Number of literals : 91 ( 0 equ; 45 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 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_v_6,negated_conjecture,
equalish(add(b,b),v),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_equals_v_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(v_is_defined,hypothesis,
defined(v),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v_is_defined) ).
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(commutativity_addition,axiom,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',commutativity_addition) ).
cnf(less_or_equal_7,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_7) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
cnf(add_equals_u_5,negated_conjecture,
equalish(add(a,a),u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_equals_u_5) ).
cnf(not_less_or_equal_8,negated_conjecture,
~ less_or_equal(u,v),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_8) ).
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(b,b),v),
add_equals_v_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(v,add(b,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(v,X1)
| less_or_equal(add(b,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,hypothesis,
defined(v),
v_is_defined ).
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(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
inference(fof_simplification,[status(thm)],[commutativity_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(b,b),v),
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(a,b),
less_or_equal_7 ).
cnf(c_0_31,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
c_0_26 ).
cnf(c_0_32,negated_conjecture,
( ~ less_or_equal(X1,add(b,b))
| less_or_equal(X1,v) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( ~ defined(X1)
| less_or_equal(add(a,X1),add(b,X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_35,plain,
( ~ defined(X2)
| ~ defined(X1)
| ~ less_or_equal(add(X2,X1),X3)
| less_or_equal(add(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_31]) ).
cnf(c_0_36,negated_conjecture,
less_or_equal(add(a,b),v),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_37,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_38,negated_conjecture,
equalish(add(a,a),u),
add_equals_u_5 ).
cnf(c_0_39,negated_conjecture,
less_or_equal(add(b,a),v),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_34]),c_0_37])]) ).
cnf(c_0_40,negated_conjecture,
( ~ less_or_equal(add(a,a),X1)
| less_or_equal(u,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
~ less_or_equal(u,v),
inference(fof_simplification,[status(thm)],[not_less_or_equal_8]) ).
cnf(c_0_42,negated_conjecture,
( ~ less_or_equal(X1,add(b,a))
| less_or_equal(X1,v) ),
inference(spm,[status(thm)],[c_0_27,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
less_or_equal(u,add(b,a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_33]),c_0_37])]) ).
cnf(c_0_44,negated_conjecture,
~ less_or_equal(u,v),
c_0_41 ).
cnf(c_0_45,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD060-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n008.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 15:44:24 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.44 Running first-order theorem proving
% 0.15/0.44 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.40/0.50 % Version: 3.5.1
% 0.40/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.40/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.40/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.40/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.40/0.50 % Starting sh5l with 300s (1) cores
% 0.40/0.50 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1333053 completed with status 0
% 0.40/0.50 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.40/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.40/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.40/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.40/0.50 % No SInE strategy applied
% 0.40/0.50 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.40/0.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.40/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.40/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.40/0.50 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 0.40/0.50 % Starting new_bool_3 with 269s (1) cores
% 0.40/0.50 % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 0.40/0.50 % H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with pid 1333060 completed with status 0
% 0.40/0.50 % Result found by H----_102_C18_F1_PI_AE_CS_SP_PS_S2S
% 0.40/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.40/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.40/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.40/0.50 % No SInE strategy applied
% 0.40/0.50 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.40/0.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.40/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.40/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.40/0.50 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 0.40/0.50 % Preprocessing time : 0.002 s
% 0.40/0.50 % Presaturation interreduction done
% 0.40/0.50
% 0.40/0.50 % Proof found!
% 0.40/0.50 % SZS status Unsatisfiable
% 0.40/0.50 % SZS output start CNFRefutation
% See solution above
% 0.40/0.50 % Parsed axioms : 35
% 0.40/0.50 % Removed by relevancy pruning/SinE : 0
% 0.40/0.50 % Initial clauses : 35
% 0.40/0.50 % Removed in clause preprocessing : 0
% 0.40/0.50 % Initial clauses in saturation : 35
% 0.40/0.50 % Processed clauses : 462
% 0.40/0.50 % ...of these trivial : 25
% 0.40/0.50 % ...subsumed : 57
% 0.40/0.50 % ...remaining for further processing : 380
% 0.40/0.50 % Other redundant clauses eliminated : 0
% 0.40/0.50 % Clauses deleted for lack of memory : 0
% 0.40/0.50 % Backward-subsumed : 0
% 0.40/0.50 % Backward-rewritten : 2
% 0.40/0.50 % Generated clauses : 3009
% 0.40/0.50 % ...of the previous two non-redundant : 2395
% 0.40/0.50 % ...aggressively subsumed : 0
% 0.40/0.50 % Contextual simplify-reflections : 0
% 0.40/0.50 % Paramodulations : 3007
% 0.40/0.50 % Factorizations : 2
% 0.40/0.50 % NegExts : 0
% 0.40/0.50 % Equation resolutions : 0
% 0.40/0.50 % Disequality decompositions : 0
% 0.40/0.50 % Total rewrite steps : 1607
% 0.40/0.50 % ...of those cached : 1491
% 0.40/0.50 % Propositional unsat checks : 0
% 0.40/0.50 % Propositional check models : 0
% 0.40/0.50 % Propositional check unsatisfiable : 0
% 0.40/0.50 % Propositional clauses : 0
% 0.40/0.50 % Propositional clauses after purity: 0
% 0.40/0.50 % Propositional unsat core size : 0
% 0.40/0.50 % Propositional preprocessing time : 0.000
% 0.40/0.50 % Propositional encoding time : 0.000
% 0.40/0.50 % Propositional solver time : 0.000
% 0.40/0.50 % Success case prop preproc time : 0.000
% 0.40/0.50 % Success case prop encoding time : 0.000
% 0.40/0.50 % Success case prop solver time : 0.000
% 0.40/0.50 % Current number of processed clauses : 343
% 0.40/0.50 % Positive orientable unit clauses : 120
% 0.40/0.50 % Positive unorientable unit clauses: 0
% 0.40/0.50 % Negative unit clauses : 2
% 0.40/0.50 % Non-unit-clauses : 221
% 0.40/0.50 % Current number of unprocessed clauses: 2003
% 0.40/0.50 % ...number of literals in the above : 4698
% 0.40/0.50 % Current number of archived formulas : 0
% 0.40/0.50 % Current number of archived clauses : 37
% 0.40/0.50 % Clause-clause subsumption calls (NU) : 3912
% 0.40/0.50 % Rec. Clause-clause subsumption calls : 3331
% 0.40/0.50 % Non-unit clause-clause subsumptions : 57
% 0.40/0.50 % Unit Clause-clause subsumption calls : 197
% 0.40/0.50 % Rewrite failures with RHS unbound : 0
% 0.40/0.50 % BW rewrite match attempts : 2
% 0.40/0.50 % BW rewrite match successes : 2
% 0.40/0.50 % Condensation attempts : 0
% 0.40/0.50 % Condensation successes : 0
% 0.40/0.50 % Termbank termtop insertions : 38170
% 0.40/0.50 % Search garbage collected termcells : 71
% 0.40/0.50
% 0.40/0.50 % -------------------------------------------------
% 0.40/0.50 % User time : 0.046 s
% 0.40/0.50 % System time : 0.004 s
% 0.40/0.50 % Total time : 0.050 s
% 0.40/0.50 % Maximum resident set size: 3660 pages
% 0.40/0.50
% 0.40/0.50 % -------------------------------------------------
% 0.40/0.50 % User time : 0.179 s
% 0.40/0.50 % System time : 0.020 s
% 0.40/0.50 % Total time : 0.199 s
% 0.40/0.50 % Maximum resident set size: 4864 pages
% 0.40/0.50 % E exiting
%------------------------------------------------------------------------------