- : unit = ()
h : heuristic = <heuristic>
- : unit = ()
APPLY CRITERIA (Marked dependency pairs)

TRS termination of:
[1] zeros -> cons(0,n__zeros)
[2] U11(tt,L) -> s(length(activate(L)))
[3] U21(tt) -> nil
[4] U31(tt,IL,M,N) -> cons(activate(N),n__take(activate(M),activate(IL)))
[5] and(tt,X) -> activate(X)
[6] isNat(n__0) -> tt
[7] isNat(n__length(V1)) -> isNatList(activate(V1))
[8] isNat(n__s(V1)) -> isNat(activate(V1))
[9] isNatIList(V) -> isNatList(activate(V))
[10] isNatIList(n__zeros) -> tt
[11] isNatIList(n__cons(V1,V2)) ->
 and(isNat(activate(V1)),n__isNatIList(activate(V2)))
[12] isNatList(n__nil) -> tt
[13] isNatList(n__cons(V1,V2)) ->
 and(isNat(activate(V1)),n__isNatList(activate(V2)))
[14] isNatList(n__take(V1,V2)) ->
 and(isNat(activate(V1)),n__isNatIList(activate(V2)))
[15] length(nil) -> 0
[16] length(cons(N,L)) ->
 U11(and(isNatList(activate(L)),n__isNat(N)),activate(L))
[17] take(0,IL) -> U21(isNatIList(IL))
[18] take(s(M),cons(N,IL)) ->
 U31(and(isNatIList(activate(IL)),n__and(isNat(M),n__isNat(N))),activate(IL),
  M,N)
[19] zeros -> n__zeros
[20] take(X1,X2) -> n__take(X1,X2)
[21] 0 -> n__0
[22] length(X) -> n__length(X)
[23] s(X) -> n__s(X)
[24] cons(X1,X2) -> n__cons(X1,X2)
[25] isNatIList(X) -> n__isNatIList(X)
[26] nil -> n__nil
[27] isNatList(X) -> n__isNatList(X)
[28] isNat(X) -> n__isNat(X)
[29] and(X1,X2) -> n__and(X1,X2)
[30] activate(n__zeros) -> zeros
[31] activate(n__take(X1,X2)) -> take(X1,X2)
[32] activate(n__0) -> 0
[33] activate(n__length(X)) -> length(X)
[34] activate(n__s(X)) -> s(X)
[35] activate(n__cons(X1,X2)) -> cons(X1,X2)
[36] activate(n__isNatIList(X)) -> isNatIList(X)
[37] activate(n__nil) -> nil
[38] activate(n__isNatList(X)) -> isNatList(X)
[39] activate(n__isNat(X)) -> isNat(X)
[40] activate(n__and(X1,X2)) -> and(X1,X2)
[41] activate(X) -> X


Sub problem: 
guided: 

DP termination of:
<Marked_zeros , Marked_cons(0,n__zeros)>
<Marked_zeros , Marked_0>
<Marked_U11(tt,L) , Marked_s(length(activate(L)))>
<Marked_U11(tt,L) , Marked_length(activate(L))>
<Marked_U11(tt,L) , Marked_activate(L)>
<Marked_U21(tt) , Marked_nil>
<Marked_U31(tt,IL,M,N) , Marked_cons(activate(N),
                          n__take(activate(M),activate(IL)))>
<Marked_U31(tt,IL,M,N) , Marked_activate(N)>
<Marked_U31(tt,IL,M,N) , Marked_activate(M)>
<Marked_U31(tt,IL,M,N) , Marked_activate(IL)>
<Marked_and(tt,X) , Marked_activate(X)>
<Marked_isNat(n__length(V1)) , Marked_isNatList(activate(V1))>
<Marked_isNat(n__length(V1)) , Marked_activate(V1)>
<Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))>
<Marked_isNat(n__s(V1)) , Marked_activate(V1)>
<Marked_isNatIList(V) , Marked_isNatList(activate(V))>
<Marked_isNatIList(V) , Marked_activate(V)>
<Marked_isNatIList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                      n__isNatIList(activate(V2)))>
<Marked_isNatIList(n__cons(V1,V2)) , Marked_isNat(activate(V1))>
<Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V1)>
<Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V2)>
<Marked_isNatList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                     n__isNatList(activate(V2)))>
<Marked_isNatList(n__cons(V1,V2)) , Marked_isNat(activate(V1))>
<Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)>
<Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)>
<Marked_isNatList(n__take(V1,V2)) , Marked_and(isNat(activate(V1)),
                                     n__isNatIList(activate(V2)))>
<Marked_isNatList(n__take(V1,V2)) , Marked_isNat(activate(V1))>
<Marked_isNatList(n__take(V1,V2)) , Marked_activate(V1)>
<Marked_isNatList(n__take(V1,V2)) , Marked_activate(V2)>
<Marked_length(nil) , Marked_0>
<Marked_length(cons(N,L)) , Marked_U11(and(isNatList(activate(L)),n__isNat(N)),
                             activate(L))>
<Marked_length(cons(N,L)) , Marked_and(isNatList(activate(L)),n__isNat(N))>
<Marked_length(cons(N,L)) , Marked_isNatList(activate(L))>
<Marked_length(cons(N,L)) , Marked_activate(L)>
<Marked_length(cons(N,L)) , Marked_activate(L)>
<Marked_take(0,IL) , Marked_U21(isNatIList(IL))>
<Marked_take(0,IL) , Marked_isNatIList(IL)>
<Marked_take(s(M),cons(N,IL)) , Marked_U31(and(isNatIList(activate(IL)),
                                            n__and(isNat(M),n__isNat(N))),
                                 activate(IL),M,N)>
<Marked_take(s(M),cons(N,IL)) , Marked_and(isNatIList(activate(IL)),
                                 n__and(isNat(M),n__isNat(N)))>
