We study one specific version of the contact process on a graph. Here, we allow multiple infections carried by the nodes and include a probability of removing nodes in a graph. The removal probability is purely determined by the number of infections the node carries at the moment when it gets another infection. In this paper, we show that on any finite graph, any positive value of infection rate \(\lambda\) will result in the death of the process almost surely. In the case of \(d\)-regular infinite trees, We also give a lower bound on the infection rate in order for the process to survive, and an upper bound for the process to die out.