This paper deals with an Interference Channel with a Cognitive Relay (IFC-CR), a classic IFC with two pairs of independent source-destination, which is linked to an additional node called CR, knowing both messages and helping the communication between two pairs of receivers and senders. This paper studies a continuous alphabet IFC-CR and presents a general inner bound for a Gaussian IFC-CR, including previous bounds as its special cases.