<Marked_take(s(M),cons(N,IL)) , Marked_isNatIList(activate(IL))>
<Marked_take(s(M),cons(N,IL)) , Marked_activate(IL)>
<Marked_take(s(M),cons(N,IL)) , Marked_isNat(M)>
<Marked_take(s(M),cons(N,IL)) , Marked_activate(IL)>
<Marked_activate(n__zeros) , Marked_zeros>
<Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
<Marked_activate(n__0) , Marked_0>
<Marked_activate(n__length(X)) , Marked_length(X)>
<Marked_activate(n__s(X)) , Marked_s(X)>
<Marked_activate(n__cons(X1,X2)) , Marked_cons(X1,X2)>
<Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
<Marked_activate(n__nil) , Marked_nil>
<Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
<Marked_activate(n__isNat(X)) , Marked_isNat(X)>
<Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)> 
      --> <Marked_and(tt,X) , Marked_activate(X)>
  <Marked_activate(n__isNat(X)) , Marked_isNat(X)> 
     --> <Marked_isNat(n__s(V1)) , Marked_activate(V1)>
  <Marked_activate(n__isNat(X)) , Marked_isNat(X)> 
     --> <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))>
  <Marked_activate(n__isNat(X)) , Marked_isNat(X)> 
     --> <Marked_isNat(n__length(V1)) , Marked_activate(V1)>
  <Marked_activate(n__isNat(X)) , Marked_isNat(X)> 
     --> <Marked_isNat(n__length(V1)) , Marked_isNatList(activate(V1))>
  <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)> 
     --> <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V2)>
  <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)> 
     --> <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V1)>
  <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)> 
     --> <Marked_isNatList(n__take(V1,V2)) , Marked_isNat(activate(V1))>
  <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)> 
     --> <Marked_isNatList(n__take(V1,V2)) , Marked_and(isNat(activate(V1)),
                                              n__isNatIList(activate(V2)))>
  <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)>
  <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)>
  <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_isNat(activate(V1))>
  <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                              n__isNatList(activate(V2)))>
  <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V2)>
  <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V1)>
  <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_isNat(activate(V1))>
  <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                               n__isNatIList(activate(V2)))>
  <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)> 
     --> <Marked_isNatIList(V) , Marked_activate(V)>
  <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)> 
     --> <Marked_isNatIList(V) , Marked_isNatList(activate(V))>
  <Marked_activate(n__length(X)) , Marked_length(X)> 
     --> <Marked_length(cons(N,L)) , Marked_activate(L)>
  <Marked_activate(n__length(X)) , Marked_length(X)> 
     --> <Marked_length(cons(N,L)) , Marked_activate(L)>
  <Marked_activate(n__length(X)) , Marked_length(X)> 
     --> <Marked_length(cons(N,L)) , Marked_isNatList(activate(L))>
  <Marked_activate(n__length(X)) , Marked_length(X)> 
     --> <Marked_length(cons(N,L)) , Marked_and(isNatList(activate(L)),
                                      n__isNat(N))>
  <Marked_activate(n__length(X)) , Marked_length(X)> 
     --> <Marked_length(cons(N,L)) , Marked_U11(and(isNatList(activate(L)),
                                                 n__isNat(N)),activate(L))>
  <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)> 
     --> <Marked_take(s(M),cons(N,IL)) , Marked_activate(IL)>
  <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)> 
     --> <Marked_take(s(M),cons(N,IL)) , Marked_isNat(M)>
  <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)> 
     --> <Marked_take(s(M),cons(N,IL)) , Marked_activate(IL)>
  <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)> 
     --> <Marked_take(s(M),cons(N,IL)) , Marked_isNatIList(activate(IL))>
  <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)> 
     --> <Marked_take(s(M),cons(N,IL)) , Marked_and(isNatIList(activate(IL)),
                                          n__and(isNat(M),n__isNat(N)))>
  <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)> 
     --> <Marked_take(s(M),cons(N,IL)) , Marked_U31(and(isNatIList(activate(IL)),
                                                     n__and(isNat(M),
                                                      n__isNat(N))),
                                          activate(IL),M,N)>
  <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)> 
     --> <Marked_take(0,IL) , Marked_isNatIList(IL)>
  <Marked_take(s(M),cons(N,IL)) , Marked_activate(IL)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_take(s(M),cons(N,IL)) , Marked_activate(IL)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_take(s(M),cons(N,IL)) , Marked_activate(IL)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_take(s(M),cons(N,IL)) , Marked_activate(IL)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_take(s(M),cons(N,IL)) , Marked_activate(IL)> 
     --> <Marked_activate(n__length(X)) , Marked_length(X)>
  <Marked_take(s(M),cons(N,IL)) , Marked_activate(IL)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_take(s(M),cons(N,IL)) , Marked_isNat(M)> 
     --> <Marked_isNat(n__s(V1)) , Marked_activate(V1)>
  <Marked_take(s(M),cons(N,IL)) , Marked_isNat(M)> 
     --> <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))>
  <Marked_take(s(M),cons(N,IL)) , Marked_isNat(M)> 
     --> <Marked_isNat(n__length(V1)) , Marked_activate(V1)>
  <Marked_take(s(M),cons(N,IL)) , Marked_isNat(M)> 
     --> <Marked_isNat(n__length(V1)) , Marked_isNatList(activate(V1))>
  <Marked_take(s(M),cons(N,IL)) , Marked_activate(IL)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_take(s(M),cons(N,IL)) , Marked_activate(IL)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_take(s(M),cons(N,IL)) , Marked_activate(IL)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_take(s(M),cons(N,IL)) , Marked_activate(IL)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_take(s(M),cons(N,IL)) , Marked_activate(IL)> 
     --> <Marked_activate(n__length(X)) , Marked_length(X)>
  <Marked_take(s(M),cons(N,IL)) , Marked_activate(IL)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_take(s(M),cons(N,IL)) , Marked_isNatIList(activate(IL))> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V2)>
  <Marked_take(s(M),cons(N,IL)) , Marked_isNatIList(activate(IL))> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V1)>
  <Marked_take(s(M),cons(N,IL)) , Marked_isNatIList(activate(IL))> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_isNat(activate(V1))>
  <Marked_take(s(M),cons(N,IL)) , Marked_isNatIList(activate(IL))> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                               n__isNatIList(activate(V2)))>
  <Marked_take(s(M),cons(N,IL)) , Marked_isNatIList(activate(IL))> 
     --> <Marked_isNatIList(V) , Marked_activate(V)>
  <Marked_take(s(M),cons(N,IL)) , Marked_isNatIList(activate(IL))> 
     --> <Marked_isNatIList(V) , Marked_isNatList(activate(V))>
  <Marked_take(s(M),cons(N,IL)) , Marked_and(isNatIList(activate(IL)),
                                   n__and(isNat(M),n__isNat(N)))> 
     --> <Marked_and(tt,X) , Marked_activate(X)>
  <Marked_take(s(M),cons(N,IL)) , Marked_U31(and(isNatIList(activate(IL)),
                                              n__and(isNat(M),n__isNat(N))),
                                   activate(IL),M,N)> 
     --> <Marked_U31(tt,IL,M,N) , Marked_activate(IL)>
  <Marked_take(s(M),cons(N,IL)) , Marked_U31(and(isNatIList(activate(IL)),
                                              n__and(isNat(M),n__isNat(N))),
                                   activate(IL),M,N)> 
     --> <Marked_U31(tt,IL,M,N) , Marked_activate(M)>
  <Marked_take(s(M),cons(N,IL)) , Marked_U31(and(isNatIList(activate(IL)),
                                              n__and(isNat(M),n__isNat(N))),
                                   activate(IL),M,N)> 
     --> <Marked_U31(tt,IL,M,N) , Marked_activate(N)>
  <Marked_take(0,IL) , Marked_isNatIList(IL)> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V2)>
  <Marked_take(0,IL) , Marked_isNatIList(IL)> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V1)>
  <Marked_take(0,IL) , Marked_isNatIList(IL)> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_isNat(activate(V1))>
  <Marked_take(0,IL) , Marked_isNatIList(IL)> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                               n__isNatIList(activate(V2)))>
  <Marked_take(0,IL) , Marked_isNatIList(IL)> 
     --> <Marked_isNatIList(V) , Marked_activate(V)>
  <Marked_take(0,IL) , Marked_isNatIList(IL)> 
     --> <Marked_isNatIList(V) , Marked_isNatList(activate(V))>
  <Marked_length(cons(N,L)) , Marked_activate(L)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_length(cons(N,L)) , Marked_activate(L)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_length(cons(N,L)) , Marked_activate(L)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_length(cons(N,L)) , Marked_activate(L)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_length(cons(N,L)) , Marked_activate(L)> 
     --> <Marked_activate(n__length(X)) , Marked_length(X)>
  <Marked_length(cons(N,L)) , Marked_activate(L)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_length(cons(N,L)) , Marked_activate(L)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_length(cons(N,L)) , Marked_activate(L)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_length(cons(N,L)) , Marked_activate(L)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_length(cons(N,L)) , Marked_activate(L)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_length(cons(N,L)) , Marked_activate(L)> 
     --> <Marked_activate(n__length(X)) , Marked_length(X)>
  <Marked_length(cons(N,L)) , Marked_activate(L)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_length(cons(N,L)) , Marked_isNatList(activate(L))> 
     --> <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V2)>
  <Marked_length(cons(N,L)) , Marked_isNatList(activate(L))> 
     --> <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V1)>
  <Marked_length(cons(N,L)) , Marked_isNatList(activate(L))> 
     --> <Marked_isNatList(n__take(V1,V2)) , Marked_isNat(activate(V1))>
  <Marked_length(cons(N,L)) , Marked_isNatList(activate(L))> 
     --> <Marked_isNatList(n__take(V1,V2)) , Marked_and(isNat(activate(V1)),
                                              n__isNatIList(activate(V2)))>
  <Marked_length(cons(N,L)) , Marked_isNatList(activate(L))> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)>
  <Marked_length(cons(N,L)) , Marked_isNatList(activate(L))> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)>
  <Marked_length(cons(N,L)) , Marked_isNatList(activate(L))> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_isNat(activate(V1))>
  <Marked_length(cons(N,L)) , Marked_isNatList(activate(L))> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                              n__isNatList(activate(V2)))>
  <Marked_length(cons(N,L)) , Marked_and(isNatList(activate(L)),n__isNat(N))> 
     --> <Marked_and(tt,X) , Marked_activate(X)>
  <Marked_length(cons(N,L)) , Marked_U11(and(isNatList(activate(L)),
                                          n__isNat(N)),activate(L))> 
     --> <Marked_U11(tt,L) , Marked_activate(L)>
  <Marked_length(cons(N,L)) , Marked_U11(and(isNatList(activate(L)),
                                          n__isNat(N)),activate(L))> 
     --> <Marked_U11(tt,L) , Marked_length(activate(L))>
  <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__length(X)) , Marked_length(X)>
  <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__length(X)) , Marked_length(X)>
  <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_isNatList(n__take(V1,V2)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_activate(V1)>
  <Marked_isNatList(n__take(V1,V2)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))>
  <Marked_isNatList(n__take(V1,V2)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__length(V1)) , Marked_activate(V1)>
  <Marked_isNatList(n__take(V1,V2)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__length(V1)) , Marked_isNatList(activate(V1))>
  <Marked_isNatList(n__take(V1,V2)) , Marked_and(isNat(activate(V1)),
                                       n__isNatIList(activate(V2)))> 
     --> <Marked_and(tt,X) , Marked_activate(X)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__length(X)) , Marked_length(X)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__length(X)) , Marked_length(X)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_activate(V1)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__length(V1)) , Marked_activate(V1)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__length(V1)) , Marked_isNatList(activate(V1))>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                       n__isNatList(activate(V2)))> 
     --> <Marked_and(tt,X) , Marked_activate(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__length(X)) , Marked_length(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__length(X)) , Marked_length(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_activate(V1)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__length(V1)) , Marked_activate(V1)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__length(V1)) , Marked_isNatList(activate(V1))>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                        n__isNatIList(activate(V2)))> 
     --> <Marked_and(tt,X) , Marked_activate(X)>
  <Marked_isNatIList(V) , Marked_activate(V)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNatIList(V) , Marked_activate(V)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_isNatIList(V) , Marked_activate(V)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNatIList(V) , Marked_activate(V)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNatIList(V) , Marked_activate(V)> 
     --> <Marked_activate(n__length(X)) , Marked_length(X)>
  <Marked_isNatIList(V) , Marked_activate(V)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_isNatIList(V) , Marked_isNatList(activate(V))> 
     --> <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V2)>
  <Marked_isNatIList(V) , Marked_isNatList(activate(V))> 
     --> <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V1)>
  <Marked_isNatIList(V) , Marked_isNatList(activate(V))> 
     --> <Marked_isNatList(n__take(V1,V2)) , Marked_isNat(activate(V1))>
  <Marked_isNatIList(V) , Marked_isNatList(activate(V))> 
     --> <Marked_isNatList(n__take(V1,V2)) , Marked_and(isNat(activate(V1)),
                                              n__isNatIList(activate(V2)))>
  <Marked_isNatIList(V) , Marked_isNatList(activate(V))> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)>
  <Marked_isNatIList(V) , Marked_isNatList(activate(V))> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)>
  <Marked_isNatIList(V) , Marked_isNatList(activate(V))> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_isNat(activate(V1))>
  <Marked_isNatIList(V) , Marked_isNatList(activate(V))> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                              n__isNatList(activate(V2)))>
  <Marked_isNat(n__s(V1)) , Marked_activate(V1)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNat(n__s(V1)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_isNat(n__s(V1)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNat(n__s(V1)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNat(n__s(V1)) , Marked_activate(V1)> 
     --> <Marked_activate(n__length(X)) , Marked_length(X)>
  <Marked_isNat(n__s(V1)) , Marked_activate(V1)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_activate(V1)>
  <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))>
  <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__length(V1)) , Marked_activate(V1)>
  <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__length(V1)) , Marked_isNatList(activate(V1))>
  <Marked_isNat(n__length(V1)) , Marked_activate(V1)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNat(n__length(V1)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_isNat(n__length(V1)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNat(n__length(V1)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNat(n__length(V1)) , Marked_activate(V1)> 
     --> <Marked_activate(n__length(X)) , Marked_length(X)>
  <Marked_isNat(n__length(V1)) , Marked_activate(V1)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_isNat(n__length(V1)) , Marked_isNatList(activate(V1))> 
     --> <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V2)>
  <Marked_isNat(n__length(V1)) , Marked_isNatList(activate(V1))> 
     --> <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V1)>
  <Marked_isNat(n__length(V1)) , Marked_isNatList(activate(V1))> 
     --> <Marked_isNatList(n__take(V1,V2)) , Marked_isNat(activate(V1))>
  <Marked_isNat(n__length(V1)) , Marked_isNatList(activate(V1))> 
     --> <Marked_isNatList(n__take(V1,V2)) , Marked_and(isNat(activate(V1)),
                                              n__isNatIList(activate(V2)))>
  <Marked_isNat(n__length(V1)) , Marked_isNatList(activate(V1))> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)>
  <Marked_isNat(n__length(V1)) , Marked_isNatList(activate(V1))> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)>
  <Marked_isNat(n__length(V1)) , Marked_isNatList(activate(V1))> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_isNat(activate(V1))>
  <Marked_isNat(n__length(V1)) , Marked_isNatList(activate(V1))> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                              n__isNatList(activate(V2)))>
  <Marked_and(tt,X) , Marked_activate(X)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_and(tt,X) , Marked_activate(X)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_and(tt,X) , Marked_activate(X)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_and(tt,X) , Marked_activate(X)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_and(tt,X) , Marked_activate(X)> 
     --> <Marked_activate(n__length(X)) , Marked_length(X)>
  <Marked_and(tt,X) , Marked_activate(X)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(IL)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(IL)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(IL)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(IL)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(IL)> 
     --> <Marked_activate(n__length(X)) , Marked_length(X)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(IL)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(M)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(M)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(M)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(M)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(M)> 
     --> <Marked_activate(n__length(X)) , Marked_length(X)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(M)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(N)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(N)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(N)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(N)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(N)> 
     --> <Marked_activate(n__length(X)) , Marked_length(X)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(N)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_U11(tt,L) , Marked_activate(L)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_U11(tt,L) , Marked_activate(L)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_U11(tt,L) , Marked_activate(L)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_U11(tt,L) , Marked_activate(L)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_U11(tt,L) , Marked_activate(L)> 
     --> <Marked_activate(n__length(X)) , Marked_length(X)>
  <Marked_U11(tt,L) , Marked_activate(L)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_U11(tt,L) , Marked_length(activate(L))> 
     --> <Marked_length(cons(N,L)) , Marked_activate(L)>
  <Marked_U11(tt,L) , Marked_length(activate(L))> 
     --> <Marked_length(cons(N,L)) , Marked_activate(L)>
  <Marked_U11(tt,L) , Marked_length(activate(L))> 
     --> <Marked_length(cons(N,L)) , Marked_isNatList(activate(L))>
  <Marked_U11(tt,L) , Marked_length(activate(L))> 
     --> <Marked_length(cons(N,L)) , Marked_and(isNatList(activate(L)),
                                      n__isNat(N))>
  <Marked_U11(tt,L) , Marked_length(activate(L))> 
     --> <Marked_length(cons(N,L)) , Marked_U11(and(isNatList(activate(L)),
                                                 n__isNat(N)),activate(L))>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cons(X1,X2) >= n__cons(X1,X2) ;
  0 >= n__0 ;
  zeros >= cons(0,n__zeros) ;
  zeros >= n__zeros ;
  s(X) >= n__s(X) ;
  length(cons(N,L)) >= U11(and(isNatList(activate(L)),n__isNat(N)),activate(L)) ;
  length(nil) >= 0 ;
  length(X) >= n__length(X) ;
  activate(n__zeros) >= zeros ;
  activate(n__take(X1,X2)) >= take(X1,X2) ;
  activate(n__0) >= 0 ;
  activate(n__length(X)) >= length(X) ;
  activate(n__s(X)) >= s(X) ;
  activate(n__isNatIList(X)) >= isNatIList(X) ;
  activate(n__cons(X1,X2)) >= cons(X1,X2) ;
  activate(n__nil) >= nil ;
  activate(n__isNatList(X)) >= isNatList(X) ;
  activate(n__isNat(X)) >= isNat(X) ;
  activate(n__and(X1,X2)) >= and(X1,X2) ;
  activate(X) >= X ;
  U11(tt,L) >= s(length(activate(L))) ;
  nil >= n__nil ;
  U21(tt) >= nil ;
  U31(tt,IL,M,N) >= cons(activate(N),n__take(activate(M),activate(IL))) ;
  and(tt,X) >= activate(X) ;
  and(X1,X2) >= n__and(X1,X2) ;
  isNat(n__0) >= tt ;
  isNat(n__length(V1)) >= isNatList(activate(V1)) ;
  isNat(n__s(V1)) >= isNat(activate(V1)) ;
  isNat(X) >= n__isNat(X) ;
  isNatList(n__take(V1,V2)) >= and(isNat(activate(V1)),
                                n__isNatIList(activate(V2))) ;
  isNatList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                n__isNatList(activate(V2))) ;
  isNatList(n__nil) >= tt ;
  isNatList(X) >= n__isNatList(X) ;
  isNatIList(n__zeros) >= tt ;
  isNatIList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                 n__isNatIList(activate(V2))) ;
  isNatIList(X) >= n__isNatIList(X) ;
  isNatIList(V) >= isNatList(activate(V)) ;
  take(0,IL) >= U21(isNatIList(IL)) ;
  take(s(M),cons(N,IL)) >= U31(and(isNatIList(activate(IL)),
                                n__and(isNat(M),n__isNat(N))),activate(IL),
                            M,N) ;
  take(X1,X2) >= n__take(X1,X2) ;
  Marked_activate(n__take(X1,X2)) >= Marked_take(X1,X2) ;
  Marked_activate(n__length(X)) >= Marked_length(X) ;
  Marked_activate(n__isNatIList(X)) >= Marked_isNatIList(X) ;
  Marked_activate(n__isNatList(X)) >= Marked_isNatList(X) ;
  Marked_activate(n__isNat(X)) >= Marked_isNat(X) ;
  Marked_activate(n__and(X1,X2)) >= Marked_and(X1,X2) ;
  Marked_and(tt,X) >= Marked_activate(X) ;
  Marked_isNat(n__length(V1)) >= Marked_activate(V1) ;
  Marked_isNat(n__length(V1)) >= Marked_isNatList(activate(V1)) ;
  Marked_isNat(n__s(V1)) >= Marked_activate(V1) ;
  Marked_isNat(n__s(V1)) >= Marked_isNat(activate(V1)) ;
  Marked_isNatList(n__take(V1,V2)) >= Marked_activate(V1) ;
  Marked_isNatList(n__take(V1,V2)) >= Marked_activate(V2) ;
  Marked_isNatList(n__take(V1,V2)) >= Marked_and(isNat(activate(V1)),
                                       n__isNatIList(activate(V2))) ;
  Marked_isNatList(n__take(V1,V2)) >= Marked_isNat(activate(V1)) ;
  Marked_isNatList(n__cons(V1,V2)) >= Marked_activate(V1) ;
  Marked_isNatList(n__cons(V1,V2)) >= Marked_activate(V2) ;
  Marked_isNatList(n__cons(V1,V2)) >= Marked_and(isNat(activate(V1)),
                                       n__isNatList(activate(V2))) ;
  Marked_isNatList(n__cons(V1,V2)) >= Marked_isNat(activate(V1)) ;
  Marked_isNatIList(n__cons(V1,V2)) >= Marked_activate(V1) ;
  Marked_isNatIList(n__cons(V1,V2)) >= Marked_activate(V2) ;
  Marked_isNatIList(n__cons(V1,V2)) >= Marked_and(isNat(activate(V1)),
                                        n__isNatIList(activate(V2))) ;
  Marked_isNatIList(n__cons(V1,V2)) >= Marked_isNat(activate(V1)) ;
  Marked_isNatIList(V) >= Marked_activate(V) ;
  Marked_isNatIList(V) >= Marked_isNatList(activate(V)) ;
  Marked_length(cons(N,L)) >= Marked_activate(L) ;
  Marked_length(cons(N,L)) >= Marked_and(isNatList(activate(L)),n__isNat(N)) ;
  Marked_length(cons(N,L)) >= Marked_isNatList(activate(L)) ;
  Marked_length(cons(N,L)) >= Marked_U11(and(isNatList(activate(L)),
                                          n__isNat(N)),activate(L)) ;
  Marked_take(0,IL) >= Marked_isNatIList(IL) ;
  Marked_take(s(M),cons(N,IL)) >= Marked_activate(IL) ;
  Marked_take(s(M),cons(N,IL)) >= Marked_and(isNatIList(activate(IL)),
                                   n__and(isNat(M),n__isNat(N))) ;
  Marked_take(s(M),cons(N,IL)) >= Marked_isNat(M) ;
  Marked_take(s(M),cons(N,IL)) >= Marked_isNatIList(activate(IL)) ;
  Marked_take(s(M),cons(N,IL)) >= Marked_U31(and(isNatIList(activate(IL)),
                                              n__and(isNat(M),n__isNat(N))),
                                   activate(IL),M,N) ;
  Marked_U31(tt,IL,M,N) >= Marked_activate(IL) ;
  Marked_U31(tt,IL,M,N) >= Marked_activate(M) ;
  Marked_U31(tt,IL,M,N) >= Marked_activate(N) ;
  Marked_U11(tt,L) >= Marked_activate(L) ;
  Marked_U11(tt,L) >= Marked_length(activate(L)) ;
 }
 + Disjunctions:{ 
{
  Marked_activate(n__take(X1,X2)) > Marked_take(X1,X2) ;
 }
{
  Marked_activate(n__length(X)) > Marked_length(X) ;
 }
{
  Marked_activate(n__isNatIList(X)) > Marked_isNatIList(X) ;
 }
{
  Marked_activate(n__isNatList(X)) > Marked_isNatList(X) ;
 }
{
  Marked_activate(n__isNat(X)) > Marked_isNat(X) ;
 }
{
  Marked_activate(n__and(X1,X2)) > Marked_and(X1,X2) ;
 }
{
  Marked_and(tt,X) > Marked_activate(X) ;
 }
{
  Marked_isNat(n__length(V1)) > Marked_activate(V1) ;
 }
{
  Marked_isNat(n__length(V1)) > Marked_isNatList(activate(V1)) ;
 }
{
  Marked_isNat(n__s(V1)) > Marked_activate(V1) ;
 }
{
  Marked_isNat(n__s(V1)) > Marked_isNat(activate(V1)) ;
 }
{
  Marked_isNatList(n__take(V1,V2)) > Marked_activate(V1) ;
 }
{
  Marked_isNatList(n__take(V1,V2)) > Marked_activate(V2) ;
 }
{
  Marked_isNatList(n__take(V1,V2)) > Marked_and(isNat(activate(V1)),
                                      n__isNatIList(activate(V2))) ;
 }
{
  Marked_isNatList(n__take(V1,V2)) > Marked_isNat(activate(V1)) ;
 }
{
  Marked_isNatList(n__cons(V1,V2)) > Marked_activate(V1) ;
 }
{
  Marked_isNatList(n__cons(V1,V2)) > Marked_activate(V2) ;
 }
{
  Marked_isNatList(n__cons(V1,V2)) > Marked_and(isNat(activate(V1)),
                                      n__isNatList(activate(V2))) ;
 }
{
  Marked_isNatList(n__cons(V1,V2)) > Marked_isNat(activate(V1)) ;
 }
{
  Marked_isNatIList(n__cons(V1,V2)) > Marked_activate(V1) ;
 }
{
  Marked_isNatIList(n__cons(V1,V2)) > Marked_activate(V2) ;
 }
{
  Marked_isNatIList(n__cons(V1,V2)) > Marked_and(isNat(activate(V1)),
                                       n__isNatIList(activate(V2))) ;
 }
{
  Marked_isNatIList(n__cons(V1,V2)) > Marked_isNat(activate(V1)) ;
 }
{
  Marked_isNatIList(V) > Marked_activate(V) ;
 }
{
  Marked_isNatIList(V) > Marked_isNatList(activate(V)) ;
 }
{
  Marked_length(cons(N,L)) > Marked_activate(L) ;
 }
{
  Marked_length(cons(N,L)) > Marked_and(isNatList(activate(L)),n__isNat(N)) ;
 }
{
  Marked_length(cons(N,L)) > Marked_isNatList(activate(L)) ;
 }
{
  Marked_length(cons(N,L)) > Marked_U11(and(isNatList(activate(L)),n__isNat(N)),
                              activate(L)) ;
 }
{
  Marked_take(0,IL) > Marked_isNatIList(IL) ;
 }
{
  Marked_take(s(M),cons(N,IL)) > Marked_activate(IL) ;
 }
{
  Marked_take(s(M),cons(N,IL)) > Marked_and(isNatIList(activate(IL)),
                                  n__and(isNat(M),n__isNat(N))) ;
 }
{
  Marked_take(s(M),cons(N,IL)) > Marked_isNat(M) ;
 }
{
  Marked_take(s(M),cons(N,IL)) > Marked_isNatIList(activate(IL)) ;
 }
{
  Marked_take(s(M),cons(N,IL)) > Marked_U31(and(isNatIList(activate(IL)),
                                             n__and(isNat(M),n__isNat(N))),
                                  activate(IL),M,N) ;
 }
{
  Marked_U31(tt,IL,M,N) > Marked_activate(IL) ;
 }
{
  Marked_U31(tt,IL,M,N) > Marked_activate(M) ;
 }
{
  Marked_U31(tt,IL,M,N) > Marked_activate(N) ;
 }
{
  Marked_U11(tt,L) > Marked_activate(L) ;
 }
{
  Marked_U11(tt,L) > Marked_length(activate(L)) ;
 }
 } 
