AFTD Auto-Formalizing Theoretical Domains

multidim_opt2

def

The offline optimal total completion time multidim_opt2 I of a two-resource multidimensional scheduling instance I is defined as sInf { s | ∃ (x : Fin I.n → ℝ → ℝ) (C : Fin I.n → ℝ), multidim_is_feasible_schedule2 I x C ∧ s = ∑ j, C j }.

Statement

noncomputable def multidim_opt2 (I : MultidimInstance2) : ℝ
Defined in
arXiv:2611.07905 Sec. 2.1
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…
  • multidim_is_feasible_schedule2A rate allocation x and completion time vector C satisfy multidim_is_feasible_schedule2 I x C if for every job j and time t, 0 ≤ x j t ≤…
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

multidim_opt2 I is defined as the real infimum (sInf) of the set of all real numbers s such that there exist rate functions x : Fin I.n → ℝ → ℝ and completion times C : Fin I.n → ℝ satisfying multidim_is_feasible_schedule2 I x C such that s = ∑ j, 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

/-- Offline optimal total completion time for a two-resource multidimensional scheduling instance. -/
noncomputable def multidim_opt2 (I : MultidimInstance2) : ℝ :=
  sInf { s | ∃ (x : Fin I.n → ℝ → ℝ) (C : Fin I.n → ℝ), multidim_is_feasible_schedule2 I x C ∧ s = ∑ j, C j }
See it in the graphDiscuss this resultChallenge it