Can an NP-Complete problem be reduced to an NP problem?


All NP problems can be reduced to NP-Complete problems, can an NP-Complete problem be reduced to a NP problem (non complete)?