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