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