- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] +(0,y) -> y [2] +(s(x),y) -> s(+(x,y)) [3] +(s(x),y) -> +(x,s(y)) 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: { +(0,y) >= y ; +(s(x),y) >= +(x,s(y)) ; +(s(x),y) >= s(+(x,y)) ; Marked_+(s(x),y) >= Marked_+(x,s(y)) ; Marked_+(s(x),y) >= Marked_+(x,y) ; } + Disjunctions:{ { Marked_+(s(x),y) > Marked_+(x,s(y)) ; } { Marked_+(s(x),y) > Marked_+(x,y) ; } } === 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: +(0,y) >= y constraint: +(s(x),y) >= +(x,s(y)) constraint: +(s(x),y) >= s(+(x,y)) constraint: Marked_+(s(x),y) >= Marked_+(x,s(y)) constraint: Marked_+(s(x),y) >= Marked_+(x,y) APPLY CRITERIA (Graph splitting) Found 0 components: SOLVED { TRS termination of: [1] +(0,y) -> y [2] +(s(x),y) -> s(+(x,y)) [3] +(s(x),y) -> +(x,s(y)) , CRITERION: MDP [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ + ] (X0,X1) = 2*X0 + 2*X1 + 0; [ s ] (X0) = 1 + 1*X0 + 0; [ 0 ] () = 3 + 0; [ Marked_+ ] (X0,X1) = 1*X0 + 0; ]} ]} ]} Cime worked for 0.014449 seconds (real time) Cime Exit Status: 0