=== TIMER virtual : 10.000000 ===
Entering poly_solver
Starting Sat solver initialization
Calling Sat solver...
=== STOPING TIMER virtual ===
=== TIMER real : 10.000000 ===
=== STOPING TIMER real ===
Sat solver returned
Sat solver result read
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
constraint: cons(X1,X2) >= n__cons(X1,X2)
constraint: 0 >= n__0
constraint: zeros >= cons(0,n__zeros)
constraint: zeros >= n__zeros
constraint: s(X) >= n__s(X)
constraint: length(cons(N,L)) >= U11(and(isNatList(activate(L)),n__isNat(N)),
                                  activate(L))
constraint: length(nil) >= 0
constraint: length(X) >= n__length(X)
constraint: activate(n__zeros) >= zeros
constraint: activate(n__take(X1,X2)) >= take(X1,X2)
constraint: activate(n__0) >= 0
constraint: activate(n__length(X)) >= length(X)
constraint: activate(n__s(X)) >= s(X)
constraint: activate(n__isNatIList(X)) >= isNatIList(X)
constraint: activate(n__cons(X1,X2)) >= cons(X1,X2)
constraint: activate(n__nil) >= nil
constraint: activate(n__isNatList(X)) >= isNatList(X)
constraint: activate(n__isNat(X)) >= isNat(X)
constraint: activate(n__and(X1,X2)) >= and(X1,X2)
constraint: activate(X) >= X
constraint: U11(tt,L) >= s(length(activate(L)))
constraint: nil >= n__nil
constraint: U21(tt) >= nil
constraint: U31(tt,IL,M,N) >= cons(activate(N),
                               n__take(activate(M),activate(IL)))
constraint: and(tt,X) >= activate(X)
constraint: and(X1,X2) >= n__and(X1,X2)
constraint: isNat(n__0) >= tt
constraint: isNat(n__length(V1)) >= isNatList(activate(V1))
constraint: isNat(n__s(V1)) >= isNat(activate(V1))
constraint: isNat(X) >= n__isNat(X)
constraint: isNatList(n__take(V1,V2)) >= and(isNat(activate(V1)),
                                          n__isNatIList(activate(V2)))
constraint: isNatList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                          n__isNatList(activate(V2)))
constraint: isNatList(n__nil) >= tt
constraint: isNatList(X) >= n__isNatList(X)
constraint: isNatIList(n__zeros) >= tt
constraint: isNatIList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                           n__isNatIList(activate(V2)))
constraint: isNatIList(X) >= n__isNatIList(X)
constraint: isNatIList(V) >= isNatList(activate(V))
constraint: take(0,IL) >= U21(isNatIList(IL))
constraint: take(s(M),cons(N,IL)) >= U31(and(isNatIList(activate(IL)),
                                          n__and(isNat(M),n__isNat(N))),
                                      activate(IL),M,N)
constraint: take(X1,X2) >= n__take(X1,X2)
constraint: Marked_activate(n__take(X1,X2)) >= Marked_take(X1,X2)
constraint: Marked_activate(n__length(X)) >= Marked_length(X)
constraint: Marked_activate(n__isNatIList(X)) >= Marked_isNatIList(X)
constraint: Marked_activate(n__isNatList(X)) >= Marked_isNatList(X)
constraint: Marked_activate(n__isNat(X)) >= Marked_isNat(X)
constraint: Marked_activate(n__and(X1,X2)) >= Marked_and(X1,X2)
constraint: Marked_and(tt,X) >= Marked_activate(X)
constraint: Marked_isNat(n__length(V1)) >= Marked_activate(V1)
constraint: Marked_isNat(n__length(V1)) >= Marked_isNatList(activate(V1))
constraint: Marked_isNat(n__s(V1)) >= Marked_activate(V1)
constraint: Marked_isNat(n__s(V1)) >= Marked_isNat(activate(V1))
constraint: Marked_isNatList(n__take(V1,V2)) >= Marked_activate(V1)
constraint: Marked_isNatList(n__take(V1,V2)) >= Marked_activate(V2)
constraint: Marked_isNatList(n__take(V1,V2)) >= Marked_and(isNat(activate(V1)),
                                                 n__isNatIList(activate(V2)))
constraint: Marked_isNatList(n__take(V1,V2)) >= Marked_isNat(activate(V1))
constraint: Marked_isNatList(n__cons(V1,V2)) >= Marked_activate(V1)
constraint: Marked_isNatList(n__cons(V1,V2)) >= Marked_activate(V2)
constraint: Marked_isNatList(n__cons(V1,V2)) >= Marked_and(isNat(activate(V1)),
                                                 n__isNatList(activate(V2)))
constraint: Marked_isNatList(n__cons(V1,V2)) >= Marked_isNat(activate(V1))
constraint: Marked_isNatIList(n__cons(V1,V2)) >= Marked_activate(V1)
constraint: Marked_isNatIList(n__cons(V1,V2)) >= Marked_activate(V2)
constraint: Marked_isNatIList(n__cons(V1,V2)) >= Marked_and(isNat(activate(V1)),
                                                  n__isNatIList(activate(V2)))
constraint: Marked_isNatIList(n__cons(V1,V2)) >= Marked_isNat(activate(V1))
constraint: Marked_isNatIList(V) >= Marked_activate(V)
constraint: Marked_isNatIList(V) >= Marked_isNatList(activate(V))
constraint: Marked_length(cons(N,L)) >= Marked_activate(L)
constraint: Marked_length(cons(N,L)) >= Marked_and(isNatList(activate(L)),
                                         n__isNat(N))
constraint: Marked_length(cons(N,L)) >= Marked_isNatList(activate(L))
constraint: Marked_length(cons(N,L)) >= Marked_U11(and(isNatList(activate(L)),
                                                    n__isNat(N)),activate(L))
constraint: Marked_take(0,IL) >= Marked_isNatIList(IL)
constraint: Marked_take(s(M),cons(N,IL)) >= Marked_activate(IL)
constraint: Marked_take(s(M),cons(N,IL)) >= Marked_and(isNatIList(activate(IL)),
                                             n__and(isNat(M),n__isNat(N)))
constraint: Marked_take(s(M),cons(N,IL)) >= Marked_isNat(M)
constraint: Marked_take(s(M),cons(N,IL)) >= Marked_isNatIList(activate(IL))
constraint: Marked_take(s(M),cons(N,IL)) >= Marked_U31(and(isNatIList(
                                                            activate(
                                                             IL)),
                                                        n__and(isNat(M),
                                                         n__isNat(N))),
                                             activate(IL),M,N)
constraint: Marked_U31(tt,IL,M,N) >= Marked_activate(IL)
constraint: Marked_U31(tt,IL,M,N) >= Marked_activate(M)
constraint: Marked_U31(tt,IL,M,N) >= Marked_activate(N)
constraint: Marked_U11(tt,L) >= Marked_activate(L)
constraint: Marked_U11(tt,L) >= Marked_length(activate(L))
APPLY CRITERIA (Graph splitting)
Found 2 components:

{  <Marked_length(cons(N,L)) , Marked_U11(and(isNatList(activate(L)),
                                           n__isNat(N)),activate(L))> 
      --> <Marked_U11(tt,L) , Marked_length(activate(L))>
  <Marked_U11(tt,L) , Marked_length(activate(L))> 
     --> <Marked_length(cons(N,L)) , Marked_U11(and(isNatList(activate(L)),
                                                 n__isNat(N)),activate(L))>
}

{  <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)> 
      --> <Marked_and(tt,X) , Marked_activate(X)>
  <Marked_activate(n__isNat(X)) , Marked_isNat(X)> 
     --> <Marked_isNat(n__s(V1)) , Marked_activate(V1)>
  <Marked_activate(n__isNat(X)) , Marked_isNat(X)> 
     --> <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))>
  <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)> 
     --> <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V2)>
  <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)> 
     --> <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V1)>
  <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)> 
     --> <Marked_isNatList(n__take(V1,V2)) , Marked_isNat(activate(V1))>
  <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)> 
     --> <Marked_isNatList(n__take(V1,V2)) , Marked_and(isNat(activate(V1)),
                                              n__isNatIList(activate(V2)))>
  <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)>
  <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)>
  <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_isNat(activate(V1))>
  <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                              n__isNatList(activate(V2)))>
  <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V2)>
  <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V1)>
  <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_isNat(activate(V1))>
  <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                               n__isNatIList(activate(V2)))>
  <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)> 
     --> <Marked_isNatIList(V) , Marked_activate(V)>
  <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)> 
     --> <Marked_isNatIList(V) , Marked_isNatList(activate(V))>
  <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)> 
     --> <Marked_take(s(M),cons(N,IL)) , Marked_activate(IL)>
  <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)> 
     --> <Marked_take(s(M),cons(N,IL)) , Marked_isNat(M)>
  <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)> 
     --> <Marked_take(s(M),cons(N,IL)) , Marked_activate(IL)>
  <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)> 
     --> <Marked_take(s(M),cons(N,IL)) , Marked_isNatIList(activate(IL))>
  <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)> 
     --> <Marked_take(s(M),cons(N,IL)) , Marked_and(isNatIList(activate(IL)),
                                          n__and(isNat(M),n__isNat(N)))>
  <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)> 
     --> <Marked_take(s(M),cons(N,IL)) , Marked_U31(and(isNatIList(activate(IL)),
                                                     n__and(isNat(M),
                                                      n__isNat(N))),
                                          activate(IL),M,N)>
  <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)> 
     --> <Marked_take(0,IL) , Marked_isNatIList(IL)>
  <Marked_take(s(M),cons(N,IL)) , Marked_activate(IL)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_take(s(M),cons(N,IL)) , Marked_activate(IL)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_take(s(M),cons(N,IL)) , Marked_activate(IL)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_take(s(M),cons(N,IL)) , Marked_activate(IL)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_take(s(M),cons(N,IL)) , Marked_activate(IL)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_take(s(M),cons(N,IL)) , Marked_isNat(M)> 
     --> <Marked_isNat(n__s(V1)) , Marked_activate(V1)>
  <Marked_take(s(M),cons(N,IL)) , Marked_isNat(M)> 
     --> <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))>
  <Marked_take(s(M),cons(N,IL)) , Marked_activate(IL)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_take(s(M),cons(N,IL)) , Marked_activate(IL)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_take(s(M),cons(N,IL)) , Marked_activate(IL)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_take(s(M),cons(N,IL)) , Marked_activate(IL)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_take(s(M),cons(N,IL)) , Marked_activate(IL)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_take(s(M),cons(N,IL)) , Marked_isNatIList(activate(IL))> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V2)>
  <Marked_take(s(M),cons(N,IL)) , Marked_isNatIList(activate(IL))> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V1)>
  <Marked_take(s(M),cons(N,IL)) , Marked_isNatIList(activate(IL))> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_isNat(activate(V1))>
  <Marked_take(s(M),cons(N,IL)) , Marked_isNatIList(activate(IL))> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                               n__isNatIList(activate(V2)))>
  <Marked_take(s(M),cons(N,IL)) , Marked_isNatIList(activate(IL))> 
     --> <Marked_isNatIList(V) , Marked_activate(V)>
  <Marked_take(s(M),cons(N,IL)) , Marked_isNatIList(activate(IL))> 
     --> <Marked_isNatIList(V) , Marked_isNatList(activate(V))>
  <Marked_take(s(M),cons(N,IL)) , Marked_and(isNatIList(activate(IL)),
                                   n__and(isNat(M),n__isNat(N)))> 
     --> <Marked_and(tt,X) , Marked_activate(X)>
  <Marked_take(s(M),cons(N,IL)) , Marked_U31(and(isNatIList(activate(IL)),
                                              n__and(isNat(M),n__isNat(N))),
                                   activate(IL),M,N)> 
     --> <Marked_U31(tt,IL,M,N) , Marked_activate(IL)>
  <Marked_take(s(M),cons(N,IL)) , Marked_U31(and(isNatIList(activate(IL)),
                                              n__and(isNat(M),n__isNat(N))),
                                   activate(IL),M,N)> 
     --> <Marked_U31(tt,IL,M,N) , Marked_activate(M)>
  <Marked_take(s(M),cons(N,IL)) , Marked_U31(and(isNatIList(activate(IL)),
                                              n__and(isNat(M),n__isNat(N))),
                                   activate(IL),M,N)> 
     --> <Marked_U31(tt,IL,M,N) , Marked_activate(N)>
  <Marked_take(0,IL) , Marked_isNatIList(IL)> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V2)>
  <Marked_take(0,IL) , Marked_isNatIList(IL)> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V1)>
  <Marked_take(0,IL) , Marked_isNatIList(IL)> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_isNat(activate(V1))>
  <Marked_take(0,IL) , Marked_isNatIList(IL)> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                               n__isNatIList(activate(V2)))>
  <Marked_take(0,IL) , Marked_isNatIList(IL)> 
     --> <Marked_isNatIList(V) , Marked_activate(V)>
  <Marked_take(0,IL) , Marked_isNatIList(IL)> 
     --> <Marked_isNatIList(V) , Marked_isNatList(activate(V))>
  <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_isNatList(n__take(V1,V2)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_activate(V1)>
  <Marked_isNatList(n__take(V1,V2)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))>
  <Marked_isNatList(n__take(V1,V2)) , Marked_and(isNat(activate(V1)),
                                       n__isNatIList(activate(V2)))> 
     --> <Marked_and(tt,X) , Marked_activate(X)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_activate(V1)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                       n__isNatList(activate(V2)))> 
     --> <Marked_and(tt,X) , Marked_activate(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_activate(V1)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                        n__isNatIList(activate(V2)))> 
     --> <Marked_and(tt,X) , Marked_activate(X)>
  <Marked_isNatIList(V) , Marked_activate(V)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNatIList(V) , Marked_activate(V)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_isNatIList(V) , Marked_activate(V)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNatIList(V) , Marked_activate(V)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNatIList(V) , Marked_activate(V)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_isNatIList(V) , Marked_isNatList(activate(V))> 
     --> <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V2)>
  <Marked_isNatIList(V) , Marked_isNatList(activate(V))> 
     --> <Marked_isNatList(n__take(V1,V2)) , Marked_activate(V1)>
  <Marked_isNatIList(V) , Marked_isNatList(activate(V))> 
     --> <Marked_isNatList(n__take(V1,V2)) , Marked_isNat(activate(V1))>
  <Marked_isNatIList(V) , Marked_isNatList(activate(V))> 
     --> <Marked_isNatList(n__take(V1,V2)) , Marked_and(isNat(activate(V1)),
                                              n__isNatIList(activate(V2)))>
  <Marked_isNatIList(V) , Marked_isNatList(activate(V))> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)>
  <Marked_isNatIList(V) , Marked_isNatList(activate(V))> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)>
  <Marked_isNatIList(V) , Marked_isNatList(activate(V))> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_isNat(activate(V1))>
  <Marked_isNatIList(V) , Marked_isNatList(activate(V))> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                              n__isNatList(activate(V2)))>
  <Marked_isNat(n__s(V1)) , Marked_activate(V1)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNat(n__s(V1)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_isNat(n__s(V1)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNat(n__s(V1)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNat(n__s(V1)) , Marked_activate(V1)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_activate(V1)>
  <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))>
  <Marked_and(tt,X) , Marked_activate(X)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_and(tt,X) , Marked_activate(X)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_and(tt,X) , Marked_activate(X)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_and(tt,X) , Marked_activate(X)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_and(tt,X) , Marked_activate(X)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(IL)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(IL)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(IL)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(IL)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(IL)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(M)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(M)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(M)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(M)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(M)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(N)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(N)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(N)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(N)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_U31(tt,IL,M,N) , Marked_activate(N)> 
     --> <Marked_activate(n__take(X1,X2)) , Marked_take(X1,X2)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cons(X1,X2) >= n__cons(X1,X2) ;
  0 >= n__0 ;
  zeros >= cons(0,n__zeros) ;
  zeros >= n__zeros ;
  s(X) >= n__s(X) ;
  length(cons(N,L)) >= U11(and(isNatList(activate(L)),n__isNat(N)),activate(L)) ;
  length(nil) >= 0 ;
  length(X) >= n__length(X) ;
  activate(n__zeros) >= zeros ;
  activate(n__take(X1,X2)) >= take(X1,X2) ;
  activate(n__0) >= 0 ;
  activate(n__length(X)) >= length(X) ;
  activate(n__s(X)) >= s(X) ;
  activate(n__isNatIList(X)) >= isNatIList(X) ;
  activate(n__cons(X1,X2)) >= cons(X1,X2) ;
  activate(n__nil) >= nil ;
  activate(n__isNatList(X)) >= isNatList(X) ;
  activate(n__isNat(X)) >= isNat(X) ;
  activate(n__and(X1,X2)) >= and(X1,X2) ;
  activate(X) >= X ;
  U11(tt,L) >= s(length(activate(L))) ;
  nil >= n__nil ;
  U21(tt) >= nil ;
  U31(tt,IL,M,N) >= cons(activate(N),n__take(activate(M),activate(IL))) ;
  and(tt,X) >= activate(X) ;
  and(X1,X2) >= n__and(X1,X2) ;
  isNat(n__0) >= tt ;
  isNat(n__length(V1)) >= isNatList(activate(V1)) ;
  isNat(n__s(V1)) >= isNat(activate(V1)) ;
  isNat(X) >= n__isNat(X) ;
  isNatList(n__take(V1,V2)) >= and(isNat(activate(V1)),
                                n__isNatIList(activate(V2))) ;
  isNatList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                n__isNatList(activate(V2))) ;
  isNatList(n__nil) >= tt ;
  isNatList(X) >= n__isNatList(X) ;
  isNatIList(n__zeros) >= tt ;
  isNatIList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                 n__isNatIList(activate(V2))) ;
  isNatIList(X) >= n__isNatIList(X) ;
  isNatIList(V) >= isNatList(activate(V)) ;
  take(0,IL) >= U21(isNatIList(IL)) ;
  take(s(M),cons(N,IL)) >= U31(and(isNatIList(activate(IL)),
                                n__and(isNat(M),n__isNat(N))),activate(IL),
                            M,N) ;
  take(X1,X2) >= n__take(X1,X2) ;
  Marked_length(cons(N,L)) >= Marked_U11(and(isNatList(activate(L)),
                                          n__isNat(N)),activate(L)) ;
  Marked_U11(tt,L) >= Marked_length(activate(L)) ;
 }
 + Disjunctions:{ 
{
  Marked_length(cons(N,L)) > Marked_U11(and(isNatList(activate(L)),n__isNat(N)),
                              activate(L)) ;
 }
{
  Marked_U11(tt,L) > Marked_length(activate(L)) ;
 }
 } 
