report: applications: elementary can be many things

doc/report/applications.tex

@@ -86,8 +86,8 @@ implementations.
 Our first query~$\mathcal{Q}_1$ illustrates how we can compute
 arithmetic scores for some nodes in our knowledge
 graph. Query~$\mathcal{Q}_1$ asks us to ``[f]ind theorems with
-non-elementary proofs.''.  Elementary proofs are those that are
-considered easy and obvious~\cite{elempro}. In
+non-elementary proofs.''.  Elementary proofs can be understood as
+those proof that are considered easy and obvious~\cite{elempro}. In
 consequence,~$\mathcal{Q}_1$ has to search for all proofs which are
 not trivial.  Of course, just like nay distinction between ``theorem''
 and ``corollary'' is going to be somewhat arbitrary, so is any