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