=== TIMER virtual : 10.000000 ===
Entering poly_solver
Starting Sat solver initialization
Calling Sat solver...
=== STOPING TIMER virtual ===
=== TIMER real : 10.000000 ===
=== STOPING TIMER real ===
Sat solver returned
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
No solution found for these parameters.
Entering rpo_solver
=== TIMER virtual : 25.000000 ===
Search parameters: AFS type: 2 ; time limit: 25.. 
=== STOPING TIMER virtual ===
Time out for these parameters.
=== TIMER virtual : 15.000000 ===
Entering poly_solver
Starting Sat solver initialization
Calling Sat solver...
=== STOPING TIMER virtual ===
=== TIMER real : 15.000000 ===
=== STOPING TIMER real ===
Sat solver returned
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
No solution found for these parameters.
=== TIMER virtual : 50.000000 ===
trying sub matrices of size: 1
Matrix interpretation constraints generated.
Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. 
Termination constraints generated.
Starting Sat solver initialization
Calling Sat solver...
=== STOPING TIMER virtual ===
=== TIMER real : 50.000000 ===
=== STOPING TIMER real ===
Sat solver returned
Sat solver result read
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
constraint: cons(X1,X2) >= n__cons(X1,X2)
constraint: 0 >= n__0
constraint: zeros >= cons(0,n__zeros)
constraint: zeros >= n__zeros
constraint: s(X) >= n__s(X)
constraint: length(cons(N,L)) >= U11(and(isNatList(activate(L)),n__isNat(N)),
                                  activate(L))
constraint: length(nil) >= 0
constraint: length(X) >= n__length(X)
constraint: activate(n__zeros) >= zeros
constraint: activate(n__take(X1,X2)) >= take(X1,X2)
constraint: activate(n__0) >= 0
constraint: activate(n__length(X)) >= length(X)
constraint: activate(n__s(X)) >= s(X)
constraint: activate(n__isNatIList(X)) >= isNatIList(X)
constraint: activate(n__cons(X1,X2)) >= cons(X1,X2)
constraint: activate(n__nil) >= nil
constraint: activate(n__isNatList(X)) >= isNatList(X)
constraint: activate(n__isNat(X)) >= isNat(X)
constraint: activate(n__and(X1,X2)) >= and(X1,X2)
constraint: activate(X) >= X
constraint: U11(tt,L) >= s(length(activate(L)))
constraint: nil >= n__nil
constraint: U21(tt) >= nil
constraint: U31(tt,IL,M,N) >= cons(activate(N),
                               n__take(activate(M),activate(IL)))
constraint: and(tt,X) >= activate(X)
constraint: and(X1,X2) >= n__and(X1,X2)
constraint: isNat(n__0) >= tt
constraint: isNat(n__length(V1)) >= isNatList(activate(V1))
constraint: isNat(n__s(V1)) >= isNat(activate(V1))
constraint: isNat(X) >= n__isNat(X)
constraint: isNatList(n__take(V1,V2)) >= and(isNat(activate(V1)),
                                          n__isNatIList(activate(V2)))
constraint: isNatList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                          n__isNatList(activate(V2)))
constraint: isNatList(n__nil) >= tt
constraint: isNatList(X) >= n__isNatList(X)
constraint: isNatIList(n__zeros) >= tt
constraint: isNatIList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                           n__isNatIList(activate(V2)))
constraint: isNatIList(X) >= n__isNatIList(X)
constraint: isNatIList(V) >= isNatList(activate(V))
constraint: take(0,IL) >= U21(isNatIList(IL))
constraint: take(s(M),cons(N,IL)) >= U31(and(isNatIList(activate(IL)),
                                          n__and(isNat(M),n__isNat(N))),
                                      activate(IL),M,N)
constraint: take(X1,X2) >= n__take(X1,X2)
constraint: Marked_length(cons(N,L)) >= Marked_U11(and(isNatList(activate(L)),
                                                    n__isNat(N)),activate(L))
constraint: Marked_U11(tt,L) >= Marked_length(activate(L))
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cons(X1,X2) >= n__cons(X1,X2) ;
  0 >= n__0 ;
  zeros >= cons(0,n__zeros) ;
  zeros >= n__zeros ;
  s(X) >= n__s(X) ;
  length(cons(N,L)) >= U11(and(isNatList(activate(L)),n__isNat(N)),activate(L)) ;
  length(nil) >= 0 ;
  length(X) >= n__length(X) ;
  activate(n__zeros) >= zeros ;
  activate(n__take(X1,X2)) >= take(X1,X2) ;
  activate(n__0) >= 0 ;
  activate(n__length(X)) >= length(X) ;
  activate(n__s(X)) >= s(X) ;
  activate(n__isNatIList(X)) >= isNatIList(X) ;
  activate(n__cons(X1,X2)) >= cons(X1,X2) ;
  activate(n__nil) >= nil ;
  activate(n__isNatList(X)) >= isNatList(X) ;
  activate(n__isNat(X)) >= isNat(X) ;
  activate(n__and(X1,X2)) >= and(X1,X2) ;
  activate(X) >= X ;
  U11(tt,L) >= s(length(activate(L))) ;
  nil >= n__nil ;
  U21(tt) >= nil ;
  U31(tt,IL,M,N) >= cons(activate(N),n__take(activate(M),activate(IL))) ;
  and(tt,X) >= activate(X) ;
  and(X1,X2) >= n__and(X1,X2) ;
  isNat(n__0) >= tt ;
  isNat(n__length(V1)) >= isNatList(activate(V1)) ;
  isNat(n__s(V1)) >= isNat(activate(V1)) ;
  isNat(X) >= n__isNat(X) ;
  isNatList(n__take(V1,V2)) >= and(isNat(activate(V1)),
                                n__isNatIList(activate(V2))) ;
  isNatList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                n__isNatList(activate(V2))) ;
  isNatList(n__nil) >= tt ;
  isNatList(X) >= n__isNatList(X) ;
  isNatIList(n__zeros) >= tt ;
  isNatIList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                 n__isNatIList(activate(V2))) ;
  isNatIList(X) >= n__isNatIList(X) ;
  isNatIList(V) >= isNatList(activate(V)) ;
  take(0,IL) >= U21(isNatIList(IL)) ;
  take(s(M),cons(N,IL)) >= U31(and(isNatIList(activate(IL)),
                                n__and(isNat(M),n__isNat(N))),activate(IL),
                            M,N) ;
  take(X1,X2) >= n__take(X1,X2) ;
  Marked_activate(n__take(X1,X2)) >= Marked_take(X1,X2) ;
  Marked_activate(n__isNatIList(X)) >= Marked_isNatIList(X) ;
  Marked_activate(n__isNatList(X)) >= Marked_isNatList(X) ;
  Marked_activate(n__isNat(X)) >= Marked_isNat(X) ;
  Marked_activate(n__and(X1,X2)) >= Marked_and(X1,X2) ;
  Marked_and(tt,X) >= Marked_activate(X) ;
  Marked_isNat(n__s(V1)) >= Marked_activate(V1) ;
  Marked_isNat(n__s(V1)) >= Marked_isNat(activate(V1)) ;
  Marked_isNatList(n__take(V1,V2)) >= Marked_activate(V1) ;
  Marked_isNatList(n__take(V1,V2)) >= Marked_activate(V2) ;
  Marked_isNatList(n__take(V1,V2)) >= Marked_and(isNat(activate(V1)),
                                       n__isNatIList(activate(V2))) ;
  Marked_isNatList(n__take(V1,V2)) >= Marked_isNat(activate(V1)) ;
  Marked_isNatList(n__cons(V1,V2)) >= Marked_activate(V1) ;
  Marked_isNatList(n__cons(V1,V2)) >= Marked_activate(V2) ;
  Marked_isNatList(n__cons(V1,V2)) >= Marked_and(isNat(activate(V1)),
                                       n__isNatList(activate(V2))) ;
  Marked_isNatList(n__cons(V1,V2)) >= Marked_isNat(activate(V1)) ;
  Marked_isNatIList(n__cons(V1,V2)) >= Marked_activate(V1) ;
  Marked_isNatIList(n__cons(V1,V2)) >= Marked_activate(V2) ;
  Marked_isNatIList(n__cons(V1,V2)) >= Marked_and(isNat(activate(V1)),
                                        n__isNatIList(activate(V2))) ;
  Marked_isNatIList(n__cons(V1,V2)) >= Marked_isNat(activate(V1)) ;
  Marked_isNatIList(V) >= Marked_activate(V) ;
  Marked_isNatIList(V) >= Marked_isNatList(activate(V)) ;
  Marked_take(0,IL) >= Marked_isNatIList(IL) ;
  Marked_take(s(M),cons(N,IL)) >= Marked_activate(IL) ;
  Marked_take(s(M),cons(N,IL)) >= Marked_and(isNatIList(activate(IL)),
                                   n__and(isNat(M),n__isNat(N))) ;
  Marked_take(s(M),cons(N,IL)) >= Marked_isNat(M) ;
  Marked_take(s(M),cons(N,IL)) >= Marked_isNatIList(activate(IL)) ;
  Marked_take(s(M),cons(N,IL)) >= Marked_U31(and(isNatIList(activate(IL)),
                                              n__and(isNat(M),n__isNat(N))),
                                   activate(IL),M,N) ;
  Marked_U31(tt,IL,M,N) >= Marked_activate(IL) ;
  Marked_U31(tt,IL,M,N) >= Marked_activate(M) ;
  Marked_U31(tt,IL,M,N) >= Marked_activate(N) ;
 }
 + Disjunctions:{ 
{
  Marked_activate(n__take(X1,X2)) > Marked_take(X1,X2) ;
 }
{
  Marked_activate(n__isNatIList(X)) > Marked_isNatIList(X) ;
 }
{
  Marked_activate(n__isNatList(X)) > Marked_isNatList(X) ;
 }
{
  Marked_activate(n__isNat(X)) > Marked_isNat(X) ;
 }
{
  Marked_activate(n__and(X1,X2)) > Marked_and(X1,X2) ;
 }
{
  Marked_and(tt,X) > Marked_activate(X) ;
 }
{
  Marked_isNat(n__s(V1)) > Marked_activate(V1) ;
 }
{
  Marked_isNat(n__s(V1)) > Marked_isNat(activate(V1)) ;
 }
{
  Marked_isNatList(n__take(V1,V2)) > Marked_activate(V1) ;
 }
{
  Marked_isNatList(n__take(V1,V2)) > Marked_activate(V2) ;
 }
{
  Marked_isNatList(n__take(V1,V2)) > Marked_and(isNat(activate(V1)),
                                      n__isNatIList(activate(V2))) ;
 }
{
  Marked_isNatList(n__take(V1,V2)) > Marked_isNat(activate(V1)) ;
 }
{
  Marked_isNatList(n__cons(V1,V2)) > Marked_activate(V1) ;
 }
{
  Marked_isNatList(n__cons(V1,V2)) > Marked_activate(V2) ;
 }
{
  Marked_isNatList(n__cons(V1,V2)) > Marked_and(isNat(activate(V1)),
                                      n__isNatList(activate(V2))) ;
 }
{
  Marked_isNatList(n__cons(V1,V2)) > Marked_isNat(activate(V1)) ;
 }
{
  Marked_isNatIList(n__cons(V1,V2)) > Marked_activate(V1) ;
 }
{
  Marked_isNatIList(n__cons(V1,V2)) > Marked_activate(V2) ;
 }
{
  Marked_isNatIList(n__cons(V1,V2)) > Marked_and(isNat(activate(V1)),
                                       n__isNatIList(activate(V2))) ;
 }
{
  Marked_isNatIList(n__cons(V1,V2)) > Marked_isNat(activate(V1)) ;
 }
{
  Marked_isNatIList(V) > Marked_activate(V) ;
 }
{
  Marked_isNatIList(V) > Marked_isNatList(activate(V)) ;
 }
{
  Marked_take(0,IL) > Marked_isNatIList(IL) ;
 }
{
  Marked_take(s(M),cons(N,IL)) > Marked_activate(IL) ;
 }
{
  Marked_take(s(M),cons(N,IL)) > Marked_and(isNatIList(activate(IL)),
                                  n__and(isNat(M),n__isNat(N))) ;
 }
{
  Marked_take(s(M),cons(N,IL)) > Marked_isNat(M) ;
 }
{
  Marked_take(s(M),cons(N,IL)) > Marked_isNatIList(activate(IL)) ;
 }
{
  Marked_take(s(M),cons(N,IL)) > Marked_U31(and(isNatIList(activate(IL)),
                                             n__and(isNat(M),n__isNat(N))),
                                  activate(IL),M,N) ;
 }
{
  Marked_U31(tt,IL,M,N) > Marked_activate(IL) ;
 }
{
  Marked_U31(tt,IL,M,N) > Marked_activate(M) ;
 }
{
  Marked_U31(tt,IL,M,N) > Marked_activate(N) ;
 }
 } 
