%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD061-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 : n007.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 0.48s 0.63s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 33 ( 16 unt; 0 nHn; 33 RR)
% Number of literals : 62 ( 0 equ; 32 neg)
% Maximal clause size : 3 ( 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 : 38 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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_6,negated_conjecture,
less_or_equal(c,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_6) ).
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_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(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
cnf(c_is_defined,hypothesis,
defined(c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_is_defined) ).
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(less_or_equal_5,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_5) ).
cnf(not_less_or_equal_7,negated_conjecture,
~ less_or_equal(add(a,c),add(d,b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_7) ).
cnf(c_0_9,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_10,plain,
( ~ less_or_equal(X1,X3)
| ~ defined(X2)
| less_or_equal(add(X1,X2),add(X3,X2)) ),
c_0_9 ).
cnf(c_0_11,negated_conjecture,
less_or_equal(c,d),
less_or_equal_6 ).
cnf(c_0_12,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
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,negated_conjecture,
( ~ defined(X1)
| less_or_equal(add(c,X1),add(d,X1)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_16,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
c_0_12 ).
cnf(c_0_17,hypothesis,
defined(c),
c_is_defined ).
cnf(c_0_18,plain,
( ~ equalish(X3,X1)
| ~ less_or_equal(X3,X2)
| less_or_equal(X1,X2) ),
c_0_13 ).
cnf(c_0_19,hypothesis,
less_or_equal(add(c,b),add(d,b)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,hypothesis,
( ~ defined(X1)
| equalish(add(c,X1),add(X1,c)) ),
inference(spm,[status(thm)],[c_0_16,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,hypothesis,
( ~ equalish(add(c,b),X1)
| less_or_equal(X1,add(d,b)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,hypothesis,
equalish(add(c,b),add(b,c)),
inference(spm,[status(thm)],[c_0_20,c_0_15]) ).
cnf(c_0_24,negated_conjecture,
less_or_equal(a,b),
less_or_equal_5 ).
cnf(c_0_25,plain,
( ~ less_or_equal(X3,X2)
| ~ less_or_equal(X1,X3)
| less_or_equal(X1,X2) ),
c_0_21 ).
cnf(c_0_26,hypothesis,
less_or_equal(add(b,c),add(d,b)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( ~ defined(X1)
| less_or_equal(add(a,X1),add(b,X1)) ),
inference(spm,[status(thm)],[c_0_10,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
~ less_or_equal(add(a,c),add(d,b)),
inference(fof_simplification,[status(thm)],[not_less_or_equal_7]) ).
cnf(c_0_29,hypothesis,
( ~ less_or_equal(X1,add(b,c))
| less_or_equal(X1,add(d,b)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,hypothesis,
less_or_equal(add(a,c),add(b,c)),
inference(spm,[status(thm)],[c_0_27,c_0_17]) ).
cnf(c_0_31,negated_conjecture,
~ less_or_equal(add(a,c),add(d,b)),
c_0_28 ).
cnf(c_0_32,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD061-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n007.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 15:41:36 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.43 Running first-order theorem proving
% 0.14/0.43 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.48/0.63 % Version: 3.5.1
% 0.48/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.48/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.48/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.48/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.48/0.63 % Starting sh5l with 300s (1) cores
% 0.48/0.63 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1451040 completed with status 0
% 0.48/0.63 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.48/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.48/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.48/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.48/0.63 % No SInE strategy applied
% 0.48/0.63 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.48/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.48/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.48/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.48/0.63 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 0.48/0.63 % Starting new_bool_3 with 269s (1) cores
% 0.48/0.63 % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 0.48/0.63 % G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with pid 1451045 completed with status 0
% 0.48/0.63 % Result found by G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN
% 0.48/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.48/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.48/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.48/0.63 % No SInE strategy applied
% 0.48/0.63 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.48/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.48/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.48/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.48/0.63 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 0.48/0.63 % Starting new_bool_3 with 269s (1) cores
% 0.48/0.63 % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 0.48/0.63 % Preprocessing time : 0.001 s
% 0.48/0.63 % Presaturation interreduction done
% 0.48/0.63
% 0.48/0.63 % Proof found!
% 0.48/0.63 % SZS status Unsatisfiable
% 0.48/0.63 % SZS output start CNFRefutation
% See solution above
% 0.48/0.63 % Parsed axioms : 34
% 0.48/0.63 % Removed by relevancy pruning/SinE : 0
% 0.48/0.63 % Initial clauses : 34
% 0.48/0.63 % Removed in clause preprocessing : 0
% 0.48/0.63 % Initial clauses in saturation : 34
% 0.48/0.63 % Processed clauses : 559
% 0.48/0.63 % ...of these trivial : 0
% 0.48/0.63 % ...subsumed : 126
% 0.48/0.63 % ...remaining for further processing : 433
% 0.48/0.63 % Other redundant clauses eliminated : 0
% 0.48/0.63 % Clauses deleted for lack of memory : 0
% 0.48/0.63 % Backward-subsumed : 0
% 0.48/0.63 % Backward-rewritten : 0
% 0.48/0.63 % Generated clauses : 2817
% 0.48/0.63 % ...of the previous two non-redundant : 2502
% 0.48/0.63 % ...aggressively subsumed : 0
% 0.48/0.63 % Contextual simplify-reflections : 0
% 0.48/0.63 % Paramodulations : 2817
% 0.48/0.63 % Factorizations : 0
% 0.48/0.63 % NegExts : 0
% 0.48/0.63 % Equation resolutions : 0
% 0.48/0.63 % Disequality decompositions : 0
% 0.48/0.63 % Total rewrite steps : 588
% 0.48/0.63 % ...of those cached : 455
% 0.48/0.63 % Propositional unsat checks : 0
% 0.48/0.63 % Propositional check models : 0
% 0.48/0.63 % Propositional check unsatisfiable : 0
% 0.48/0.63 % Propositional clauses : 0
% 0.48/0.63 % Propositional clauses after purity: 0
% 0.48/0.63 % Propositional unsat core size : 0
% 0.48/0.63 % Propositional preprocessing time : 0.000
% 0.48/0.63 % Propositional encoding time : 0.000
% 0.48/0.63 % Propositional solver time : 0.000
% 0.48/0.63 % Success case prop preproc time : 0.000
% 0.48/0.63 % Success case prop encoding time : 0.000
% 0.48/0.63 % Success case prop solver time : 0.000
% 0.48/0.63 % Current number of processed clauses : 399
% 0.48/0.63 % Positive orientable unit clauses : 156
% 0.48/0.63 % Positive unorientable unit clauses: 0
% 0.48/0.63 % Negative unit clauses : 2
% 0.48/0.63 % Non-unit-clauses : 241
% 0.48/0.63 % Current number of unprocessed clauses: 2007
% 0.48/0.63 % ...number of literals in the above : 6782
% 0.48/0.63 % Current number of archived formulas : 0
% 0.48/0.63 % Current number of archived clauses : 34
% 0.48/0.63 % Clause-clause subsumption calls (NU) : 4721
% 0.48/0.63 % Rec. Clause-clause subsumption calls : 3610
% 0.48/0.63 % Non-unit clause-clause subsumptions : 126
% 0.48/0.63 % Unit Clause-clause subsumption calls : 449
% 0.48/0.63 % Rewrite failures with RHS unbound : 0
% 0.48/0.63 % BW rewrite match attempts : 0
% 0.48/0.63 % BW rewrite match successes : 0
% 0.48/0.63 % Condensation attempts : 0
% 0.48/0.63 % Condensation successes : 0
% 0.48/0.63 % Termbank termtop insertions : 37752
% 0.48/0.63 % Search garbage collected termcells : 71
% 0.48/0.63
% 0.48/0.63 % -------------------------------------------------
% 0.48/0.63 % User time : 0.098 s
% 0.48/0.63 % System time : 0.010 s
% 0.48/0.63 % Total time : 0.108 s
% 0.48/0.63 % Maximum resident set size: 3660 pages
% 0.48/0.63
% 0.48/0.63 % -------------------------------------------------
% 0.48/0.63 % User time : 0.567 s
% 0.48/0.63 % System time : 0.050 s
% 0.48/0.63 % Total time : 0.617 s
% 0.48/0.63 % Maximum resident set size: 4864 pages
% 0.48/0.63 % E exiting
%------------------------------------------------------------------------------