/export/starexec/sandbox/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: U11(tt(),V2) -> U12(isNat(activate(V2))) U12(tt()) -> tt() U21(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> U42(isNat(activate(N)),activate(M),activate(N)) U42(tt(),M,N) -> s(plus(activate(N),activate(M))) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(isNat(activate(V1)),activate(V2)) isNat(n__s(V1)) -> U21(isNat(activate(V1))) plus(N,0()) -> U31(isNat(N),N) plus(N,s(M)) -> U41(isNat(M),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__s(X)) -> s(X) activate(X) -> X Proof: DP Processor: DPs: U11#(tt(),V2) -> activate#(V2) U11#(tt(),V2) -> isNat#(activate(V2)) U11#(tt(),V2) -> U12#(isNat(activate(V2))) U31#(tt(),N) -> activate#(N) U41#(tt(),M,N) -> activate#(M) U41#(tt(),M,N) -> activate#(N) U41#(tt(),M,N) -> isNat#(activate(N)) U41#(tt(),M,N) -> U42#(isNat(activate(N)),activate(M),activate(N)) U42#(tt(),M,N) -> activate#(M) U42#(tt(),M,N) -> activate#(N) U42#(tt(),M,N) -> plus#(activate(N),activate(M)) U42#(tt(),M,N) -> s#(plus(activate(N),activate(M))) 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)) -> U11#(isNat(activate(V1)),activate(V2)) isNat#(n__s(V1)) -> activate#(V1) isNat#(n__s(V1)) -> isNat#(activate(V1)) isNat#(n__s(V1)) -> U21#(isNat(activate(V1))) plus#(N,0()) -> isNat#(N) plus#(N,0()) -> U31#(isNat(N),N) plus#(N,s(M)) -> isNat#(M) plus#(N,s(M)) -> U41#(isNat(M),M,N) activate#(n__0()) -> 0#() activate#(n__plus(X1,X2)) -> plus#(X1,X2) activate#(n__s(X)) -> s#(X) TRS: U11(tt(),V2) -> U12(isNat(activate(V2))) U12(tt()) -> tt() U21(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> U42(isNat(activate(N)),activate(M),activate(N)) U42(tt(),M,N) -> s(plus(activate(N),activate(M))) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(isNat(activate(V1)),activate(V2)) isNat(n__s(V1)) -> U21(isNat(activate(V1))) plus(N,0()) -> U31(isNat(N),N) plus(N,s(M)) -> U41(isNat(M),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__s(X)) -> s(X) activate(X) -> X TDG Processor: DPs: U11#(tt(),V2) -> activate#(V2) U11#(tt(),V2) -> isNat#(activate(V2)) U11#(tt(),V2) -> U12#(isNat(activate(V2))) U31#(tt(),N) -> activate#(N) U41#(tt(),M,N) -> activate#(M) U41#(tt(),M,N) -> activate#(N) U41#(tt(),M,N) -> isNat#(activate(N)) U41#(tt(),M,N) -> U42#(isNat(activate(N)),activate(M),activate(N)) U42#(tt(),M,N) -> activate#(M) U42#(tt(),M,N) -> activate#(N) U42#(tt(),M,N) -> plus#(activate(N),activate(M)) U42#(tt(),M,N) -> s#(plus(activate(N),activate(M))) 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)) -> U11#(isNat(activate(V1)),activate(V2)) isNat#(n__s(V1)) -> activate#(V1) isNat#(n__s(V1)) -> isNat#(activate(V1)) isNat#(n__s(V1)) -> U21#(isNat(activate(V1))) plus#(N,0()) -> isNat#(N) plus#(N,0()) -> U31#(isNat(N),N) plus#(N,s(M)) -> isNat#(M) plus#(N,s(M)) -> U41#(isNat(M),M,N) activate#(n__0()) -> 0#() activate#(n__plus(X1,X2)) -> plus#(X1,X2) activate#(n__s(X)) -> s#(X) TRS: U11(tt(),V2) -> U12(isNat(activate(V2))) U12(tt()) -> tt() U21(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> U42(isNat(activate(N)),activate(M),activate(N)) U42(tt(),M,N) -> s(plus(activate(N),activate(M))) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(isNat(activate(V1)),activate(V2)) isNat(n__s(V1)) -> U21(isNat(activate(V1))) plus(N,0()) -> U31(isNat(N),N) plus(N,s(M)) -> U41(isNat(M),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__s(X)) -> s(X) activate(X) -> X graph: plus#(N,0()) -> U31#(isNat(N),N) -> U31#(tt(),N) -> activate#(N) plus#(N,0()) -> isNat#(N) -> isNat#(n__s(V1)) -> U21#(isNat(activate(V1))) 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)) -> U11#(isNat(activate(V1)),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,s(M)) -> U41#(isNat(M),M,N) -> U41#(tt(),M,N) -> U42#(isNat(activate(N)),activate(M),activate(N)) plus#(N,s(M)) -> U41#(isNat(M),M,N) -> U41#(tt(),M,N) -> isNat#(activate(N)) plus#(N,s(M)) -> U41#(isNat(M),M,N) -> U41#(tt(),M,N) -> activate#(N) plus#(N,s(M)) -> U41#(isNat(M),M,N) -> U41#(tt(),M,N) -> activate#(M) plus#(N,s(M)) -> isNat#(M) -> isNat#(n__s(V1)) -> U21#(isNat(activate(V1))) 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)) -> U11#(isNat(activate(V1)),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) U42#(tt(),M,N) -> plus#(activate(N),activate(M)) -> plus#(N,s(M)) -> U41#(isNat(M),M,N) U42#(tt(),M,N) -> plus#(activate(N),activate(M)) -> plus#(N,s(M)) -> isNat#(M) U42#(tt(),M,N) -> plus#(activate(N),activate(M)) -> plus#(N,0()) -> U31#(isNat(N),N) U42#(tt(),M,N) -> plus#(activate(N),activate(M)) -> plus#(N,0()) -> isNat#(N) U42#(tt(),M,N) -> activate#(M) -> activate#(n__s(X)) -> s#(X) U42#(tt(),M,N) -> activate#(M) -> activate#(n__plus(X1,X2)) -> plus#(X1,X2) U42#(tt(),M,N) -> activate#(M) -> activate#(n__0()) -> 0#() U42#(tt(),M,N) -> activate#(N) -> activate#(n__s(X)) -> s#(X) U42#(tt(),M,N) -> activate#(N) -> activate#(n__plus(X1,X2)) -> plus#(X1,X2) U42#(tt(),M,N) -> activate#(N) -> activate#(n__0()) -> 0#() U41#(tt(),M,N) -> U42#(isNat(activate(N)),activate(M),activate(N)) -> U42#(tt(),M,N) -> s#(plus(activate(N),activate(M))) U41#(tt(),M,N) -> U42#(isNat(activate(N)),activate(M),activate(N)) -> U42#(tt(),M,N) -> plus#(activate(N),activate(M)) U41#(tt(),M,N) -> U42#(isNat(activate(N)),activate(M),activate(N)) -> U42#(tt(),M,N) -> activate#(N) U41#(tt(),M,N) -> U42#(isNat(activate(N)),activate(M),activate(N)) -> U42#(tt(),M,N) -> activate#(M) U41#(tt(),M,N) -> isNat#(activate(N)) -> isNat#(n__s(V1)) -> U21#(isNat(activate(V1))) U41#(tt(),M,N) -> isNat#(activate(N)) -> isNat#(n__s(V1)) -> isNat#(activate(V1)) U41#(tt(),M,N) -> isNat#(activate(N)) -> isNat#(n__s(V1)) -> activate#(V1) U41#(tt(),M,N) -> isNat#(activate(N)) -> isNat#(n__plus(V1,V2)) -> U11#(isNat(activate(V1)),activate(V2)) U41#(tt(),M,N) -> isNat#(activate(N)) -> isNat#(n__plus(V1,V2)) -> isNat#(activate(V1)) U41#(tt(),M,N) -> isNat#(activate(N)) -> isNat#(n__plus(V1,V2)) -> activate#(V1) U41#(tt(),M,N) -> isNat#(activate(N)) -> isNat#(n__plus(V1,V2)) -> activate#(V2) U41#(tt(),M,N) -> activate#(M) -> activate#(n__s(X)) -> s#(X) U41#(tt(),M,N) -> activate#(M) -> activate#(n__plus(X1,X2)) -> plus#(X1,X2) U41#(tt(),M,N) -> activate#(M) -> activate#(n__0()) -> 0#() U41#(tt(),M,N) -> activate#(N) -> activate#(n__s(X)) -> s#(X) U41#(tt(),M,N) -> activate#(N) -> activate#(n__plus(X1,X2)) -> plus#(X1,X2) U41#(tt(),M,N) -> activate#(N) -> activate#(n__0()) -> 0#() U31#(tt(),N) -> activate#(N) -> activate#(n__s(X)) -> s#(X) U31#(tt(),N) -> activate#(N) -> activate#(n__plus(X1,X2)) -> plus#(X1,X2) U31#(tt(),N) -> activate#(N) -> activate#(n__0()) -> 0#() isNat#(n__s(V1)) -> isNat#(activate(V1)) -> isNat#(n__s(V1)) -> U21#(isNat(activate(V1))) 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)) -> U11#(isNat(activate(V1)),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#(X) isNat#(n__s(V1)) -> activate#(V1) -> activate#(n__plus(X1,X2)) -> plus#(X1,X2) isNat#(n__s(V1)) -> activate#(V1) -> activate#(n__0()) -> 0#() isNat#(n__plus(V1,V2)) -> isNat#(activate(V1)) -> isNat#(n__s(V1)) -> U21#(isNat(activate(V1))) 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)) -> U11#(isNat(activate(V1)),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)) -> activate#(V1) -> activate#(n__s(X)) -> s#(X) isNat#(n__plus(V1,V2)) -> activate#(V1) -> activate#(n__plus(X1,X2)) -> plus#(X1,X2) isNat#(n__plus(V1,V2)) -> activate#(V1) -> activate#(n__0()) -> 0#() isNat#(n__plus(V1,V2)) -> activate#(V2) -> activate#(n__s(X)) -> s#(X) isNat#(n__plus(V1,V2)) -> activate#(V2) -> activate#(n__plus(X1,X2)) -> plus#(X1,X2) isNat#(n__plus(V1,V2)) -> activate#(V2) -> activate#(n__0()) -> 0#() isNat#(n__plus(V1,V2)) -> U11#(isNat(activate(V1)),activate(V2)) -> U11#(tt(),V2) -> U12#(isNat(activate(V2))) isNat#(n__plus(V1,V2)) -> U11#(isNat(activate(V1)),activate(V2)) -> U11#(tt(),V2) -> isNat#(activate(V2)) isNat#(n__plus(V1,V2)) -> U11#(isNat(activate(V1)),activate(V2)) -> U11#(tt(),V2) -> activate#(V2) activate#(n__plus(X1,X2)) -> plus#(X1,X2) -> plus#(N,s(M)) -> U41#(isNat(M),M,N) activate#(n__plus(X1,X2)) -> plus#(X1,X2) -> plus#(N,s(M)) -> isNat#(M) activate#(n__plus(X1,X2)) -> plus#(X1,X2) -> plus#(N,0()) -> U31#(isNat(N),N) activate#(n__plus(X1,X2)) -> plus#(X1,X2) -> plus#(N,0()) -> isNat#(N) U11#(tt(),V2) -> isNat#(activate(V2)) -> isNat#(n__s(V1)) -> U21#(isNat(activate(V1))) U11#(tt(),V2) -> isNat#(activate(V2)) -> isNat#(n__s(V1)) -> isNat#(activate(V1)) U11#(tt(),V2) -> isNat#(activate(V2)) -> isNat#(n__s(V1)) -> activate#(V1) U11#(tt(),V2) -> isNat#(activate(V2)) -> isNat#(n__plus(V1,V2)) -> U11#(isNat(activate(V1)),activate(V2)) U11#(tt(),V2) -> isNat#(activate(V2)) -> isNat#(n__plus(V1,V2)) -> isNat#(activate(V1)) U11#(tt(),V2) -> isNat#(activate(V2)) -> isNat#(n__plus(V1,V2)) -> activate#(V1) U11#(tt(),V2) -> isNat#(activate(V2)) -> isNat#(n__plus(V1,V2)) -> activate#(V2) U11#(tt(),V2) -> activate#(V2) -> activate#(n__s(X)) -> s#(X) U11#(tt(),V2) -> activate#(V2) -> activate#(n__plus(X1,X2)) -> plus#(X1,X2) U11#(tt(),V2) -> activate#(V2) -> activate#(n__0()) -> 0#() SCC Processor: #sccs: 1 #rules: 21 #arcs: 89/676 DPs: plus#(N,0()) -> U31#(isNat(N),N) U31#(tt(),N) -> activate#(N) activate#(n__plus(X1,X2)) -> plus#(X1,X2) plus#(N,0()) -> isNat#(N) 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)) -> U11#(isNat(activate(V1)),activate(V2)) U11#(tt(),V2) -> activate#(V2) U11#(tt(),V2) -> isNat#(activate(V2)) isNat#(n__s(V1)) -> activate#(V1) isNat#(n__s(V1)) -> isNat#(activate(V1)) plus#(N,s(M)) -> isNat#(M) plus#(N,s(M)) -> U41#(isNat(M),M,N) U41#(tt(),M,N) -> activate#(M) U41#(tt(),M,N) -> activate#(N) U41#(tt(),M,N) -> isNat#(activate(N)) U41#(tt(),M,N) -> U42#(isNat(activate(N)),activate(M),activate(N)) U42#(tt(),M,N) -> activate#(M) U42#(tt(),M,N) -> activate#(N) U42#(tt(),M,N) -> plus#(activate(N),activate(M)) TRS: U11(tt(),V2) -> U12(isNat(activate(V2))) U12(tt()) -> tt() U21(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> U42(isNat(activate(N)),activate(M),activate(N)) U42(tt(),M,N) -> s(plus(activate(N),activate(M))) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(isNat(activate(V1)),activate(V2)) isNat(n__s(V1)) -> U21(isNat(activate(V1))) plus(N,0()) -> U31(isNat(N),N) plus(N,s(M)) -> U41(isNat(M),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__s(X)) -> s(X) activate(X) -> X Arctic Interpretation Processor: dimension: 1 usable rules: U31(tt(),N) -> activate(N) U41(tt(),M,N) -> U42(isNat(activate(N)),activate(M),activate(N)) U42(tt(),M,N) -> s(plus(activate(N),activate(M))) plus(N,0()) -> U31(isNat(N),N) plus(N,s(M)) -> U41(isNat(M),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__s(X)) -> s(X) activate(X) -> X interpretation: [plus#](x0, x1) = 4x0 + 7x1, [U42#](x0, x1, x2) = 7x1 + 4x2, [U41#](x0, x1, x2) = 7x1 + 4x2 + 4, [U31#](x0, x1) = 1x1, [isNat#](x0) = x0 + 0, [activate#](x0) = x0, [U11#](x0, x1) = 4x1 + 4, [0] = 0, [n__s](x0) = x0 + 0, [n__plus](x0, x1) = 4x0 + 7x1 + 4, [n__0] = 0, [s](x0) = x0 + 0, [plus](x0, x1) = 4x0 + 7x1 + 4, [U42](x0, x1, x2) = 7x1 + 4x2 + 4, [U41](x0, x1, x2) = 7x1 + 4x2 + 7, [U31](x0, x1) = 2x1 + 0, [U21](x0) = 0, [U12](x0) = 1x0 + 12, [isNat](x0) = 0, [activate](x0) = x0, [U11](x0, x1) = x0 + 1x1 + 1, [tt] = 0 orientation: plus#(N,0()) = 4N + 7 >= 1N = U31#(isNat(N),N) U31#(tt(),N) = 1N >= N = activate#(N) activate#(n__plus(X1,X2)) = 4X1 + 7X2 + 4 >= 4X1 + 7X2 = plus#(X1,X2) plus#(N,0()) = 4N + 7 >= N + 0 = isNat#(N) isNat#(n__plus(V1,V2)) = 4V1 + 7V2 + 4 >= V2 = activate#(V2) isNat#(n__plus(V1,V2)) = 4V1 + 7V2 + 4 >= V1 = activate#(V1) isNat#(n__plus(V1,V2)) = 4V1 + 7V2 + 4 >= V1 + 0 = isNat#(activate(V1)) isNat#(n__plus(V1,V2)) = 4V1 + 7V2 + 4 >= 4V2 + 4 = U11#(isNat(activate(V1)),activate(V2)) U11#(tt(),V2) = 4V2 + 4 >= V2 = activate#(V2) U11#(tt(),V2) = 4V2 + 4 >= V2 + 0 = isNat#(activate(V2)) isNat#(n__s(V1)) = V1 + 0 >= V1 = activate#(V1) isNat#(n__s(V1)) = V1 + 0 >= V1 + 0 = isNat#(activate(V1)) plus#(N,s(M)) = 7M + 4N + 7 >= M + 0 = isNat#(M) plus#(N,s(M)) = 7M + 4N + 7 >= 7M + 4N + 4 = U41#(isNat(M),M,N) U41#(tt(),M,N) = 7M + 4N + 4 >= M = activate#(M) U41#(tt(),M,N) = 7M + 4N + 4 >= N = activate#(N) U41#(tt(),M,N) = 7M + 4N + 4 >= N + 0 = isNat#(activate(N)) U41#(tt(),M,N) = 7M + 4N + 4 >= 7M + 4N = U42#(isNat(activate(N)),activate(M),activate(N)) U42#(tt(),M,N) = 7M + 4N >= M = activate#(M) U42#(tt(),M,N) = 7M + 4N >= N = activate#(N) U42#(tt(),M,N) = 7M + 4N >= 7M + 4N = plus#(activate(N),activate(M)) U11(tt(),V2) = 1V2 + 1 >= 12 = U12(isNat(activate(V2))) U12(tt()) = 12 >= 0 = tt() U21(tt()) = 0 >= 0 = tt() U31(tt(),N) = 2N + 0 >= N = activate(N) U41(tt(),M,N) = 7M + 4N + 7 >= 7M + 4N + 4 = U42(isNat(activate(N)),activate(M),activate(N)) U42(tt(),M,N) = 7M + 4N + 4 >= 7M + 4N + 4 = s(plus(activate(N),activate(M))) isNat(n__0()) = 0 >= 0 = tt() isNat(n__plus(V1,V2)) = 0 >= 1V2 + 1 = U11(isNat(activate(V1)),activate(V2)) isNat(n__s(V1)) = 0 >= 0 = U21(isNat(activate(V1))) plus(N,0()) = 4N + 7 >= 2N + 0 = U31(isNat(N),N) plus(N,s(M)) = 7M + 4N + 7 >= 7M + 4N + 7 = U41(isNat(M),M,N) 0() = 0 >= 0 = n__0() plus(X1,X2) = 4X1 + 7X2 + 4 >= 4X1 + 7X2 + 4 = n__plus(X1,X2) s(X) = X + 0 >= X + 0 = n__s(X) activate(n__0()) = 0 >= 0 = 0() activate(n__plus(X1,X2)) = 4X1 + 7X2 + 4 >= 4X1 + 7X2 + 4 = plus(X1,X2) activate(n__s(X)) = X + 0 >= X + 0 = s(X) activate(X) = X >= X = X problem: DPs: activate#(n__plus(X1,X2)) -> plus#(X1,X2) isNat#(n__plus(V1,V2)) -> U11#(isNat(activate(V1)),activate(V2)) isNat#(n__s(V1)) -> activate#(V1) isNat#(n__s(V1)) -> isNat#(activate(V1)) plus#(N,s(M)) -> U41#(isNat(M),M,N) U41#(tt(),M,N) -> U42#(isNat(activate(N)),activate(M),activate(N)) U42#(tt(),M,N) -> plus#(activate(N),activate(M)) TRS: U11(tt(),V2) -> U12(isNat(activate(V2))) U12(tt()) -> tt() U21(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> U42(isNat(activate(N)),activate(M),activate(N)) U42(tt(),M,N) -> s(plus(activate(N),activate(M))) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(isNat(activate(V1)),activate(V2)) isNat(n__s(V1)) -> U21(isNat(activate(V1))) plus(N,0()) -> U31(isNat(N),N) plus(N,s(M)) -> U41(isNat(M),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__s(X)) -> s(X) activate(X) -> X Restore Modifier: DPs: activate#(n__plus(X1,X2)) -> plus#(X1,X2) isNat#(n__plus(V1,V2)) -> U11#(isNat(activate(V1)),activate(V2)) isNat#(n__s(V1)) -> activate#(V1) isNat#(n__s(V1)) -> isNat#(activate(V1)) plus#(N,s(M)) -> U41#(isNat(M),M,N) U41#(tt(),M,N) -> U42#(isNat(activate(N)),activate(M),activate(N)) U42#(tt(),M,N) -> plus#(activate(N),activate(M)) TRS: U11(tt(),V2) -> U12(isNat(activate(V2))) U12(tt()) -> tt() U21(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> U42(isNat(activate(N)),activate(M),activate(N)) U42(tt(),M,N) -> s(plus(activate(N),activate(M))) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(isNat(activate(V1)),activate(V2)) isNat(n__s(V1)) -> U21(isNat(activate(V1))) plus(N,0()) -> U31(isNat(N),N) plus(N,s(M)) -> U41(isNat(M),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__s(X)) -> s(X) activate(X) -> X SCC Processor: #sccs: 2 #rules: 4 #arcs: 63/49 DPs: isNat#(n__s(V1)) -> isNat#(activate(V1)) TRS: U11(tt(),V2) -> U12(isNat(activate(V2))) U12(tt()) -> tt() U21(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> U42(isNat(activate(N)),activate(M),activate(N)) U42(tt(),M,N) -> s(plus(activate(N),activate(M))) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(isNat(activate(V1)),activate(V2)) isNat(n__s(V1)) -> U21(isNat(activate(V1))) plus(N,0()) -> U31(isNat(N),N) plus(N,s(M)) -> U41(isNat(M),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__s(X)) -> s(X) activate(X) -> X Matrix Interpretation Processor: dim=1 usable rules: U31(tt(),N) -> activate(N) U41(tt(),M,N) -> U42(isNat(activate(N)),activate(M),activate(N)) U42(tt(),M,N) -> s(plus(activate(N),activate(M))) plus(N,0()) -> U31(isNat(N),N) plus(N,s(M)) -> U41(isNat(M),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__s(X)) -> s(X) activate(X) -> X interpretation: [isNat#](x0) = x0, [0] = 2, [n__s](x0) = x0 + 1, [n__plus](x0, x1) = x0 + 2x1, [n__0] = 2, [s](x0) = x0 + 1, [plus](x0, x1) = x0 + 2x1, [U42](x0, x1, x2) = 2x1 + x2 + 2, [U41](x0, x1, x2) = 2x1 + x2 + 2, [U31](x0, x1) = x1 + 4, [U21](x0) = 3x0 + 5, [U12](x0) = 3x0 + 5, [isNat](x0) = 4x0, [activate](x0) = x0, [U11](x0, x1) = 0, [tt] = 1 orientation: isNat#(n__s(V1)) = V1 + 1 >= V1 = isNat#(activate(V1)) U11(tt(),V2) = 0 >= 12V2 + 5 = U12(isNat(activate(V2))) U12(tt()) = 8 >= 1 = tt() U21(tt()) = 8 >= 1 = tt() U31(tt(),N) = N + 4 >= N = activate(N) U41(tt(),M,N) = 2M + N + 2 >= 2M + N + 2 = U42(isNat(activate(N)),activate(M),activate(N)) U42(tt(),M,N) = 2M + N + 2 >= 2M + N + 1 = s(plus(activate(N),activate(M))) isNat(n__0()) = 8 >= 1 = tt() isNat(n__plus(V1,V2)) = 4V1 + 8V2 >= 0 = U11(isNat(activate(V1)),activate(V2)) isNat(n__s(V1)) = 4V1 + 4 >= 12V1 + 5 = U21(isNat(activate(V1))) plus(N,0()) = N + 4 >= N + 4 = U31(isNat(N),N) plus(N,s(M)) = 2M + N + 2 >= 2M + N + 2 = U41(isNat(M),M,N) 0() = 2 >= 2 = n__0() plus(X1,X2) = X1 + 2X2 >= X1 + 2X2 = n__plus(X1,X2) s(X) = X + 1 >= X + 1 = n__s(X) activate(n__0()) = 2 >= 2 = 0() activate(n__plus(X1,X2)) = X1 + 2X2 >= X1 + 2X2 = plus(X1,X2) activate(n__s(X)) = X + 1 >= X + 1 = s(X) activate(X) = X >= X = X problem: DPs: TRS: U11(tt(),V2) -> U12(isNat(activate(V2))) U12(tt()) -> tt() U21(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> U42(isNat(activate(N)),activate(M),activate(N)) U42(tt(),M,N) -> s(plus(activate(N),activate(M))) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(isNat(activate(V1)),activate(V2)) isNat(n__s(V1)) -> U21(isNat(activate(V1))) plus(N,0()) -> U31(isNat(N),N) plus(N,s(M)) -> U41(isNat(M),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__s(X)) -> s(X) activate(X) -> X Qed DPs: plus#(N,s(M)) -> U41#(isNat(M),M,N) U41#(tt(),M,N) -> U42#(isNat(activate(N)),activate(M),activate(N)) U42#(tt(),M,N) -> plus#(activate(N),activate(M)) TRS: U11(tt(),V2) -> U12(isNat(activate(V2))) U12(tt()) -> tt() U21(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> U42(isNat(activate(N)),activate(M),activate(N)) U42(tt(),M,N) -> s(plus(activate(N),activate(M))) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(isNat(activate(V1)),activate(V2)) isNat(n__s(V1)) -> U21(isNat(activate(V1))) plus(N,0()) -> U31(isNat(N),N) plus(N,s(M)) -> U41(isNat(M),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__s(X)) -> s(X) activate(X) -> X Matrix Interpretation Processor: dim=1 usable rules: U31(tt(),N) -> activate(N) U41(tt(),M,N) -> U42(isNat(activate(N)),activate(M),activate(N)) U42(tt(),M,N) -> s(plus(activate(N),activate(M))) plus(N,0()) -> U31(isNat(N),N) plus(N,s(M)) -> U41(isNat(M),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__s(X)) -> s(X) activate(X) -> X interpretation: [plus#](x0, x1) = 5x1, [U42#](x0, x1, x2) = 5x1, [U41#](x0, x1, x2) = 5x1, [0] = 4, [n__s](x0) = x0 + 5, [n__plus](x0, x1) = x0 + 2x1 + 1, [n__0] = 4, [s](x0) = x0 + 5, [plus](x0, x1) = x0 + 2x1 + 1, [U42](x0, x1, x2) = 2x1 + x2 + 6, [U41](x0, x1, x2) = 2x1 + x2 + 7, [U31](x0, x1) = x1 + 1, [U21](x0) = 0, [U12](x0) = 0, [isNat](x0) = 0, [activate](x0) = x0, [U11](x0, x1) = 0, [tt] = 0 orientation: plus#(N,s(M)) = 5M + 25 >= 5M = U41#(isNat(M),M,N) U41#(tt(),M,N) = 5M >= 5M = U42#(isNat(activate(N)),activate(M),activate(N)) U42#(tt(),M,N) = 5M >= 5M = plus#(activate(N),activate(M)) U11(tt(),V2) = 0 >= 0 = U12(isNat(activate(V2))) U12(tt()) = 0 >= 0 = tt() U21(tt()) = 0 >= 0 = tt() U31(tt(),N) = N + 1 >= N = activate(N) U41(tt(),M,N) = 2M + N + 7 >= 2M + N + 6 = U42(isNat(activate(N)),activate(M),activate(N)) U42(tt(),M,N) = 2M + N + 6 >= 2M + N + 6 = s(plus(activate(N),activate(M))) isNat(n__0()) = 0 >= 0 = tt() isNat(n__plus(V1,V2)) = 0 >= 0 = U11(isNat(activate(V1)),activate(V2)) isNat(n__s(V1)) = 0 >= 0 = U21(isNat(activate(V1))) plus(N,0()) = N + 9 >= N + 1 = U31(isNat(N),N) plus(N,s(M)) = 2M + N + 11 >= 2M + N + 7 = U41(isNat(M),M,N) 0() = 4 >= 4 = n__0() plus(X1,X2) = X1 + 2X2 + 1 >= X1 + 2X2 + 1 = n__plus(X1,X2) s(X) = X + 5 >= X + 5 = n__s(X) activate(n__0()) = 4 >= 4 = 0() activate(n__plus(X1,X2)) = X1 + 2X2 + 1 >= X1 + 2X2 + 1 = plus(X1,X2) activate(n__s(X)) = X + 5 >= X + 5 = s(X) activate(X) = X >= X = X problem: DPs: U41#(tt(),M,N) -> U42#(isNat(activate(N)),activate(M),activate(N)) U42#(tt(),M,N) -> plus#(activate(N),activate(M)) TRS: U11(tt(),V2) -> U12(isNat(activate(V2))) U12(tt()) -> tt() U21(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> U42(isNat(activate(N)),activate(M),activate(N)) U42(tt(),M,N) -> s(plus(activate(N),activate(M))) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(isNat(activate(V1)),activate(V2)) isNat(n__s(V1)) -> U21(isNat(activate(V1))) plus(N,0()) -> U31(isNat(N),N) plus(N,s(M)) -> U41(isNat(M),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__s(X)) -> s(X) activate(X) -> X Restore Modifier: DPs: U41#(tt(),M,N) -> U42#(isNat(activate(N)),activate(M),activate(N)) U42#(tt(),M,N) -> plus#(activate(N),activate(M)) TRS: U11(tt(),V2) -> U12(isNat(activate(V2))) U12(tt()) -> tt() U21(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> U42(isNat(activate(N)),activate(M),activate(N)) U42(tt(),M,N) -> s(plus(activate(N),activate(M))) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(isNat(activate(V1)),activate(V2)) isNat(n__s(V1)) -> U21(isNat(activate(V1))) plus(N,0()) -> U31(isNat(N),N) plus(N,s(M)) -> U41(isNat(M),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) s(X) -> n__s(X) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__s(X)) -> s(X) activate(X) -> X SCC Processor: #sccs: 0 #rules: 0 #arcs: 3/4