%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD058-1 : 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 : 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:53 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 28 ( 13 unt; 0 nHn; 28 RR)
% Number of literals : 52 ( 0 equ; 27 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 32 ( 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(antisymmetry_of_order_relation,axiom,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',antisymmetry_of_order_relation) ).
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(b_equals_additive_identity_6,negated_conjecture,
equalish(b,additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_equals_additive_identity_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(transitivity_of_equality,axiom,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',transitivity_of_equality) ).
cnf(less_or_equal_3,negated_conjecture,
less_or_equal(additive_identity,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_3) ).
cnf(a_not_equal_to_additive_identity_5,negated_conjecture,
~ equalish(a,additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_not_equal_to_additive_identity_5) ).
cnf(c_0_8,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_9,plain,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[antisymmetry_of_order_relation]) ).
cnf(c_0_10,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_11,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_8 ).
cnf(c_0_12,negated_conjecture,
equalish(b,additive_identity),
b_equals_additive_identity_6 ).
cnf(c_0_13,plain,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| equalish(X1,X2) ),
c_0_9 ).
cnf(c_0_14,negated_conjecture,
less_or_equal(a,b),
less_or_equal_4 ).
cnf(c_0_15,plain,
( ~ equalish(X3,X1)
| ~ less_or_equal(X3,X2)
| less_or_equal(X1,X2) ),
c_0_10 ).
cnf(c_0_16,negated_conjecture,
equalish(additive_identity,b),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_equality]) ).
cnf(c_0_18,negated_conjecture,
( ~ less_or_equal(b,a)
| equalish(b,a) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( ~ less_or_equal(additive_identity,X1)
| less_or_equal(b,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
less_or_equal(additive_identity,a),
less_or_equal_3 ).
cnf(c_0_21,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
c_0_17 ).
cnf(c_0_22,negated_conjecture,
equalish(b,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_23,negated_conjecture,
~ equalish(a,additive_identity),
inference(fof_simplification,[status(thm)],[a_not_equal_to_additive_identity_5]) ).
cnf(c_0_24,negated_conjecture,
( ~ equalish(X1,b)
| equalish(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_21,c_0_12]) ).
cnf(c_0_25,negated_conjecture,
equalish(a,b),
inference(spm,[status(thm)],[c_0_11,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
~ equalish(a,additive_identity),
c_0_23 ).
cnf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD058-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n018.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 15:45:31 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/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.15/0.43 % Version: 3.5.1
% 0.15/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 % Starting sh5l with 300s (1) cores
% 0.15/0.43 % new_bool_1 with pid 2249849 completed with status 0
% 0.15/0.43 % Result found by new_bool_1
% 0.15/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 % Search class: FGUNF-FFMM22-SFFFFFNN
% 0.15/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.43 % SubtermCWHack with pid 2249859 completed with status 0
% 0.15/0.43 % Result found by SubtermCWHack
% 0.15/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 % Search class: FGUNF-FFMM22-SFFFFFNN
% 0.15/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.43 % Preprocessing time : 0.001 s
% 0.15/0.43
% 0.15/0.43 % Proof found!
% 0.15/0.43 % SZS status Unsatisfiable
% 0.15/0.43 % SZS output start CNFRefutation
% See solution above
% 0.15/0.43 % Parsed axioms : 33
% 0.15/0.43 % Removed by relevancy pruning/SinE : 7
% 0.15/0.43 % Initial clauses : 26
% 0.15/0.43 % Removed in clause preprocessing : 0
% 0.15/0.43 % Initial clauses in saturation : 26
% 0.15/0.43 % Processed clauses : 49
% 0.15/0.43 % ...of these trivial : 0
% 0.15/0.43 % ...subsumed : 3
% 0.15/0.43 % ...remaining for further processing : 46
% 0.15/0.43 % Other redundant clauses eliminated : 0
% 0.15/0.43 % Clauses deleted for lack of memory : 0
% 0.15/0.43 % Backward-subsumed : 0
% 0.15/0.43 % Backward-rewritten : 2
% 0.15/0.43 % Generated clauses : 103
% 0.15/0.43 % ...of the previous two non-redundant : 68
% 0.15/0.43 % ...aggressively subsumed : 0
% 0.15/0.43 % Contextual simplify-reflections : 0
% 0.15/0.43 % Paramodulations : 103
% 0.15/0.43 % Factorizations : 0
% 0.15/0.43 % NegExts : 0
% 0.15/0.43 % Equation resolutions : 0
% 0.15/0.43 % Disequality decompositions : 0
% 0.15/0.43 % Total rewrite steps : 34
% 0.15/0.43 % ...of those cached : 16
% 0.15/0.43 % Propositional unsat checks : 0
% 0.15/0.43 % Propositional check models : 0
% 0.15/0.43 % Propositional check unsatisfiable : 0
% 0.15/0.43 % Propositional clauses : 0
% 0.15/0.43 % Propositional clauses after purity: 0
% 0.15/0.43 % Propositional unsat core size : 0
% 0.15/0.43 % Propositional preprocessing time : 0.000
% 0.15/0.43 % Propositional encoding time : 0.000
% 0.15/0.43 % Propositional solver time : 0.000
% 0.15/0.43 % Success case prop preproc time : 0.000
% 0.15/0.43 % Success case prop encoding time : 0.000
% 0.15/0.43 % Success case prop solver time : 0.000
% 0.15/0.43 % Current number of processed clauses : 44
% 0.15/0.44 % Positive orientable unit clauses : 24
% 0.15/0.44 % Positive unorientable unit clauses: 0
% 0.15/0.44 % Negative unit clauses : 2
% 0.15/0.44 % Non-unit-clauses : 18
% 0.15/0.44 % Current number of unprocessed clauses: 43
% 0.15/0.44 % ...number of literals in the above : 124
% 0.15/0.44 % Current number of archived formulas : 0
% 0.15/0.44 % Current number of archived clauses : 2
% 0.15/0.44 % Clause-clause subsumption calls (NU) : 17
% 0.15/0.44 % Rec. Clause-clause subsumption calls : 17
% 0.15/0.44 % Non-unit clause-clause subsumptions : 3
% 0.15/0.44 % Unit Clause-clause subsumption calls : 4
% 0.15/0.44 % Rewrite failures with RHS unbound : 0
% 0.15/0.44 % BW rewrite match attempts : 2
% 0.15/0.44 % BW rewrite match successes : 2
% 0.15/0.44 % Condensation attempts : 0
% 0.15/0.44 % Condensation successes : 0
% 0.15/0.44 % Termbank termtop insertions : 1824
% 0.15/0.44 % Search garbage collected termcells : 93
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.006 s
% 0.15/0.44 % System time : 0.002 s
% 0.15/0.44 % Total time : 0.008 s
% 0.15/0.44 % Maximum resident set size: 3660 pages
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.007 s
% 0.15/0.44 % System time : 0.007 s
% 0.15/0.44 % Total time : 0.014 s
% 0.15/0.44 % Maximum resident set size: 4608 pages
% 0.15/0.44 % E exiting
%------------------------------------------------------------------------------