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