- : unit = () - : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] f(x,y) -> x [2] g(a) -> h(a,b,a) [3] i(x) -> f(x,x) [4] h(x,x,y) -> g(x) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { f(x,y) >= x ; h(x,x,y) >= g(x) ; g(a) >= h(a,b,a) ; i(x) >= f(x,x) ; Marked_h(x,x,y) >= Marked_g(x) ; Marked_g(a) >= Marked_h(a,b,a) ; } + Disjunctions:{ { Marked_h(x,x,y) > Marked_g(x) ; } { Marked_g(a) > Marked_h(a,b,a) ; } } === 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,y) >= x constraint: h(x,x,y) >= g(x) constraint: g(a) >= h(a,b,a) constraint: i(x) >= f(x,x) constraint: Marked_h(x,x,y) >= Marked_g(x) constraint: Marked_g(a) >= Marked_h(a,b,a) APPLY CRITERIA (Graph splitting) Found 0 components: SOLVED { TRS termination of: [1] f(x,y) -> x [2] g(a) -> h(a,b,a) [3] i(x) -> f(x,x) [4] h(x,x,y) -> g(x) , CRITERION: MDP [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ f ] (X0,X1) = 1*X1 + 1*X0 + 2; [ g ] (X0) = 2*X0; [ a ] () = 3; [ Marked_h ] (X0,X1,X2) = 2*X1; [ h ] (X0,X1,X2) = 2*X1; [ i ] (X0) = 2*X0 + 3; [ b ] () = 0; [ Marked_g ] (X0) = 2*X0; removing [ { DP termination of: , CRITERION: SG [ ]} ]} ]} ]} Cime worked for 0.020598 seconds (real time) Cime Exit Status: 0