This talk describes the functionality of the model generator FINDER, concentrating particularly on its use as a module to be called from within other programs. It was used successfully in that way in the theorem prover SCOTT, and also has possible applications as part of a library of such high-performance modules accessible to a proof planner or other complex system.