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