=== TIMER virtual : 10.000000 ===
Entering poly_solver
Starting Sat solver initialization
Calling Sat solver...
=== STOPING TIMER virtual ===
=== TIMER real : 10.000000 ===
=== STOPING TIMER real ===
Sat solver returned
Sat solver result read
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
constraint: cons(X1,X2) >= n__cons(X1,X2)
constraint: 0 >= n__0
constraint: zeros >= cons(0,n__zeros)
constraint: zeros >= n__zeros
constraint: s(X) >= n__s(X)
constraint: length(cons(N,L)) >= U11(and(isNatList(activate(L)),n__isNat(N)),
                                  activate(L))
constraint: length(nil) >= 0
constraint: length(X) >= n__length(X)
constraint: activate(n__zeros) >= zeros
constraint: activate(n__take(X1,X2)) >= take(X1,X2)
constraint: activate(n__0) >= 0
constraint: activate(n__length(X)) >= length(X)
constraint: activate(n__s(X)) >= s(X)
constraint: activate(n__isNatIList(X)) >= isNatIList(X)
constraint: activate(n__cons(X1,X2)) >= cons(X1,X2)
constraint: activate(n__nil) >= nil
constraint: activate(n__isNatList(X)) >= isNatList(X)
constraint: activate(n__isNat(X)) >= isNat(X)
constraint: activate(n__and(X1,X2)) >= and(X1,X2)
constraint: activate(X) >= X
constraint: U11(tt,L) >= s(length(activate(L)))
constraint: nil >= n__nil
constraint: U21(tt) >= nil
constraint: U31(tt,IL,M,N) >= cons(activate(N),
                               n__take(activate(M),activate(IL)))
constraint: and(tt,X) >= activate(X)
constraint: and(X1,X2) >= n__and(X1,X2)
constraint: isNat(n__0) >= tt
constraint: isNat(n__length(V1)) >= isNatList(activate(V1))
constraint: isNat(n__s(V1)) >= isNat(activate(V1))
constraint: isNat(X) >= n__isNat(X)
constraint: isNatList(n__take(V1,V2)) >= and(isNat(activate(V1)),
                                          n__isNatIList(activate(V2)))
constraint: isNatList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                          n__isNatList(activate(V2)))
constraint: isNatList(n__nil) >= tt
constraint: isNatList(X) >= n__isNatList(X)
constraint: isNatIList(n__zeros) >= tt
constraint: isNatIList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                           n__isNatIList(activate(V2)))
constraint: isNatIList(X) >= n__isNatIList(X)
constraint: isNatIList(V) >= isNatList(activate(V))
constraint: take(0,IL) >= U21(isNatIList(IL))
constraint: take(s(M),cons(N,IL)) >= U31(and(isNatIList(activate(IL)),
                                          n__and(isNat(M),n__isNat(N))),
                                      activate(IL),M,N)
constraint: take(X1,X2) >= n__take(X1,X2)
constraint: Marked_activate(n__take(X1,X2)) >= Marked_take(X1,X2)
constraint: Marked_activate(n__isNatIList(X)) >= Marked_isNatIList(X)
constraint: Marked_activate(n__isNatList(X)) >= Marked_isNatList(X)
constraint: Marked_activate(n__isNat(X)) >= Marked_isNat(X)
constraint: Marked_activate(n__and(X1,X2)) >= Marked_and(X1,X2)
constraint: Marked_and(tt,X) >= Marked_activate(X)
constraint: Marked_isNat(n__s(V1)) >= Marked_activate(V1)
constraint: Marked_isNat(n__s(V1)) >= Marked_isNat(activate(V1))
constraint: Marked_isNatList(n__take(V1,V2)) >= Marked_activate(V1)
constraint: Marked_isNatList(n__take(V1,V2)) >= Marked_activate(V2)
constraint: Marked_isNatList(n__take(V1,V2)) >= Marked_and(isNat(activate(V1)),
                                                 n__isNatIList(activate(V2)))
constraint: Marked_isNatList(n__take(V1,V2)) >= Marked_isNat(activate(V1))
constraint: Marked_isNatList(n__cons(V1,V2)) >= Marked_activate(V1)
constraint: Marked_isNatList(n__cons(V1,V2)) >= Marked_activate(V2)
constraint: Marked_isNatList(n__cons(V1,V2)) >= Marked_and(isNat(activate(V1)),
                                                 n__isNatList(activate(V2)))
constraint: Marked_isNatList(n__cons(V1,V2)) >= Marked_isNat(activate(V1))
constraint: Marked_isNatIList(n__cons(V1,V2)) >= Marked_activate(V1)
constraint: Marked_isNatIList(n__cons(V1,V2)) >= Marked_activate(V2)
constraint: Marked_isNatIList(n__cons(V1,V2)) >= Marked_and(isNat(activate(V1)),
                                                  n__isNatIList(activate(V2)))
constraint: Marked_isNatIList(n__cons(V1,V2)) >= Marked_isNat(activate(V1))
constraint: Marked_isNatIList(V) >= Marked_activate(V)
constraint: Marked_isNatIList(V) >= Marked_isNatList(activate(V))
constraint: Marked_take(0,IL) >= Marked_isNatIList(IL)
constraint: Marked_take(s(M),cons(N,IL)) >= Marked_activate(IL)
constraint: Marked_take(s(M),cons(N,IL)) >= Marked_and(isNatIList(activate(IL)),
                                             n__and(isNat(M),n__isNat(N)))
constraint: Marked_take(s(M),cons(N,IL)) >= Marked_isNat(M)
constraint: Marked_take(s(M),cons(N,IL)) >= Marked_isNatIList(activate(IL))
constraint: Marked_take(s(M),cons(N,IL)) >= Marked_U31(and(isNatIList(
                                                            activate(
                                                             IL)),
                                                        n__and(isNat(M),
                                                         n__isNat(N))),
                                             activate(IL),M,N)
constraint: Marked_U31(tt,IL,M,N) >= Marked_activate(IL)
constraint: Marked_U31(tt,IL,M,N) >= Marked_activate(M)
constraint: Marked_U31(tt,IL,M,N) >= Marked_activate(N)
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)> 
      --> <Marked_and(tt,X) , Marked_activate(X)>
  <Marked_activate(n__isNat(X)) , Marked_isNat(X)> 
     --> <Marked_isNat(n__s(V1)) , Marked_activate(V1)>
  <Marked_activate(n__isNat(X)) , Marked_isNat(X)> 
     --> <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))>
  <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)>
  <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)>
  <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_isNat(activate(V1))>
  <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                              n__isNatList(activate(V2)))>
  <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V2)>
  <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V1)>
  <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_isNat(activate(V1))>
  <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                               n__isNatIList(activate(V2)))>
  <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)> 
     --> <Marked_isNatIList(V) , Marked_activate(V)>
  <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)> 
     --> <Marked_isNatIList(V) , Marked_isNatList(activate(V))>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_activate(V1)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                       n__isNatList(activate(V2)))> 
     --> <Marked_and(tt,X) , Marked_activate(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_activate(V1)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                        n__isNatIList(activate(V2)))> 
     --> <Marked_and(tt,X) , Marked_activate(X)>
  <Marked_isNatIList(V) , Marked_activate(V)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNatIList(V) , Marked_activate(V)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_isNatIList(V) , Marked_activate(V)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNatIList(V) , Marked_activate(V)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNatIList(V) , Marked_isNatList(activate(V))> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)>
  <Marked_isNatIList(V) , Marked_isNatList(activate(V))> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)>
  <Marked_isNatIList(V) , Marked_isNatList(activate(V))> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_isNat(activate(V1))>
  <Marked_isNatIList(V) , Marked_isNatList(activate(V))> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                              n__isNatList(activate(V2)))>
  <Marked_isNat(n__s(V1)) , Marked_activate(V1)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNat(n__s(V1)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_isNat(n__s(V1)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNat(n__s(V1)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_activate(V1)>
  <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))>
  <Marked_and(tt,X) , Marked_activate(X)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_and(tt,X) , Marked_activate(X)> 
     --> <Marked_activate(n__isNat(X)) , Marked_isNat(X)>
  <Marked_and(tt,X) , Marked_activate(X)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_and(tt,X) , Marked_activate(X)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cons(X1,X2) >= n__cons(X1,X2) ;
  0 >= n__0 ;
  zeros >= cons(0,n__zeros) ;
  zeros >= n__zeros ;
  s(X) >= n__s(X) ;
  length(cons(N,L)) >= U11(and(isNatList(activate(L)),n__isNat(N)),activate(L)) ;
  length(nil) >= 0 ;
  length(X) >= n__length(X) ;
  activate(n__zeros) >= zeros ;
  activate(n__take(X1,X2)) >= take(X1,X2) ;
  activate(n__0) >= 0 ;
  activate(n__length(X)) >= length(X) ;
  activate(n__s(X)) >= s(X) ;
  activate(n__isNatIList(X)) >= isNatIList(X) ;
  activate(n__cons(X1,X2)) >= cons(X1,X2) ;
  activate(n__nil) >= nil ;
  activate(n__isNatList(X)) >= isNatList(X) ;
  activate(n__isNat(X)) >= isNat(X) ;
  activate(n__and(X1,X2)) >= and(X1,X2) ;
  activate(X) >= X ;
  U11(tt,L) >= s(length(activate(L))) ;
  nil >= n__nil ;
  U21(tt) >= nil ;
  U31(tt,IL,M,N) >= cons(activate(N),n__take(activate(M),activate(IL))) ;
  and(tt,X) >= activate(X) ;
  and(X1,X2) >= n__and(X1,X2) ;
  isNat(n__0) >= tt ;
  isNat(n__length(V1)) >= isNatList(activate(V1)) ;
  isNat(n__s(V1)) >= isNat(activate(V1)) ;
  isNat(X) >= n__isNat(X) ;
  isNatList(n__take(V1,V2)) >= and(isNat(activate(V1)),
                                n__isNatIList(activate(V2))) ;
  isNatList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                n__isNatList(activate(V2))) ;
  isNatList(n__nil) >= tt ;
  isNatList(X) >= n__isNatList(X) ;
  isNatIList(n__zeros) >= tt ;
  isNatIList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                 n__isNatIList(activate(V2))) ;
  isNatIList(X) >= n__isNatIList(X) ;
  isNatIList(V) >= isNatList(activate(V)) ;
  take(0,IL) >= U21(isNatIList(IL)) ;
  take(s(M),cons(N,IL)) >= U31(and(isNatIList(activate(IL)),
                                n__and(isNat(M),n__isNat(N))),activate(IL),
                            M,N) ;
  take(X1,X2) >= n__take(X1,X2) ;
  Marked_activate(n__isNatIList(X)) >= Marked_isNatIList(X) ;
  Marked_activate(n__isNatList(X)) >= Marked_isNatList(X) ;
  Marked_activate(n__isNat(X)) >= Marked_isNat(X) ;
  Marked_activate(n__and(X1,X2)) >= Marked_and(X1,X2) ;
  Marked_and(tt,X) >= Marked_activate(X) ;
  Marked_isNat(n__s(V1)) >= Marked_activate(V1) ;
  Marked_isNat(n__s(V1)) >= Marked_isNat(activate(V1)) ;
  Marked_isNatList(n__cons(V1,V2)) >= Marked_activate(V1) ;
  Marked_isNatList(n__cons(V1,V2)) >= Marked_activate(V2) ;
  Marked_isNatList(n__cons(V1,V2)) >= Marked_and(isNat(activate(V1)),
                                       n__isNatList(activate(V2))) ;
  Marked_isNatList(n__cons(V1,V2)) >= Marked_isNat(activate(V1)) ;
  Marked_isNatIList(n__cons(V1,V2)) >= Marked_activate(V1) ;
  Marked_isNatIList(n__cons(V1,V2)) >= Marked_activate(V2) ;
  Marked_isNatIList(n__cons(V1,V2)) >= Marked_and(isNat(activate(V1)),
                                        n__isNatIList(activate(V2))) ;
  Marked_isNatIList(n__cons(V1,V2)) >= Marked_isNat(activate(V1)) ;
  Marked_isNatIList(V) >= Marked_activate(V) ;
  Marked_isNatIList(V) >= Marked_isNatList(activate(V)) ;
 }
 + Disjunctions:{ 
{
  Marked_activate(n__isNatIList(X)) > Marked_isNatIList(X) ;
 }
{
  Marked_activate(n__isNatList(X)) > Marked_isNatList(X) ;
 }
{
  Marked_activate(n__isNat(X)) > Marked_isNat(X) ;
 }
{
  Marked_activate(n__and(X1,X2)) > Marked_and(X1,X2) ;
 }
{
  Marked_and(tt,X) > Marked_activate(X) ;
 }
{
  Marked_isNat(n__s(V1)) > Marked_activate(V1) ;
 }
{
  Marked_isNat(n__s(V1)) > Marked_isNat(activate(V1)) ;
 }
{
  Marked_isNatList(n__cons(V1,V2)) > Marked_activate(V1) ;
 }
{
  Marked_isNatList(n__cons(V1,V2)) > Marked_activate(V2) ;
 }
{
  Marked_isNatList(n__cons(V1,V2)) > Marked_and(isNat(activate(V1)),
                                      n__isNatList(activate(V2))) ;
 }
{
  Marked_isNatList(n__cons(V1,V2)) > Marked_isNat(activate(V1)) ;
 }
{
  Marked_isNatIList(n__cons(V1,V2)) > Marked_activate(V1) ;
 }
{
  Marked_isNatIList(n__cons(V1,V2)) > Marked_activate(V2) ;
 }
{
  Marked_isNatIList(n__cons(V1,V2)) > Marked_and(isNat(activate(V1)),
                                       n__isNatIList(activate(V2))) ;
 }
{
  Marked_isNatIList(n__cons(V1,V2)) > Marked_isNat(activate(V1)) ;
 }
{
  Marked_isNatIList(V) > Marked_activate(V) ;
 }
{
  Marked_isNatIList(V) > Marked_isNatList(activate(V)) ;
 }
 } 
