On the adequateness of the connection method

Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Au-tomated inferencing methods are often not ade-quate as they require thousands of steps to solve problems which humans solve effortlessly, sponta-neously, and with remarkable efficiency. L. Shastri and V. Ajjanagadde- who call this gap the ar-tificial intelligence paradox- suggest that their connectionist inference system is a first step to-ward bridging this gap. In this paper we show that their inference method is equivalent to rea-soning by reductions in the well-known connec-tion method. In particular, we extend a reductio