- : unit = () - : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] from(X) -> cons(X,n__from(s(X))) [2] head(cons(X,XS)) -> X [3] 2nd(cons(X,XS)) -> head(activate(XS)) [4] take(0,XS) -> nil [5] take(s(N),cons(X,XS)) -> cons(X,n__take(N,activate(XS))) [6] sel(0,cons(X,XS)) -> X [7] sel(s(N),cons(X,XS)) -> sel(N,activate(XS)) [8] from(X) -> n__from(X) [9] take(X1,X2) -> n__take(X1,X2) [10] activate(n__from(X)) -> from(X) [11] activate(n__take(X1,X2)) -> take(X1,X2) [12] activate(X) -> X Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 2 components: { --> } { --> --> } APPLY CRITERIA (Subterm criterion) ST: Marked_sel -> 1 APPLY CRITERIA (Subterm criterion) ST: Marked_activate -> 1 Marked_take -> 2 APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: SOLVED { TRS termination of: [1] from(X) -> cons(X,n__from(s(X))) [2] head(cons(X,XS)) -> X [3] 2nd(cons(X,XS)) -> head(activate(XS)) [4] take(0,XS) -> nil [5] take(s(N),cons(X,XS)) -> cons(X,n__take(N,activate(XS))) [6] sel(0,cons(X,XS)) -> X [7] sel(s(N),cons(X,XS)) -> sel(N,activate(XS)) [8] from(X) -> n__from(X) [9] take(X1,X2) -> n__take(X1,X2) [10] activate(n__from(X)) -> from(X) [11] activate(n__take(X1,X2)) -> take(X1,X2) [12] activate(X) -> X , CRITERION: MDP [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ST [ { DP termination of: , CRITERION: SG [ ]} ]} { DP termination of: , CRITERION: ST [ { DP termination of: , CRITERION: SG [ ]} ]} ]} ]} Cime worked for 0.007732 seconds (real time) Cime Exit Status: 0