diff --git a/NEWPROPOSAL/FULLPROP.tex b/NEWPROPOSAL/FULLPROP.tex
index 434a5b7f0fbcc286f33f34049c03e7e461a6571a..d3ed0a6fe46aa50a12f13c5221a9a50f44a73cc0 100644
--- a/NEWPROPOSAL/FULLPROP.tex
+++ b/NEWPROPOSAL/FULLPROP.tex
@@ -712,18 +712,6 @@ First, we will identify re-writing processes among the automated theorem proving
 This will allow us to identify candidate subroutines that require nonclassical resources to be carried out.
 Such subroutines then will be used to develop procedures for characterising if a \zx-represented algorithm demonstrates speed-up. 
 
-\KILL{\begin{color}{red!70!black}
-\texttt{[Delete the following once it has been properly incorporated into the WP description in \S3.2]}
-
-Deliverables: 
-\begin{itemize}
-  \item M12: Preliminary assessment of the comparative study of the axiomatizations of paradigms of quantum computation.
-  \item M15: \zx representation and explanation of the result that promotes magic states as a resource of quantum computation in the state injection paradigm.
-  \item M18: Preliminary assessment of nonclassicality of re-writing processes.
-  \item M24: A \zx formulation of contextuality (Kochen--Specker and/or generalised Spekken's type). 
-\end{itemize}
-\end{color}}
-
 \subsubsection{Machine-independent optimisation}
 \label{sec:repr-reas-azx}