Proof of `Relations of the Scheduling Zoo that need an encoding` (3rd statement)
groundedproofs/Lax434175Proofs/EncodingsFlexible.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
One more machine forms the first stage; every job gets an operation of length zero on it, followed by its operation on one of the original machines. This is even a special case.