Proving mathematical theorems by computer programs is the hot and latest buzz in automated reasoning (AR). The legality factor of a theorem ranges from the trivial to impossible state, based upon the logic used for its conceptualisation.

Automated Theorem Proving
AbstractAutomated theorem proving (ATP), currently the most well-developed subfield of automated reasoning (AR), is the proving of mathematical theorems by a computer program. Depending on the underlying logic, the problem of deciding the validity of a theorem varies from trivial to impossible.