This paper describes the implementation of the Refined Triggering Graph (RTG) method for active rule termination analysis. The RTG method has been defined in the context of an active, deductive, object-oriented database language known as CDOL (Comprehensive, Declarative, Object Language). The RTG method studies the contents of rule pairs and rule cycles in a triggering graph and tests for: 1) the successful unification of one rule's action with another rule’s triggering event, and 2) the satisfiability of active rule conditions, asking if it is possible for the condition of a triggered rule to evaluate to true in the context of the triggering rule’s condition. If the analysis can provably demonstrate that one rule cannot trigger another rule, the directed vector connecting the two rules in a basic triggering graph can be removed, thus refining the triggering graph. Two important aspects in the implementation of the method include the development of a satisfiability algorithm for CDOL conditions and the extension of the RTG method with knowledge of the rule execution semantics. The effectiveness of the approach within the context of the sample application is also addressed.