This paper presents a novel approach for identifying redundant rules in inductive logic programming (ILP). Redundant rules are those that contain redundant literals or cannot distinguish between negative examples. We demonstrate that ignoring these redundant rules effectively prunes the hypothesis space. Experimental results across multiple domains, including visual reasoning and game play, demonstrate that the proposed approach can reduce training time by up to 99% while maintaining prediction accuracy.