AFTD Auto-Formalizing Theoretical Domains

oneshot_drf_total_completion_time

def

The total completion time oneshot_drf_total_completion_time I of one-shot DRF on an instance I with D resources is defined as the real infimum sInf of the set of all s such that there exist x and C satisfying is_oneshot_drf_schedule I x C with s = ∑ j, C j.

Statement

noncomputable def oneshot_drf_total_completion_time {D : ℕ} (I : MultidimInstance D) : ℝ
Defined in
arXiv:2611.07905 Tight Worst-Case Completion-Time Bounds for Dominant Resource Fairness, Section 2.2
Verified
08 Nov 2026
Axioms
none listed
Built on 2
  • MultidimInstanceAn instance of multidimensional scheduling with D resource types and zero release times, consisting of a positive number of jobs n with…
  • is_oneshot_drf_scheduleA rate allocation x and completion time vector C satisfy is_oneshot_drf_schedule I x C for an instance I with D resources if…

Read back from the Lean

oneshot_drf_total_completion_time defines a function that takes a dimension D : ℕ and a multidimensional scheduling instance I : MultidimInstance D, and returns the real infimum (sInf) of the set of total completion times s = ∑ j, C j over all rate allocation functions x : Fin I.n → ℝ → ℝ and completion time vectors C : Fin I.n → ℝ such that (x, C) is a valid one-shot DRF schedule for I (is_oneshot_drf_schedule I x C).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- Total completion time under one-shot DRF. -/
noncomputable def oneshot_drf_total_completion_time {D : ℕ} (I : MultidimInstance D) : ℝ :=
  sInf { s | ∃ (x : Fin I.n → ℝ → ℝ) (C : Fin I.n → ℝ), is_oneshot_drf_schedule I x C ∧ s = ∑ j, C j }
See it in the graphDiscuss this resultChallenge it