In this paper we describe two different probabilistic teleportation protocols for teleporting the same unknown 3-qubit state from the sender Alice to the receiver Bob. The speciality of the state is that it remains a 2-qubit entangled state after any of the three involved qubits is eliminated by partial trace operation. One of the protocols utilizes a two and a three-qubit separate channels while in the other protocol, a five-qubit channel is utilized. One of the channels in the first protocol is a non-maximally entangled Bell state while the 5-qubit channel used in the case of the second protocol is non-maximally entangled. Both the teleportation schemes are probabilistic with the feature that in the case of failure of the teleportation, the state to be teleported is not lost to the sender. So the process can be repeated after failure till success is achieved. Moreover, one of the channels is recovered in the failure case. Both protocols are resumable in the above sense. The above is the speciality of the present work. We analyze the efficiency of our protocol which shows that the present two protocols are better performing than some existing ones.