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