=== TIMER virtual : 10.000000 ===
Entering poly_solver
Starting Sat solver initialization
Calling Sat solver...
=== STOPING TIMER virtual ===
=== TIMER real : 10.000000 ===
=== STOPING TIMER real ===
Sat solver returned
Sat solver result read
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
constraint: cons(X1,X2) >= n__cons(X1,X2)
constraint: 0 >= n__0
constraint: zeros >= cons(0,n__zeros)
constraint: zeros >= n__zeros
constraint: s(X) >= n__s(X)
constraint: length(cons(N,L)) >= U11(and(isNatList(activate(L)),n__isNat(N)),
                                  activate(L))
constraint: length(nil) >= 0
constraint: length(X) >= n__length(X)
constraint: activate(n__zeros) >= zeros
constraint: activate(n__take(X1,X2)) >= take(X1,X2)
constraint: activate(n__0) >= 0
constraint: activate(n__length(X)) >= length(X)
constraint: activate(n__s(X)) >= s(X)
constraint: activate(n__isNatIList(X)) >= isNatIList(X)
constraint: activate(n__cons(X1,X2)) >= cons(X1,X2)
constraint: activate(n__nil) >= nil
constraint: activate(n__isNatList(X)) >= isNatList(X)
constraint: activate(n__isNat(X)) >= isNat(X)
constraint: activate(n__and(X1,X2)) >= and(X1,X2)
constraint: activate(X) >= X
constraint: U11(tt,L) >= s(length(activate(L)))
constraint: nil >= n__nil
constraint: U21(tt) >= nil
constraint: U31(tt,IL,M,N) >= cons(activate(N),
                               n__take(activate(M),activate(IL)))
constraint: and(tt,X) >= activate(X)
constraint: and(X1,X2) >= n__and(X1,X2)
constraint: isNat(n__0) >= tt
constraint: isNat(n__length(V1)) >= isNatList(activate(V1))
constraint: isNat(n__s(V1)) >= isNat(activate(V1))
constraint: isNat(X) >= n__isNat(X)
constraint: isNatList(n__take(V1,V2)) >= and(isNat(activate(V1)),
                                          n__isNatIList(activate(V2)))
constraint: isNatList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                          n__isNatList(activate(V2)))
constraint: isNatList(n__nil) >= tt
constraint: isNatList(X) >= n__isNatList(X)
constraint: isNatIList(n__zeros) >= tt
constraint: isNatIList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                           n__isNatIList(activate(V2)))
constraint: isNatIList(X) >= n__isNatIList(X)
constraint: isNatIList(V) >= isNatList(activate(V))
constraint: take(0,IL) >= U21(isNatIList(IL))
constraint: take(s(M),cons(N,IL)) >= U31(and(isNatIList(activate(IL)),
                                          n__and(isNat(M),n__isNat(N))),
                                      activate(IL),M,N)
constraint: take(X1,X2) >= n__take(X1,X2)
constraint: Marked_activate(n__isNatIList(X)) >= Marked_isNatIList(X)
constraint: Marked_activate(n__isNatList(X)) >= Marked_isNatList(X)
constraint: Marked_activate(n__isNat(X)) >= Marked_isNat(X)
constraint: Marked_activate(n__and(X1,X2)) >= Marked_and(X1,X2)
constraint: Marked_and(tt,X) >= Marked_activate(X)
constraint: Marked_isNat(n__s(V1)) >= Marked_activate(V1)
constraint: Marked_isNat(n__s(V1)) >= Marked_isNat(activate(V1))
constraint: Marked_isNatList(n__cons(V1,V2)) >= Marked_activate(V1)
constraint: Marked_isNatList(n__cons(V1,V2)) >= Marked_activate(V2)
constraint: Marked_isNatList(n__cons(V1,V2)) >= Marked_and(isNat(activate(V1)),
                                                 n__isNatList(activate(V2)))
constraint: Marked_isNatList(n__cons(V1,V2)) >= Marked_isNat(activate(V1))
constraint: Marked_isNatIList(n__cons(V1,V2)) >= Marked_activate(V1)
constraint: Marked_isNatIList(n__cons(V1,V2)) >= Marked_activate(V2)
constraint: Marked_isNatIList(n__cons(V1,V2)) >= Marked_and(isNat(activate(V1)),
                                                  n__isNatIList(activate(V2)))
constraint: Marked_isNatIList(n__cons(V1,V2)) >= Marked_isNat(activate(V1))
constraint: Marked_isNatIList(V) >= Marked_activate(V)
constraint: Marked_isNatIList(V) >= Marked_isNatList(activate(V))
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)> 
      --> <Marked_and(tt,X) , Marked_activate(X)>
  <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)>
  <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)>
  <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_isNat(activate(V1))>
  <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                              n__isNatList(activate(V2)))>
  <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V2)>
  <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V1)>
  <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_isNat(activate(V1))>
  <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                               n__isNatIList(activate(V2)))>
  <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)> 
     --> <Marked_isNatIList(V) , Marked_activate(V)>
  <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)> 
     --> <Marked_isNatIList(V) , Marked_isNatList(activate(V))>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_activate(V1)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                       n__isNatList(activate(V2)))> 
     --> <Marked_and(tt,X) , Marked_activate(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_activate(V1)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                        n__isNatIList(activate(V2)))> 
     --> <Marked_and(tt,X) , Marked_activate(X)>
  <Marked_isNatIList(V) , Marked_activate(V)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNatIList(V) , Marked_activate(V)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNatIList(V) , Marked_activate(V)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNatIList(V) , Marked_isNatList(activate(V))> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)>
  <Marked_isNatIList(V) , Marked_isNatList(activate(V))> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)>
  <Marked_isNatIList(V) , Marked_isNatList(activate(V))> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_isNat(activate(V1))>
  <Marked_isNatIList(V) , Marked_isNatList(activate(V))> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                              n__isNatList(activate(V2)))>
  <Marked_isNat(n__s(V1)) , Marked_activate(V1)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNat(n__s(V1)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNat(n__s(V1)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_activate(V1)>
  <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))>
  <Marked_and(tt,X) , Marked_activate(X)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_and(tt,X) , Marked_activate(X)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_and(tt,X) , Marked_activate(X)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cons(X1,X2) >= n__cons(X1,X2) ;
  0 >= n__0 ;
  zeros >= cons(0,n__zeros) ;
  zeros >= n__zeros ;
  s(X) >= n__s(X) ;
  length(cons(N,L)) >= U11(and(isNatList(activate(L)),n__isNat(N)),activate(L)) ;
  length(nil) >= 0 ;
  length(X) >= n__length(X) ;
  activate(n__zeros) >= zeros ;
  activate(n__take(X1,X2)) >= take(X1,X2) ;
  activate(n__0) >= 0 ;
  activate(n__length(X)) >= length(X) ;
  activate(n__s(X)) >= s(X) ;
  activate(n__isNatIList(X)) >= isNatIList(X) ;
  activate(n__cons(X1,X2)) >= cons(X1,X2) ;
  activate(n__nil) >= nil ;
  activate(n__isNatList(X)) >= isNatList(X) ;
  activate(n__isNat(X)) >= isNat(X) ;
  activate(n__and(X1,X2)) >= and(X1,X2) ;
  activate(X) >= X ;
  U11(tt,L) >= s(length(activate(L))) ;
  nil >= n__nil ;
  U21(tt) >= nil ;
  U31(tt,IL,M,N) >= cons(activate(N),n__take(activate(M),activate(IL))) ;
  and(tt,X) >= activate(X) ;
  and(X1,X2) >= n__and(X1,X2) ;
  isNat(n__0) >= tt ;
  isNat(n__length(V1)) >= isNatList(activate(V1)) ;
  isNat(n__s(V1)) >= isNat(activate(V1)) ;
  isNat(X) >= n__isNat(X) ;
  isNatList(n__take(V1,V2)) >= and(isNat(activate(V1)),
                                n__isNatIList(activate(V2))) ;
  isNatList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                n__isNatList(activate(V2))) ;
  isNatList(n__nil) >= tt ;
  isNatList(X) >= n__isNatList(X) ;
  isNatIList(n__zeros) >= tt ;
  isNatIList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                 n__isNatIList(activate(V2))) ;
  isNatIList(X) >= n__isNatIList(X) ;
  isNatIList(V) >= isNatList(activate(V)) ;
  take(0,IL) >= U21(isNatIList(IL)) ;
  take(s(M),cons(N,IL)) >= U31(and(isNatIList(activate(IL)),
                                n__and(isNat(M),n__isNat(N))),activate(IL),
                            M,N) ;
  take(X1,X2) >= n__take(X1,X2) ;
  Marked_activate(n__isNatIList(X)) >= Marked_isNatIList(X) ;
  Marked_activate(n__isNatList(X)) >= Marked_isNatList(X) ;
  Marked_activate(n__and(X1,X2)) >= Marked_and(X1,X2) ;
  Marked_and(tt,X) >= Marked_activate(X) ;
  Marked_isNat(n__s(V1)) >= Marked_activate(V1) ;
  Marked_isNat(n__s(V1)) >= Marked_isNat(activate(V1)) ;
  Marked_isNatList(n__cons(V1,V2)) >= Marked_activate(V1) ;
  Marked_isNatList(n__cons(V1,V2)) >= Marked_activate(V2) ;
  Marked_isNatList(n__cons(V1,V2)) >= Marked_and(isNat(activate(V1)),
                                       n__isNatList(activate(V2))) ;
  Marked_isNatList(n__cons(V1,V2)) >= Marked_isNat(activate(V1)) ;
  Marked_isNatIList(n__cons(V1,V2)) >= Marked_activate(V1) ;
  Marked_isNatIList(n__cons(V1,V2)) >= Marked_activate(V2) ;
  Marked_isNatIList(n__cons(V1,V2)) >= Marked_and(isNat(activate(V1)),
                                        n__isNatIList(activate(V2))) ;
  Marked_isNatIList(n__cons(V1,V2)) >= Marked_isNat(activate(V1)) ;
  Marked_isNatIList(V) >= Marked_activate(V) ;
  Marked_isNatIList(V) >= Marked_isNatList(activate(V)) ;
 }
 + Disjunctions:{ 
{
  Marked_activate(n__isNatIList(X)) > Marked_isNatIList(X) ;
 }
{
  Marked_activate(n__isNatList(X)) > Marked_isNatList(X) ;
 }
{
  Marked_activate(n__and(X1,X2)) > Marked_and(X1,X2) ;
 }
{
  Marked_and(tt,X) > Marked_activate(X) ;
 }
{
  Marked_isNat(n__s(V1)) > Marked_activate(V1) ;
 }
{
  Marked_isNat(n__s(V1)) > Marked_isNat(activate(V1)) ;
 }
{
  Marked_isNatList(n__cons(V1,V2)) > Marked_activate(V1) ;
 }
{
  Marked_isNatList(n__cons(V1,V2)) > Marked_activate(V2) ;
 }
{
  Marked_isNatList(n__cons(V1,V2)) > Marked_and(isNat(activate(V1)),
                                      n__isNatList(activate(V2))) ;
 }
{
  Marked_isNatList(n__cons(V1,V2)) > Marked_isNat(activate(V1)) ;
 }
{
  Marked_isNatIList(n__cons(V1,V2)) > Marked_activate(V1) ;
 }
{
  Marked_isNatIList(n__cons(V1,V2)) > Marked_activate(V2) ;
 }
{
  Marked_isNatIList(n__cons(V1,V2)) > Marked_and(isNat(activate(V1)),
                                       n__isNatIList(activate(V2))) ;
 }
{
  Marked_isNatIList(n__cons(V1,V2)) > Marked_isNat(activate(V1)) ;
 }
{
  Marked_isNatIList(V) > Marked_activate(V) ;
 }
{
  Marked_isNatIList(V) > Marked_isNatList(activate(V)) ;
 }
 } 
=== TIMER virtual : 10.000000 ===
Entering poly_solver
Starting Sat solver initialization
Calling Sat solver...
=== STOPING TIMER virtual ===
=== TIMER real : 10.000000 ===
=== STOPING TIMER real ===
Sat solver returned
Sat solver result read
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
constraint: cons(X1,X2) >= n__cons(X1,X2)
constraint: 0 >= n__0
constraint: zeros >= cons(0,n__zeros)
constraint: zeros >= n__zeros
constraint: s(X) >= n__s(X)
constraint: length(cons(N,L)) >= U11(and(isNatList(activate(L)),n__isNat(N)),
                                  activate(L))
constraint: length(nil) >= 0
constraint: length(X) >= n__length(X)
constraint: activate(n__zeros) >= zeros
constraint: activate(n__take(X1,X2)) >= take(X1,X2)
constraint: activate(n__0) >= 0
constraint: activate(n__length(X)) >= length(X)
constraint: activate(n__s(X)) >= s(X)
constraint: activate(n__isNatIList(X)) >= isNatIList(X)
constraint: activate(n__cons(X1,X2)) >= cons(X1,X2)
constraint: activate(n__nil) >= nil
constraint: activate(n__isNatList(X)) >= isNatList(X)
constraint: activate(n__isNat(X)) >= isNat(X)
constraint: activate(n__and(X1,X2)) >= and(X1,X2)
constraint: activate(X) >= X
constraint: U11(tt,L) >= s(length(activate(L)))
constraint: nil >= n__nil
constraint: U21(tt) >= nil
constraint: U31(tt,IL,M,N) >= cons(activate(N),
                               n__take(activate(M),activate(IL)))
constraint: and(tt,X) >= activate(X)
constraint: and(X1,X2) >= n__and(X1,X2)
constraint: isNat(n__0) >= tt
constraint: isNat(n__length(V1)) >= isNatList(activate(V1))
constraint: isNat(n__s(V1)) >= isNat(activate(V1))
constraint: isNat(X) >= n__isNat(X)
constraint: isNatList(n__take(V1,V2)) >= and(isNat(activate(V1)),
                                          n__isNatIList(activate(V2)))
constraint: isNatList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                          n__isNatList(activate(V2)))
constraint: isNatList(n__nil) >= tt
constraint: isNatList(X) >= n__isNatList(X)
constraint: isNatIList(n__zeros) >= tt
constraint: isNatIList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                           n__isNatIList(activate(V2)))
constraint: isNatIList(X) >= n__isNatIList(X)
constraint: isNatIList(V) >= isNatList(activate(V))
constraint: take(0,IL) >= U21(isNatIList(IL))
constraint: take(s(M),cons(N,IL)) >= U31(and(isNatIList(activate(IL)),
                                          n__and(isNat(M),n__isNat(N))),
                                      activate(IL),M,N)
