Turing reduction
This gives a Turing reduction from SAT to Unambiguous-SAT since an assumed algorithm for Unambiguous-SAT can be invoked on the formula_15. Then the random self-reducibility of SAT can be used to compute a satisfying assignment, should it exist.