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