Proof of `Machine sets encoded by long processing times` (1st statement)
groundedproofs/Lax434175Proofs/EncodingsEligibility.lean · lax-434175
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
A machine outside the set of a job gets the time ; a schedule within the threshold uses only machines of the sets.