%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : HEN005-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:45:35 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.44s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 11
% Syntax : Number of clauses : 49 ( 15 unt; 0 nHn; 38 RR)
% Number of literals : 110 ( 12 equ; 64 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 119 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(less_equal_and_equal,axiom,
( ~ less_equal(X2,X1)
| ~ less_equal(X1,X2)
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',less_equal_and_equal) ).
cnf(divisor_existence,axiom,
( ~ quotient(X1,X2,X3)
| less_equal(X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',divisor_existence) ).
cnf(zero_is_smallest,axiom,
less_equal(zero,X1),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',zero_is_smallest) ).
cnf(closure,axiom,
quotient(X1,X2,divide(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',closure) ).
cnf(quotient_property,axiom,
( ~ quotient(X3,X4,X8)
| ~ quotient(X6,X5,X7)
| ~ quotient(X1,X4,X6)
| ~ quotient(X2,X4,X5)
| ~ quotient(X1,X2,X3)
| less_equal(X7,X8) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',quotient_property) ).
cnf(quotient_less_equal,axiom,
( ~ less_equal(X1,X2)
| quotient(X1,X2,zero) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',quotient_less_equal) ).
cnf(well_defined,axiom,
( ~ quotient(X1,X2,X4)
| ~ quotient(X1,X2,X3)
| X3 = X4 ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',well_defined) ).
cnf(less_equal_quotient,axiom,
( ~ quotient(X1,X2,zero)
| less_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',less_equal_quotient) ).
cnf(xLEy,hypothesis,
less_equal(x,y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xLEy) ).
cnf(prove_transitivity_of_less_equal,negated_conjecture,
~ less_equal(x,z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_transitivity_of_less_equal) ).
cnf(yLEz,hypothesis,
less_equal(y,z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',yLEz) ).
cnf(c_0_11,plain,
( ~ less_equal(X2,X1)
| ~ less_equal(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[less_equal_and_equal]) ).
cnf(c_0_12,plain,
( ~ quotient(X1,X2,X3)
| less_equal(X3,X1) ),
inference(fof_simplification,[status(thm)],[divisor_existence]) ).
cnf(c_0_13,plain,
( ~ less_equal(X2,X1)
| ~ less_equal(X1,X2)
| X1 = X2 ),
c_0_11 ).
cnf(c_0_14,axiom,
less_equal(zero,X1),
zero_is_smallest ).
cnf(c_0_15,plain,
( ~ quotient(X1,X2,X3)
| less_equal(X3,X1) ),
c_0_12 ).
cnf(c_0_16,axiom,
quotient(X1,X2,divide(X1,X2)),
closure ).
cnf(c_0_17,plain,
( ~ quotient(X3,X4,X8)
| ~ quotient(X6,X5,X7)
| ~ quotient(X1,X4,X6)
| ~ quotient(X2,X4,X5)
| ~ quotient(X1,X2,X3)
| less_equal(X7,X8) ),
inference(fof_simplification,[status(thm)],[quotient_property]) ).
cnf(c_0_18,plain,
( ~ less_equal(X1,zero)
| X1 = zero ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
less_equal(divide(X1,X2),X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( ~ quotient(X3,X4,X8)
| ~ quotient(X6,X5,X7)
| ~ quotient(X1,X4,X6)
| ~ quotient(X2,X4,X5)
| ~ quotient(X1,X2,X3)
| less_equal(X7,X8) ),
c_0_17 ).
cnf(c_0_21,plain,
divide(zero,X1) = zero,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( ~ quotient(X7,X6,X4)
| ~ quotient(X7,X5,X1)
| ~ quotient(X6,X5,X2)
| ~ quotient(X4,X5,X3)
| less_equal(divide(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_23,plain,
quotient(zero,X1,zero),
inference(spm,[status(thm)],[c_0_16,c_0_21]) ).
cnf(c_0_24,plain,
( ~ less_equal(X1,X2)
| quotient(X1,X2,zero) ),
inference(fof_simplification,[status(thm)],[quotient_less_equal]) ).
cnf(c_0_25,plain,
( ~ quotient(X3,X5,X1)
| ~ quotient(X4,X5,X2)
| ~ quotient(X3,X4,zero)
| less_equal(divide(X1,X2),zero) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( ~ less_equal(X1,X2)
| quotient(X1,X2,zero) ),
c_0_24 ).
cnf(c_0_27,plain,
( ~ less_equal(X5,X3)
| ~ quotient(X5,X4,X1)
| ~ quotient(X3,X4,X2)
| less_equal(divide(X1,X2),zero) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,plain,
( ~ less_equal(X4,X2)
| ~ quotient(X4,X3,X1)
| less_equal(divide(X1,divide(X2,X3)),zero) ),
inference(spm,[status(thm)],[c_0_27,c_0_16]) ).
cnf(c_0_29,plain,
( ~ less_equal(X1,X3)
| less_equal(divide(divide(X1,X2),divide(X3,X2)),zero) ),
inference(spm,[status(thm)],[c_0_28,c_0_16]) ).
cnf(c_0_30,plain,
( ~ quotient(X1,X2,X4)
| ~ quotient(X1,X2,X3)
| X3 = X4 ),
inference(fof_simplification,[status(thm)],[well_defined]) ).
cnf(c_0_31,plain,
( ~ quotient(X1,X2,zero)
| less_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[less_equal_quotient]) ).
cnf(c_0_32,plain,
( ~ less_equal(X1,X3)
| divide(divide(X1,X2),divide(X3,X2)) = zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_29]),c_0_14])]) ).
cnf(c_0_33,plain,
( ~ quotient(X1,X2,X4)
| ~ quotient(X1,X2,X3)
| X3 = X4 ),
c_0_30 ).
cnf(c_0_34,plain,
( ~ quotient(X1,X2,zero)
| less_equal(X1,X2) ),
c_0_31 ).
cnf(c_0_35,plain,
( ~ less_equal(X1,X3)
| quotient(divide(X1,X2),divide(X3,X2),zero) ),
inference(spm,[status(thm)],[c_0_16,c_0_32]) ).
cnf(c_0_36,plain,
( ~ quotient(X2,X3,X1)
| X1 = divide(X2,X3) ),
inference(spm,[status(thm)],[c_0_33,c_0_16]) ).
cnf(c_0_37,plain,
( ~ less_equal(X1,X3)
| less_equal(divide(X1,X2),divide(X3,X2)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
( ~ less_equal(X1,X2)
| divide(X1,X2) = zero ),
inference(spm,[status(thm)],[c_0_36,c_0_26]) ).
cnf(c_0_39,plain,
( ~ less_equal(X3,X2)
| ~ less_equal(X1,X3)
| less_equal(divide(X1,X2),zero) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_40,hypothesis,
less_equal(x,y),
xLEy ).
cnf(c_0_41,hypothesis,
( ~ less_equal(y,X1)
| less_equal(divide(x,X1),zero) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,hypothesis,
( ~ less_equal(y,X1)
| divide(x,X1) = zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_41]),c_0_14])]) ).
cnf(c_0_43,hypothesis,
( ~ less_equal(y,X1)
| quotient(x,X1,zero) ),
inference(spm,[status(thm)],[c_0_16,c_0_42]) ).
cnf(c_0_44,negated_conjecture,
~ less_equal(x,z),
inference(fof_simplification,[status(thm)],[prove_transitivity_of_less_equal]) ).
cnf(c_0_45,hypothesis,
( ~ less_equal(y,X1)
| less_equal(x,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_43]) ).
cnf(c_0_46,hypothesis,
less_equal(y,z),
yLEz ).
cnf(c_0_47,negated_conjecture,
~ less_equal(x,z),
c_0_44 ).
cnf(c_0_48,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HEN005-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n009.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 : Sun Sep 20 20:45:42 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.11/0.44 % Version: 3.5.1
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % Starting sh5l with 300s (1) cores
% 0.11/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 28105 completed with status 0
% 0.11/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.44 % No SInE strategy applied
% 0.11/0.44 % Search class: FHUSS-FFSF22-SFFFFFNN
% 0.11/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.11/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.11/0.44 % SubtermCWHack with pid 28109 completed with status 0
% 0.11/0.44 % Result found by SubtermCWHack
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.44 % No SInE strategy applied
% 0.11/0.44 % Search class: FHUSS-FFSF22-SFFFFFNN
% 0.11/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.44 % Preprocessing time : 0.001 s
% 0.11/0.44
% 0.11/0.44 % Proof found!
% 0.11/0.44 % SZS status Unsatisfiable
% 0.11/0.44 % SZS output start CNFRefutation
% See solution above
% 0.11/0.44 % Parsed axioms : 12
% 0.11/0.44 % Removed by relevancy pruning/SinE : 0
% 0.11/0.44 % Initial clauses : 12
% 0.11/0.44 % Removed in clause preprocessing : 0
% 0.11/0.44 % Initial clauses in saturation : 12
% 0.11/0.44 % Processed clauses : 93
% 0.11/0.44 % ...of these trivial : 0
% 0.11/0.44 % ...subsumed : 29
% 0.11/0.44 % ...remaining for further processing : 64
% 0.11/0.44 % Other redundant clauses eliminated : 0
% 0.11/0.44 % Clauses deleted for lack of memory : 0
% 0.11/0.44 % Backward-subsumed : 3
% 0.11/0.44 % Backward-rewritten : 0
% 0.11/0.44 % Generated clauses : 388
% 0.11/0.44 % ...of the previous two non-redundant : 213
% 0.11/0.44 % ...aggressively subsumed : 0
% 0.11/0.44 % Contextual simplify-reflections : 0
% 0.11/0.44 % Paramodulations : 388
% 0.11/0.44 % Factorizations : 0
% 0.11/0.44 % NegExts : 0
% 0.11/0.44 % Equation resolutions : 0
% 0.11/0.44 % Disequality decompositions : 0
% 0.11/0.44 % Total rewrite steps : 268
% 0.11/0.44 % ...of those cached : 230
% 0.11/0.44 % Propositional unsat checks : 0
% 0.11/0.44 % Propositional check models : 0
% 0.11/0.44 % Propositional check unsatisfiable : 0
% 0.11/0.44 % Propositional clauses : 0
% 0.11/0.44 % Propositional clauses after purity: 0
% 0.11/0.44 % Propositional unsat core size : 0
% 0.11/0.44 % Propositional preprocessing time : 0.000
% 0.11/0.44 % Propositional encoding time : 0.000
% 0.11/0.44 % Propositional solver time : 0.000
% 0.11/0.44 % Success case prop preproc time : 0.000
% 0.11/0.44 % Success case prop encoding time : 0.000
% 0.11/0.44 % Success case prop solver time : 0.000
% 0.11/0.44 % Current number of processed clauses : 61
% 0.11/0.44 % Positive orientable unit clauses : 8
% 0.11/0.44 % Positive unorientable unit clauses: 0
% 0.11/0.44 % Negative unit clauses : 1
% 0.11/0.44 % Non-unit-clauses : 52
% 0.11/0.44 % Current number of unprocessed clauses: 132
% 0.11/0.44 % ...number of literals in the above : 433
% 0.11/0.44 % Current number of archived formulas : 0
% 0.11/0.44 % Current number of archived clauses : 3
% 0.11/0.44 % Clause-clause subsumption calls (NU) : 497
% 0.11/0.44 % Rec. Clause-clause subsumption calls : 379
% 0.11/0.44 % Non-unit clause-clause subsumptions : 32
% 0.11/0.44 % Unit Clause-clause subsumption calls : 0
% 0.11/0.44 % Rewrite failures with RHS unbound : 0
% 0.11/0.44 % BW rewrite match attempts : 0
% 0.11/0.44 % BW rewrite match successes : 0
% 0.11/0.44 % Condensation attempts : 0
% 0.11/0.44 % Condensation successes : 0
% 0.11/0.44 % Termbank termtop insertions : 4700
% 0.11/0.44 % Search garbage collected termcells : 30
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.003 s
% 0.11/0.44 % System time : 0.005 s
% 0.11/0.44 % Total time : 0.008 s
% 0.11/0.44 % Maximum resident set size: 3644 pages
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.022 s
% 0.11/0.44 % System time : 0.015 s
% 0.11/0.44 % Total time : 0.037 s
% 0.11/0.44 % Maximum resident set size: 4864 pages
% 0.11/0.44 % E exiting
%------------------------------------------------------------------------------