/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: U11(tt(),N) -> activate(N) U21(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> and(isNat(activate(V1)),n__isNat(activate(V2))) isNat(n__s(V1)) -> isNat(activate(V1)) plus(N,0()) -> U11(isNat(N),N) plus(N,s(M)) -> U21(and(isNat(M),n__isNat(N)),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNat(X) -> n__isNat(X) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2)) activate(n__isNat(X)) -> isNat(X) activate(n__s(X)) -> s(activate(X)) activate(X) -> X Proof: DP Processor: DPs: U11#(tt(),N) -> activate#(N) U21#(tt(),M,N) -> activate#(M) U21#(tt(),M,N) -> activate#(N) U21#(tt(),M,N) -> plus#(activate(N),activate(M)) U21#(tt(),M,N) -> s#(plus(activate(N),activate(M))) and#(tt(),X) -> activate#(X) isNat#(n__plus(V1,V2)) -> activate#(V2) isNat#(n__plus(V1,V2)) -> activate#(V1) isNat#(n__plus(V1,V2)) -> isNat#(activate(V1)) isNat#(n__plus(V1,V2)) -> and#(isNat(activate(V1)),n__isNat(activate(V2))) isNat#(n__s(V1)) -> activate#(V1) isNat#(n__s(V1)) -> isNat#(activate(V1)) plus#(N,0()) -> isNat#(N) plus#(N,0()) -> U11#(isNat(N),N) plus#(N,s(M)) -> isNat#(M) plus#(N,s(M)) -> and#(isNat(M),n__isNat(N)) plus#(N,s(M)) -> U21#(and(isNat(M),n__isNat(N)),M,N) activate#(n__0()) -> 0#() activate#(n__plus(X1,X2)) -> activate#(X2) activate#(n__plus(X1,X2)) -> activate#(X1) activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) activate#(n__isNat(X)) -> isNat#(X) activate#(n__s(X)) -> activate#(X) activate#(n__s(X)) -> s#(activate(X)) TRS: U11(tt(),N) -> activate(N) U21(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> and(isNat(activate(V1)),n__isNat(activate(V2))) isNat(n__s(V1)) -> isNat(activate(V1)) plus(N,0()) -> U11(isNat(N),N) plus(N,s(M)) -> U21(and(isNat(M),n__isNat(N)),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNat(X) -> n__isNat(X) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2)) activate(n__isNat(X)) -> isNat(X) activate(n__s(X)) -> s(activate(X)) activate(X) -> X TDG Processor: DPs: U11#(tt(),N) -> activate#(N) U21#(tt(),M,N) -> activate#(M) U21#(tt(),M,N) -> activate#(N) U21#(tt(),M,N) -> plus#(activate(N),activate(M)) U21#(tt(),M,N) -> s#(plus(activate(N),activate(M))) and#(tt(),X) -> activate#(X) isNat#(n__plus(V1,V2)) -> activate#(V2) isNat#(n__plus(V1,V2)) -> activate#(V1) isNat#(n__plus(V1,V2)) -> isNat#(activate(V1)) isNat#(n__plus(V1,V2)) -> and#(isNat(activate(V1)),n__isNat(activate(V2))) isNat#(n__s(V1)) -> activate#(V1) isNat#(n__s(V1)) -> isNat#(activate(V1)) plus#(N,0()) -> isNat#(N) plus#(N,0()) -> U11#(isNat(N),N) plus#(N,s(M)) -> isNat#(M) plus#(N,s(M)) -> and#(isNat(M),n__isNat(N)) plus#(N,s(M)) -> U21#(and(isNat(M),n__isNat(N)),M,N) activate#(n__0()) -> 0#() activate#(n__plus(X1,X2)) -> activate#(X2) activate#(n__plus(X1,X2)) -> activate#(X1) activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) activate#(n__isNat(X)) -> isNat#(X) activate#(n__s(X)) -> activate#(X) activate#(n__s(X)) -> s#(activate(X)) TRS: U11(tt(),N) -> activate(N) U21(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> and(isNat(activate(V1)),n__isNat(activate(V2))) isNat(n__s(V1)) -> isNat(activate(V1)) plus(N,0()) -> U11(isNat(N),N) plus(N,s(M)) -> U21(and(isNat(M),n__isNat(N)),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNat(X) -> n__isNat(X) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2)) activate(n__isNat(X)) -> isNat(X) activate(n__s(X)) -> s(activate(X)) activate(X) -> X graph: isNat#(n__s(V1)) -> isNat#(activate(V1)) -> isNat#(n__s(V1)) -> isNat#(activate(V1)) isNat#(n__s(V1)) -> isNat#(activate(V1)) -> isNat#(n__s(V1)) -> activate#(V1) isNat#(n__s(V1)) -> isNat#(activate(V1)) -> isNat#(n__plus(V1,V2)) -> and#(isNat(activate(V1)),n__isNat(activate(V2))) isNat#(n__s(V1)) -> isNat#(activate(V1)) -> isNat#(n__plus(V1,V2)) -> isNat#(activate(V1)) isNat#(n__s(V1)) -> isNat#(activate(V1)) -> isNat#(n__plus(V1,V2)) -> activate#(V1) isNat#(n__s(V1)) -> isNat#(activate(V1)) -> isNat#(n__plus(V1,V2)) -> activate#(V2) isNat#(n__s(V1)) -> activate#(V1) -> activate#(n__s(X)) -> s#(activate(X)) isNat#(n__s(V1)) -> activate#(V1) -> activate#(n__s(X)) -> activate#(X) isNat#(n__s(V1)) -> activate#(V1) -> activate#(n__isNat(X)) -> isNat#(X) isNat#(n__s(V1)) -> activate#(V1) -> activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) isNat#(n__s(V1)) -> activate#(V1) -> activate#(n__plus(X1,X2)) -> activate#(X1) isNat#(n__s(V1)) -> activate#(V1) -> activate#(n__plus(X1,X2)) -> activate#(X2) isNat#(n__s(V1)) -> activate#(V1) -> activate#(n__0()) -> 0#() isNat#(n__plus(V1,V2)) -> isNat#(activate(V1)) -> isNat#(n__s(V1)) -> isNat#(activate(V1)) isNat#(n__plus(V1,V2)) -> isNat#(activate(V1)) -> isNat#(n__s(V1)) -> activate#(V1) isNat#(n__plus(V1,V2)) -> isNat#(activate(V1)) -> isNat#(n__plus(V1,V2)) -> and#(isNat(activate(V1)),n__isNat(activate(V2))) isNat#(n__plus(V1,V2)) -> isNat#(activate(V1)) -> isNat#(n__plus(V1,V2)) -> isNat#(activate(V1)) isNat#(n__plus(V1,V2)) -> isNat#(activate(V1)) -> isNat#(n__plus(V1,V2)) -> activate#(V1) isNat#(n__plus(V1,V2)) -> isNat#(activate(V1)) -> isNat#(n__plus(V1,V2)) -> activate#(V2) isNat#(n__plus(V1,V2)) -> and#(isNat(activate(V1)),n__isNat(activate(V2))) -> and#(tt(),X) -> activate#(X) isNat#(n__plus(V1,V2)) -> activate#(V2) -> activate#(n__s(X)) -> s#(activate(X)) isNat#(n__plus(V1,V2)) -> activate#(V2) -> activate#(n__s(X)) -> activate#(X) isNat#(n__plus(V1,V2)) -> activate#(V2) -> activate#(n__isNat(X)) -> isNat#(X) isNat#(n__plus(V1,V2)) -> activate#(V2) -> activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) isNat#(n__plus(V1,V2)) -> activate#(V2) -> activate#(n__plus(X1,X2)) -> activate#(X1) isNat#(n__plus(V1,V2)) -> activate#(V2) -> activate#(n__plus(X1,X2)) -> activate#(X2) isNat#(n__plus(V1,V2)) -> activate#(V2) -> activate#(n__0()) -> 0#() isNat#(n__plus(V1,V2)) -> activate#(V1) -> activate#(n__s(X)) -> s#(activate(X)) isNat#(n__plus(V1,V2)) -> activate#(V1) -> activate#(n__s(X)) -> activate#(X) isNat#(n__plus(V1,V2)) -> activate#(V1) -> activate#(n__isNat(X)) -> isNat#(X) isNat#(n__plus(V1,V2)) -> activate#(V1) -> activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) isNat#(n__plus(V1,V2)) -> activate#(V1) -> activate#(n__plus(X1,X2)) -> activate#(X1) isNat#(n__plus(V1,V2)) -> activate#(V1) -> activate#(n__plus(X1,X2)) -> activate#(X2) isNat#(n__plus(V1,V2)) -> activate#(V1) -> activate#(n__0()) -> 0#() and#(tt(),X) -> activate#(X) -> activate#(n__s(X)) -> s#(activate(X)) and#(tt(),X) -> activate#(X) -> activate#(n__s(X)) -> activate#(X) and#(tt(),X) -> activate#(X) -> activate#(n__isNat(X)) -> isNat#(X) and#(tt(),X) -> activate#(X) -> activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) and#(tt(),X) -> activate#(X) -> activate#(n__plus(X1,X2)) -> activate#(X1) and#(tt(),X) -> activate#(X) -> activate#(n__plus(X1,X2)) -> activate#(X2) and#(tt(),X) -> activate#(X) -> activate#(n__0()) -> 0#() plus#(N,0()) -> isNat#(N) -> isNat#(n__s(V1)) -> isNat#(activate(V1)) plus#(N,0()) -> isNat#(N) -> isNat#(n__s(V1)) -> activate#(V1) plus#(N,0()) -> isNat#(N) -> isNat#(n__plus(V1,V2)) -> and#(isNat(activate(V1)),n__isNat(activate(V2))) plus#(N,0()) -> isNat#(N) -> isNat#(n__plus(V1,V2)) -> isNat#(activate(V1)) plus#(N,0()) -> isNat#(N) -> isNat#(n__plus(V1,V2)) -> activate#(V1) plus#(N,0()) -> isNat#(N) -> isNat#(n__plus(V1,V2)) -> activate#(V2) plus#(N,0()) -> U11#(isNat(N),N) -> U11#(tt(),N) -> activate#(N) plus#(N,s(M)) -> isNat#(M) -> isNat#(n__s(V1)) -> isNat#(activate(V1)) plus#(N,s(M)) -> isNat#(M) -> isNat#(n__s(V1)) -> activate#(V1) plus#(N,s(M)) -> isNat#(M) -> isNat#(n__plus(V1,V2)) -> and#(isNat(activate(V1)),n__isNat(activate(V2))) plus#(N,s(M)) -> isNat#(M) -> isNat#(n__plus(V1,V2)) -> isNat#(activate(V1)) plus#(N,s(M)) -> isNat#(M) -> isNat#(n__plus(V1,V2)) -> activate#(V1) plus#(N,s(M)) -> isNat#(M) -> isNat#(n__plus(V1,V2)) -> activate#(V2) plus#(N,s(M)) -> and#(isNat(M),n__isNat(N)) -> and#(tt(),X) -> activate#(X) plus#(N,s(M)) -> U21#(and(isNat(M),n__isNat(N)),M,N) -> U21#(tt(),M,N) -> s#(plus(activate(N),activate(M))) plus#(N,s(M)) -> U21#(and(isNat(M),n__isNat(N)),M,N) -> U21#(tt(),M,N) -> plus#(activate(N),activate(M)) plus#(N,s(M)) -> U21#(and(isNat(M),n__isNat(N)),M,N) -> U21#(tt(),M,N) -> activate#(N) plus#(N,s(M)) -> U21#(and(isNat(M),n__isNat(N)),M,N) -> U21#(tt(),M,N) -> activate#(M) U21#(tt(),M,N) -> plus#(activate(N),activate(M)) -> plus#(N,s(M)) -> U21#(and(isNat(M),n__isNat(N)),M,N) U21#(tt(),M,N) -> plus#(activate(N),activate(M)) -> plus#(N,s(M)) -> and#(isNat(M),n__isNat(N)) U21#(tt(),M,N) -> plus#(activate(N),activate(M)) -> plus#(N,s(M)) -> isNat#(M) U21#(tt(),M,N) -> plus#(activate(N),activate(M)) -> plus#(N,0()) -> U11#(isNat(N),N) U21#(tt(),M,N) -> plus#(activate(N),activate(M)) -> plus#(N,0()) -> isNat#(N) U21#(tt(),M,N) -> activate#(M) -> activate#(n__s(X)) -> s#(activate(X)) U21#(tt(),M,N) -> activate#(M) -> activate#(n__s(X)) -> activate#(X) U21#(tt(),M,N) -> activate#(M) -> activate#(n__isNat(X)) -> isNat#(X) U21#(tt(),M,N) -> activate#(M) -> activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) U21#(tt(),M,N) -> activate#(M) -> activate#(n__plus(X1,X2)) -> activate#(X1) U21#(tt(),M,N) -> activate#(M) -> activate#(n__plus(X1,X2)) -> activate#(X2) U21#(tt(),M,N) -> activate#(M) -> activate#(n__0()) -> 0#() U21#(tt(),M,N) -> activate#(N) -> activate#(n__s(X)) -> s#(activate(X)) U21#(tt(),M,N) -> activate#(N) -> activate#(n__s(X)) -> activate#(X) U21#(tt(),M,N) -> activate#(N) -> activate#(n__isNat(X)) -> isNat#(X) U21#(tt(),M,N) -> activate#(N) -> activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) U21#(tt(),M,N) -> activate#(N) -> activate#(n__plus(X1,X2)) -> activate#(X1) U21#(tt(),M,N) -> activate#(N) -> activate#(n__plus(X1,X2)) -> activate#(X2) U21#(tt(),M,N) -> activate#(N) -> activate#(n__0()) -> 0#() activate#(n__s(X)) -> activate#(X) -> activate#(n__s(X)) -> s#(activate(X)) activate#(n__s(X)) -> activate#(X) -> activate#(n__s(X)) -> activate#(X) activate#(n__s(X)) -> activate#(X) -> activate#(n__isNat(X)) -> isNat#(X) activate#(n__s(X)) -> activate#(X) -> activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) activate#(n__s(X)) -> activate#(X) -> activate#(n__plus(X1,X2)) -> activate#(X1) activate#(n__s(X)) -> activate#(X) -> activate#(n__plus(X1,X2)) -> activate#(X2) activate#(n__s(X)) -> activate#(X) -> activate#(n__0()) -> 0#() activate#(n__isNat(X)) -> isNat#(X) -> isNat#(n__s(V1)) -> isNat#(activate(V1)) activate#(n__isNat(X)) -> isNat#(X) -> isNat#(n__s(V1)) -> activate#(V1) activate#(n__isNat(X)) -> isNat#(X) -> isNat#(n__plus(V1,V2)) -> and#(isNat(activate(V1)),n__isNat(activate(V2))) activate#(n__isNat(X)) -> isNat#(X) -> isNat#(n__plus(V1,V2)) -> isNat#(activate(V1)) activate#(n__isNat(X)) -> isNat#(X) -> isNat#(n__plus(V1,V2)) -> activate#(V1) activate#(n__isNat(X)) -> isNat#(X) -> isNat#(n__plus(V1,V2)) -> activate#(V2) activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) -> plus#(N,s(M)) -> U21#(and(isNat(M),n__isNat(N)),M,N) activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) -> plus#(N,s(M)) -> and#(isNat(M),n__isNat(N)) activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) -> plus#(N,s(M)) -> isNat#(M) activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) -> plus#(N,0()) -> U11#(isNat(N),N) activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) -> plus#(N,0()) -> isNat#(N) activate#(n__plus(X1,X2)) -> activate#(X2) -> activate#(n__s(X)) -> s#(activate(X)) activate#(n__plus(X1,X2)) -> activate#(X2) -> activate#(n__s(X)) -> activate#(X) activate#(n__plus(X1,X2)) -> activate#(X2) -> activate#(n__isNat(X)) -> isNat#(X) activate#(n__plus(X1,X2)) -> activate#(X2) -> activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) activate#(n__plus(X1,X2)) -> activate#(X2) -> activate#(n__plus(X1,X2)) -> activate#(X1) activate#(n__plus(X1,X2)) -> activate#(X2) -> activate#(n__plus(X1,X2)) -> activate#(X2) activate#(n__plus(X1,X2)) -> activate#(X2) -> activate#(n__0()) -> 0#() activate#(n__plus(X1,X2)) -> activate#(X1) -> activate#(n__s(X)) -> s#(activate(X)) activate#(n__plus(X1,X2)) -> activate#(X1) -> activate#(n__s(X)) -> activate#(X) activate#(n__plus(X1,X2)) -> activate#(X1) -> activate#(n__isNat(X)) -> isNat#(X) activate#(n__plus(X1,X2)) -> activate#(X1) -> activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) activate#(n__plus(X1,X2)) -> activate#(X1) -> activate#(n__plus(X1,X2)) -> activate#(X1) activate#(n__plus(X1,X2)) -> activate#(X1) -> activate#(n__plus(X1,X2)) -> activate#(X2) activate#(n__plus(X1,X2)) -> activate#(X1) -> activate#(n__0()) -> 0#() U11#(tt(),N) -> activate#(N) -> activate#(n__s(X)) -> s#(activate(X)) U11#(tt(),N) -> activate#(N) -> activate#(n__s(X)) -> activate#(X) U11#(tt(),N) -> activate#(N) -> activate#(n__isNat(X)) -> isNat#(X) U11#(tt(),N) -> activate#(N) -> activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) U11#(tt(),N) -> activate#(N) -> activate#(n__plus(X1,X2)) -> activate#(X1) U11#(tt(),N) -> activate#(N) -> activate#(n__plus(X1,X2)) -> activate#(X2) U11#(tt(),N) -> activate#(N) -> activate#(n__0()) -> 0#() SCC Processor: #sccs: 1 #rules: 21 #arcs: 117/576 DPs: isNat#(n__s(V1)) -> isNat#(activate(V1)) isNat#(n__plus(V1,V2)) -> activate#(V2) activate#(n__plus(X1,X2)) -> activate#(X2) activate#(n__plus(X1,X2)) -> activate#(X1) activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) plus#(N,0()) -> isNat#(N) isNat#(n__plus(V1,V2)) -> activate#(V1) activate#(n__isNat(X)) -> isNat#(X) isNat#(n__plus(V1,V2)) -> isNat#(activate(V1)) isNat#(n__plus(V1,V2)) -> and#(isNat(activate(V1)),n__isNat(activate(V2))) and#(tt(),X) -> activate#(X) activate#(n__s(X)) -> activate#(X) isNat#(n__s(V1)) -> activate#(V1) plus#(N,0()) -> U11#(isNat(N),N) U11#(tt(),N) -> activate#(N) plus#(N,s(M)) -> isNat#(M) plus#(N,s(M)) -> and#(isNat(M),n__isNat(N)) plus#(N,s(M)) -> U21#(and(isNat(M),n__isNat(N)),M,N) U21#(tt(),M,N) -> activate#(M) U21#(tt(),M,N) -> activate#(N) U21#(tt(),M,N) -> plus#(activate(N),activate(M)) TRS: U11(tt(),N) -> activate(N) U21(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> and(isNat(activate(V1)),n__isNat(activate(V2))) isNat(n__s(V1)) -> isNat(activate(V1)) plus(N,0()) -> U11(isNat(N),N) plus(N,s(M)) -> U21(and(isNat(M),n__isNat(N)),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNat(X) -> n__isNat(X) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2)) activate(n__isNat(X)) -> isNat(X) activate(n__s(X)) -> s(activate(X)) activate(X) -> X Arctic Interpretation Processor: dimension: 1 usable rules: U11(tt(),N) -> activate(N) U21(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> and(isNat(activate(V1)),n__isNat(activate(V2))) isNat(n__s(V1)) -> isNat(activate(V1)) plus(N,0()) -> U11(isNat(N),N) plus(N,s(M)) -> U21(and(isNat(M),n__isNat(N)),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNat(X) -> n__isNat(X) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2)) activate(n__isNat(X)) -> isNat(X) activate(n__s(X)) -> s(activate(X)) activate(X) -> X interpretation: [isNat#](x0) = x0 + 0, [and#](x0, x1) = x1 + 1, [plus#](x0, x1) = x0 + 1x1 + 2, [U21#](x0, x1, x2) = x0 + 1x1 + x2 + 2, [activate#](x0) = x0 + 0, [U11#](x0, x1) = x1 + 0, [0] = 0, [n__s](x0) = x0, [n__isNat](x0) = x0 + 0, [n__plus](x0, x1) = x0 + 2x1 + 2, [isNat](x0) = x0 + 0, [n__0] = 0, [and](x0, x1) = x1 + 2, [s](x0) = x0 + 0, [plus](x0, x1) = x0 + 2x1 + 2, [U21](x0, x1, x2) = x0 + 2x1 + x2 + 2, [activate](x0) = x0 + 0, [U11](x0, x1) = x0 + x1 + 0, [tt] = 0 orientation: isNat#(n__s(V1)) = V1 + 0 >= V1 + 0 = isNat#(activate(V1)) isNat#(n__plus(V1,V2)) = V1 + 2V2 + 2 >= V2 + 0 = activate#(V2) activate#(n__plus(X1,X2)) = X1 + 2X2 + 2 >= X2 + 0 = activate#(X2) activate#(n__plus(X1,X2)) = X1 + 2X2 + 2 >= X1 + 0 = activate#(X1) activate#(n__plus(X1,X2)) = X1 + 2X2 + 2 >= X1 + 1X2 + 2 = plus#(activate(X1),activate(X2)) plus#(N,0()) = N + 2 >= N + 0 = isNat#(N) isNat#(n__plus(V1,V2)) = V1 + 2V2 + 2 >= V1 + 0 = activate#(V1) activate#(n__isNat(X)) = X + 0 >= X + 0 = isNat#(X) isNat#(n__plus(V1,V2)) = V1 + 2V2 + 2 >= V1 + 0 = isNat#(activate(V1)) isNat#(n__plus(V1,V2)) = V1 + 2V2 + 2 >= V2 + 1 = and#(isNat(activate(V1)),n__isNat(activate(V2))) and#(tt(),X) = X + 1 >= X + 0 = activate#(X) activate#(n__s(X)) = X + 0 >= X + 0 = activate#(X) isNat#(n__s(V1)) = V1 + 0 >= V1 + 0 = activate#(V1) plus#(N,0()) = N + 2 >= N + 0 = U11#(isNat(N),N) U11#(tt(),N) = N + 0 >= N + 0 = activate#(N) plus#(N,s(M)) = 1M + N + 2 >= M + 0 = isNat#(M) plus#(N,s(M)) = 1M + N + 2 >= N + 1 = and#(isNat(M),n__isNat(N)) plus#(N,s(M)) = 1M + N + 2 >= 1M + N + 2 = U21#(and(isNat(M),n__isNat(N)),M,N) U21#(tt(),M,N) = 1M + N + 2 >= M + 0 = activate#(M) U21#(tt(),M,N) = 1M + N + 2 >= N + 0 = activate#(N) U21#(tt(),M,N) = 1M + N + 2 >= 1M + N + 2 = plus#(activate(N),activate(M)) U11(tt(),N) = N + 0 >= N + 0 = activate(N) U21(tt(),M,N) = 2M + N + 2 >= 2M + N + 2 = s(plus(activate(N),activate(M))) and(tt(),X) = X + 2 >= X + 0 = activate(X) isNat(n__0()) = 0 >= 0 = tt() isNat(n__plus(V1,V2)) = V1 + 2V2 + 2 >= V2 + 2 = and(isNat(activate(V1)),n__isNat(activate(V2))) isNat(n__s(V1)) = V1 + 0 >= V1 + 0 = isNat(activate(V1)) plus(N,0()) = N + 2 >= N + 0 = U11(isNat(N),N) plus(N,s(M)) = 2M + N + 2 >= 2M + N + 2 = U21(and(isNat(M),n__isNat(N)),M,N) 0() = 0 >= 0 = n__0() plus(X1,X2) = X1 + 2X2 + 2 >= X1 + 2X2 + 2 = n__plus(X1,X2) isNat(X) = X + 0 >= X + 0 = n__isNat(X) s(X) = X + 0 >= X = n__s(X) activate(n__0()) = 0 >= 0 = 0() activate(n__plus(X1,X2)) = X1 + 2X2 + 2 >= X1 + 2X2 + 2 = plus(activate(X1),activate(X2)) activate(n__isNat(X)) = X + 0 >= X + 0 = isNat(X) activate(n__s(X)) = X + 0 >= X + 0 = s(activate(X)) activate(X) = X + 0 >= X = X problem: DPs: isNat#(n__s(V1)) -> isNat#(activate(V1)) activate#(n__plus(X1,X2)) -> activate#(X1) activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) plus#(N,0()) -> isNat#(N) isNat#(n__plus(V1,V2)) -> activate#(V1) activate#(n__isNat(X)) -> isNat#(X) isNat#(n__plus(V1,V2)) -> isNat#(activate(V1)) and#(tt(),X) -> activate#(X) activate#(n__s(X)) -> activate#(X) isNat#(n__s(V1)) -> activate#(V1) plus#(N,0()) -> U11#(isNat(N),N) U11#(tt(),N) -> activate#(N) plus#(N,s(M)) -> and#(isNat(M),n__isNat(N)) plus#(N,s(M)) -> U21#(and(isNat(M),n__isNat(N)),M,N) U21#(tt(),M,N) -> activate#(N) U21#(tt(),M,N) -> plus#(activate(N),activate(M)) TRS: U11(tt(),N) -> activate(N) U21(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> and(isNat(activate(V1)),n__isNat(activate(V2))) isNat(n__s(V1)) -> isNat(activate(V1)) plus(N,0()) -> U11(isNat(N),N) plus(N,s(M)) -> U21(and(isNat(M),n__isNat(N)),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNat(X) -> n__isNat(X) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2)) activate(n__isNat(X)) -> isNat(X) activate(n__s(X)) -> s(activate(X)) activate(X) -> X Restore Modifier: DPs: isNat#(n__s(V1)) -> isNat#(activate(V1)) activate#(n__plus(X1,X2)) -> activate#(X1) activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) plus#(N,0()) -> isNat#(N) isNat#(n__plus(V1,V2)) -> activate#(V1) activate#(n__isNat(X)) -> isNat#(X) isNat#(n__plus(V1,V2)) -> isNat#(activate(V1)) and#(tt(),X) -> activate#(X) activate#(n__s(X)) -> activate#(X) isNat#(n__s(V1)) -> activate#(V1) plus#(N,0()) -> U11#(isNat(N),N) U11#(tt(),N) -> activate#(N) plus#(N,s(M)) -> and#(isNat(M),n__isNat(N)) plus#(N,s(M)) -> U21#(and(isNat(M),n__isNat(N)),M,N) U21#(tt(),M,N) -> activate#(N) U21#(tt(),M,N) -> plus#(activate(N),activate(M)) TRS: U11(tt(),N) -> activate(N) U21(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> and(isNat(activate(V1)),n__isNat(activate(V2))) isNat(n__s(V1)) -> isNat(activate(V1)) plus(N,0()) -> U11(isNat(N),N) plus(N,s(M)) -> U21(and(isNat(M),n__isNat(N)),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNat(X) -> n__isNat(X) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2)) activate(n__isNat(X)) -> isNat(X) activate(n__s(X)) -> s(activate(X)) activate(X) -> X Arctic Interpretation Processor: dimension: 1 usable rules: U11(tt(),N) -> activate(N) U21(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> and(isNat(activate(V1)),n__isNat(activate(V2))) isNat(n__s(V1)) -> isNat(activate(V1)) plus(N,0()) -> U11(isNat(N),N) plus(N,s(M)) -> U21(and(isNat(M),n__isNat(N)),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNat(X) -> n__isNat(X) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2)) activate(n__isNat(X)) -> isNat(X) activate(n__s(X)) -> s(activate(X)) activate(X) -> X interpretation: [isNat#](x0) = x0, [and#](x0, x1) = x0 + x1 + 0, [plus#](x0, x1) = x0 + x1, [U21#](x0, x1, x2) = x0 + x1 + x2 + 0, [activate#](x0) = x0, [U11#](x0, x1) = x0 + x1, [0] = 0, [n__s](x0) = x0 + 1, [n__isNat](x0) = x0, [n__plus](x0, x1) = 2x0 + 1x1 + 1, [isNat](x0) = x0, [n__0] = 0, [and](x0, x1) = x0 + x1 + 1, [s](x0) = x0 + 1, [plus](x0, x1) = 2x0 + 1x1 + 1, [U21](x0, x1, x2) = 1x1 + 2x2 + 2, [activate](x0) = x0, [U11](x0, x1) = 2x0 + x1 + 0, [tt] = 0 orientation: isNat#(n__s(V1)) = V1 + 1 >= V1 = isNat#(activate(V1)) activate#(n__plus(X1,X2)) = 2X1 + 1X2 + 1 >= X1 = activate#(X1) activate#(n__plus(X1,X2)) = 2X1 + 1X2 + 1 >= X1 + X2 = plus#(activate(X1),activate(X2)) plus#(N,0()) = N + 0 >= N = isNat#(N) isNat#(n__plus(V1,V2)) = 2V1 + 1V2 + 1 >= V1 = activate#(V1) activate#(n__isNat(X)) = X >= X = isNat#(X) isNat#(n__plus(V1,V2)) = 2V1 + 1V2 + 1 >= V1 = isNat#(activate(V1)) and#(tt(),X) = X + 0 >= X = activate#(X) activate#(n__s(X)) = X + 1 >= X = activate#(X) isNat#(n__s(V1)) = V1 + 1 >= V1 = activate#(V1) plus#(N,0()) = N + 0 >= N = U11#(isNat(N),N) U11#(tt(),N) = N + 0 >= N = activate#(N) plus#(N,s(M)) = M + N + 1 >= M + N + 0 = and#(isNat(M),n__isNat(N)) plus#(N,s(M)) = M + N + 1 >= M + N + 1 = U21#(and(isNat(M),n__isNat(N)),M,N) U21#(tt(),M,N) = M + N + 0 >= N = activate#(N) U21#(tt(),M,N) = M + N + 0 >= M + N = plus#(activate(N),activate(M)) U11(tt(),N) = N + 2 >= N = activate(N) U21(tt(),M,N) = 1M + 2N + 2 >= 1M + 2N + 1 = s(plus(activate(N),activate(M))) and(tt(),X) = X + 1 >= X = activate(X) isNat(n__0()) = 0 >= 0 = tt() isNat(n__plus(V1,V2)) = 2V1 + 1V2 + 1 >= V1 + V2 + 1 = and(isNat(activate(V1)),n__isNat(activate(V2))) isNat(n__s(V1)) = V1 + 1 >= V1 = isNat(activate(V1)) plus(N,0()) = 2N + 1 >= 2N + 0 = U11(isNat(N),N) plus(N,s(M)) = 1M + 2N + 2 >= 1M + 2N + 2 = U21(and(isNat(M),n__isNat(N)),M,N) 0() = 0 >= 0 = n__0() plus(X1,X2) = 2X1 + 1X2 + 1 >= 2X1 + 1X2 + 1 = n__plus(X1,X2) isNat(X) = X >= X = n__isNat(X) s(X) = X + 1 >= X + 1 = n__s(X) activate(n__0()) = 0 >= 0 = 0() activate(n__plus(X1,X2)) = 2X1 + 1X2 + 1 >= 2X1 + 1X2 + 1 = plus(activate(X1),activate(X2)) activate(n__isNat(X)) = X >= X = isNat(X) activate(n__s(X)) = X + 1 >= X + 1 = s(activate(X)) activate(X) = X >= X = X problem: DPs: isNat#(n__s(V1)) -> isNat#(activate(V1)) plus#(N,0()) -> isNat#(N) activate#(n__isNat(X)) -> isNat#(X) and#(tt(),X) -> activate#(X) activate#(n__s(X)) -> activate#(X) isNat#(n__s(V1)) -> activate#(V1) plus#(N,0()) -> U11#(isNat(N),N) U11#(tt(),N) -> activate#(N) plus#(N,s(M)) -> and#(isNat(M),n__isNat(N)) plus#(N,s(M)) -> U21#(and(isNat(M),n__isNat(N)),M,N) U21#(tt(),M,N) -> activate#(N) U21#(tt(),M,N) -> plus#(activate(N),activate(M)) TRS: U11(tt(),N) -> activate(N) U21(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> and(isNat(activate(V1)),n__isNat(activate(V2))) isNat(n__s(V1)) -> isNat(activate(V1)) plus(N,0()) -> U11(isNat(N),N) plus(N,s(M)) -> U21(and(isNat(M),n__isNat(N)),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNat(X) -> n__isNat(X) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2)) activate(n__isNat(X)) -> isNat(X) activate(n__s(X)) -> s(activate(X)) activate(X) -> X Restore Modifier: DPs: isNat#(n__s(V1)) -> isNat#(activate(V1)) plus#(N,0()) -> isNat#(N) activate#(n__isNat(X)) -> isNat#(X) and#(tt(),X) -> activate#(X) activate#(n__s(X)) -> activate#(X) isNat#(n__s(V1)) -> activate#(V1) plus#(N,0()) -> U11#(isNat(N),N) U11#(tt(),N) -> activate#(N) plus#(N,s(M)) -> and#(isNat(M),n__isNat(N)) plus#(N,s(M)) -> U21#(and(isNat(M),n__isNat(N)),M,N) U21#(tt(),M,N) -> activate#(N) U21#(tt(),M,N) -> plus#(activate(N),activate(M)) TRS: U11(tt(),N) -> activate(N) U21(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> and(isNat(activate(V1)),n__isNat(activate(V2))) isNat(n__s(V1)) -> isNat(activate(V1)) plus(N,0()) -> U11(isNat(N),N) plus(N,s(M)) -> U21(and(isNat(M),n__isNat(N)),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNat(X) -> n__isNat(X) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2)) activate(n__isNat(X)) -> isNat(X) activate(n__s(X)) -> s(activate(X)) activate(X) -> X SCC Processor: #sccs: 2 #rules: 6 #arcs: 96/144 DPs: plus#(N,s(M)) -> U21#(and(isNat(M),n__isNat(N)),M,N) U21#(tt(),M,N) -> plus#(activate(N),activate(M)) TRS: U11(tt(),N) -> activate(N) U21(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> and(isNat(activate(V1)),n__isNat(activate(V2))) isNat(n__s(V1)) -> isNat(activate(V1)) plus(N,0()) -> U11(isNat(N),N) plus(N,s(M)) -> U21(and(isNat(M),n__isNat(N)),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNat(X) -> n__isNat(X) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2)) activate(n__isNat(X)) -> isNat(X) activate(n__s(X)) -> s(activate(X)) activate(X) -> X Matrix Interpretation Processor: dim=1 usable rules: U11(tt(),N) -> activate(N) U21(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> and(isNat(activate(V1)),n__isNat(activate(V2))) isNat(n__s(V1)) -> isNat(activate(V1)) plus(N,0()) -> U11(isNat(N),N) plus(N,s(M)) -> U21(and(isNat(M),n__isNat(N)),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNat(X) -> n__isNat(X) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2)) activate(n__isNat(X)) -> isNat(X) activate(n__s(X)) -> s(activate(X)) activate(X) -> X interpretation: [plus#](x0, x1) = 1/2x1, [U21#](x0, x1, x2) = 1/2x1 + 1/2, [0] = 2, [n__s](x0) = x0 + 1, [n__isNat](x0) = 0, [n__plus](x0, x1) = 2x0 + 3/2x1, [isNat](x0) = 0, [n__0] = 2, [and](x0, x1) = x1, [s](x0) = x0 + 1, [plus](x0, x1) = 2x0 + 3/2x1, [U21](x0, x1, x2) = 3/2x1 + 2x2 + 1, [activate](x0) = x0, [U11](x0, x1) = 3/2x1 + 5/2, [tt] = 0 orientation: plus#(N,s(M)) = 1/2M + 1/2 >= 1/2M + 1/2 = U21#(and(isNat(M),n__isNat(N)),M,N) U21#(tt(),M,N) = 1/2M + 1/2 >= 1/2M = plus#(activate(N),activate(M)) U11(tt(),N) = 3/2N + 5/2 >= N = activate(N) U21(tt(),M,N) = 3/2M + 2N + 1 >= 3/2M + 2N + 1 = s(plus(activate(N),activate(M))) and(tt(),X) = X >= X = activate(X) isNat(n__0()) = 0 >= 0 = tt() isNat(n__plus(V1,V2)) = 0 >= 0 = and(isNat(activate(V1)),n__isNat(activate(V2))) isNat(n__s(V1)) = 0 >= 0 = isNat(activate(V1)) plus(N,0()) = 2N + 3 >= 3/2N + 5/2 = U11(isNat(N),N) plus(N,s(M)) = 3/2M + 2N + 3/2 >= 3/2M + 2N + 1 = U21(and(isNat(M),n__isNat(N)),M,N) 0() = 2 >= 2 = n__0() plus(X1,X2) = 2X1 + 3/2X2 >= 2X1 + 3/2X2 = n__plus(X1,X2) isNat(X) = 0 >= 0 = n__isNat(X) s(X) = X + 1 >= X + 1 = n__s(X) activate(n__0()) = 2 >= 2 = 0() activate(n__plus(X1,X2)) = 2X1 + 3/2X2 >= 2X1 + 3/2X2 = plus(activate(X1),activate(X2)) activate(n__isNat(X)) = 0 >= 0 = isNat(X) activate(n__s(X)) = X + 1 >= X + 1 = s(activate(X)) activate(X) = X >= X = X problem: DPs: plus#(N,s(M)) -> U21#(and(isNat(M),n__isNat(N)),M,N) TRS: U11(tt(),N) -> activate(N) U21(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> and(isNat(activate(V1)),n__isNat(activate(V2))) isNat(n__s(V1)) -> isNat(activate(V1)) plus(N,0()) -> U11(isNat(N),N) plus(N,s(M)) -> U21(and(isNat(M),n__isNat(N)),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNat(X) -> n__isNat(X) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2)) activate(n__isNat(X)) -> isNat(X) activate(n__s(X)) -> s(activate(X)) activate(X) -> X Restore Modifier: DPs: plus#(N,s(M)) -> U21#(and(isNat(M),n__isNat(N)),M,N) TRS: U11(tt(),N) -> activate(N) U21(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> and(isNat(activate(V1)),n__isNat(activate(V2))) isNat(n__s(V1)) -> isNat(activate(V1)) plus(N,0()) -> U11(isNat(N),N) plus(N,s(M)) -> U21(and(isNat(M),n__isNat(N)),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNat(X) -> n__isNat(X) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2)) activate(n__isNat(X)) -> isNat(X) activate(n__s(X)) -> s(activate(X)) activate(X) -> X SCC Processor: #sccs: 0 #rules: 0 #arcs: 2/1 DPs: isNat#(n__s(V1)) -> isNat#(activate(V1)) isNat#(n__s(V1)) -> activate#(V1) activate#(n__isNat(X)) -> isNat#(X) activate#(n__s(X)) -> activate#(X) TRS: U11(tt(),N) -> activate(N) U21(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> and(isNat(activate(V1)),n__isNat(activate(V2))) isNat(n__s(V1)) -> isNat(activate(V1)) plus(N,0()) -> U11(isNat(N),N) plus(N,s(M)) -> U21(and(isNat(M),n__isNat(N)),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNat(X) -> n__isNat(X) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2)) activate(n__isNat(X)) -> isNat(X) activate(n__s(X)) -> s(activate(X)) activate(X) -> X Arctic Interpretation Processor: dimension: 1 usable rules: U11(tt(),N) -> activate(N) U21(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> and(isNat(activate(V1)),n__isNat(activate(V2))) isNat(n__s(V1)) -> isNat(activate(V1)) plus(N,0()) -> U11(isNat(N),N) plus(N,s(M)) -> U21(and(isNat(M),n__isNat(N)),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNat(X) -> n__isNat(X) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2)) activate(n__isNat(X)) -> isNat(X) activate(n__s(X)) -> s(activate(X)) activate(X) -> X interpretation: [isNat#](x0) = 2x0, [activate#](x0) = x0 + 3, [0] = 0, [n__s](x0) = x0 + 2, [n__isNat](x0) = 2x0 + 0, [n__plus](x0, x1) = 2x0 + 4x1 + 0, [isNat](x0) = 2x0 + 0, [n__0] = 0, [and](x0, x1) = x0 + x1 + 0, [s](x0) = x0 + 2, [plus](x0, x1) = 2x0 + 4x1 + 0, [U21](x0, x1, x2) = x0 + 4x1 + 2x2 + 4, [activate](x0) = x0, [U11](x0, x1) = x1, [tt] = 0 orientation: isNat#(n__s(V1)) = 2V1 + 4 >= 2V1 = isNat#(activate(V1)) isNat#(n__s(V1)) = 2V1 + 4 >= V1 + 3 = activate#(V1) activate#(n__isNat(X)) = 2X + 3 >= 2X = isNat#(X) activate#(n__s(X)) = X + 3 >= X + 3 = activate#(X) U11(tt(),N) = N >= N = activate(N) U21(tt(),M,N) = 4M + 2N + 4 >= 4M + 2N + 2 = s(plus(activate(N),activate(M))) and(tt(),X) = X + 0 >= X = activate(X) isNat(n__0()) = 2 >= 0 = tt() isNat(n__plus(V1,V2)) = 4V1 + 6V2 + 2 >= 2V1 + 2V2 + 0 = and(isNat(activate(V1)),n__isNat(activate(V2))) isNat(n__s(V1)) = 2V1 + 4 >= 2V1 + 0 = isNat(activate(V1)) plus(N,0()) = 2N + 4 >= N = U11(isNat(N),N) plus(N,s(M)) = 4M + 2N + 6 >= 4M + 2N + 4 = U21(and(isNat(M),n__isNat(N)),M,N) 0() = 0 >= 0 = n__0() plus(X1,X2) = 2X1 + 4X2 + 0 >= 2X1 + 4X2 + 0 = n__plus(X1,X2) isNat(X) = 2X + 0 >= 2X + 0 = n__isNat(X) s(X) = X + 2 >= X + 2 = n__s(X) activate(n__0()) = 0 >= 0 = 0() activate(n__plus(X1,X2)) = 2X1 + 4X2 + 0 >= 2X1 + 4X2 + 0 = plus(activate(X1),activate(X2)) activate(n__isNat(X)) = 2X + 0 >= 2X + 0 = isNat(X) activate(n__s(X)) = X + 2 >= X + 2 = s(activate(X)) activate(X) = X >= X = X problem: DPs: isNat#(n__s(V1)) -> isNat#(activate(V1)) activate#(n__isNat(X)) -> isNat#(X) activate#(n__s(X)) -> activate#(X) TRS: U11(tt(),N) -> activate(N) U21(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> and(isNat(activate(V1)),n__isNat(activate(V2))) isNat(n__s(V1)) -> isNat(activate(V1)) plus(N,0()) -> U11(isNat(N),N) plus(N,s(M)) -> U21(and(isNat(M),n__isNat(N)),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNat(X) -> n__isNat(X) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2)) activate(n__isNat(X)) -> isNat(X) activate(n__s(X)) -> s(activate(X)) activate(X) -> X Restore Modifier: DPs: isNat#(n__s(V1)) -> isNat#(activate(V1)) activate#(n__isNat(X)) -> isNat#(X) activate#(n__s(X)) -> activate#(X) TRS: U11(tt(),N) -> activate(N) U21(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> and(isNat(activate(V1)),n__isNat(activate(V2))) isNat(n__s(V1)) -> isNat(activate(V1)) plus(N,0()) -> U11(isNat(N),N) plus(N,s(M)) -> U21(and(isNat(M),n__isNat(N)),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNat(X) -> n__isNat(X) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2)) activate(n__isNat(X)) -> isNat(X) activate(n__s(X)) -> s(activate(X)) activate(X) -> X SCC Processor: #sccs: 2 #rules: 2 #arcs: 8/9 DPs: activate#(n__s(X)) -> activate#(X) TRS: U11(tt(),N) -> activate(N) U21(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> and(isNat(activate(V1)),n__isNat(activate(V2))) isNat(n__s(V1)) -> isNat(activate(V1)) plus(N,0()) -> U11(isNat(N),N) plus(N,s(M)) -> U21(and(isNat(M),n__isNat(N)),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNat(X) -> n__isNat(X) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2)) activate(n__isNat(X)) -> isNat(X) activate(n__s(X)) -> s(activate(X)) activate(X) -> X Size-Change Termination Processor: DPs: TRS: U11(tt(),N) -> activate(N) U21(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> and(isNat(activate(V1)),n__isNat(activate(V2))) isNat(n__s(V1)) -> isNat(activate(V1)) plus(N,0()) -> U11(isNat(N),N) plus(N,s(M)) -> U21(and(isNat(M),n__isNat(N)),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNat(X) -> n__isNat(X) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2)) activate(n__isNat(X)) -> isNat(X) activate(n__s(X)) -> s(activate(X)) activate(X) -> X The DP: activate#(n__s(X)) -> activate#(X) has the edges: 0 > 0 Qed DPs: isNat#(n__s(V1)) -> isNat#(activate(V1)) TRS: U11(tt(),N) -> activate(N) U21(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> and(isNat(activate(V1)),n__isNat(activate(V2))) isNat(n__s(V1)) -> isNat(activate(V1)) plus(N,0()) -> U11(isNat(N),N) plus(N,s(M)) -> U21(and(isNat(M),n__isNat(N)),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNat(X) -> n__isNat(X) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2)) activate(n__isNat(X)) -> isNat(X) activate(n__s(X)) -> s(activate(X)) activate(X) -> X Matrix Interpretation Processor: dim=1 usable rules: U11(tt(),N) -> activate(N) U21(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> and(isNat(activate(V1)),n__isNat(activate(V2))) isNat(n__s(V1)) -> isNat(activate(V1)) plus(N,0()) -> U11(isNat(N),N) plus(N,s(M)) -> U21(and(isNat(M),n__isNat(N)),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNat(X) -> n__isNat(X) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2)) activate(n__isNat(X)) -> isNat(X) activate(n__s(X)) -> s(activate(X)) activate(X) -> X interpretation: [isNat#](x0) = 2x0 + 1, [0] = 6, [n__s](x0) = x0 + 1, [n__isNat](x0) = 0, [n__plus](x0, x1) = x0 + x1, [isNat](x0) = 0, [n__0] = 6, [and](x0, x1) = x1, [s](x0) = x0 + 1, [plus](x0, x1) = x0 + x1, [U21](x0, x1, x2) = x1 + x2 + 1, [activate](x0) = x0, [U11](x0, x1) = x1 + 1, [tt] = 0 orientation: isNat#(n__s(V1)) = 2V1 + 3 >= 2V1 + 1 = isNat#(activate(V1)) U11(tt(),N) = N + 1 >= N = activate(N) U21(tt(),M,N) = M + N + 1 >= M + N + 1 = s(plus(activate(N),activate(M))) and(tt(),X) = X >= X = activate(X) isNat(n__0()) = 0 >= 0 = tt() isNat(n__plus(V1,V2)) = 0 >= 0 = and(isNat(activate(V1)),n__isNat(activate(V2))) isNat(n__s(V1)) = 0 >= 0 = isNat(activate(V1)) plus(N,0()) = N + 6 >= N + 1 = U11(isNat(N),N) plus(N,s(M)) = M + N + 1 >= M + N + 1 = U21(and(isNat(M),n__isNat(N)),M,N) 0() = 6 >= 6 = n__0() plus(X1,X2) = X1 + X2 >= X1 + X2 = n__plus(X1,X2) isNat(X) = 0 >= 0 = n__isNat(X) s(X) = X + 1 >= X + 1 = n__s(X) activate(n__0()) = 6 >= 6 = 0() activate(n__plus(X1,X2)) = X1 + X2 >= X1 + X2 = plus(activate(X1),activate(X2)) activate(n__isNat(X)) = 0 >= 0 = isNat(X) activate(n__s(X)) = X + 1 >= X + 1 = s(activate(X)) activate(X) = X >= X = X problem: DPs: TRS: U11(tt(),N) -> activate(N) U21(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> and(isNat(activate(V1)),n__isNat(activate(V2))) isNat(n__s(V1)) -> isNat(activate(V1)) plus(N,0()) -> U11(isNat(N),N) plus(N,s(M)) -> U21(and(isNat(M),n__isNat(N)),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNat(X) -> n__isNat(X) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2)) activate(n__isNat(X)) -> isNat(X) activate(n__s(X)) -> s(activate(X)) activate(X) -> X Qed