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