n>2 has 4 states: 0ms
 (n>2&endsIn4Zeros(n)) has 4 states: 0ms
  i>0 has 2 states: 0ms
   (i>0&endsIn4Zeros(i)) has 2 states: 0ms
    j<=(((6*x)+n)-1) has 8 states: 1ms
     (j<=(((6*x)+n)-1)&twoceilinglog(x,n)) has 9 states: 0ms
      (E x (j<=(((6*x)+n)-1)&twoceilinglog(x,n))) has 10 states: 1ms
       k<n has 2 states: 0ms
        PF[f][(i+k)]=PF[f][(j+k)] has 46 states: 8ms
         (k<n=>PF[f][(i+k)]=PF[f][(j+k)]) has 92 states: 6ms
          (A k (k<n=>PF[f][(i+k)]=PF[f][(j+k)])) has 153 states: 443ms
           ((E x (j<=(((6*x)+n)-1)&twoceilinglog(x,n)))&(A k (k<n=>PF[f][(i+k)]=PF[f][(j+k)]))) has 218 states: 6ms
            (E j ((E x (j<=(((6*x)+n)-1)&twoceilinglog(x,n)))&(A k (k<n=>PF[f][(i+k)]=PF[f][(j+k)])))) has 4 states: 8ms
             ((i>0&endsIn4Zeros(i))=>(E j ((E x (j<=(((6*x)+n)-1)&twoceilinglog(x,n)))&(A k (k<n=>PF[f][(i+k)]=PF[f][(j+k)]))))) has 4 states: 0ms
              (A i ((i>0&endsIn4Zeros(i))=>(E j ((E x (j<=(((6*x)+n)-1)&twoceilinglog(x,n)))&(A k (k<n=>PF[f][(i+k)]=PF[f][(j+k)])))))) has 2 states: 0ms
               ((n>2&endsIn4Zeros(n))&(A i ((i>0&endsIn4Zeros(i))=>(E j ((E x (j<=(((6*x)+n)-1)&twoceilinglog(x,n)))&(A k (k<n=>PF[f][(i+k)]=PF[f][(j+k)]))))))) has 1 states: 1ms
total computation time: 477ms