%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD065-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 : n015.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:56 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.44s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 19 ( 9 unt; 0 nHn; 19 RR)
% Number of literals : 36 ( 0 equ; 20 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
cnf(existence_of_inverse_addition,axiom,
( ~ defined(X1)
| sum(additive_inverse(X1),X1,additive_identity) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',existence_of_inverse_addition) ).
cnf(not_less_or_equal_3,negated_conjecture,
~ less_or_equal(additive_identity,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_3) ).
cnf(less_or_equal_2,negated_conjecture,
less_or_equal(additive_inverse(a),additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_2) ).
cnf(c_0_6,plain,
( ~ defined(X1)
| sum(additive_identity,X1,X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_7,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_8,plain,
( ~ defined(X1)
| sum(additive_identity,X1,X1) ),
c_0_6 ).
cnf(c_0_9,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_10,plain,
( ~ sum(X4,X5,X2)
| ~ sum(X3,X5,X1)
| ~ less_or_equal(X3,X4)
| less_or_equal(X1,X2) ),
c_0_7 ).
cnf(c_0_11,hypothesis,
sum(additive_identity,a,a),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( ~ defined(X1)
| sum(additive_inverse(X1),X1,additive_identity) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).
cnf(c_0_13,negated_conjecture,
~ less_or_equal(additive_identity,a),
inference(fof_simplification,[status(thm)],[not_less_or_equal_3]) ).
cnf(c_0_14,hypothesis,
( ~ sum(X2,a,X1)
| ~ less_or_equal(X2,additive_identity)
| less_or_equal(X1,a) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( ~ defined(X1)
| sum(additive_inverse(X1),X1,additive_identity) ),
c_0_12 ).
cnf(c_0_16,negated_conjecture,
less_or_equal(additive_inverse(a),additive_identity),
less_or_equal_2 ).
cnf(c_0_17,negated_conjecture,
~ less_or_equal(additive_identity,a),
c_0_13 ).
cnf(c_0_18,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_9])]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : FLD065-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.37 % Computer : n015.cluster.edu
% 0.08/0.37 % Model : x86_64 x86_64
% 0.08/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.37 % Memory : 8046.5625MB
% 0.08/0.37 % OS : Linux 6.8.0-71-generic
% 0.08/0.37 % CPULimit : 300
% 0.08/0.37 % WCLimit : 300
% 0.08/0.37 % DateTime : Mon Sep 21 15:47:06 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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.14/0.44 % Version: 3.5.1
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.44 % Starting sh5l with 300s (1) cores
% 0.14/0.44 % new_bool_3 with pid 1820649 completed with status 0
% 0.14/0.44 % Result found by new_bool_3
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.44 % Search class: FGUNF-FFMS11-SFFFFFNN
% 0.14/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.44 % SubtermCWHack with pid 1820657 completed with status 0
% 0.14/0.44 % Result found by SubtermCWHack
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.44 % Search class: FGUNF-FFMS11-SFFFFFNN
% 0.14/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.44 % Preprocessing time : 0.001 s
% 0.14/0.44
% 0.14/0.44 % Proof found!
% 0.14/0.44 % SZS status Unsatisfiable
% 0.14/0.44 % SZS output start CNFRefutation
% See solution above
% 0.14/0.44 % Parsed axioms : 29
% 0.14/0.44 % Removed by relevancy pruning/SinE : 9
% 0.14/0.44 % Initial clauses : 20
% 0.14/0.44 % Removed in clause preprocessing : 0
% 0.14/0.44 % Initial clauses in saturation : 20
% 0.14/0.44 % Processed clauses : 47
% 0.14/0.44 % ...of these trivial : 0
% 0.14/0.44 % ...subsumed : 6
% 0.14/0.44 % ...remaining for further processing : 41
% 0.14/0.44 % Other redundant clauses eliminated : 0
% 0.14/0.44 % Clauses deleted for lack of memory : 0
% 0.14/0.44 % Backward-subsumed : 0
% 0.14/0.44 % Backward-rewritten : 0
% 0.14/0.44 % Generated clauses : 69
% 0.14/0.44 % ...of the previous two non-redundant : 49
% 0.14/0.44 % ...aggressively subsumed : 0
% 0.14/0.44 % Contextual simplify-reflections : 0
% 0.14/0.44 % Paramodulations : 69
% 0.14/0.44 % Factorizations : 0
% 0.14/0.44 % NegExts : 0
% 0.14/0.44 % Equation resolutions : 0
% 0.14/0.44 % Disequality decompositions : 0
% 0.14/0.44 % Total rewrite steps : 27
% 0.14/0.44 % ...of those cached : 18
% 0.14/0.44 % Propositional unsat checks : 0
% 0.14/0.44 % Propositional check models : 0
% 0.14/0.44 % Propositional check unsatisfiable : 0
% 0.14/0.44 % Propositional clauses : 0
% 0.14/0.44 % Propositional clauses after purity: 0
% 0.14/0.44 % Propositional unsat core size : 0
% 0.14/0.44 % Propositional preprocessing time : 0.000
% 0.14/0.44 % Propositional encoding time : 0.000
% 0.14/0.44 % Propositional solver time : 0.000
% 0.14/0.44 % Success case prop preproc time : 0.000
% 0.14/0.44 % Success case prop encoding time : 0.000
% 0.14/0.44 % Success case prop solver time : 0.000
% 0.14/0.44 % Current number of processed clauses : 41
% 0.14/0.44 % Positive orientable unit clauses : 10
% 0.14/0.44 % Positive unorientable unit clauses: 0
% 0.14/0.44 % Negative unit clauses : 2
% 0.14/0.44 % Non-unit-clauses : 29
% 0.14/0.44 % Current number of unprocessed clauses: 22
% 0.14/0.44 % ...number of literals in the above : 83
% 0.14/0.44 % Current number of archived formulas : 0
% 0.14/0.44 % Current number of archived clauses : 0
% 0.14/0.44 % Clause-clause subsumption calls (NU) : 62
% 0.14/0.44 % Rec. Clause-clause subsumption calls : 54
% 0.14/0.44 % Non-unit clause-clause subsumptions : 4
% 0.14/0.44 % Unit Clause-clause subsumption calls : 7
% 0.14/0.44 % Rewrite failures with RHS unbound : 0
% 0.14/0.44 % BW rewrite match attempts : 0
% 0.14/0.44 % BW rewrite match successes : 0
% 0.14/0.44 % Condensation attempts : 0
% 0.14/0.44 % Condensation successes : 0
% 0.14/0.44 % Termbank termtop insertions : 1748
% 0.14/0.44 % Search garbage collected termcells : 140
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.005 s
% 0.14/0.44 % System time : 0.003 s
% 0.14/0.44 % Total time : 0.007 s
% 0.14/0.44 % Maximum resident set size: 3608 pages
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.007 s
% 0.14/0.44 % System time : 0.007 s
% 0.14/0.44 % Total time : 0.014 s
% 0.14/0.44 % Maximum resident set size: 4608 pages
% 0.14/0.44 % E exiting
%------------------------------------------------------------------------------