The Mining of Missing Treasure

Most appealing - and sometimes even stirring - is a well-constructed case showing that, without doubt, some given assertion holds. Typically, such a case is based on logical and flawless reasoning, on a sequence of steps that follow inevitably from the hypotheses used to deduce each. In other words, a proof is given establishing that the assertion under consideration indeed holds.Such proofs are clearly crucial to logic and to mathematics. Not so obvious, but true, proofs are crucial to circuit design, program writing, and, more generally, to various activities in which reasoning plays a vital role. Indeed, most desirable is the case in which no doubt exists regarding the absence of flaws in the design of a chip, in the structure of a computer program, in the argument on which an important decision is based. Such careful reasoning is even the key factor in games that include chess and poker.This book features one example after another of flawless logical reasoning the context is that of finding proofs absent from the literature. The means for finding the missing proofs is reliance on a single computer program, William McCune's automated reasoning program OTTER.One motivating force for writing this book is to interest others in automated reasoning, logic and mathematics. As the text strongly indicates, we delight in using OTTER equally in two quite distinct activities: finding a proof where none is offered by the literature, and finding a proof far more appealing than any the literature provides. We believe that the challenge offered by the type of problem featured in this book can be as engrossing as solving puzzles and playing various games that appeal to the mind. Indeed,sometimes, inexpressible is the excitement engendered when seeking a proof with fewer steps than was found by one of the great minds of the twentieth century.A second motivating force resets with our obvious enjoyment of the type of research featured in this book. Like the fancier of fine wines, we continually seek new open questions to attack, whether (at one end of the spectrum) they concern the settling of a conjecture or (at the other end) the focus is on proof betterment. We encourage readers to send us additional open questions and challenging problems.Another factor that motivated us was our wish to collect in a single volume a surprisingly large number of proofs, most of which were previously absent from the literature. In some cases, no proof was offered of any type; in some cases, the proof that was offered was far from axiomatic. None of the proofs rely on induction, or on metal argument, or on higher-order logic. In one sense, the book can serve as an encyclopedia of proofs -- many new and many improved - a work that sometimes extends, sometimes replaces, and sometimes supplements the research of more than a century. These proofs offer the implicit challenge of finding others that are further improvements.In a rather different sense, the book may serve as the key to eventually answering one open question after another, whether the context is logic, mathematics, design, synthesis, or some other area relying on sound reasoning. In that regards, we include in details numerous diverse methodologies are themselves intriguing. For an example, one methodology asks for two independent paths that lead to success and, rather than emphasizing what is common to both (theirintersection), instead heavily focuses on what is not shared (their symmetric difference).Although the emphasis here is on their use in the context of logic and mathematics, we conjecture that the methodologies we offer will prove most useful in a far wider context. We also suspect that, especially for those who enjoy solving puzzles and unraveling the mysteries of sciences, the nature of the methodologies will provide substantial stimulation.This volume introduce some readers to the excitement of discovering new results, increase the intrigue of those already familiar with such excitement, and (for the expert) add to the arsenal of weapons for attacking deep questions and hard problems.