The Firefighter problem was introduced by Hartnell in 1995 and corresponds to a scenario in which a fire breaks out at one or more vertices of a graph and spreads to all adjacent vertices that have not been protected in previous steps. In this paper, we present an algorithm of the Firefighter problem to an infinite family of full icosahedral symmetry fullerene graphs, providing the surviving rate at least 50%, contributing to the question proposed by Costa in 2015 on the surviving rate of graphs with maximum degree 3.