Application of Geometry Expressions to Theorems from Machine Proofs in Geometry Saltire Software internal Report 2016-1 By Philip Todd
[email protected] In this document we apply Geometry Expressions to a set of theorems from [1]. While not human readable, Geometry Expressions does provide a form of proof. The objective here is to calibrate its performance against this given set of examples. 1 Introduction The goal in this document is to try and “prove” the theorem using Geometry Expressions. If we cannot, we try to use an external CAS to help. If this fails, we will look at special cases we can try and address. If all fail we will look to improve Geometry Expressions! Examples are numbered as they appear in the book. The bulk of this document consists of screenshots taken from Geometry Expressions. These screenshots indicate both the model, which would be input by the user, and the result, constituting the Geometry Expressions proof, which was generated automatically. Examples 6.1 to 6.207 are treated. 1.1 Results Example by example comments are given below. In summary, however, of the 207 examples, 196 are solved in a reasonable amount of time on a modern PC by Geometry Expressions, using an initial formulation. 5 examples failed on the initial formulation, but succeeded on a second formulation (6.69, 6.122, 6.149, 6.163, 6.182). In 3 cases (6.22, 6.104, 6.200), the internal Geometry Expressions CAS was unable to simplify the result, but Maple was able to complete the simplification. In 2 cases, the initial formulation failed, but succeeded after supplying a simple intermediate result (6.172, 6.174).