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