constraint: take(X1,X2) >= n__take(X1,X2)
constraint: Marked_activate(n__isNatIList(X)) >= Marked_isNatIList(X)
constraint: Marked_activate(n__isNatList(X)) >= Marked_isNatList(X)
constraint: Marked_activate(n__and(X1,X2)) >= Marked_and(X1,X2)
constraint: Marked_and(tt,X) >= Marked_activate(X)
constraint: Marked_isNat(n__s(V1)) >= Marked_activate(V1)
constraint: Marked_isNat(n__s(V1)) >= Marked_isNat(activate(V1))
constraint: Marked_isNatList(n__cons(V1,V2)) >= Marked_activate(V1)
constraint: Marked_isNatList(n__cons(V1,V2)) >= Marked_activate(V2)
constraint: Marked_isNatList(n__cons(V1,V2)) >= Marked_and(isNat(activate(V1)),
                                                 n__isNatList(activate(V2)))
constraint: Marked_isNatList(n__cons(V1,V2)) >= Marked_isNat(activate(V1))
constraint: Marked_isNatIList(n__cons(V1,V2)) >= Marked_activate(V1)
constraint: Marked_isNatIList(n__cons(V1,V2)) >= Marked_activate(V2)
constraint: Marked_isNatIList(n__cons(V1,V2)) >= Marked_and(isNat(activate(V1)),
                                                  n__isNatIList(activate(V2)))
constraint: Marked_isNatIList(n__cons(V1,V2)) >= Marked_isNat(activate(V1))
constraint: Marked_isNatIList(V) >= Marked_activate(V)
constraint: Marked_isNatIList(V) >= Marked_isNatList(activate(V))
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)> 
      --> <Marked_and(tt,X) , Marked_activate(X)>
  <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)>
  <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)>
  <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_isNat(activate(V1))>
  <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                              n__isNatList(activate(V2)))>
  <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                               n__isNatIList(activate(V2)))>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V2)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_activate(V1)>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                       n__isNatList(activate(V2)))> 
     --> <Marked_and(tt,X) , Marked_activate(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                        n__isNatIList(activate(V2)))> 
     --> <Marked_and(tt,X) , Marked_activate(X)>
  <Marked_isNat(n__s(V1)) , Marked_activate(V1)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_isNat(n__s(V1)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_isNat(n__s(V1)) , Marked_activate(V1)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
  <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_activate(V1)>
  <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))> 
     --> <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))>
  <Marked_and(tt,X) , Marked_activate(X)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_and(tt,X) , Marked_activate(X)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_and(tt,X) , Marked_activate(X)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cons(X1,X2) >= n__cons(X1,X2) ;
  0 >= n__0 ;
  zeros >= cons(0,n__zeros) ;
  zeros >= n__zeros ;
  s(X) >= n__s(X) ;
  length(cons(N,L)) >= U11(and(isNatList(activate(L)),n__isNat(N)),activate(L)) ;
  length(nil) >= 0 ;
  length(X) >= n__length(X) ;
  activate(n__zeros) >= zeros ;
  activate(n__take(X1,X2)) >= take(X1,X2) ;
  activate(n__0) >= 0 ;
  activate(n__length(X)) >= length(X) ;
  activate(n__s(X)) >= s(X) ;
  activate(n__isNatIList(X)) >= isNatIList(X) ;
  activate(n__cons(X1,X2)) >= cons(X1,X2) ;
  activate(n__nil) >= nil ;
  activate(n__isNatList(X)) >= isNatList(X) ;
  activate(n__isNat(X)) >= isNat(X) ;
  activate(n__and(X1,X2)) >= and(X1,X2) ;
  activate(X) >= X ;
  U11(tt,L) >= s(length(activate(L))) ;
  nil >= n__nil ;
  U21(tt) >= nil ;
  U31(tt,IL,M,N) >= cons(activate(N),n__take(activate(M),activate(IL))) ;
  and(tt,X) >= activate(X) ;
  and(X1,X2) >= n__and(X1,X2) ;
  isNat(n__0) >= tt ;
  isNat(n__length(V1)) >= isNatList(activate(V1)) ;
  isNat(n__s(V1)) >= isNat(activate(V1)) ;
  isNat(X) >= n__isNat(X) ;
  isNatList(n__take(V1,V2)) >= and(isNat(activate(V1)),
                                n__isNatIList(activate(V2))) ;
  isNatList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                n__isNatList(activate(V2))) ;
  isNatList(n__nil) >= tt ;
  isNatList(X) >= n__isNatList(X) ;
  isNatIList(n__zeros) >= tt ;
  isNatIList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                 n__isNatIList(activate(V2))) ;
  isNatIList(X) >= n__isNatIList(X) ;
  isNatIList(V) >= isNatList(activate(V)) ;
  take(0,IL) >= U21(isNatIList(IL)) ;
  take(s(M),cons(N,IL)) >= U31(and(isNatIList(activate(IL)),
                                n__and(isNat(M),n__isNat(N))),activate(IL),
                            M,N) ;
  take(X1,X2) >= n__take(X1,X2) ;
  Marked_activate(n__isNatIList(X)) >= Marked_isNatIList(X) ;
  Marked_activate(n__isNatList(X)) >= Marked_isNatList(X) ;
  Marked_activate(n__and(X1,X2)) >= Marked_and(X1,X2) ;
  Marked_and(tt,X) >= Marked_activate(X) ;
  Marked_isNat(n__s(V1)) >= Marked_activate(V1) ;
  Marked_isNat(n__s(V1)) >= Marked_isNat(activate(V1)) ;
  Marked_isNatList(n__cons(V1,V2)) >= Marked_activate(V1) ;
  Marked_isNatList(n__cons(V1,V2)) >= Marked_activate(V2) ;
  Marked_isNatList(n__cons(V1,V2)) >= Marked_and(isNat(activate(V1)),
                                       n__isNatList(activate(V2))) ;
  Marked_isNatList(n__cons(V1,V2)) >= Marked_isNat(activate(V1)) ;
  Marked_isNatIList(n__cons(V1,V2)) >= Marked_and(isNat(activate(V1)),
                                        n__isNatIList(activate(V2))) ;
 }
 + Disjunctions:{ 
{
  Marked_activate(n__isNatIList(X)) > Marked_isNatIList(X) ;
 }
{
  Marked_activate(n__isNatList(X)) > Marked_isNatList(X) ;
 }
{
  Marked_activate(n__and(X1,X2)) > Marked_and(X1,X2) ;
 }
{
  Marked_and(tt,X) > Marked_activate(X) ;
 }
{
  Marked_isNat(n__s(V1)) > Marked_activate(V1) ;
 }
{
  Marked_isNat(n__s(V1)) > Marked_isNat(activate(V1)) ;
 }
{
  Marked_isNatList(n__cons(V1,V2)) > Marked_activate(V1) ;
 }
{
  Marked_isNatList(n__cons(V1,V2)) > Marked_activate(V2) ;
 }
{
  Marked_isNatList(n__cons(V1,V2)) > Marked_and(isNat(activate(V1)),
                                      n__isNatList(activate(V2))) ;
 }
{
  Marked_isNatList(n__cons(V1,V2)) > Marked_isNat(activate(V1)) ;
 }
{
  Marked_isNatIList(n__cons(V1,V2)) > Marked_and(isNat(activate(V1)),
                                       n__isNatIList(activate(V2))) ;
 }
 } 
=== TIMER virtual : 10.000000 ===
Entering poly_solver
Starting Sat solver initialization
Calling Sat solver...
=== STOPING TIMER virtual ===
=== TIMER real : 10.000000 ===
=== STOPING TIMER real ===
Sat solver returned
Sat solver result read
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
constraint: cons(X1,X2) >= n__cons(X1,X2)
constraint: 0 >= n__0
constraint: zeros >= cons(0,n__zeros)
constraint: zeros >= n__zeros
constraint: s(X) >= n__s(X)
constraint: length(cons(N,L)) >= U11(and(isNatList(activate(L)),n__isNat(N)),
                                  activate(L))
constraint: length(nil) >= 0
constraint: length(X) >= n__length(X)
constraint: activate(n__zeros) >= zeros
constraint: activate(n__take(X1,X2)) >= take(X1,X2)
constraint: activate(n__0) >= 0
constraint: activate(n__length(X)) >= length(X)
constraint: activate(n__s(X)) >= s(X)
constraint: activate(n__isNatIList(X)) >= isNatIList(X)
constraint: activate(n__cons(X1,X2)) >= cons(X1,X2)
constraint: activate(n__nil) >= nil
constraint: activate(n__isNatList(X)) >= isNatList(X)
constraint: activate(n__isNat(X)) >= isNat(X)
constraint: activate(n__and(X1,X2)) >= and(X1,X2)
constraint: activate(X) >= X
constraint: U11(tt,L) >= s(length(activate(L)))
constraint: nil >= n__nil
constraint: U21(tt) >= nil
constraint: U31(tt,IL,M,N) >= cons(activate(N),
                               n__take(activate(M),activate(IL)))
constraint: and(tt,X) >= activate(X)
constraint: and(X1,X2) >= n__and(X1,X2)
constraint: isNat(n__0) >= tt
constraint: isNat(n__length(V1)) >= isNatList(activate(V1))
constraint: isNat(n__s(V1)) >= isNat(activate(V1))
constraint: isNat(X) >= n__isNat(X)
constraint: isNatList(n__take(V1,V2)) >= and(isNat(activate(V1)),
                                          n__isNatIList(activate(V2)))
constraint: isNatList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                          n__isNatList(activate(V2)))
constraint: isNatList(n__nil) >= tt
constraint: isNatList(X) >= n__isNatList(X)
constraint: isNatIList(n__zeros) >= tt
constraint: isNatIList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                           n__isNatIList(activate(V2)))
constraint: isNatIList(X) >= n__isNatIList(X)
constraint: isNatIList(V) >= isNatList(activate(V))
constraint: take(0,IL) >= U21(isNatIList(IL))
constraint: take(s(M),cons(N,IL)) >= U31(and(isNatIList(activate(IL)),
                                          n__and(isNat(M),n__isNat(N))),
                                      activate(IL),M,N)
constraint: take(X1,X2) >= n__take(X1,X2)
constraint: Marked_activate(n__isNatIList(X)) >= Marked_isNatIList(X)
constraint: Marked_activate(n__isNatList(X)) >= Marked_isNatList(X)
constraint: Marked_activate(n__and(X1,X2)) >= Marked_and(X1,X2)
constraint: Marked_and(tt,X) >= Marked_activate(X)
constraint: Marked_isNat(n__s(V1)) >= Marked_activate(V1)
constraint: Marked_isNat(n__s(V1)) >= Marked_isNat(activate(V1))
constraint: Marked_isNatList(n__cons(V1,V2)) >= Marked_activate(V1)
constraint: Marked_isNatList(n__cons(V1,V2)) >= Marked_activate(V2)
constraint: Marked_isNatList(n__cons(V1,V2)) >= Marked_and(isNat(activate(V1)),
                                                 n__isNatList(activate(V2)))
constraint: Marked_isNatList(n__cons(V1,V2)) >= Marked_isNat(activate(V1))
constraint: Marked_isNatIList(n__cons(V1,V2)) >= Marked_and(isNat(activate(V1)),
                                                  n__isNatIList(activate(V2)))
APPLY CRITERIA (Graph splitting)
Found 2 components:

{  <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)> 
      --> <Marked_and(tt,X) , Marked_activate(X)>
  <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)> 
     --> <Marked_isNatList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                              n__isNatList(activate(V2)))>
  <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                               n__isNatIList(activate(V2)))>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                       n__isNatList(activate(V2)))> 
     --> <Marked_and(tt,X) , Marked_activate(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                        n__isNatIList(activate(V2)))> 
     --> <Marked_and(tt,X) , Marked_activate(X)>
  <Marked_and(tt,X) , Marked_activate(X)> 
     --> <Marked_activate(n__and(X1,X2)) , Marked_and(X1,X2)>
  <Marked_and(tt,X) , Marked_activate(X)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_and(tt,X) , Marked_activate(X)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
}

{  <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))> 
      --> <Marked_isNat(n__s(V1)) , Marked_isNat(activate(V1))>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cons(X1,X2) >= n__cons(X1,X2) ;
  0 >= n__0 ;
  zeros >= cons(0,n__zeros) ;
  zeros >= n__zeros ;
  s(X) >= n__s(X) ;
  length(cons(N,L)) >= U11(and(isNatList(activate(L)),n__isNat(N)),activate(L)) ;
  length(nil) >= 0 ;
  length(X) >= n__length(X) ;
  activate(n__zeros) >= zeros ;
  activate(n__take(X1,X2)) >= take(X1,X2) ;
  activate(n__0) >= 0 ;
  activate(n__length(X)) >= length(X) ;
  activate(n__s(X)) >= s(X) ;
  activate(n__isNatIList(X)) >= isNatIList(X) ;
  activate(n__cons(X1,X2)) >= cons(X1,X2) ;
  activate(n__nil) >= nil ;
  activate(n__isNatList(X)) >= isNatList(X) ;
  activate(n__isNat(X)) >= isNat(X) ;
  activate(n__and(X1,X2)) >= and(X1,X2) ;
  activate(X) >= X ;
  U11(tt,L) >= s(length(activate(L))) ;
  nil >= n__nil ;
  U21(tt) >= nil ;
  U31(tt,IL,M,N) >= cons(activate(N),n__take(activate(M),activate(IL))) ;
  and(tt,X) >= activate(X) ;
  and(X1,X2) >= n__and(X1,X2) ;
  isNat(n__0) >= tt ;
  isNat(n__length(V1)) >= isNatList(activate(V1)) ;
  isNat(n__s(V1)) >= isNat(activate(V1)) ;
  isNat(X) >= n__isNat(X) ;
  isNatList(n__take(V1,V2)) >= and(isNat(activate(V1)),
                                n__isNatIList(activate(V2))) ;
  isNatList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                n__isNatList(activate(V2))) ;
  isNatList(n__nil) >= tt ;
  isNatList(X) >= n__isNatList(X) ;
  isNatIList(n__zeros) >= tt ;
  isNatIList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                 n__isNatIList(activate(V2))) ;
  isNatIList(X) >= n__isNatIList(X) ;
  isNatIList(V) >= isNatList(activate(V)) ;
  take(0,IL) >= U21(isNatIList(IL)) ;
  take(s(M),cons(N,IL)) >= U31(and(isNatIList(activate(IL)),
                                n__and(isNat(M),n__isNat(N))),activate(IL),
                            M,N) ;
  take(X1,X2) >= n__take(X1,X2) ;
  Marked_activate(n__isNatIList(X)) >= Marked_isNatIList(X) ;
  Marked_activate(n__isNatList(X)) >= Marked_isNatList(X) ;
  Marked_activate(n__and(X1,X2)) >= Marked_and(X1,X2) ;
  Marked_and(tt,X) >= Marked_activate(X) ;
  Marked_isNatList(n__cons(V1,V2)) >= Marked_and(isNat(activate(V1)),
                                       n__isNatList(activate(V2))) ;
  Marked_isNatIList(n__cons(V1,V2)) >= Marked_and(isNat(activate(V1)),
                                        n__isNatIList(activate(V2))) ;
 }
 + Disjunctions:{ 
{
  Marked_activate(n__isNatIList(X)) > Marked_isNatIList(X) ;
 }
{
  Marked_activate(n__isNatList(X)) > Marked_isNatList(X) ;
 }
{
  Marked_activate(n__and(X1,X2)) > Marked_and(X1,X2) ;
 }
{
  Marked_and(tt,X) > Marked_activate(X) ;
 }
{
  Marked_isNatList(n__cons(V1,V2)) > Marked_and(isNat(activate(V1)),
                                      n__isNatList(activate(V2))) ;
 }
{
  Marked_isNatIList(n__cons(V1,V2)) > Marked_and(isNat(activate(V1)),
                                       n__isNatIList(activate(V2))) ;
 }
 } 
