n>0 has 2 states: 7ms
 i>=1 has 2 states: 5ms
  (i>=1&startsWith2Zeros(i)) has 2 states: 1ms
   ((i>=1&startsWith2Zeros(i))&startsWith2Zeros(n)) has 2 states: 1ms
    k<n has 2 states: 0ms
     PFmsd[f][(i+k)]=PFmsd[f][((i+k)+n)] has 162 states: 368ms
      (k<n=>PFmsd[f][(i+k)]=PFmsd[f][((i+k)+n)]) has 248 states: 141ms
       (A k (k<n=>PFmsd[f][(i+k)]=PFmsd[f][((i+k)+n)])) has 36 states: 3721ms
        (((i>=1&startsWith2Zeros(i))&startsWith2Zeros(n))&(A k (k<n=>PFmsd[f][(i+k)]=PFmsd[f][((i+k)+n)]))) has 36 states: 1ms
         (E f , i (((i>=1&startsWith2Zeros(i))&startsWith2Zeros(n))&(A k (k<n=>PFmsd[f][(i+k)]=PFmsd[f][((i+k)+n)])))) has 4 states: 1ms
          (n>0&(E f , i (((i>=1&startsWith2Zeros(i))&startsWith2Zeros(n))&(A k (k<n=>PFmsd[f][(i+k)]=PFmsd[f][((i+k)+n)]))))) has 4 states: 0ms
total computation time: 4270ms