This paper presents a new mehtod with which we can improve the efficiency (both of speed and precision) of FPN$^{[1]}$. Our method makes use of the basic propositions smong the conditional propositions of a goal proposition. The basic propositions are represented as ource vertices on an FPN. Therefore, we introduce an efficient algebraic algorithm which finds source vertices of FPN.