Our approach to improve the search of a theorem prover employs empirical knowledge gMned from former proofs. A connectionist network is used to learn heuristics which order the choices at nondeterministic branch-points. This is done by estimating their relative chance for leading to a shortest proof. Using the method it was possible to reduce the search effort required by a high speed theorem prover. Several experiments are presented showing the attained improvements.