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