%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD071-2 : 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 : n026.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:58 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of clauses : 48 ( 21 unt; 4 nHn; 48 RR)
% Number of literals : 97 ( 0 equ; 48 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 56 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(totality_of_order_relation,axiom,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',totality_of_order_relation) ).
cnf(u_is_defined,hypothesis,
defined(u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',u_is_defined) ).
cnf(not_less_or_equal_7,negated_conjecture,
~ less_or_equal(additive_identity,u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_7) ).
cnf(symmetry_of_equality,axiom,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
cnf(transitivity_of_order_relation,axiom,
( ~ less_or_equal(X3,X2)
| ~ less_or_equal(X1,X3)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',transitivity_of_order_relation) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_identity) ).
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(multiply_equals_u_6,negated_conjecture,
equalish(multiply(a,b),u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_equals_u_6) ).
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(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(compatibility_of_order_relation_and_multiplication,axiom,
( ~ less_or_equal(additive_identity,X2)
| ~ less_or_equal(additive_identity,X1)
| less_or_equal(additive_identity,multiply(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_order_relation_and_multiplication) ).
cnf(less_or_equal_5,negated_conjecture,
less_or_equal(additive_identity,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_5) ).
cnf(less_or_equal_4,negated_conjecture,
less_or_equal(additive_identity,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_4) ).
cnf(c_0_13,plain,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[totality_of_order_relation]) ).
cnf(c_0_14,plain,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
c_0_13 ).
cnf(c_0_15,hypothesis,
defined(u),
u_is_defined ).
cnf(c_0_16,negated_conjecture,
~ less_or_equal(additive_identity,u),
inference(fof_simplification,[status(thm)],[not_less_or_equal_7]) ).
cnf(c_0_17,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_18,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_19,hypothesis,
( ~ defined(X1)
| less_or_equal(X1,u)
| less_or_equal(u,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_21,negated_conjecture,
~ less_or_equal(additive_identity,u),
c_0_16 ).
cnf(c_0_22,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_23,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_17 ).
cnf(c_0_24,negated_conjecture,
equalish(multiply(a,b),u),
multiply_equals_u_6 ).
cnf(c_0_25,plain,
( ~ less_or_equal(X3,X2)
| ~ less_or_equal(X1,X3)
| less_or_equal(X1,X2) ),
c_0_18 ).
cnf(c_0_26,hypothesis,
less_or_equal(u,additive_identity),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_27,plain,
( ~ equalish(X3,X1)
| ~ less_or_equal(X3,X2)
| less_or_equal(X1,X2) ),
c_0_22 ).
cnf(c_0_28,negated_conjecture,
equalish(u,multiply(a,b)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,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_30,hypothesis,
( ~ less_or_equal(X1,u)
| less_or_equal(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( ~ less_or_equal(u,X1)
| less_or_equal(multiply(a,b),X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,hypothesis,
less_or_equal(u,u),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_33,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_equality]) ).
cnf(c_0_34,plain,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| equalish(X1,X2) ),
c_0_29 ).
cnf(c_0_35,negated_conjecture,
less_or_equal(multiply(a,b),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_36,plain,
( ~ less_or_equal(additive_identity,X2)
| ~ less_or_equal(additive_identity,X1)
| less_or_equal(additive_identity,multiply(X1,X2)) ),
inference(fof_simplification,[status(thm)],[compatibility_of_order_relation_and_multiplication]) ).
cnf(c_0_37,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
c_0_33 ).
cnf(c_0_38,negated_conjecture,
( ~ less_or_equal(additive_identity,multiply(a,b))
| equalish(additive_identity,multiply(a,b)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
( ~ less_or_equal(additive_identity,X2)
| ~ less_or_equal(additive_identity,X1)
| less_or_equal(additive_identity,multiply(X1,X2)) ),
c_0_36 ).
cnf(c_0_40,negated_conjecture,
less_or_equal(additive_identity,b),
less_or_equal_5 ).
cnf(c_0_41,negated_conjecture,
less_or_equal(additive_identity,a),
less_or_equal_4 ).
cnf(c_0_42,negated_conjecture,
( ~ equalish(X1,multiply(a,b))
| equalish(X1,u) ),
inference(spm,[status(thm)],[c_0_37,c_0_24]) ).
cnf(c_0_43,negated_conjecture,
equalish(additive_identity,multiply(a,b)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_41])]) ).
cnf(c_0_44,negated_conjecture,
equalish(additive_identity,u),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_45,negated_conjecture,
equalish(u,additive_identity),
inference(spm,[status(thm)],[c_0_23,c_0_44]) ).
cnf(c_0_46,negated_conjecture,
( ~ less_or_equal(u,X1)
| less_or_equal(additive_identity,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_45]) ).
cnf(c_0_47,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_32]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD071-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n026.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 15:47:37 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.43 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.45 % Version: 3.5.1
% 0.15/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 % Starting sh5l with 300s (1) cores
% 0.15/0.45 % new_bool_3 with pid 2644069 completed with status 0
% 0.15/0.45 % Result found by new_bool_3
% 0.15/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.45 % Search class: FGUNF-FFMM22-SFFFFFNN
% 0.15/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.45 % SubtermCWHack with pid 2644077 completed with status 0
% 0.15/0.45 % Result found by SubtermCWHack
% 0.15/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.45 % Search class: FGUNF-FFMM22-SFFFFFNN
% 0.15/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.45 % Preprocessing time : 0.001 s
% 0.15/0.45
% 0.15/0.45 % Proof found!
% 0.15/0.45 % SZS status Unsatisfiable
% 0.15/0.45 % SZS output start CNFRefutation
% See solution above
% 0.15/0.45 % Parsed axioms : 34
% 0.15/0.45 % Removed by relevancy pruning/SinE : 7
% 0.15/0.45 % Initial clauses : 27
% 0.15/0.45 % Removed in clause preprocessing : 0
% 0.15/0.45 % Initial clauses in saturation : 27
% 0.15/0.45 % Processed clauses : 141
% 0.15/0.45 % ...of these trivial : 3
% 0.15/0.45 % ...subsumed : 27
% 0.15/0.45 % ...remaining for further processing : 111
% 0.15/0.45 % Other redundant clauses eliminated : 0
% 0.15/0.45 % Clauses deleted for lack of memory : 0
% 0.15/0.45 % Backward-subsumed : 2
% 0.15/0.45 % Backward-rewritten : 1
% 0.15/0.45 % Generated clauses : 346
% 0.15/0.45 % ...of the previous two non-redundant : 236
% 0.15/0.45 % ...aggressively subsumed : 0
% 0.15/0.45 % Contextual simplify-reflections : 0
% 0.15/0.45 % Paramodulations : 346
% 0.15/0.45 % Factorizations : 0
% 0.15/0.45 % NegExts : 0
% 0.15/0.45 % Equation resolutions : 0
% 0.15/0.45 % Disequality decompositions : 0
% 0.15/0.45 % Total rewrite steps : 142
% 0.15/0.45 % ...of those cached : 110
% 0.15/0.45 % Propositional unsat checks : 0
% 0.15/0.45 % Propositional check models : 0
% 0.15/0.45 % Propositional check unsatisfiable : 0
% 0.15/0.45 % Propositional clauses : 0
% 0.15/0.45 % Propositional clauses after purity: 0
% 0.15/0.45 % Propositional unsat core size : 0
% 0.15/0.45 % Propositional preprocessing time : 0.000
% 0.15/0.45 % Propositional encoding time : 0.000
% 0.15/0.45 % Propositional solver time : 0.000
% 0.15/0.45 % Success case prop preproc time : 0.000
% 0.15/0.45 % Success case prop encoding time : 0.000
% 0.15/0.45 % Success case prop solver time : 0.000
% 0.15/0.45 % Current number of processed clauses : 108
% 0.15/0.45 % Positive orientable unit clauses : 37
% 0.15/0.45 % Positive unorientable unit clauses: 0
% 0.15/0.45 % Negative unit clauses : 1
% 0.15/0.45 % Non-unit-clauses : 70
% 0.15/0.45 % Current number of unprocessed clauses: 120
% 0.15/0.45 % ...number of literals in the above : 369
% 0.15/0.45 % Current number of archived formulas : 0
% 0.15/0.45 % Current number of archived clauses : 3
% 0.15/0.45 % Clause-clause subsumption calls (NU) : 358
% 0.15/0.45 % Rec. Clause-clause subsumption calls : 331
% 0.15/0.45 % Non-unit clause-clause subsumptions : 26
% 0.15/0.45 % Unit Clause-clause subsumption calls : 9
% 0.15/0.45 % Rewrite failures with RHS unbound : 0
% 0.15/0.45 % BW rewrite match attempts : 3
% 0.15/0.45 % BW rewrite match successes : 3
% 0.15/0.45 % Condensation attempts : 0
% 0.15/0.45 % Condensation successes : 0
% 0.15/0.45 % Termbank termtop insertions : 4604
% 0.15/0.45 % Search garbage collected termcells : 93
% 0.15/0.45
% 0.15/0.45 % -------------------------------------------------
% 0.15/0.45 % User time : 0.009 s
% 0.15/0.45 % System time : 0.003 s
% 0.15/0.45 % Total time : 0.012 s
% 0.15/0.45 % Maximum resident set size: 3660 pages
% 0.15/0.45
% 0.15/0.45 % -------------------------------------------------
% 0.15/0.45 % User time : 0.010 s
% 0.15/0.45 % System time : 0.008 s
% 0.15/0.45 % Total time : 0.019 s
% 0.15/0.45 % Maximum resident set size: 4608 pages
% 0.15/0.45 % E exiting
%------------------------------------------------------------------------------