n=2 has 3 states: 0ms
 (n=2&endsIn2Zeros(n)) has 3 states: 0ms
  i>=1 has 2 states: 0ms
   (endsIn2Zeros(i)&i>=1) has 2 states: 0ms
    k<n has 2 states: 0ms
     PF[f][(i+k)]=PF[f][((i+k)+n)] has 34 states: 5ms
      (k<n=>PF[f][(i+k)]=PF[f][((i+k)+n)]) has 59 states: 3ms
       (A k (k<n=>PF[f][(i+k)]=PF[f][((i+k)+n)])) has 36 states: 45ms
        ((endsIn2Zeros(i)&i>=1)&(A k (k<n=>PF[f][(i+k)]=PF[f][((i+k)+n)]))) has 37 states: 1ms
         (E i ((endsIn2Zeros(i)&i>=1)&(A k (k<n=>PF[f][(i+k)]=PF[f][((i+k)+n)])))) has 12 states: 0ms
          ((n=2&endsIn2Zeros(n))=>(E i ((endsIn2Zeros(i)&i>=1)&(A k (k<n=>PF[f][(i+k)]=PF[f][((i+k)+n)]))))) has 4 states: 1ms
           (A n ((n=2&endsIn2Zeros(n))=>(E i ((endsIn2Zeros(i)&i>=1)&(A k (k<n=>PF[f][(i+k)]=PF[f][((i+k)+n)])))))) has 2 states: 0ms
total computation time: 56ms