- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] and(tt,X) -> activate(X) [2] plus(N,0) -> N [3] plus(N,s(M)) -> s(plus(N,M)) [4] x(N,0) -> 0 [5] x(N,s(M)) -> plus(x(N,M),N) [6] 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: { activate(X) >= X ; and(tt,X) >= activate(X) ; plus(N,0) >= N ; plus(N,s(M)) >= s(plus(N,M)) ; x(N,0) >= 0 ; x(N,s(M)) >= plus(x(N,M),N) ; Marked_x(N,s(M)) >= Marked_x(N,M) ; } + Disjunctions:{ { Marked_x(N,s(M)) > Marked_x(N,M) ; } } === 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: activate(X) >= X constraint: and(tt,X) >= activate(X) constraint: plus(N,0) >= N constraint: plus(N,s(M)) >= s(plus(N,M)) constraint: x(N,0) >= 0 constraint: x(N,s(M)) >= plus(x(N,M),N) constraint: Marked_x(N,s(M)) >= Marked_x(N,M) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { activate(X) >= X ; and(tt,X) >= activate(X) ; plus(N,0) >= N ; plus(N,s(M)) >= s(plus(N,M)) ; x(N,0) >= 0 ; x(N,s(M)) >= plus(x(N,M),N) ; Marked_plus(N,s(M)) >= Marked_plus(N,M) ; } + Disjunctions:{ { Marked_plus(N,s(M)) > Marked_plus(N,M) ; } } === 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: activate(X) >= X constraint: and(tt,X) >= activate(X) constraint: plus(N,0) >= N constraint: plus(N,s(M)) >= s(plus(N,M)) constraint: x(N,0) >= 0 constraint: x(N,s(M)) >= plus(x(N,M),N) constraint: Marked_plus(N,s(M)) >= Marked_plus(N,M) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: SOLVED { TRS termination of: [1] and(tt,X) -> activate(X) [2] plus(N,0) -> N [3] plus(N,s(M)) -> s(plus(N,M)) [4] x(N,0) -> 0 [5] x(N,s(M)) -> plus(x(N,M),N) [6] 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.): { activate < and ; and > activate ; plus > s ; plus < x ; s < plus ; s < x ; x > plus ; x > s ; } ]} { DP termination of: , CRITERION: ORD [ Solution found: RPO with AFS = AFS: and precedence: prec (All symbols are Lex.): { activate < and ; and > activate ; plus > s ; plus < x ; s < plus ; s < x ; x > plus ; x > s ; } ]} ]} ]} Cime worked for 0.030659 seconds (real time) Cime Exit Status: 0