(* Reduction from: Turing Machine Halting (HaltTM 1) to: Semi-unification (SemiU) *)
Require Undecidability.StackMachines.Reductions.HaltTM_1_to_CSSM_UB.
Require Undecidability.SemiUnification.Reductions.CSSM_UB_to_SSemiU.
Require Undecidability.SemiUnification.Reductions.SSemiU_to_RU2SemiU.
Require Undecidability.SemiUnification.Reductions.RU2SemiU_to_SemiU.

(* Many-one reduction from Turing machine halting to semi-unification *)
Theorem reduction : HaltTM 1 ⪯ SemiU.