%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD055-3 : 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 : n017.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:53 PM UTC 2026
% Result : Unsatisfiable 0.24s 0.55s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 23 ( 13 unt; 0 nHn; 23 RR)
% Number of literals : 40 ( 0 equ; 20 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 29 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(commutativity_addition,axiom,
( ~ sum(X2,X1,X3)
| sum(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',commutativity_addition) ).
cnf(existence_of_identity_addition,axiom,
( ~ defined(X1)
| sum(additive_identity,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',existence_of_identity_addition) ).
cnf(compatibility_of_order_relation_and_addition,axiom,
( ~ sum(X4,X5,X2)
| ~ sum(X3,X5,X1)
| ~ less_or_equal(X3,X4)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',compatibility_of_order_relation_and_addition) ).
cnf(sum_5,negated_conjecture,
sum(additive_identity,b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_5) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
cnf(not_less_or_equal_6,negated_conjecture,
~ less_or_equal(a,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_6) ).
cnf(less_or_equal_4,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_4) ).
cnf(c_0_7,plain,
( ~ sum(X2,X1,X3)
| sum(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_8,plain,
( ~ defined(X1)
| sum(additive_identity,X1,X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_9,plain,
( ~ sum(X4,X5,X2)
| ~ sum(X3,X5,X1)
| ~ less_or_equal(X3,X4)
| less_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[compatibility_of_order_relation_and_addition]) ).
cnf(c_0_10,plain,
( ~ sum(X2,X1,X3)
| sum(X1,X2,X3) ),
c_0_7 ).
cnf(c_0_11,negated_conjecture,
sum(additive_identity,b,c),
sum_5 ).
cnf(c_0_12,plain,
( ~ defined(X1)
| sum(additive_identity,X1,X1) ),
c_0_8 ).
cnf(c_0_13,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_14,plain,
( ~ sum(X4,X5,X2)
| ~ sum(X3,X5,X1)
| ~ less_or_equal(X3,X4)
| less_or_equal(X1,X2) ),
c_0_9 ).
cnf(c_0_15,negated_conjecture,
sum(b,additive_identity,c),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,hypothesis,
sum(additive_identity,a,a),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
~ less_or_equal(a,c),
inference(fof_simplification,[status(thm)],[not_less_or_equal_6]) ).
cnf(c_0_18,negated_conjecture,
( ~ sum(X2,additive_identity,X1)
| ~ less_or_equal(X2,b)
| less_or_equal(X1,c) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,hypothesis,
sum(a,additive_identity,a),
inference(spm,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
less_or_equal(a,b),
less_or_equal_4 ).
cnf(c_0_21,negated_conjecture,
~ less_or_equal(a,c),
c_0_17 ).
cnf(c_0_22,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : FLD055-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.46 % Computer : n017.cluster.edu
% 0.18/0.46 % Model : x86_64 x86_64
% 0.18/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.46 % Memory : 8046.5625MB
% 0.18/0.46 % OS : Linux 6.8.0-71-generic
% 0.18/0.46 % CPULimit : 300
% 0.18/0.46 % WCLimit : 300
% 0.18/0.46 % DateTime : Mon Sep 21 15:37:58 UTC 2026
% 0.18/0.46 % CPUTime :
% 0.18/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.52 Running first-order theorem proving
% 0.24/0.52 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.24/0.55 % Version: 3.5.1
% 0.24/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.55 % Starting sh5l with 300s (1) cores
% 0.24/0.55 % new_bool_1 with pid 2669656 completed with status 0
% 0.24/0.55 % Result found by new_bool_1
% 0.24/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.55 % Search class: FGUNF-FFMM00-SFFFFFNN
% 0.24/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.55 % SubtermCWHack with pid 2669661 completed with status 0
% 0.24/0.55 % Result found by SubtermCWHack
% 0.24/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.55 % Search class: FGUNF-FFMM00-SFFFFFNN
% 0.24/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.55 % Preprocessing time : 0.001 s
% 0.24/0.55
% 0.24/0.55 % Proof found!
% 0.24/0.55 % SZS status Unsatisfiable
% 0.24/0.55 % SZS output start CNFRefutation
% See solution above
% 0.24/0.55 % Parsed axioms : 32
% 0.24/0.55 % Removed by relevancy pruning/SinE : 11
% 0.24/0.55 % Initial clauses : 21
% 0.24/0.55 % Removed in clause preprocessing : 0
% 0.24/0.55 % Initial clauses in saturation : 21
% 0.24/0.55 % Processed clauses : 73
% 0.24/0.55 % ...of these trivial : 0
% 0.24/0.55 % ...subsumed : 17
% 0.24/0.55 % ...remaining for further processing : 56
% 0.24/0.55 % Other redundant clauses eliminated : 0
% 0.24/0.55 % Clauses deleted for lack of memory : 0
% 0.24/0.55 % Backward-subsumed : 2
% 0.24/0.55 % Backward-rewritten : 0
% 0.24/0.55 % Generated clauses : 110
% 0.24/0.55 % ...of the previous two non-redundant : 77
% 0.24/0.55 % ...aggressively subsumed : 0
% 0.24/0.55 % Contextual simplify-reflections : 0
% 0.24/0.55 % Paramodulations : 110
% 0.24/0.55 % Factorizations : 0
% 0.24/0.55 % NegExts : 0
% 0.24/0.55 % Equation resolutions : 0
% 0.24/0.55 % Disequality decompositions : 0
% 0.24/0.55 % Total rewrite steps : 30
% 0.24/0.55 % ...of those cached : 18
% 0.24/0.55 % Propositional unsat checks : 0
% 0.24/0.55 % Propositional check models : 0
% 0.24/0.55 % Propositional check unsatisfiable : 0
% 0.24/0.55 % Propositional clauses : 0
% 0.24/0.55 % Propositional clauses after purity: 0
% 0.24/0.55 % Propositional unsat core size : 0
% 0.24/0.55 % Propositional preprocessing time : 0.000
% 0.24/0.55 % Propositional encoding time : 0.000
% 0.24/0.55 % Propositional solver time : 0.000
% 0.24/0.55 % Success case prop preproc time : 0.000
% 0.24/0.55 % Success case prop encoding time : 0.000
% 0.24/0.55 % Success case prop solver time : 0.000
% 0.24/0.55 % Current number of processed clauses : 54
% 0.24/0.55 % Positive orientable unit clauses : 20
% 0.24/0.55 % Positive unorientable unit clauses: 0
% 0.24/0.55 % Negative unit clauses : 1
% 0.24/0.55 % Non-unit-clauses : 33
% 0.24/0.55 % Current number of unprocessed clauses: 24
% 0.24/0.55 % ...number of literals in the above : 79
% 0.24/0.55 % Current number of archived formulas : 0
% 0.24/0.55 % Current number of archived clauses : 2
% 0.24/0.55 % Clause-clause subsumption calls (NU) : 76
% 0.24/0.55 % Rec. Clause-clause subsumption calls : 65
% 0.24/0.55 % Non-unit clause-clause subsumptions : 17
% 0.24/0.55 % Unit Clause-clause subsumption calls : 11
% 0.24/0.55 % Rewrite failures with RHS unbound : 0
% 0.24/0.55 % BW rewrite match attempts : 3
% 0.24/0.55 % BW rewrite match successes : 1
% 0.24/0.55 % Condensation attempts : 0
% 0.24/0.55 % Condensation successes : 0
% 0.24/0.55 % Termbank termtop insertions : 2035
% 0.24/0.55 % Search garbage collected termcells : 145
% 0.24/0.55
% 0.24/0.55 % -------------------------------------------------
% 0.24/0.56 % User time : 0.004 s
% 0.24/0.56 % System time : 0.004 s
% 0.24/0.56 % Total time : 0.008 s
% 0.24/0.56 % Maximum resident set size: 3616 pages
% 0.24/0.56
% 0.24/0.56 % -------------------------------------------------
% 0.24/0.56 % User time : 0.007 s
% 0.24/0.56 % System time : 0.010 s
% 0.24/0.56 % Total time : 0.017 s
% 0.24/0.56 % Maximum resident set size: 4864 pages
% 0.24/0.56 % E exiting
%------------------------------------------------------------------------------