- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] f(X) -> if(X,c,n__f(n__true)) [2] if(true,X,Y) -> X [3] if(false,X,Y) -> activate(Y) [4] f(X) -> n__f(X) [5] true -> n__true [6] activate(n__f(X)) -> f(activate(X)) [7] activate(n__true) -> true [8] activate(X) -> 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: { if(true,X,Y) >= X ; if(false,X,Y) >= activate(Y) ; f(X) >= if(X,c,n__f(n__true)) ; f(X) >= n__f(X) ; true >= n__true ; activate(n__f(X)) >= f(activate(X)) ; activate(n__true) >= true ; activate(X) >= X ; Marked_activate(n__f(X)) >= Marked_activate(X) ; Marked_activate(n__f(X)) >= Marked_f(activate(X)) ; Marked_f(X) >= Marked_if(X,c,n__f(n__true)) ; Marked_if(false,X,Y) >= Marked_activate(Y) ; } + Disjunctions:{ { Marked_activate(n__f(X)) > Marked_activate(X) ; } { Marked_activate(n__f(X)) > Marked_f(activate(X)) ; } { Marked_f(X) > Marked_if(X,c,n__f(n__true)) ; } { Marked_if(false,X,Y) > Marked_activate(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: if(true,X,Y) >= X constraint: if(false,X,Y) >= activate(Y) constraint: f(X) >= if(X,c,n__f(n__true)) constraint: f(X) >= n__f(X) constraint: true >= n__true constraint: activate(n__f(X)) >= f(activate(X)) constraint: activate(n__true) >= true constraint: activate(X) >= X constraint: Marked_activate(n__f(X)) >= Marked_activate(X) constraint: Marked_activate(n__f(X)) >= Marked_f(activate(X)) constraint: Marked_f(X) >= Marked_if(X,c,n__f(n__true)) constraint: Marked_if(false,X,Y) >= Marked_activate(Y) APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { if(true,X,Y) >= X ; if(false,X,Y) >= activate(Y) ; f(X) >= if(X,c,n__f(n__true)) ; f(X) >= n__f(X) ; true >= n__true ; activate(n__f(X)) >= f(activate(X)) ; activate(n__true) >= true ; activate(X) >= X ; Marked_activate(n__f(X)) >= Marked_activate(X) ; } + Disjunctions:{ { Marked_activate(n__f(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 Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: if(true,X,Y) >= X constraint: if(false,X,Y) >= activate(Y) constraint: f(X) >= if(X,c,n__f(n__true)) constraint: f(X) >= n__f(X) constraint: true >= n__true constraint: activate(n__f(X)) >= f(activate(X)) constraint: activate(n__true) >= true constraint: activate(X) >= X constraint: Marked_activate(n__f(X)) >= Marked_activate(X) APPLY CRITERIA (Graph splitting) Found 0 components: SOLVED { TRS termination of: [1] f(X) -> if(X,c,n__f(n__true)) [2] if(true,X,Y) -> X [3] if(false,X,Y) -> activate(Y) [4] f(X) -> n__f(X) [5] true -> n__true [6] activate(n__f(X)) -> f(activate(X)) [7] activate(n__true) -> true [8] activate(X) -> X , CRITERION: MDP [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ if ] (X0,X1,X2) = 3*X2 + 1*X1; [ Marked_activate ] (X0) = 2*X0 + 1; [ f ] (X0) = 3*X0; [ n__f ] (X0) = 3*X0; [ Marked_f ] (X0) = 2*X0; [ activate ] (X0) = 2*X0; [ c ] () = 0; [ true ] () = 0; [ n__true ] () = 0; [ Marked_if ] (X0,X1,X2) = 2*X2 + 1*X0; [ false ] () = 1; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ if ] (X0,X1,X2) = 2*X1 + 1*X2 + 0; [ Marked_activate ] (X0) = 3*X0 + 0; [ f ] (X0) = 1 + 1*X0 + 0; [ n__f ] (X0) = 1 + 1*X0 + 0; [ activate ] (X0) = 1*X0 + 0; [ c ] () = 0; [ true ] () = 0; [ n__true ] () = 0; [ false ] () = 0; ]} ]} ]} ]} ]} Cime worked for 0.048878 seconds (real time) Cime Exit Status: 0