final bijna

[ar1516.git] / 4.tex

diff --git a/4.tex b/4.tex
index 0414723..0ddc5de 100644 (file)
--- a/4.tex
+++ b/4.tex
@@ -52,7 +52,8 @@ the $i=j$ comparison in subformula 17 and 18 by removing them from the set
 looped over. The script also optimizes by not checking variables $a_0^n$ and
 $a_I^n$ since they always stay the same anyways. The minimization is done by
 incrementing variable $N$ every time the current $N$ yields unsat with a bash
-script shown in Listing~\ref{listing:4.bash}.
+script shown in Listing~\ref{listing:4.bash} and visualized with the python
+script shown in Listing~\ref{listing:a4.py}.
 
 \lstinputlisting[language=bash,firstline=58,
        caption={Iteratively find the shortest solution for problem 4},
@@ -60,7 +61,7 @@ script shown in Listing~\ref{listing:4.bash}.
 
 \subsection{Solution}
 The bash script finds and shows the minimal solution in which the postcondition
-is satisfied for $N=10$. Finding this solution takes less then $75$ seconds and
+is satisfied for $N=10$. Finding this solution takes less then $20$ seconds and
 is shown in Table~\ref{tab:s4}.
 
 Every line in the table represents the iteration and the bold items represent