1.1 --- a/test/Tools/isac/ADDTESTS/course/SignalProcess/Build_Inverse_Z_Transform.thy	Mon Sep 02 15:17:34 2013 +0200
     1.2 +++ b/test/Tools/isac/ADDTESTS/course/SignalProcess/Build_Inverse_Z_Transform.thy	Mon Sep 02 16:16:08 2013 +0200
     1.3 @@ -1273,8 +1273,8 @@
     1.4        tree and check if every node implements that what we have wanted.*}
     1.5        
     1.6  ML {*
     1.7 -  trace_rewrite := false;
     1.8 -  trace_script := false;
     1.9 +  trace_rewrite := false; (*true*)
    1.10 +  trace_script := false; (*true*)
    1.11    print_depth 9;
    1.12    
    1.13    val fmz =
    1.14 @@ -1309,6 +1309,7 @@
    1.15      " --> X' z = 3 / (z * (z - 1 / 4 + -1 / 8 * (1 / z)))";
    1.16    val (p,_,f,nxt,_,pt) = me nxt p [] pt; 
    1.17      "SubProblem";
    1.18 +  print_depth 3;
    1.19  *}
    1.20  
    1.21  text {*\noindent Instead of \ttfamily nxt = Subproblem \normalfont above we had
    1.22 @@ -1382,7 +1383,7 @@
    1.23           \ttfamily get\_obj g\_pbl pt (fst p);\normalfont? YES -- ok
    1.24         \item What is the returned formula:
    1.25  \begin{verbatim}
    1.26 -print_depth 999; f; print_depth 999;
    1.27 +print_depth 999; f; print_depth 3;
    1.28  { Find = [ Correct "solutions z_i"],
    1.29    With = [],
    1.30    Given = [Correct "equality (-1 + -2*z + 8*z ^^^ 2 = 0)",