You can tell by "How can you be sure that the computer program did not skip any smaller examples?"
However, in actuality it really is actually too short. For example, it would be far more interesting to us in 2016 to read this early computational result if it included "reference made to previous attempts to study Euler's conjecture or similar conjectures", also "What led the authors to consider a computer search as opposed to any other approach?" and so forth.
Also in 2016 it would be extremely interesting to know "How was the programming done? How long time did the execution take?" For purely history-of-computation reasons.
Also it would be really interesting for the authors to have listed their own views on the ramifications, i.e. in what way it advances mathematical theory (or not).
Even though the parent comment is sarcastic, as a reader in 2016, I got next to nothing out of the paper. If it had been rejected on the above (sarcastic) basis, and the authors had submitted a six-page version, it would be far more interesting to us. The same would have been true for contemporaries.
[I realize it's sarcasm but in case it's not clear to everyone, I'll speak my mind about it]
I think it's a pretty serious advancement. Confirming a conjecture is just as important as invalidating it with a counter example. It doesn't matter if that counter example fits on one line.
Why should this be even necessary? There are surveys for that. Not every mathematician needs to be a historian. Nor do most people like to read the same introduction in every paper on a certain topic.
You only need one counterexample to a theory or conjecture to prove it wrong.
No reference is made to previous attempts to study Euler's conjecture or similar conjectures (there are surely a dozen other papers that ought to be cited in the introduction).
What led the authors to consider a computer search as opposed to any other approach? Does the method generalize?
It is indicated that the CDC 6600 was used. How was the programming done? How long time did the execution take? The instance is claimed to be "the smallest". In what norm? How can you be sure that the computer program did not skip any smaller examples?
The most serious problem with the paper, however, is that the only contribution is a purely computational statement which, though a counterexample to a conjecture, does not advance mathematical theory in any way.
Due to these shortcomings, my recommendation to the editor is to REJECT the submission.