- : unit = () - : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] zeros -> cons(0,n__zeros) [2] U11(tt) -> tt [3] U21(tt) -> tt [4] U31(tt) -> tt [5] U41(tt,V2) -> U42(isNatIList(activate(V2))) [6] U42(tt) -> tt [7] U51(tt,V2) -> U52(isNatList(activate(V2))) [8] U52(tt) -> tt [9] U61(tt,V2) -> U62(isNatIList(activate(V2))) [10] U62(tt) -> tt [11] U71(tt,L,N) -> U72(isNat(activate(N)),activate(L)) [12] U72(tt,L) -> s(length(activate(L))) [13] U81(tt) -> nil [14] U91(tt,IL,M,N) -> U92(isNat(activate(M)),activate(IL),activate(M),activate(N)) [15] U92(tt,IL,M,N) -> U93(isNat(activate(N)),activate(IL),activate(M),activate(N)) [16] U93(tt,IL,M,N) -> cons(activate(N),n__take(activate(M),activate(IL))) [17] isNat(n__0) -> tt [18] isNat(n__length(V1)) -> U11(isNatList(activate(V1))) [19] isNat(n__s(V1)) -> U21(isNat(activate(V1))) [20] isNatIList(V) -> U31(isNatList(activate(V))) [21] isNatIList(n__zeros) -> tt [22] isNatIList(n__cons(V1,V2)) -> U41(isNat(activate(V1)),activate(V2)) [23] isNatList(n__nil) -> tt [24] isNatList(n__cons(V1,V2)) -> U51(isNat(activate(V1)),activate(V2)) [25] isNatList(n__take(V1,V2)) -> U61(isNat(activate(V1)),activate(V2)) [26] length(nil) -> 0 [27] length(cons(N,L)) -> U71(isNatList(activate(L)),activate(L),N) [28] take(0,IL) -> U81(isNatIList(IL)) [29] take(s(M),cons(N,IL)) -> U91(isNatIList(activate(IL)),activate(IL),M,N) [30] zeros -> n__zeros [31] take(X1,X2) -> n__take(X1,X2) [32] 0 -> n__0 [33] length(X) -> n__length(X) [34] s(X) -> n__s(X) [35] cons(X1,X2) -> n__cons(X1,X2) [36] nil -> n__nil [37] activate(n__zeros) -> zeros [38] activate(n__take(X1,X2)) -> take(X1,X2) [39] activate(n__0) -> 0 [40] activate(n__length(X)) -> length(X) [41] activate(n__s(X)) -> s(X) [42] activate(n__cons(X1,X2)) -> cons(X1,X2) [43] activate(n__nil) -> nil [44] activate(X) -> X Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) 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 ; U11(tt) >= tt ; U21(tt) >= tt ; U31(tt) >= tt ; U42(tt) >= tt ; isNatIList(n__zeros) >= tt ; isNatIList(n__cons(V1,V2)) >= U41(isNat(activate(V1)),activate(V2)) ; isNatIList(V) >= U31(isNatList(activate(V))) ; 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__cons(X1,X2)) >= cons(X1,X2) ; activate(n__nil) >= nil ; activate(X) >= X ; U41(tt,V2) >= U42(isNatIList(activate(V2))) ; U52(tt) >= tt ; isNatList(n__take(V1,V2)) >= U61(isNat(activate(V1)),activate(V2)) ; isNatList(n__cons(V1,V2)) >= U51(isNat(activate(V1)),activate(V2)) ; isNatList(n__nil) >= tt ; U51(tt,V2) >= U52(isNatList(activate(V2))) ; U62(tt) >= tt ; U61(tt,V2) >= U62(isNatIList(activate(V2))) ; U72(tt,L) >= s(length(activate(L))) ; isNat(n__0) >= tt ; isNat(n__length(V1)) >= U11(isNatList(activate(V1))) ; isNat(n__s(V1)) >= U21(isNat(activate(V1))) ; U71(tt,L,N) >= U72(isNat(activate(N)),activate(L)) ; s(X) >= n__s(X) ; length(cons(N,L)) >= U71(isNatList(activate(L)),activate(L),N) ; length(nil) >= 0 ; length(X) >= n__length(X) ; nil >= n__nil ; U81(tt) >= nil ; U92(tt,IL,M,N) >= U93(isNat(activate(N)),activate(IL),activate(M), activate(N)) ; U91(tt,IL,M,N) >= U92(isNat(activate(M)),activate(IL),activate(M), activate(N)) ; U93(tt,IL,M,N) >= cons(activate(N),n__take(activate(M),activate(IL))) ; take(0,IL) >= U81(isNatIList(IL)) ; take(s(M),cons(N,IL)) >= U91(isNatIList(activate(IL)),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_length(cons(N,L)) >= Marked_activate(L) ; Marked_length(cons(N,L)) >= Marked_U71(isNatList(activate(L)),activate(L),N) ; Marked_length(cons(N,L)) >= Marked_isNatList(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_U91(isNatIList(activate(IL)), activate(IL),M,N) ; Marked_take(s(M),cons(N,IL)) >= Marked_isNatIList(activate(IL)) ; Marked_U91(tt,IL,M,N) >= Marked_activate(N) ; Marked_U91(tt,IL,M,N) >= Marked_activate(IL) ; Marked_U91(tt,IL,M,N) >= Marked_activate(M) ; Marked_U91(tt,IL,M,N) >= Marked_isNat(activate(M)) ; Marked_U91(tt,IL,M,N) >= Marked_U92(isNat(activate(M)),activate(IL), activate(M),activate(N)) ; Marked_isNatIList(n__cons(V1,V2)) >= Marked_activate(V2) ; Marked_isNatIList(n__cons(V1,V2)) >= Marked_activate(V1) ; Marked_isNatIList(n__cons(V1,V2)) >= Marked_isNat(activate(V1)) ; Marked_isNatIList(n__cons(V1,V2)) >= Marked_U41(isNat(activate(V1)), activate(V2)) ; Marked_isNatIList(V) >= Marked_activate(V) ; Marked_isNatIList(V) >= Marked_isNatList(activate(V)) ; Marked_U71(tt,L,N) >= Marked_activate(L) ; Marked_U71(tt,L,N) >= Marked_activate(N) ; Marked_U71(tt,L,N) >= Marked_isNat(activate(N)) ; Marked_U71(tt,L,N) >= Marked_U72(isNat(activate(N)),activate(L)) ; Marked_isNatList(n__take(V1,V2)) >= Marked_activate(V2) ; Marked_isNatList(n__take(V1,V2)) >= Marked_activate(V1) ; Marked_isNatList(n__take(V1,V2)) >= Marked_U61(isNat(activate(V1)), activate(V2)) ; Marked_isNatList(n__take(V1,V2)) >= Marked_isNat(activate(V1)) ; Marked_isNatList(n__cons(V1,V2)) >= Marked_activate(V2) ; Marked_isNatList(n__cons(V1,V2)) >= Marked_activate(V1) ; Marked_isNatList(n__cons(V1,V2)) >= Marked_isNat(activate(V1)) ; Marked_isNatList(n__cons(V1,V2)) >= Marked_U51(isNat(activate(V1)), activate(V2)) ; Marked_U61(tt,V2) >= Marked_activate(V2) ; Marked_U61(tt,V2) >= Marked_isNatIList(activate(V2)) ; 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_U51(tt,V2) >= Marked_activate(V2) ; Marked_U51(tt,V2) >= Marked_isNatList(activate(V2)) ; Marked_U41(tt,V2) >= Marked_activate(V2) ; Marked_U41(tt,V2) >= Marked_isNatIList(activate(V2)) ; Marked_U93(tt,IL,M,N) >= Marked_activate(N) ; Marked_U93(tt,IL,M,N) >= Marked_activate(IL) ; Marked_U93(tt,IL,M,N) >= Marked_activate(M) ; Marked_U92(tt,IL,M,N) >= Marked_activate(N) ; Marked_U92(tt,IL,M,N) >= Marked_activate(IL) ; Marked_U92(tt,IL,M,N) >= Marked_activate(M) ; Marked_U92(tt,IL,M,N) >= Marked_isNat(activate(N)) ; Marked_U92(tt,IL,M,N) >= Marked_U93(isNat(activate(N)),activate(IL), activate(M),activate(N)) ; Marked_U72(tt,L) >= Marked_activate(L) ; Marked_U72(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_length(cons(N,L)) > Marked_activate(L) ; } { Marked_length(cons(N,L)) > Marked_U71(isNatList(activate(L)),activate(L),N) ; } { Marked_length(cons(N,L)) > Marked_isNatList(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_U91(isNatIList(activate(IL)), activate(IL),M,N) ; } { Marked_take(s(M),cons(N,IL)) > Marked_isNatIList(activate(IL)) ; } { Marked_U91(tt,IL,M,N) > Marked_activate(N) ; } { Marked_U91(tt,IL,M,N) > Marked_activate(IL) ; } { Marked_U91(tt,IL,M,N) > Marked_activate(M) ; } { Marked_U91(tt,IL,M,N) > Marked_isNat(activate(M)) ; } { Marked_U91(tt,IL,M,N) > Marked_U92(isNat(activate(M)),activate(IL), activate(M),activate(N)) ; } { Marked_isNatIList(n__cons(V1,V2)) > Marked_activate(V2) ; } { Marked_isNatIList(n__cons(V1,V2)) > Marked_activate(V1) ; } { Marked_isNatIList(n__cons(V1,V2)) > Marked_isNat(activate(V1)) ; } { Marked_isNatIList(n__cons(V1,V2)) > Marked_U41(isNat(activate(V1)), activate(V2)) ; } { Marked_isNatIList(V) > Marked_activate(V) ; } { Marked_isNatIList(V) > Marked_isNatList(activate(V)) ; } { Marked_U71(tt,L,N) > Marked_activate(L) ; } { Marked_U71(tt,L,N) > Marked_activate(N) ; } { Marked_U71(tt,L,N) > Marked_isNat(activate(N)) ; } { Marked_U71(tt,L,N) > Marked_U72(isNat(activate(N)),activate(L)) ; } { Marked_isNatList(n__take(V1,V2)) > Marked_activate(V2) ; } { Marked_isNatList(n__take(V1,V2)) > Marked_activate(V1) ; } { Marked_isNatList(n__take(V1,V2)) > Marked_U61(isNat(activate(V1)), activate(V2)) ; } { Marked_isNatList(n__take(V1,V2)) > Marked_isNat(activate(V1)) ; } { Marked_isNatList(n__cons(V1,V2)) > Marked_activate(V2) ; } { Marked_isNatList(n__cons(V1,V2)) > Marked_activate(V1) ; } { Marked_isNatList(n__cons(V1,V2)) > Marked_isNat(activate(V1)) ; } { Marked_isNatList(n__cons(V1,V2)) > Marked_U51(isNat(activate(V1)), activate(V2)) ; } { Marked_U61(tt,V2) > Marked_activate(V2) ; } { Marked_U61(tt,V2) > Marked_isNatIList(activate(V2)) ; } { 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_U51(tt,V2) > Marked_activate(V2) ; } { Marked_U51(tt,V2) > Marked_isNatList(activate(V2)) ; } { Marked_U41(tt,V2) > Marked_activate(V2) ; } { Marked_U41(tt,V2) > Marked_isNatIList(activate(V2)) ; } { Marked_U93(tt,IL,M,N) > Marked_activate(N) ; } { Marked_U93(tt,IL,M,N) > Marked_activate(IL) ; } { Marked_U93(tt,IL,M,N) > Marked_activate(M) ; } { Marked_U92(tt,IL,M,N) > Marked_activate(N) ; } { Marked_U92(tt,IL,M,N) > Marked_activate(IL) ; } { Marked_U92(tt,IL,M,N) > Marked_activate(M) ; } { Marked_U92(tt,IL,M,N) > Marked_isNat(activate(N)) ; } { Marked_U92(tt,IL,M,N) > Marked_U93(isNat(activate(N)),activate(IL), activate(M),activate(N)) ; } { Marked_U72(tt,L) > Marked_activate(L) ; } { Marked_U72(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: U11(tt) >= tt constraint: U21(tt) >= tt constraint: U31(tt) >= tt constraint: U42(tt) >= tt constraint: isNatIList(n__zeros) >= tt constraint: isNatIList(n__cons(V1,V2)) >= U41(isNat(activate(V1)),activate(V2)) constraint: isNatIList(V) >= U31(isNatList(activate(V))) 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__cons(X1,X2)) >= cons(X1,X2) constraint: activate(n__nil) >= nil constraint: activate(X) >= X constraint: U41(tt,V2) >= U42(isNatIList(activate(V2))) constraint: U52(tt) >= tt constraint: isNatList(n__take(V1,V2)) >= U61(isNat(activate(V1)),activate(V2)) constraint: isNatList(n__cons(V1,V2)) >= U51(isNat(activate(V1)),activate(V2)) constraint: isNatList(n__nil) >= tt constraint: U51(tt,V2) >= U52(isNatList(activate(V2))) constraint: U62(tt) >= tt constraint: U61(tt,V2) >= U62(isNatIList(activate(V2))) constraint: U72(tt,L) >= s(length(activate(L))) constraint: isNat(n__0) >= tt constraint: isNat(n__length(V1)) >= U11(isNatList(activate(V1))) constraint: isNat(n__s(V1)) >= U21(isNat(activate(V1))) constraint: U71(tt,L,N) >= U72(isNat(activate(N)),activate(L)) constraint: s(X) >= n__s(X) constraint: length(cons(N,L)) >= U71(isNatList(activate(L)),activate(L),N) constraint: length(nil) >= 0 constraint: length(X) >= n__length(X) constraint: nil >= n__nil constraint: U81(tt) >= nil constraint: U92(tt,IL,M,N) >= U93(isNat(activate(N)),activate(IL),activate(M), activate(N)) constraint: U91(tt,IL,M,N) >= U92(isNat(activate(M)),activate(IL),activate(M), activate(N)) constraint: U93(tt,IL,M,N) >= cons(activate(N), n__take(activate(M),activate(IL))) constraint: take(0,IL) >= U81(isNatIList(IL)) constraint: take(s(M),cons(N,IL)) >= U91(isNatIList(activate(IL)),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_length(cons(N,L)) >= Marked_activate(L) constraint: Marked_length(cons(N,L)) >= Marked_U71(isNatList(activate(L)), activate(L),N) constraint: Marked_length(cons(N,L)) >= Marked_isNatList(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_U91(isNatIList(activate(IL)), activate(IL),M,N) constraint: Marked_take(s(M),cons(N,IL)) >= Marked_isNatIList(activate(IL)) constraint: Marked_U91(tt,IL,M,N) >= Marked_activate(N) constraint: Marked_U91(tt,IL,M,N) >= Marked_activate(IL) constraint: Marked_U91(tt,IL,M,N) >= Marked_activate(M) constraint: Marked_U91(tt,IL,M,N) >= Marked_isNat(activate(M)) constraint: Marked_U91(tt,IL,M,N) >= Marked_U92(isNat(activate(M)), activate(IL),activate(M),activate(N)) constraint: Marked_isNatIList(n__cons(V1,V2)) >= Marked_activate(V2) constraint: Marked_isNatIList(n__cons(V1,V2)) >= Marked_activate(V1) constraint: Marked_isNatIList(n__cons(V1,V2)) >= Marked_isNat(activate(V1)) constraint: Marked_isNatIList(n__cons(V1,V2)) >= Marked_U41(isNat(activate(V1)), activate(V2)) constraint: Marked_isNatIList(V) >= Marked_activate(V) constraint: Marked_isNatIList(V) >= Marked_isNatList(activate(V)) constraint: Marked_U71(tt,L,N) >= Marked_activate(L) constraint: Marked_U71(tt,L,N) >= Marked_activate(N) constraint: Marked_U71(tt,L,N) >= Marked_isNat(activate(N)) constraint: Marked_U71(tt,L,N) >= Marked_U72(isNat(activate(N)),activate(L)) constraint: Marked_isNatList(n__take(V1,V2)) >= Marked_activate(V2) constraint: Marked_isNatList(n__take(V1,V2)) >= Marked_activate(V1) constraint: Marked_isNatList(n__take(V1,V2)) >= Marked_U61(isNat(activate(V1)), activate(V2)) constraint: Marked_isNatList(n__take(V1,V2)) >= Marked_isNat(activate(V1)) constraint: Marked_isNatList(n__cons(V1,V2)) >= Marked_activate(V2) constraint: Marked_isNatList(n__cons(V1,V2)) >= Marked_activate(V1) constraint: Marked_isNatList(n__cons(V1,V2)) >= Marked_isNat(activate(V1)) constraint: Marked_isNatList(n__cons(V1,V2)) >= Marked_U51(isNat(activate(V1)), activate(V2)) constraint: Marked_U61(tt,V2) >= Marked_activate(V2) constraint: Marked_U61(tt,V2) >= Marked_isNatIList(activate(V2)) 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_U51(tt,V2) >= Marked_activate(V2) constraint: Marked_U51(tt,V2) >= Marked_isNatList(activate(V2)) constraint: Marked_U41(tt,V2) >= Marked_activate(V2) constraint: Marked_U41(tt,V2) >= Marked_isNatIList(activate(V2)) constraint: Marked_U93(tt,IL,M,N) >= Marked_activate(N) constraint: Marked_U93(tt,IL,M,N) >= Marked_activate(IL) constraint: Marked_U93(tt,IL,M,N) >= Marked_activate(M) constraint: Marked_U92(tt,IL,M,N) >= Marked_activate(N) constraint: Marked_U92(tt,IL,M,N) >= Marked_activate(IL) constraint: Marked_U92(tt,IL,M,N) >= Marked_activate(M) constraint: Marked_U92(tt,IL,M,N) >= Marked_isNat(activate(N)) constraint: Marked_U92(tt,IL,M,N) >= Marked_U93(isNat(activate(N)), activate(IL),activate(M),activate(N)) constraint: Marked_U72(tt,L) >= Marked_activate(L) constraint: Marked_U72(tt,L) >= Marked_length(activate(L)) APPLY CRITERIA (Graph splitting) Found 2 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> } APPLY CRITERIA (Subterm criterion) 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 ; U11(tt) >= tt ; U21(tt) >= tt ; U31(tt) >= tt ; U42(tt) >= tt ; isNatIList(n__zeros) >= tt ; isNatIList(n__cons(V1,V2)) >= U41(isNat(activate(V1)),activate(V2)) ; isNatIList(V) >= U31(isNatList(activate(V))) ; 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__cons(X1,X2)) >= cons(X1,X2) ; activate(n__nil) >= nil ; activate(X) >= X ; U41(tt,V2) >= U42(isNatIList(activate(V2))) ; U52(tt) >= tt ; isNatList(n__take(V1,V2)) >= U61(isNat(activate(V1)),activate(V2)) ; isNatList(n__cons(V1,V2)) >= U51(isNat(activate(V1)),activate(V2)) ; isNatList(n__nil) >= tt ; U51(tt,V2) >= U52(isNatList(activate(V2))) ; U62(tt) >= tt ; U61(tt,V2) >= U62(isNatIList(activate(V2))) ; U72(tt,L) >= s(length(activate(L))) ; isNat(n__0) >= tt ; isNat(n__length(V1)) >= U11(isNatList(activate(V1))) ; isNat(n__s(V1)) >= U21(isNat(activate(V1))) ; U71(tt,L,N) >= U72(isNat(activate(N)),activate(L)) ; s(X) >= n__s(X) ; length(cons(N,L)) >= U71(isNatList(activate(L)),activate(L),N) ; length(nil) >= 0 ; length(X) >= n__length(X) ; nil >= n__nil ; U81(tt) >= nil ; U92(tt,IL,M,N) >= U93(isNat(activate(N)),activate(IL),activate(M), activate(N)) ; U91(tt,IL,M,N) >= U92(isNat(activate(M)),activate(IL),activate(M), activate(N)) ; U93(tt,IL,M,N) >= cons(activate(N),n__take(activate(M),activate(IL))) ; take(0,IL) >= U81(isNatIList(IL)) ; take(s(M),cons(N,IL)) >= U91(isNatIList(activate(IL)),activate(IL),M,N) ; take(X1,X2) >= n__take(X1,X2) ; 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_take(s(M),cons(N,IL)) >= Marked_U91(isNatIList(activate(IL)), activate(IL),M,N) ; Marked_take(s(M),cons(N,IL)) >= Marked_isNatIList(activate(IL)) ; Marked_U91(tt,IL,M,N) >= Marked_activate(N) ; Marked_U91(tt,IL,M,N) >= Marked_activate(IL) ; Marked_U91(tt,IL,M,N) >= Marked_activate(M) ; Marked_U91(tt,IL,M,N) >= Marked_isNat(activate(M)) ; Marked_U91(tt,IL,M,N) >= Marked_U92(isNat(activate(M)),activate(IL), activate(M),activate(N)) ; Marked_isNatIList(n__cons(V1,V2)) >= Marked_activate(V2) ; Marked_isNatIList(n__cons(V1,V2)) >= Marked_activate(V1) ; Marked_isNatIList(n__cons(V1,V2)) >= Marked_isNat(activate(V1)) ; Marked_isNatIList(n__cons(V1,V2)) >= Marked_U41(isNat(activate(V1)), activate(V2)) ; Marked_isNatIList(V) >= Marked_activate(V) ; Marked_isNatIList(V) >= Marked_isNatList(activate(V)) ; Marked_isNatList(n__take(V1,V2)) >= Marked_activate(V2) ; Marked_isNatList(n__take(V1,V2)) >= Marked_activate(V1) ; Marked_isNatList(n__take(V1,V2)) >= Marked_U61(isNat(activate(V1)), activate(V2)) ; Marked_isNatList(n__take(V1,V2)) >= Marked_isNat(activate(V1)) ; Marked_isNatList(n__cons(V1,V2)) >= Marked_activate(V2) ; Marked_isNatList(n__cons(V1,V2)) >= Marked_activate(V1) ; Marked_isNatList(n__cons(V1,V2)) >= Marked_isNat(activate(V1)) ; Marked_isNatList(n__cons(V1,V2)) >= Marked_U51(isNat(activate(V1)), activate(V2)) ; Marked_U61(tt,V2) >= Marked_activate(V2) ; Marked_U61(tt,V2) >= Marked_isNatIList(activate(V2)) ; Marked_isNat(n__s(V1)) >= Marked_activate(V1) ; Marked_isNat(n__s(V1)) >= Marked_isNat(activate(V1)) ; Marked_U51(tt,V2) >= Marked_activate(V2) ; Marked_U51(tt,V2) >= Marked_isNatList(activate(V2)) ; Marked_U41(tt,V2) >= Marked_activate(V2) ; Marked_U41(tt,V2) >= Marked_isNatIList(activate(V2)) ; Marked_U93(tt,IL,M,N) >= Marked_activate(N) ; Marked_U93(tt,IL,M,N) >= Marked_activate(IL) ; Marked_U93(tt,IL,M,N) >= Marked_activate(M) ; Marked_U92(tt,IL,M,N) >= Marked_activate(N) ; Marked_U92(tt,IL,M,N) >= Marked_activate(IL) ; Marked_U92(tt,IL,M,N) >= Marked_activate(M) ; Marked_U92(tt,IL,M,N) >= Marked_isNat(activate(N)) ; Marked_U92(tt,IL,M,N) >= Marked_U93(isNat(activate(N)),activate(IL), activate(M),activate(N)) ; } + Disjunctions:{ { 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_take(s(M),cons(N,IL)) > Marked_U91(isNatIList(activate(IL)), activate(IL),M,N) ; } { Marked_take(s(M),cons(N,IL)) > Marked_isNatIList(activate(IL)) ; } { Marked_U91(tt,IL,M,N) > Marked_activate(N) ; } { Marked_U91(tt,IL,M,N) > Marked_activate(IL) ; } { Marked_U91(tt,IL,M,N) > Marked_activate(M) ; } { Marked_U91(tt,IL,M,N) > Marked_isNat(activate(M)) ; } { Marked_U91(tt,IL,M,N) > Marked_U92(isNat(activate(M)),activate(IL), activate(M),activate(N)) ; } { Marked_isNatIList(n__cons(V1,V2)) > Marked_activate(V2) ; } { Marked_isNatIList(n__cons(V1,V2)) > Marked_activate(V1) ; } { Marked_isNatIList(n__cons(V1,V2)) > Marked_isNat(activate(V1)) ; } { Marked_isNatIList(n__cons(V1,V2)) > Marked_U41(isNat(activate(V1)), activate(V2)) ; } { Marked_isNatIList(V) > Marked_activate(V) ; } { Marked_isNatIList(V) > Marked_isNatList(activate(V)) ; } { Marked_isNatList(n__take(V1,V2)) > Marked_activate(V2) ; } { Marked_isNatList(n__take(V1,V2)) > Marked_activate(V1) ; } { Marked_isNatList(n__take(V1,V2)) > Marked_U61(isNat(activate(V1)), activate(V2)) ; } { Marked_isNatList(n__take(V1,V2)) > Marked_isNat(activate(V1)) ; } { Marked_isNatList(n__cons(V1,V2)) > Marked_activate(V2) ; } { Marked_isNatList(n__cons(V1,V2)) > Marked_activate(V1) ; } { Marked_isNatList(n__cons(V1,V2)) > Marked_isNat(activate(V1)) ; } { Marked_isNatList(n__cons(V1,V2)) > Marked_U51(isNat(activate(V1)), activate(V2)) ; } { Marked_U61(tt,V2) > Marked_activate(V2) ; } { Marked_U61(tt,V2) > Marked_isNatIList(activate(V2)) ; } { Marked_isNat(n__s(V1)) > Marked_activate(V1) ; } { Marked_isNat(n__s(V1)) > Marked_isNat(activate(V1)) ; } { Marked_U51(tt,V2) > Marked_activate(V2) ; } { Marked_U51(tt,V2) > Marked_isNatList(activate(V2)) ; } { Marked_U41(tt,V2) > Marked_activate(V2) ; } { Marked_U41(tt,V2) > Marked_isNatIList(activate(V2)) ; } { Marked_U93(tt,IL,M,N) > Marked_activate(N) ; } { Marked_U93(tt,IL,M,N) > Marked_activate(IL) ; } { Marked_U93(tt,IL,M,N) > Marked_activate(M) ; } { Marked_U92(tt,IL,M,N) > Marked_activate(N) ; } { Marked_U92(tt,IL,M,N) > Marked_activate(IL) ; } { Marked_U92(tt,IL,M,N) > Marked_activate(M) ; } { Marked_U92(tt,IL,M,N) > Marked_isNat(activate(N)) ; } { Marked_U92(tt,IL,M,N) > Marked_U93(isNat(activate(N)),activate(IL), activate(M),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: U11(tt) >= tt constraint: U21(tt) >= tt constraint: U31(tt) >= tt constraint: U42(tt) >= tt constraint: isNatIList(n__zeros) >= tt constraint: isNatIList(n__cons(V1,V2)) >= U41(isNat(activate(V1)),activate(V2)) constraint: isNatIList(V) >= U31(isNatList(activate(V))) 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__cons(X1,X2)) >= cons(X1,X2) constraint: activate(n__nil) >= nil constraint: activate(X) >= X constraint: U41(tt,V2) >= U42(isNatIList(activate(V2))) constraint: U52(tt) >= tt constraint: isNatList(n__take(V1,V2)) >= U61(isNat(activate(V1)),activate(V2)) constraint: isNatList(n__cons(V1,V2)) >= U51(isNat(activate(V1)),activate(V2)) constraint: isNatList(n__nil) >= tt constraint: U51(tt,V2) >= U52(isNatList(activate(V2))) constraint: U62(tt) >= tt constraint: U61(tt,V2) >= U62(isNatIList(activate(V2))) constraint: U72(tt,L) >= s(length(activate(L))) constraint: isNat(n__0) >= tt constraint: isNat(n__length(V1)) >= U11(isNatList(activate(V1))) constraint: isNat(n__s(V1)) >= U21(isNat(activate(V1))) constraint: U71(tt,L,N) >= U72(isNat(activate(N)),activate(L)) constraint: s(X) >= n__s(X) constraint: length(cons(N,L)) >= U71(isNatList(activate(L)),activate(L),N) constraint: length(nil) >= 0 constraint: length(X) >= n__length(X) constraint: nil >= n__nil constraint: U81(tt) >= nil constraint: U92(tt,IL,M,N) >= U93(isNat(activate(N)),activate(IL),activate(M), activate(N)) constraint: U91(tt,IL,M,N) >= U92(isNat(activate(M)),activate(IL),activate(M), activate(N)) constraint: U93(tt,IL,M,N) >= cons(activate(N), n__take(activate(M),activate(IL))) constraint: take(0,IL) >= U81(isNatIList(IL)) constraint: take(s(M),cons(N,IL)) >= U91(isNatIList(activate(IL)),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_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_U91(isNatIList(activate(IL)), activate(IL),M,N) constraint: Marked_take(s(M),cons(N,IL)) >= Marked_isNatIList(activate(IL)) constraint: Marked_U91(tt,IL,M,N) >= Marked_activate(N) constraint: Marked_U91(tt,IL,M,N) >= Marked_activate(IL) constraint: Marked_U91(tt,IL,M,N) >= Marked_activate(M) constraint: Marked_U91(tt,IL,M,N) >= Marked_isNat(activate(M)) constraint: Marked_U91(tt,IL,M,N) >= Marked_U92(isNat(activate(M)), activate(IL),activate(M),activate(N)) constraint: Marked_isNatIList(n__cons(V1,V2)) >= Marked_activate(V2) constraint: Marked_isNatIList(n__cons(V1,V2)) >= Marked_activate(V1) constraint: Marked_isNatIList(n__cons(V1,V2)) >= Marked_isNat(activate(V1)) constraint: Marked_isNatIList(n__cons(V1,V2)) >= Marked_U41(isNat(activate(V1)), activate(V2)) constraint: Marked_isNatIList(V) >= Marked_activate(V) constraint: Marked_isNatIList(V) >= Marked_isNatList(activate(V)) constraint: Marked_isNatList(n__take(V1,V2)) >= Marked_activate(V2) constraint: Marked_isNatList(n__take(V1,V2)) >= Marked_activate(V1) constraint: Marked_isNatList(n__take(V1,V2)) >= Marked_U61(isNat(activate(V1)), activate(V2)) constraint: Marked_isNatList(n__take(V1,V2)) >= Marked_isNat(activate(V1)) constraint: Marked_isNatList(n__cons(V1,V2)) >= Marked_activate(V2) constraint: Marked_isNatList(n__cons(V1,V2)) >= Marked_activate(V1) constraint: Marked_isNatList(n__cons(V1,V2)) >= Marked_isNat(activate(V1)) constraint: Marked_isNatList(n__cons(V1,V2)) >= Marked_U51(isNat(activate(V1)), activate(V2)) constraint: Marked_U61(tt,V2) >= Marked_activate(V2) constraint: Marked_U61(tt,V2) >= Marked_isNatIList(activate(V2)) constraint: Marked_isNat(n__s(V1)) >= Marked_activate(V1) constraint: Marked_isNat(n__s(V1)) >= Marked_isNat(activate(V1)) constraint: Marked_U51(tt,V2) >= Marked_activate(V2) constraint: Marked_U51(tt,V2) >= Marked_isNatList(activate(V2)) constraint: Marked_U41(tt,V2) >= Marked_activate(V2) constraint: Marked_U41(tt,V2) >= Marked_isNatIList(activate(V2)) constraint: Marked_U93(tt,IL,M,N) >= Marked_activate(N) constraint: Marked_U93(tt,IL,M,N) >= Marked_activate(IL) constraint: Marked_U93(tt,IL,M,N) >= Marked_activate(M) constraint: Marked_U92(tt,IL,M,N) >= Marked_activate(N) constraint: Marked_U92(tt,IL,M,N) >= Marked_activate(IL) constraint: Marked_U92(tt,IL,M,N) >= Marked_activate(M) constraint: Marked_U92(tt,IL,M,N) >= Marked_isNat(activate(N)) constraint: Marked_U92(tt,IL,M,N) >= Marked_U93(isNat(activate(N)), activate(IL),activate(M),activate(N)) APPLY CRITERIA (Subterm criterion) 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 ; U11(tt) >= tt ; U21(tt) >= tt ; U31(tt) >= tt ; U42(tt) >= tt ; isNatIList(n__zeros) >= tt ; isNatIList(n__cons(V1,V2)) >= U41(isNat(activate(V1)),activate(V2)) ; isNatIList(V) >= U31(isNatList(activate(V))) ; 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__cons(X1,X2)) >= cons(X1,X2) ; activate(n__nil) >= nil ; activate(X) >= X ; U41(tt,V2) >= U42(isNatIList(activate(V2))) ; U52(tt) >= tt ; isNatList(n__take(V1,V2)) >= U61(isNat(activate(V1)),activate(V2)) ; isNatList(n__cons(V1,V2)) >= U51(isNat(activate(V1)),activate(V2)) ; isNatList(n__nil) >= tt ; U51(tt,V2) >= U52(isNatList(activate(V2))) ; U62(tt) >= tt ; U61(tt,V2) >= U62(isNatIList(activate(V2))) ; U72(tt,L) >= s(length(activate(L))) ; isNat(n__0) >= tt ; isNat(n__length(V1)) >= U11(isNatList(activate(V1))) ; isNat(n__s(V1)) >= U21(isNat(activate(V1))) ; U71(tt,L,N) >= U72(isNat(activate(N)),activate(L)) ; s(X) >= n__s(X) ; length(cons(N,L)) >= U71(isNatList(activate(L)),activate(L),N) ; length(nil) >= 0 ; length(X) >= n__length(X) ; nil >= n__nil ; U81(tt) >= nil ; U92(tt,IL,M,N) >= U93(isNat(activate(N)),activate(IL),activate(M), activate(N)) ; U91(tt,IL,M,N) >= U92(isNat(activate(M)),activate(IL),activate(M), activate(N)) ; U93(tt,IL,M,N) >= cons(activate(N),n__take(activate(M),activate(IL))) ; take(0,IL) >= U81(isNatIList(IL)) ; take(s(M),cons(N,IL)) >= U91(isNatIList(activate(IL)),activate(IL),M,N) ; take(X1,X2) >= n__take(X1,X2) ; Marked_length(cons(N,L)) >= Marked_U71(isNatList(activate(L)),activate(L),N) ; Marked_U71(tt,L,N) >= Marked_U72(isNat(activate(N)),activate(L)) ; Marked_U72(tt,L) >= Marked_length(activate(L)) ; } + Disjunctions:{ { Marked_length(cons(N,L)) > Marked_U71(isNatList(activate(L)),activate(L),N) ; } { Marked_U71(tt,L,N) > Marked_U72(isNat(activate(N)),activate(L)) ; } { Marked_U72(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: U11(tt) >= tt constraint: U21(tt) >= tt constraint: U31(tt) >= tt constraint: U42(tt) >= tt constraint: isNatIList(n__zeros) >= tt constraint: isNatIList(n__cons(V1,V2)) >= U41(isNat(activate(V1)),activate(V2)) constraint: isNatIList(V) >= U31(isNatList(activate(V))) 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__cons(X1,X2)) >= cons(X1,X2) constraint: activate(n__nil) >= nil constraint: activate(X) >= X constraint: U41(tt,V2) >= U42(isNatIList(activate(V2))) constraint: U52(tt) >= tt constraint: isNatList(n__take(V1,V2)) >= U61(isNat(activate(V1)),activate(V2)) constraint: isNatList(n__cons(V1,V2)) >= U51(isNat(activate(V1)),activate(V2)) constraint: isNatList(n__nil) >= tt constraint: U51(tt,V2) >= U52(isNatList(activate(V2))) constraint: U62(tt) >= tt constraint: U61(tt,V2) >= U62(isNatIList(activate(V2))) constraint: U72(tt,L) >= s(length(activate(L))) constraint: isNat(n__0) >= tt constraint: isNat(n__length(V1)) >= U11(isNatList(activate(V1))) constraint: isNat(n__s(V1)) >= U21(isNat(activate(V1))) constraint: U71(tt,L,N) >= U72(isNat(activate(N)),activate(L)) constraint: s(X) >= n__s(X) constraint: length(cons(N,L)) >= U71(isNatList(activate(L)),activate(L),N) constraint: length(nil) >= 0 constraint: length(X) >= n__length(X) constraint: nil >= n__nil constraint: U81(tt) >= nil constraint: U92(tt,IL,M,N) >= U93(isNat(activate(N)),activate(IL),activate(M), activate(N)) constraint: U91(tt,IL,M,N) >= U92(isNat(activate(M)),activate(IL),activate(M), activate(N)) constraint: U93(tt,IL,M,N) >= cons(activate(N), n__take(activate(M),activate(IL))) constraint: take(0,IL) >= U81(isNatIList(IL)) constraint: take(s(M),cons(N,IL)) >= U91(isNatIList(activate(IL)),activate(IL), M,N) constraint: take(X1,X2) >= n__take(X1,X2) constraint: Marked_length(cons(N,L)) >= Marked_U71(isNatList(activate(L)), activate(L),N) constraint: Marked_U71(tt,L,N) >= Marked_U72(isNat(activate(N)),activate(L)) constraint: Marked_U72(tt,L) >= Marked_length(activate(L)) APPLY CRITERIA (Graph splitting) Found 2 components: { --> --> --> --> --> --> --> --> --> --> --> } { --> } APPLY CRITERIA (Subterm criterion) 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 ; U11(tt) >= tt ; U21(tt) >= tt ; U31(tt) >= tt ; U42(tt) >= tt ; isNatIList(n__zeros) >= tt ; isNatIList(n__cons(V1,V2)) >= U41(isNat(activate(V1)),activate(V2)) ; isNatIList(V) >= U31(isNatList(activate(V))) ; 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__cons(X1,X2)) >= cons(X1,X2) ; activate(n__nil) >= nil ; activate(X) >= X ; U41(tt,V2) >= U42(isNatIList(activate(V2))) ; U52(tt) >= tt ; isNatList(n__take(V1,V2)) >= U61(isNat(activate(V1)),activate(V2)) ; isNatList(n__cons(V1,V2)) >= U51(isNat(activate(V1)),activate(V2)) ; isNatList(n__nil) >= tt ; U51(tt,V2) >= U52(isNatList(activate(V2))) ; U62(tt) >= tt ; U61(tt,V2) >= U62(isNatIList(activate(V2))) ; U72(tt,L) >= s(length(activate(L))) ; isNat(n__0) >= tt ; isNat(n__length(V1)) >= U11(isNatList(activate(V1))) ; isNat(n__s(V1)) >= U21(isNat(activate(V1))) ; U71(tt,L,N) >= U72(isNat(activate(N)),activate(L)) ; s(X) >= n__s(X) ; length(cons(N,L)) >= U71(isNatList(activate(L)),activate(L),N) ; length(nil) >= 0 ; length(X) >= n__length(X) ; nil >= n__nil ; U81(tt) >= nil ; U92(tt,IL,M,N) >= U93(isNat(activate(N)),activate(IL),activate(M), activate(N)) ; U91(tt,IL,M,N) >= U92(isNat(activate(M)),activate(IL),activate(M), activate(N)) ; U93(tt,IL,M,N) >= cons(activate(N),n__take(activate(M),activate(IL))) ; take(0,IL) >= U81(isNatIList(IL)) ; take(s(M),cons(N,IL)) >= U91(isNatIList(activate(IL)),activate(IL),M,N) ; take(X1,X2) >= n__take(X1,X2) ; Marked_isNatIList(n__cons(V1,V2)) >= Marked_U41(isNat(activate(V1)), activate(V2)) ; Marked_isNatIList(V) >= Marked_isNatList(activate(V)) ; Marked_isNatList(n__take(V1,V2)) >= Marked_U61(isNat(activate(V1)), activate(V2)) ; Marked_isNatList(n__cons(V1,V2)) >= Marked_U51(isNat(activate(V1)), activate(V2)) ; Marked_U61(tt,V2) >= Marked_isNatIList(activate(V2)) ; Marked_U51(tt,V2) >= Marked_isNatList(activate(V2)) ; Marked_U41(tt,V2) >= Marked_isNatIList(activate(V2)) ; } + Disjunctions:{ { Marked_isNatIList(n__cons(V1,V2)) > Marked_U41(isNat(activate(V1)), activate(V2)) ; } { Marked_isNatIList(V) > Marked_isNatList(activate(V)) ; } { Marked_isNatList(n__take(V1,V2)) > Marked_U61(isNat(activate(V1)), activate(V2)) ; } { Marked_isNatList(n__cons(V1,V2)) > Marked_U51(isNat(activate(V1)), activate(V2)) ; } { Marked_U61(tt,V2) > Marked_isNatIList(activate(V2)) ; } { Marked_U51(tt,V2) > Marked_isNatList(activate(V2)) ; } { Marked_U41(tt,V2) > Marked_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: U11(tt) >= tt constraint: U21(tt) >= tt constraint: U31(tt) >= tt constraint: U42(tt) >= tt constraint: isNatIList(n__zeros) >= tt constraint: isNatIList(n__cons(V1,V2)) >= U41(isNat(activate(V1)),activate(V2)) constraint: isNatIList(V) >= U31(isNatList(activate(V))) 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__cons(X1,X2)) >= cons(X1,X2) constraint: activate(n__nil) >= nil constraint: activate(X) >= X constraint: U41(tt,V2) >= U42(isNatIList(activate(V2))) constraint: U52(tt) >= tt constraint: isNatList(n__take(V1,V2)) >= U61(isNat(activate(V1)),activate(V2)) constraint: isNatList(n__cons(V1,V2)) >= U51(isNat(activate(V1)),activate(V2)) constraint: isNatList(n__nil) >= tt constraint: U51(tt,V2) >= U52(isNatList(activate(V2))) constraint: U62(tt) >= tt constraint: U61(tt,V2) >= U62(isNatIList(activate(V2))) constraint: U72(tt,L) >= s(length(activate(L))) constraint: isNat(n__0) >= tt constraint: isNat(n__length(V1)) >= U11(isNatList(activate(V1))) constraint: isNat(n__s(V1)) >= U21(isNat(activate(V1))) constraint: U71(tt,L,N) >= U72(isNat(activate(N)),activate(L)) constraint: s(X) >= n__s(X) constraint: length(cons(N,L)) >= U71(isNatList(activate(L)),activate(L),N) constraint: length(nil) >= 0 constraint: length(X) >= n__length(X) constraint: nil >= n__nil constraint: U81(tt) >= nil constraint: U92(tt,IL,M,N) >= U93(isNat(activate(N)),activate(IL),activate(M), activate(N)) constraint: U91(tt,IL,M,N) >= U92(isNat(activate(M)),activate(IL),activate(M), activate(N)) constraint: U93(tt,IL,M,N) >= cons(activate(N), n__take(activate(M),activate(IL))) constraint: take(0,IL) >= U81(isNatIList(IL)) constraint: take(s(M),cons(N,IL)) >= U91(isNatIList(activate(IL)),activate(IL), M,N) constraint: take(X1,X2) >= n__take(X1,X2) constraint: Marked_isNatIList(n__cons(V1,V2)) >= Marked_U41(isNat(activate(V1)), activate(V2)) constraint: Marked_isNatIList(V) >= Marked_isNatList(activate(V)) constraint: Marked_isNatList(n__take(V1,V2)) >= Marked_U61(isNat(activate(V1)), activate(V2)) constraint: Marked_isNatList(n__cons(V1,V2)) >= Marked_U51(isNat(activate(V1)), activate(V2)) constraint: Marked_U61(tt,V2) >= Marked_isNatIList(activate(V2)) constraint: Marked_U51(tt,V2) >= Marked_isNatList(activate(V2)) constraint: Marked_U41(tt,V2) >= Marked_isNatIList(activate(V2)) APPLY CRITERIA (Subterm criterion) 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 ; U11(tt) >= tt ; U21(tt) >= tt ; U31(tt) >= tt ; U42(tt) >= tt ; isNatIList(n__zeros) >= tt ; isNatIList(n__cons(V1,V2)) >= U41(isNat(activate(V1)),activate(V2)) ; isNatIList(V) >= U31(isNatList(activate(V))) ; 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__cons(X1,X2)) >= cons(X1,X2) ; activate(n__nil) >= nil ; activate(X) >= X ; U41(tt,V2) >= U42(isNatIList(activate(V2))) ; U52(tt) >= tt ; isNatList(n__take(V1,V2)) >= U61(isNat(activate(V1)),activate(V2)) ; isNatList(n__cons(V1,V2)) >= U51(isNat(activate(V1)),activate(V2)) ; isNatList(n__nil) >= tt ; U51(tt,V2) >= U52(isNatList(activate(V2))) ; U62(tt) >= tt ; U61(tt,V2) >= U62(isNatIList(activate(V2))) ; U72(tt,L) >= s(length(activate(L))) ; isNat(n__0) >= tt ; isNat(n__length(V1)) >= U11(isNatList(activate(V1))) ; isNat(n__s(V1)) >= U21(isNat(activate(V1))) ; U71(tt,L,N) >= U72(isNat(activate(N)),activate(L)) ; s(X) >= n__s(X) ; length(cons(N,L)) >= U71(isNatList(activate(L)),activate(L),N) ; length(nil) >= 0 ; length(X) >= n__length(X) ; nil >= n__nil ; U81(tt) >= nil ; U92(tt,IL,M,N) >= U93(isNat(activate(N)),activate(IL),activate(M), activate(N)) ; U91(tt,IL,M,N) >= U92(isNat(activate(M)),activate(IL),activate(M), activate(N)) ; U93(tt,IL,M,N) >= cons(activate(N),n__take(activate(M),activate(IL))) ; take(0,IL) >= U81(isNatIList(IL)) ; take(s(M),cons(N,IL)) >= U91(isNatIList(activate(IL)),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: U11(tt) >= tt constraint: U21(tt) >= tt constraint: U31(tt) >= tt constraint: U42(tt) >= tt constraint: isNatIList(n__zeros) >= tt constraint: isNatIList(n__cons(V1,V2)) >= U41(isNat(activate(V1)),activate(V2)) constraint: isNatIList(V) >= U31(isNatList(activate(V))) 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__cons(X1,X2)) >= cons(X1,X2) constraint: activate(n__nil) >= nil constraint: activate(X) >= X constraint: U41(tt,V2) >= U42(isNatIList(activate(V2))) constraint: U52(tt) >= tt constraint: isNatList(n__take(V1,V2)) >= U61(isNat(activate(V1)),activate(V2)) constraint: isNatList(n__cons(V1,V2)) >= U51(isNat(activate(V1)),activate(V2)) constraint: isNatList(n__nil) >= tt constraint: U51(tt,V2) >= U52(isNatList(activate(V2))) constraint: U62(tt) >= tt constraint: U61(tt,V2) >= U62(isNatIList(activate(V2))) constraint: U72(tt,L) >= s(length(activate(L))) constraint: isNat(n__0) >= tt constraint: isNat(n__length(V1)) >= U11(isNatList(activate(V1))) constraint: isNat(n__s(V1)) >= U21(isNat(activate(V1))) constraint: U71(tt,L,N) >= U72(isNat(activate(N)),activate(L)) constraint: s(X) >= n__s(X) constraint: length(cons(N,L)) >= U71(isNatList(activate(L)),activate(L),N) constraint: length(nil) >= 0 constraint: length(X) >= n__length(X) constraint: nil >= n__nil constraint: U81(tt) >= nil constraint: U92(tt,IL,M,N) >= U93(isNat(activate(N)),activate(IL),activate(M), activate(N)) constraint: U91(tt,IL,M,N) >= U92(isNat(activate(M)),activate(IL),activate(M), activate(N)) constraint: U93(tt,IL,M,N) >= cons(activate(N), n__take(activate(M),activate(IL))) constraint: take(0,IL) >= U81(isNatIList(IL)) constraint: take(s(M),cons(N,IL)) >= U91(isNatIList(activate(IL)),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 2 components: { --> --> } { --> --> } APPLY CRITERIA (Subterm criterion) 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 ; U11(tt) >= tt ; U21(tt) >= tt ; U31(tt) >= tt ; U42(tt) >= tt ; isNatIList(n__zeros) >= tt ; isNatIList(n__cons(V1,V2)) >= U41(isNat(activate(V1)),activate(V2)) ; isNatIList(V) >= U31(isNatList(activate(V))) ; 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__cons(X1,X2)) >= cons(X1,X2) ; activate(n__nil) >= nil ; activate(X) >= X ; U41(tt,V2) >= U42(isNatIList(activate(V2))) ; U52(tt) >= tt ; isNatList(n__take(V1,V2)) >= U61(isNat(activate(V1)),activate(V2)) ; isNatList(n__cons(V1,V2)) >= U51(isNat(activate(V1)),activate(V2)) ; isNatList(n__nil) >= tt ; U51(tt,V2) >= U52(isNatList(activate(V2))) ; U62(tt) >= tt ; U61(tt,V2) >= U62(isNatIList(activate(V2))) ; U72(tt,L) >= s(length(activate(L))) ; isNat(n__0) >= tt ; isNat(n__length(V1)) >= U11(isNatList(activate(V1))) ; isNat(n__s(V1)) >= U21(isNat(activate(V1))) ; U71(tt,L,N) >= U72(isNat(activate(N)),activate(L)) ; s(X) >= n__s(X) ; length(cons(N,L)) >= U71(isNatList(activate(L)),activate(L),N) ; length(nil) >= 0 ; length(X) >= n__length(X) ; nil >= n__nil ; U81(tt) >= nil ; U92(tt,IL,M,N) >= U93(isNat(activate(N)),activate(IL),activate(M), activate(N)) ; U91(tt,IL,M,N) >= U92(isNat(activate(M)),activate(IL),activate(M), activate(N)) ; U93(tt,IL,M,N) >= cons(activate(N),n__take(activate(M),activate(IL))) ; take(0,IL) >= U81(isNatIList(IL)) ; take(s(M),cons(N,IL)) >= U91(isNatIList(activate(IL)),activate(IL),M,N) ; take(X1,X2) >= n__take(X1,X2) ; Marked_isNatIList(n__cons(V1,V2)) >= Marked_U41(isNat(activate(V1)), activate(V2)) ; Marked_U41(tt,V2) >= Marked_isNatIList(activate(V2)) ; } + Disjunctions:{ { Marked_isNatIList(n__cons(V1,V2)) > Marked_U41(isNat(activate(V1)), activate(V2)) ; } { Marked_U41(tt,V2) > Marked_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 solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. No solution found for these constraints. APPLY CRITERIA (Simple graph) Found the following constraints: { cons(X1,X2) >= n__cons(X1,X2) ; 0 >= n__0 ; zeros >= cons(0,n__zeros) ; zeros >= n__zeros ; U11(tt) >= tt ; U21(tt) >= tt ; U31(tt) >= tt ; U42(tt) >= tt ; isNatIList(n__zeros) >= tt ; isNatIList(n__cons(V1,V2)) >= U41(isNat(activate(V1)),activate(V2)) ; isNatIList(V) >= U31(isNatList(activate(V))) ; 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__cons(X1,X2)) >= cons(X1,X2) ; activate(n__nil) >= nil ; activate(X) >= X ; U41(tt,V2) >= U42(isNatIList(activate(V2))) ; U52(tt) >= tt ; isNatList(n__take(V1,V2)) >= U61(isNat(activate(V1)),activate(V2)) ; isNatList(n__cons(V1,V2)) >= U51(isNat(activate(V1)),activate(V2)) ; isNatList(n__nil) >= tt ; U51(tt,V2) >= U52(isNatList(activate(V2))) ; U62(tt) >= tt ; U61(tt,V2) >= U62(isNatIList(activate(V2))) ; U72(tt,L) >= s(length(activate(L))) ; isNat(n__0) >= tt ; isNat(n__length(V1)) >= U11(isNatList(activate(V1))) ; isNat(n__s(V1)) >= U21(isNat(activate(V1))) ; U71(tt,L,N) >= U72(isNat(activate(N)),activate(L)) ; s(X) >= n__s(X) ; length(cons(N,L)) >= U71(isNatList(activate(L)),activate(L),N) ; length(nil) >= 0 ; length(X) >= n__length(X) ; nil >= n__nil ; U81(tt) >= nil ; U92(tt,IL,M,N) >= U93(isNat(activate(N)),activate(IL),activate(M), activate(N)) ; U91(tt,IL,M,N) >= U92(isNat(activate(M)),activate(IL),activate(M), activate(N)) ; U93(tt,IL,M,N) >= cons(activate(N),n__take(activate(M),activate(IL))) ; take(0,IL) >= U81(isNatIList(IL)) ; take(s(M),cons(N,IL)) >= U91(isNatIList(activate(IL)),activate(IL),M,N) ; take(X1,X2) >= n__take(X1,X2) ; Marked_isNatIList(n__cons(V1,V2)) >= Marked_U41(isNat(activate(V1)), activate(V2)) ; Marked_U41(tt,V2) > Marked_isNatIList(activate(V2)) ; } APPLY CRITERIA (SOLVE_ORD) Trying to solve the following constraints: { cons(X1,X2) >= n__cons(X1,X2) ; 0 >= n__0 ; zeros >= cons(0,n__zeros) ; zeros >= n__zeros ; U11(tt) >= tt ; U21(tt) >= tt ; U31(tt) >= tt ; U42(tt) >= tt ; isNatIList(n__zeros) >= tt ; isNatIList(n__cons(V1,V2)) >= U41(isNat(activate(V1)),activate(V2)) ; isNatIList(V) >= U31(isNatList(activate(V))) ; 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__cons(X1,X2)) >= cons(X1,X2) ; activate(n__nil) >= nil ; activate(X) >= X ; U41(tt,V2) >= U42(isNatIList(activate(V2))) ; U52(tt) >= tt ; isNatList(n__take(V1,V2)) >= U61(isNat(activate(V1)),activate(V2)) ; isNatList(n__cons(V1,V2)) >= U51(isNat(activate(V1)),activate(V2)) ; isNatList(n__nil) >= tt ; U51(tt,V2) >= U52(isNatList(activate(V2))) ; U62(tt) >= tt ; U61(tt,V2) >= U62(isNatIList(activate(V2))) ; U72(tt,L) >= s(length(activate(L))) ; isNat(n__0) >= tt ; isNat(n__length(V1)) >= U11(isNatList(activate(V1))) ; isNat(n__s(V1)) >= U21(isNat(activate(V1))) ; U71(tt,L,N) >= U72(isNat(activate(N)),activate(L)) ; s(X) >= n__s(X) ; length(cons(N,L)) >= U71(isNatList(activate(L)),activate(L),N) ; length(nil) >= 0 ; length(X) >= n__length(X) ; nil >= n__nil ; U81(tt) >= nil ; U92(tt,IL,M,N) >= U93(isNat(activate(N)),activate(IL),activate(M), activate(N)) ; U91(tt,IL,M,N) >= U92(isNat(activate(M)),activate(IL),activate(M), activate(N)) ; U93(tt,IL,M,N) >= cons(activate(N),n__take(activate(M),activate(IL))) ; take(0,IL) >= U81(isNatIList(IL)) ; take(s(M),cons(N,IL)) >= U91(isNatIList(activate(IL)),activate(IL),M,N) ; take(X1,X2) >= n__take(X1,X2) ; Marked_isNatIList(n__cons(V1,V2)) >= Marked_U41(isNat(activate(V1)), activate(V2)) ; Marked_U41(tt,V2) > Marked_isNatIList(activate(V2)) ; } + Disjunctions:{ } === 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 === STOPING TIMER real === === 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: APPLY CRITERIA (Graph splitting) Found 0 components: NOT SOLVED No proof found Cime worked for 88.820276 seconds (real time) Cime Exit Status: 0