AFTD Auto-Formalizing Theoretical Domains

oneshot_drf_total_completion_time2

def

The total completion time oneshot_drf_total_completion_time2 I of one-shot DRF on a two-resource instance I is defined as sInf { s | ∃ (x : Fin I.n → ℝ → ℝ) (C : Fin I.n → ℝ), is_oneshot_drf_schedule2 I x C ∧ s = ∑ j, C j }.

Statement

noncomputable def oneshot_drf_total_completion_time2 (I : MultidimInstance2) : ℝ
Defined in
arXiv:2611.07905 Sec. 2.2
Verified
08 Nov 2026
Axioms
none listed
Built on 2
  • MultidimInstance2An instance of multidimensional scheduling with 2 resource types and zero release times, consisting of a positive number of jobs n with…
  • is_oneshot_drf_schedule2A schedule (x, C) satisfies is_oneshot_drf_schedule2 I x C for a two-resource instance I if multidim_is_feasible_schedule2 I x C holds and…
Used by 1
  • oneshot_drf_competitive_ratio2The worst-case competitive ratio oneshot_drf_competitive_ratio2 is defined as sSup { ρ | ∃ I : MultidimInstance2, ρ =…

Read back from the Lean

Given an instance I : MultidimInstance2, oneshot_drf_total_completion_time2 I is defined as the infimum (sInf) of the set of all real numbers s such that there exist rate allocation functions x : Fin I.n → ℝ → ℝ and completion times C : Fin I.n → ℝ satisfying is_oneshot_drf_schedule2 I x C (i.e., (x, C) is a feasible multidimensional schedule whose instantaneous rates for all t ≥ 0 match the one-shot Dominant Resource Fairness (DRF) rates for the set of unfinished jobs at time t) such that s equals the total completion time ∑ j : Fin I.n, C j.

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 attained by one-shot DRF on an instance with two resources. -/
noncomputable def oneshot_drf_total_completion_time2 (I : MultidimInstance2) : ℝ :=
  sInf { s | ∃ (x : Fin I.n → ℝ → ℝ) (C : Fin I.n → ℝ), is_oneshot_drf_schedule2 I x C ∧ s = ∑ j, C j }
See it in the graphDiscuss this resultChallenge it