- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] and(tt,X) -> activate(X) [2] plus(N,0) -> N [3] plus(N,s(M)) -> s(plus(N,M)) [4] activate(X) -> X Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { activate(X) >= X ; and(tt,X) >= activate(X) ; plus(N,0) >= N ; plus(N,s(M)) >= s(plus(N,M)) ; Marked_plus(N,s(M)) >= Marked_plus(N,M) ; } + Disjunctions:{ { Marked_plus(N,s(M)) > Marked_plus(N,M) ; } } === 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: activate(X) >= X constraint: and(tt,X) >= activate(X) constraint: plus(N,0) >= N constraint: plus(N,s(M)) >= s(plus(N,M)) constraint: Marked_plus(N,s(M)) >= Marked_plus(N,M) APPLY CRITERIA (Graph splitting) Found 0 components: SOLVED { TRS termination of: [1] and(tt,X) -> activate(X) [2] plus(N,0) -> N [3] plus(N,s(M)) -> s(plus(N,M)) [4] activate(X) -> X , CRITERION: MDP [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ activate ] (X0) = 1 + 2*X0 + 0; [ 0 ] () = 2 + 0; [ tt ] () = 3 + 0; [ and ] (X0,X1) = 3 + 3*X0 + 3*X1 + 0; [ s ] (X0) = 2 + 1*X0 + 0; [ plus ] (X0,X1) = 3*X0 + 2*X1 + 0; [ Marked_plus ] (X0,X1) = 3*X1 + 0; ]} ]} ]} Cime worked for 0.011687 seconds (real time) Cime Exit Status: 0