- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] from(X) -> cons(X,n__from(n__s(X))) [2] sel(0,cons(X,Y)) -> X [3] sel(s(X),cons(Y,Z)) -> sel(X,activate(Z)) [4] from(X) -> n__from(X) [5] s(X) -> n__s(X) [6] activate(n__from(X)) -> from(activate(X)) [7] activate(n__s(X)) -> s(activate(X)) [8] activate(X) -> X Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 2 components: { --> } { --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { from(X) >= cons(X,n__from(n__s(X))) ; from(X) >= n__from(X) ; sel(0,cons(X,Y)) >= X ; sel(s(X),cons(Y,Z)) >= sel(X,activate(Z)) ; activate(n__from(X)) >= from(activate(X)) ; activate(n__s(X)) >= s(activate(X)) ; activate(X) >= X ; s(X) >= n__s(X) ; Marked_sel(s(X),cons(Y,Z)) >= Marked_sel(X,activate(Z)) ; } + Disjunctions:{ { Marked_sel(s(X),cons(Y,Z)) > Marked_sel(X,activate(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 === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. Entering rpo_solver === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === STOPING TIMER virtual === constraint: from(X) >= cons(X,n__from(n__s(X))) constraint: from(X) >= n__from(X) constraint: sel(0,cons(X,Y)) >= X constraint: sel(s(X),cons(Y,Z)) >= sel(X,activate(Z)) constraint: activate(n__from(X)) >= from(activate(X)) constraint: activate(n__s(X)) >= s(activate(X)) constraint: activate(X) >= X constraint: s(X) >= n__s(X) constraint: Marked_sel(s(X),cons(Y,Z)) >= Marked_sel(X,activate(Z)) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { from(X) >= cons(X,n__from(n__s(X))) ; from(X) >= n__from(X) ; sel(0,cons(X,Y)) >= X ; sel(s(X),cons(Y,Z)) >= sel(X,activate(Z)) ; activate(n__from(X)) >= from(activate(X)) ; activate(n__s(X)) >= s(activate(X)) ; activate(X) >= X ; s(X) >= n__s(X) ; Marked_activate(n__from(X)) >= Marked_activate(X) ; Marked_activate(n__s(X)) >= Marked_activate(X) ; } + Disjunctions:{ { Marked_activate(n__from(X)) > Marked_activate(X) ; } { Marked_activate(n__s(X)) > Marked_activate(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 === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. Entering rpo_solver === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === STOPING TIMER virtual === constraint: from(X) >= cons(X,n__from(n__s(X))) constraint: from(X) >= n__from(X) constraint: sel(0,cons(X,Y)) >= X constraint: sel(s(X),cons(Y,Z)) >= sel(X,activate(Z)) constraint: activate(n__from(X)) >= from(activate(X)) constraint: activate(n__s(X)) >= s(activate(X)) constraint: activate(X) >= X constraint: s(X) >= n__s(X) constraint: Marked_activate(n__from(X)) >= Marked_activate(X) constraint: Marked_activate(n__s(X)) >= Marked_activate(X) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: SOLVED { TRS termination of: [1] from(X) -> cons(X,n__from(n__s(X))) [2] sel(0,cons(X,Y)) -> X [3] sel(s(X),cons(Y,Z)) -> sel(X,activate(Z)) [4] from(X) -> n__from(X) [5] s(X) -> n__s(X) [6] activate(n__from(X)) -> from(activate(X)) [7] activate(n__s(X)) -> s(activate(X)) [8] activate(X) -> X , CRITERION: MDP [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: RPO with AFS = AFS: and precedence: prec (All symbols are Lex.): { cons < from ; cons < sel ; cons < activate ; cons < Marked_sel ; n__from < from ; n__from < sel ; n__from < activate ; n__from < Marked_sel ; n__s < from ; n__s < sel ; n__s < activate ; n__s < s ; n__s < Marked_sel ; from > cons ; from > n__from ; from > n__s ; from < sel ; from < activate ; from < Marked_sel ; sel > cons ; sel > n__from ; sel > n__s ; sel > from ; sel > activate ; sel > s ; activate > cons ; activate > n__from ; activate > n__s ; activate > from ; activate < sel ; activate > s ; activate < Marked_sel ; s > n__s ; s < sel ; s < activate ; s < Marked_sel ; Marked_sel > cons ; Marked_sel > n__from ; Marked_sel > n__s ; Marked_sel > from ; Marked_sel > activate ; Marked_sel > s ; } ]} { DP termination of: , CRITERION: ORD [ Solution found: RPO with AFS = AFS: and precedence: prec (All symbols are Lex.): { cons < from ; cons < sel ; cons < activate ; n__from < from ; n__from < sel ; n__from < activate ; n__s < from ; n__s < sel ; n__s < activate ; n__s < s ; from > cons ; from > n__from ; from > n__s ; from < sel ; from < activate ; sel > cons ; sel > n__from ; sel > n__s ; sel > from ; sel > activate ; sel > s ; activate > cons ; activate > n__from ; activate > n__s ; activate > from ; activate < sel ; activate > s ; s > n__s ; s < sel ; s < activate ; } ]} ]} ]} Cime worked for 0.055302 seconds (real time) Cime Exit Status: 0