=== TIMER virtual : 10.000000 ===
Entering poly_solver
Starting Sat solver initialization
Calling Sat solver...
=== STOPING TIMER virtual ===
=== TIMER real : 10.000000 ===
=== STOPING TIMER real ===
Sat solver returned
Sat solver result read
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
constraint: cons(X1,X2) >= n__cons(X1,X2)
constraint: 0 >= n__0
constraint: zeros >= cons(0,n__zeros)
constraint: zeros >= n__zeros
constraint: s(X) >= n__s(X)
constraint: length(cons(N,L)) >= U11(and(isNatList(activate(L)),n__isNat(N)),
                                  activate(L))
constraint: length(nil) >= 0
constraint: length(X) >= n__length(X)
constraint: activate(n__zeros) >= zeros
constraint: activate(n__take(X1,X2)) >= take(X1,X2)
constraint: activate(n__0) >= 0
constraint: activate(n__length(X)) >= length(X)
constraint: activate(n__s(X)) >= s(X)
constraint: activate(n__isNatIList(X)) >= isNatIList(X)
constraint: activate(n__cons(X1,X2)) >= cons(X1,X2)
constraint: activate(n__nil) >= nil
constraint: activate(n__isNatList(X)) >= isNatList(X)
constraint: activate(n__isNat(X)) >= isNat(X)
constraint: activate(n__and(X1,X2)) >= and(X1,X2)
constraint: activate(X) >= X
constraint: U11(tt,L) >= s(length(activate(L)))
constraint: nil >= n__nil
constraint: U21(tt) >= nil
constraint: U31(tt,IL,M,N) >= cons(activate(N),
                               n__take(activate(M),activate(IL)))
constraint: and(tt,X) >= activate(X)
constraint: and(X1,X2) >= n__and(X1,X2)
constraint: isNat(n__0) >= tt
constraint: isNat(n__length(V1)) >= isNatList(activate(V1))
constraint: isNat(n__s(V1)) >= isNat(activate(V1))
constraint: isNat(X) >= n__isNat(X)
constraint: isNatList(n__take(V1,V2)) >= and(isNat(activate(V1)),
                                          n__isNatIList(activate(V2)))
constraint: isNatList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                          n__isNatList(activate(V2)))
constraint: isNatList(n__nil) >= tt
constraint: isNatList(X) >= n__isNatList(X)
constraint: isNatIList(n__zeros) >= tt
constraint: isNatIList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                           n__isNatIList(activate(V2)))
constraint: isNatIList(X) >= n__isNatIList(X)
constraint: isNatIList(V) >= isNatList(activate(V))
constraint: take(0,IL) >= U21(isNatIList(IL))
constraint: take(s(M),cons(N,IL)) >= U31(and(isNatIList(activate(IL)),
                                          n__and(isNat(M),n__isNat(N))),
                                      activate(IL),M,N)
constraint: take(X1,X2) >= n__take(X1,X2)
constraint: Marked_activate(n__isNatIList(X)) >= Marked_isNatIList(X)
constraint: Marked_activate(n__isNatList(X)) >= Marked_isNatList(X)
constraint: Marked_activate(n__and(X1,X2)) >= Marked_and(X1,X2)
constraint: Marked_and(tt,X) >= Marked_activate(X)
constraint: Marked_isNatList(n__cons(V1,V2)) >= Marked_and(isNat(activate(V1)),
                                                 n__isNatList(activate(V2)))
constraint: Marked_isNatIList(n__cons(V1,V2)) >= Marked_and(isNat(activate(V1)),
                                                  n__isNatIList(activate(V2)))
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cons(X1,X2) >= n__cons(X1,X2) ;
  0 >= n__0 ;
  zeros >= cons(0,n__zeros) ;
  zeros >= n__zeros ;
  s(X) >= n__s(X) ;
  length(cons(N,L)) >= U11(and(isNatList(activate(L)),n__isNat(N)),activate(L)) ;
  length(nil) >= 0 ;
  length(X) >= n__length(X) ;
  activate(n__zeros) >= zeros ;
  activate(n__take(X1,X2)) >= take(X1,X2) ;
  activate(n__0) >= 0 ;
  activate(n__length(X)) >= length(X) ;
  activate(n__s(X)) >= s(X) ;
  activate(n__isNatIList(X)) >= isNatIList(X) ;
  activate(n__cons(X1,X2)) >= cons(X1,X2) ;
  activate(n__nil) >= nil ;
  activate(n__isNatList(X)) >= isNatList(X) ;
  activate(n__isNat(X)) >= isNat(X) ;
  activate(n__and(X1,X2)) >= and(X1,X2) ;
  activate(X) >= X ;
  U11(tt,L) >= s(length(activate(L))) ;
  nil >= n__nil ;
  U21(tt) >= nil ;
  U31(tt,IL,M,N) >= cons(activate(N),n__take(activate(M),activate(IL))) ;
  and(tt,X) >= activate(X) ;
  and(X1,X2) >= n__and(X1,X2) ;
  isNat(n__0) >= tt ;
  isNat(n__length(V1)) >= isNatList(activate(V1)) ;
  isNat(n__s(V1)) >= isNat(activate(V1)) ;
  isNat(X) >= n__isNat(X) ;
  isNatList(n__take(V1,V2)) >= and(isNat(activate(V1)),
                                n__isNatIList(activate(V2))) ;
  isNatList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                n__isNatList(activate(V2))) ;
  isNatList(n__nil) >= tt ;
  isNatList(X) >= n__isNatList(X) ;
  isNatIList(n__zeros) >= tt ;
  isNatIList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                 n__isNatIList(activate(V2))) ;
  isNatIList(X) >= n__isNatIList(X) ;
  isNatIList(V) >= isNatList(activate(V)) ;
  take(0,IL) >= U21(isNatIList(IL)) ;
  take(s(M),cons(N,IL)) >= U31(and(isNatIList(activate(IL)),
                                n__and(isNat(M),n__isNat(N))),activate(IL),
                            M,N) ;
  take(X1,X2) >= n__take(X1,X2) ;
  Marked_isNat(n__s(V1)) >= Marked_isNat(activate(V1)) ;
 }
 + Disjunctions:{ 
{
  Marked_isNat(n__s(V1)) > Marked_isNat(activate(V1)) ;
 }
 } 
=== TIMER virtual : 10.000000 ===
Entering poly_solver
Starting Sat solver initialization
Calling Sat solver...
=== STOPING TIMER virtual ===
=== TIMER real : 10.000000 ===
=== STOPING TIMER real ===
Sat solver returned
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
No solution found for these parameters.
Entering rpo_solver
=== TIMER virtual : 25.000000 ===
Search parameters: AFS type: 2 ; time limit: 25.. 
=== STOPING TIMER virtual ===
Time out for these parameters.
=== TIMER virtual : 15.000000 ===
Entering poly_solver
Starting Sat solver initialization
Calling Sat solver...
=== STOPING TIMER virtual ===
=== TIMER real : 15.000000 ===
=== STOPING TIMER real ===
Sat solver returned
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
No solution found for these parameters.
=== TIMER virtual : 50.000000 ===
trying sub matrices of size: 1
Matrix interpretation constraints generated.
Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. 
Termination constraints generated.
Starting Sat solver initialization
Calling Sat solver...
=== STOPING TIMER virtual ===
=== TIMER real : 50.000000 ===
=== STOPING TIMER real ===
Sat solver returned
Sat solver result read
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
constraint: cons(X1,X2) >= n__cons(X1,X2)
constraint: 0 >= n__0
constraint: zeros >= cons(0,n__zeros)
constraint: zeros >= n__zeros
constraint: s(X) >= n__s(X)
constraint: length(cons(N,L)) >= U11(and(isNatList(activate(L)),n__isNat(N)),
                                  activate(L))
constraint: length(nil) >= 0
constraint: length(X) >= n__length(X)
constraint: activate(n__zeros) >= zeros
constraint: activate(n__take(X1,X2)) >= take(X1,X2)
constraint: activate(n__0) >= 0
constraint: activate(n__length(X)) >= length(X)
constraint: activate(n__s(X)) >= s(X)
constraint: activate(n__isNatIList(X)) >= isNatIList(X)
constraint: activate(n__cons(X1,X2)) >= cons(X1,X2)
constraint: activate(n__nil) >= nil
constraint: activate(n__isNatList(X)) >= isNatList(X)
constraint: activate(n__isNat(X)) >= isNat(X)
constraint: activate(n__and(X1,X2)) >= and(X1,X2)
constraint: activate(X) >= X
constraint: U11(tt,L) >= s(length(activate(L)))
constraint: nil >= n__nil
constraint: U21(tt) >= nil
constraint: U31(tt,IL,M,N) >= cons(activate(N),
                               n__take(activate(M),activate(IL)))
constraint: and(tt,X) >= activate(X)
constraint: and(X1,X2) >= n__and(X1,X2)
constraint: isNat(n__0) >= tt
constraint: isNat(n__length(V1)) >= isNatList(activate(V1))
constraint: isNat(n__s(V1)) >= isNat(activate(V1))
constraint: isNat(X) >= n__isNat(X)
constraint: isNatList(n__take(V1,V2)) >= and(isNat(activate(V1)),
                                          n__isNatIList(activate(V2)))
constraint: isNatList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                          n__isNatList(activate(V2)))
constraint: isNatList(n__nil) >= tt
constraint: isNatList(X) >= n__isNatList(X)
constraint: isNatIList(n__zeros) >= tt
constraint: isNatIList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                           n__isNatIList(activate(V2)))
constraint: isNatIList(X) >= n__isNatIList(X)
constraint: isNatIList(V) >= isNatList(activate(V))
constraint: take(0,IL) >= U21(isNatIList(IL))
constraint: take(s(M),cons(N,IL)) >= U31(and(isNatIList(activate(IL)),
                                          n__and(isNat(M),n__isNat(N))),
                                      activate(IL),M,N)
constraint: take(X1,X2) >= n__take(X1,X2)
constraint: Marked_isNat(n__s(V1)) >= Marked_isNat(activate(V1))
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)> 
      --> <Marked_isNatList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                               n__isNatList(activate(V2)))>
  <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)> 
     --> <Marked_isNatIList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                               n__isNatIList(activate(V2)))>
  <Marked_isNatList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                       n__isNatList(activate(V2)))> 
     --> <Marked_and(tt,X) , Marked_activate(X)>
  <Marked_isNatIList(n__cons(V1,V2)) , Marked_and(isNat(activate(V1)),
                                        n__isNatIList(activate(V2)))> 
     --> <Marked_and(tt,X) , Marked_activate(X)>
  <Marked_and(tt,X) , Marked_activate(X)> 
     --> <Marked_activate(n__isNatList(X)) , Marked_isNatList(X)>
  <Marked_and(tt,X) , Marked_activate(X)> 
     --> <Marked_activate(n__isNatIList(X)) , Marked_isNatIList(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cons(X1,X2) >= n__cons(X1,X2) ;
  0 >= n__0 ;
  zeros >= cons(0,n__zeros) ;
  zeros >= n__zeros ;
  s(X) >= n__s(X) ;
  length(cons(N,L)) >= U11(and(isNatList(activate(L)),n__isNat(N)),activate(L)) ;
  length(nil) >= 0 ;
  length(X) >= n__length(X) ;
  activate(n__zeros) >= zeros ;
  activate(n__take(X1,X2)) >= take(X1,X2) ;
  activate(n__0) >= 0 ;
  activate(n__length(X)) >= length(X) ;
  activate(n__s(X)) >= s(X) ;
  activate(n__isNatIList(X)) >= isNatIList(X) ;
  activate(n__cons(X1,X2)) >= cons(X1,X2) ;
  activate(n__nil) >= nil ;
  activate(n__isNatList(X)) >= isNatList(X) ;
  activate(n__isNat(X)) >= isNat(X) ;
  activate(n__and(X1,X2)) >= and(X1,X2) ;
  activate(X) >= X ;
  U11(tt,L) >= s(length(activate(L))) ;
  nil >= n__nil ;
  U21(tt) >= nil ;
  U31(tt,IL,M,N) >= cons(activate(N),n__take(activate(M),activate(IL))) ;
  and(tt,X) >= activate(X) ;
  and(X1,X2) >= n__and(X1,X2) ;
  isNat(n__0) >= tt ;
  isNat(n__length(V1)) >= isNatList(activate(V1)) ;
  isNat(n__s(V1)) >= isNat(activate(V1)) ;
  isNat(X) >= n__isNat(X) ;
  isNatList(n__take(V1,V2)) >= and(isNat(activate(V1)),
                                n__isNatIList(activate(V2))) ;
  isNatList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                n__isNatList(activate(V2))) ;
  isNatList(n__nil) >= tt ;
  isNatList(X) >= n__isNatList(X) ;
  isNatIList(n__zeros) >= tt ;
  isNatIList(n__cons(V1,V2)) >= and(isNat(activate(V1)),
                                 n__isNatIList(activate(V2))) ;
  isNatIList(X) >= n__isNatIList(X) ;
  isNatIList(V) >= isNatList(activate(V)) ;
  take(0,IL) >= U21(isNatIList(IL)) ;
  take(s(M),cons(N,IL)) >= U31(and(isNatIList(activate(IL)),
                                n__and(isNat(M),n__isNat(N))),activate(IL),
                            M,N) ;
  take(X1,X2) >= n__take(X1,X2) ;
  Marked_activate(n__isNatIList(X)) >= Marked_isNatIList(X) ;
  Marked_activate(n__isNatList(X)) >= Marked_isNatList(X) ;
  Marked_and(tt,X) >= Marked_activate(X) ;
  Marked_isNatList(n__cons(V1,V2)) >= Marked_and(isNat(activate(V1)),
                                       n__isNatList(activate(V2))) ;
  Marked_isNatIList(n__cons(V1,V2)) >= Marked_and(isNat(activate(V1)),
                                        n__isNatIList(activate(V2))) ;
 }
 + Disjunctions:{ 
{
  Marked_activate(n__isNatIList(X)) > Marked_isNatIList(X) ;
 }
{
  Marked_activate(n__isNatList(X)) > Marked_isNatList(X) ;
 }
{
  Marked_and(tt,X) > Marked_activate(X) ;
 }
{
  Marked_isNatList(n__cons(V1,V2)) > Marked_and(isNat(activate(V1)),
                                      n__isNatList(activate(V2))) ;
 }
{
  Marked_isNatIList(n__cons(V1,V2)) > Marked_and(isNat(activate(V1)),
                                       n__isNatIList(activate(V2))) ;
 }
 } 
=== TIMER virtual : 10.000000 ===
Entering poly_solver
Starting Sat solver initialization
Calling Sat solver...
=== STOPING TIMER virtual ===
=== TIMER real : 10.000000 ===
=== STOPING TIMER real ===
Sat solver returned
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
No solution found for these parameters.
Entering rpo_solver
=== TIMER virtual : 25.000000 ===
Search parameters: AFS type: 2 ; time limit: 25.. 
=== STOPING TIMER virtual ===
Time out for these parameters.
=== TIMER virtual : 15.000000 ===
Entering poly_solver
Starting Sat solver initialization
Calling Sat solver...
=== STOPING TIMER virtual ===
=== TIMER real : 15.000000 ===
=== STOPING TIMER real ===
Sat solver returned
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
No solution found for these parameters.
=== TIMER virtual : 50.000000 ===
trying sub matrices of size: 1
Matrix interpretation constraints generated.
Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. 
Termination constraints generated.
Starting Sat solver initialization
Calling Sat solver...
=== STOPING TIMER virtual ===
=== TIMER real : 50.000000 ===
=== STOPING TIMER real ===
Sat timeout reached
=== STOPING TIMER virtual ===
No solution found for these parameters.
No solution found for these constraints.
APPLY CRITERIA (ID_CRIT)
APPLY CRITERIA (Graph splitting)
Found 0 components:
NOT SOLVED
No proof found
Cime worked for 174.345591 seconds (real time)
Cime Exit Status: 0