Yes. The Clique Problem is NP-complete, so every problem in NP reduces to it in polynomial time. SIP is in NP.