%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD060-1 : 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 : n018.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:54 PM UTC 2026
% Result : Unsatisfiable 7.83s 6.41s
% Output : CNFRefutation 7.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 26 ( 10 unt; 0 nHn; 26 RR)
% Number of literals : 57 ( 0 equ; 34 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 : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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(commutativity_addition,axiom,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',commutativity_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_3,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_3) ).
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(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
cnf(not_less_or_equal_4,negated_conjecture,
~ less_or_equal(add(a,a),add(b,b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_4) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
cnf(c_0_8,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_9,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_10,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_11,plain,
( ~ equalish(X3,X1)
| ~ less_or_equal(X3,X2)
| less_or_equal(X1,X2) ),
c_0_8 ).
cnf(c_0_12,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
c_0_9 ).
cnf(c_0_13,plain,
( ~ less_or_equal(X1,X3)
| ~ defined(X2)
| less_or_equal(add(X1,X2),add(X3,X2)) ),
c_0_10 ).
cnf(c_0_14,negated_conjecture,
less_or_equal(a,b),
less_or_equal_3 ).
cnf(c_0_15,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_16,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_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( ~ defined(X1)
| less_or_equal(add(a,X1),add(b,X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_19,plain,
( ~ less_or_equal(X3,X2)
| ~ less_or_equal(X1,X3)
| less_or_equal(X1,X2) ),
c_0_15 ).
cnf(c_0_20,negated_conjecture,
( ~ defined(X1)
| less_or_equal(add(X1,a),add(b,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_21,negated_conjecture,
~ less_or_equal(add(a,a),add(b,b)),
inference(fof_simplification,[status(thm)],[not_less_or_equal_4]) ).
cnf(c_0_22,negated_conjecture,
( ~ defined(X2)
| ~ less_or_equal(X1,add(X2,a))
| less_or_equal(X1,add(b,X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_24,negated_conjecture,
~ less_or_equal(add(a,a),add(b,b)),
c_0_21 ).
cnf(c_0_25,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_17]),c_0_23]),c_0_18])]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : FLD060-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/5.37 % Computer : n018.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Mon Sep 21 15:45:49 UTC 2026
% 0.10/5.37 % CPUTime :
% 0.10/5.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/5.42 Running first-order theorem proving
% 0.14/5.42 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
% 7.83/6.41 % Version: 3.5.1
% 7.83/6.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 7.83/6.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.83/6.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 7.83/6.41 % Starting new_bool_3 with 300s (1) cores
% 7.83/6.41 % Starting new_bool_1 with 300s (1) cores
% 7.83/6.41 % Starting sh5l with 300s (1) cores
% 7.83/6.41 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2250831 completed with status 0
% 7.83/6.41 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 7.83/6.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 7.83/6.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.83/6.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 7.83/6.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 7.83/6.41 % No SInE strategy applied
% 7.83/6.41 % Search class: FGUNF-FFMS21-SFFFFFNN
% 7.83/6.41 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 7.83/6.41 % Starting SubtermCWHack with 136s (1) cores
% 7.83/6.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 7.83/6.41 % Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 7.83/6.41 % Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 7.83/6.41 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 7.83/6.41 % G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 2250839 completed with status 0
% 7.83/6.41 % Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 7.83/6.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 7.83/6.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.83/6.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 7.83/6.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 7.83/6.41 % No SInE strategy applied
% 7.83/6.41 % Search class: FGUNF-FFMS21-SFFFFFNN
% 7.83/6.41 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 7.83/6.41 % Starting SubtermCWHack with 136s (1) cores
% 7.83/6.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 7.83/6.41 % Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 7.83/6.41 % Preprocessing time : 0.002 s
% 7.83/6.41 % Presaturation interreduction done
% 7.83/6.41
% 7.83/6.41 % Proof found!
% 7.83/6.41 % SZS status Unsatisfiable
% 7.83/6.41 % SZS output start CNFRefutation
% See solution above
% 7.83/6.42 % Parsed axioms : 31
% 7.83/6.42 % Removed by relevancy pruning/SinE : 0
% 7.83/6.42 % Initial clauses : 31
% 7.83/6.42 % Removed in clause preprocessing : 0
% 7.83/6.42 % Initial clauses in saturation : 31
% 7.83/6.42 % Processed clauses : 4904
% 7.83/6.42 % ...of these trivial : 381
% 7.83/6.42 % ...subsumed : 2380
% 7.83/6.42 % ...remaining for further processing : 2143
% 7.83/6.42 % Other redundant clauses eliminated : 0
% 7.83/6.42 % Clauses deleted for lack of memory : 0
% 7.83/6.42 % Backward-subsumed : 121
% 7.83/6.42 % Backward-rewritten : 93
% 7.83/6.42 % Generated clauses : 48423
% 7.83/6.42 % ...of the previous two non-redundant : 40918
% 7.83/6.42 % ...aggressively subsumed : 0
% 7.83/6.42 % Contextual simplify-reflections : 52
% 7.83/6.42 % Paramodulations : 48407
% 7.83/6.42 % Factorizations : 16
% 7.83/6.42 % NegExts : 0
% 7.83/6.42 % Equation resolutions : 0
% 7.83/6.42 % Disequality decompositions : 0
% 7.83/6.42 % Total rewrite steps : 26095
% 7.83/6.42 % ...of those cached : 25841
% 7.83/6.42 % Propositional unsat checks : 0
% 7.83/6.42 % Propositional check models : 0
% 7.83/6.42 % Propositional check unsatisfiable : 0
% 7.83/6.42 % Propositional clauses : 0
% 7.83/6.42 % Propositional clauses after purity: 0
% 7.83/6.42 % Propositional unsat core size : 0
% 7.83/6.42 % Propositional preprocessing time : 0.000
% 7.83/6.42 % Propositional encoding time : 0.000
% 7.83/6.42 % Propositional solver time : 0.000
% 7.83/6.42 % Success case prop preproc time : 0.000
% 7.83/6.42 % Success case prop encoding time : 0.000
% 7.83/6.42 % Success case prop solver time : 0.000
% 7.83/6.42 % Current number of processed clauses : 1898
% 7.83/6.42 % Positive orientable unit clauses : 255
% 7.83/6.42 % Positive unorientable unit clauses: 0
% 7.83/6.42 % Negative unit clauses : 2
% 7.83/6.42 % Non-unit-clauses : 1641
% 7.83/6.42 % Current number of unprocessed clauses: 36050
% 7.83/6.42 % ...number of literals in the above : 118658
% 7.83/6.42 % Current number of archived formulas : 0
% 7.83/6.42 % Current number of archived clauses : 245
% 7.83/6.42 % Clause-clause subsumption calls (NU) : 388714
% 7.83/6.42 % Rec. Clause-clause subsumption calls : 257666
% 7.83/6.42 % Non-unit clause-clause subsumptions : 2553
% 7.83/6.42 % Unit Clause-clause subsumption calls : 11042
% 7.83/6.42 % Rewrite failures with RHS unbound : 0
% 7.83/6.42 % BW rewrite match attempts : 188
% 7.83/6.42 % BW rewrite match successes : 92
% 7.83/6.42 % Condensation attempts : 0
% 7.83/6.42 % Condensation successes : 0
% 7.83/6.42 % Termbank termtop insertions : 733903
% 7.83/6.42 % Search garbage collected termcells : 71
% 7.83/6.42
% 7.83/6.42 % -------------------------------------------------
% 7.83/6.42 % User time : 0.913 s
% 7.83/6.42 % System time : 0.042 s
% 7.83/6.42 % Total time : 0.955 s
% 7.83/6.42 % Maximum resident set size: 3660 pages
% 7.83/6.42
% 7.83/6.42 % -------------------------------------------------
% 7.83/6.42 % User time : 4.608 s
% 7.83/6.42 % System time : 0.199 s
% 7.83/6.42 % Total time : 4.807 s
% 7.83/6.42 % Maximum resident set size: 4608 pages
% 7.83/6.42 % E exiting
%------------------------------------------------------------------------------