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