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