n=1 has 2 states: 0ms
 n=3 has 3 states: 0ms
  (n=1|n=3) has 3 states: 0ms
   n=5 has 4 states: 0ms
    ((n=1|n=3)|n=5) has 4 states: 0ms
     (((n=1|n=3)|n=5)&endsIn2Zeros(n)) has 4 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: 9ms
          (k<n=>PF[f][(i+k)]=PF[f][((i+k)+n)]) has 59 states: 2ms
           (A k (k<n=>PF[f][(i+k)]=PF[f][((i+k)+n)])) has 36 states: 22ms
            ((endsIn2Zeros(i)&i>=1)&(A k (k<n=>PF[f][(i+k)]=PF[f][((i+k)+n)]))) has 37 states: 0ms
             (E i ((endsIn2Zeros(i)&i>=1)&(A k (k<n=>PF[f][(i+k)]=PF[f][((i+k)+n)])))) has 12 states: 1ms
              ((((n=1|n=3)|n=5)&endsIn2Zeros(n))=>(E i ((endsIn2Zeros(i)&i>=1)&(A k (k<n=>PF[f][(i+k)]=PF[f][((i+k)+n)]))))) has 12 states: 0ms
               (A n ((((n=1|n=3)|n=5)&endsIn2Zeros(n))=>(E i ((endsIn2Zeros(i)&i>=1)&(A k (k<n=>PF[f][(i+k)]=PF[f][((i+k)+n)])))))) has 10 states: 0ms
total computation time: 36ms