/export/starexec/sandbox2/solver/bin/starexec_run_ttt2 /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/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(activate(X1),activate(X2)) activate(n__s(X)) -> s(activate(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)) -> activate#(X2) activate#(n__plus(X1,X2)) -> activate#(X1) activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) activate#(n__s(X)) -> activate#(X) activate#(n__s(X)) -> s#(activate(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(activate(X1),activate(X2)) activate(n__s(X)) -> s(activate(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)) -> activate#(X2) activate#(n__plus(X1,X2)) -> activate#(X1) activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) activate#(n__s(X)) -> activate#(X) activate#(n__s(X)) -> s#(activate(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(activate(X1),activate(X2)) activate(n__s(X)) -> s(activate(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#(activate(X)) U42#(tt(),M,N) -> activate#(M) -> activate#(n__s(X)) -> activate#(X) U42#(tt(),M,N) -> activate#(M) -> activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) U42#(tt(),M,N) -> activate#(M) -> activate#(n__plus(X1,X2)) -> activate#(X1) U42#(tt(),M,N) -> activate#(M) -> activate#(n__plus(X1,X2)) -> activate#(X2) U42#(tt(),M,N) -> activate#(M) -> activate#(n__0()) -> 0#() U42#(tt(),M,N) -> activate#(N) -> activate#(n__s(X)) -> s#(activate(X)) U42#(tt(),M,N) -> activate#(N) -> activate#(n__s(X)) -> activate#(X) U42#(tt(),M,N) -> activate#(N) -> activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) U42#(tt(),M,N) -> activate#(N) -> activate#(n__plus(X1,X2)) -> activate#(X1) U42#(tt(),M,N) -> activate#(N) -> activate#(n__plus(X1,X2)) -> activate#(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#(activate(X)) U41#(tt(),M,N) -> activate#(M) -> activate#(n__s(X)) -> activate#(X) U41#(tt(),M,N) -> activate#(M) -> activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) U41#(tt(),M,N) -> activate#(M) -> activate#(n__plus(X1,X2)) -> activate#(X1) U41#(tt(),M,N) -> activate#(M) -> activate#(n__plus(X1,X2)) -> activate#(X2) U41#(tt(),M,N) -> activate#(M) -> activate#(n__0()) -> 0#() U41#(tt(),M,N) -> activate#(N) -> activate#(n__s(X)) -> s#(activate(X)) U41#(tt(),M,N) -> activate#(N) -> activate#(n__s(X)) -> activate#(X) U41#(tt(),M,N) -> activate#(N) -> activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) U41#(tt(),M,N) -> activate#(N) -> activate#(n__plus(X1,X2)) -> activate#(X1) U41#(tt(),M,N) -> activate#(N) -> activate#(n__plus(X1,X2)) -> activate#(X2) U41#(tt(),M,N) -> activate#(N) -> activate#(n__0()) -> 0#() U31#(tt(),N) -> activate#(N) -> activate#(n__s(X)) -> s#(activate(X)) U31#(tt(),N) -> activate#(N) -> activate#(n__s(X)) -> activate#(X) U31#(tt(),N) -> activate#(N) -> activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) U31#(tt(),N) -> activate#(N) -> activate#(n__plus(X1,X2)) -> activate#(X1) U31#(tt(),N) -> activate#(N) -> activate#(n__plus(X1,X2)) -> activate#(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#(activate(X)) isNat#(n__s(V1)) -> activate#(V1) -> activate#(n__s(X)) -> activate#(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)) -> 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#(activate(X)) isNat#(n__plus(V1,V2)) -> activate#(V1) -> activate#(n__s(X)) -> activate#(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#() 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__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)) -> 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__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__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__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) -> plus#(N,s(M)) -> U41#(isNat(M),M,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()) -> U31#(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__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__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(),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#(activate(X)) U11#(tt(),V2) -> activate#(V2) -> activate#(n__s(X)) -> activate#(X) U11#(tt(),V2) -> activate#(V2) -> activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) U11#(tt(),V2) -> activate#(V2) -> activate#(n__plus(X1,X2)) -> activate#(X1) U11#(tt(),V2) -> activate#(V2) -> activate#(n__plus(X1,X2)) -> activate#(X2) U11#(tt(),V2) -> activate#(V2) -> activate#(n__0()) -> 0#() SCC Processor: #sccs: 1 #rules: 24 #arcs: 134/841 DPs: plus#(N,0()) -> U31#(isNat(N),N) U31#(tt(),N) -> activate#(N) 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#(V2) activate#(n__s(X)) -> activate#(X) 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(activate(X1),activate(X2)) activate(n__s(X)) -> s(activate(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(activate(X1),activate(X2)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X interpretation: [U12](x0) = 6x0 + 13, [U11#](x0, x1) = x1 + 0, [U42](x0, x1, x2) = x1 + 1x2 + 6, [U11](x0, x1) = 4x1, [isNat](x0) = x0 + 1, [activate#](x0) = x0, [U41#](x0, x1, x2) = x1 + x2 + 6, [isNat#](x0) = x0, [U42#](x0, x1, x2) = x1 + x2, [U21](x0) = 1x0 + 8, [s](x0) = x0 + 6, [tt] = 0, [U41](x0, x1, x2) = x1 + 1x2 + 6, [U31#](x0, x1) = x1, [0] = 4, [n__plus](x0, x1) = 1x0 + x1 + 0, [plus#](x0, x1) = x0 + x1, [n__0] = 4, [plus](x0, x1) = 1x0 + x1 + 0, [n__s](x0) = x0 + 6, [U31](x0, x1) = x1 + 0, [activate](x0) = x0 orientation: plus#(N,0()) = N + 4 >= N = U31#(isNat(N),N) U31#(tt(),N) = N >= N = activate#(N) activate#(n__plus(X1,X2)) = 1X1 + X2 + 0 >= X2 = activate#(X2) activate#(n__plus(X1,X2)) = 1X1 + X2 + 0 >= X1 = activate#(X1) activate#(n__plus(X1,X2)) = 1X1 + X2 + 0 >= X1 + X2 = plus#(activate(X1),activate(X2)) plus#(N,0()) = N + 4 >= N = isNat#(N) isNat#(n__plus(V1,V2)) = 1V1 + V2 + 0 >= V2 = activate#(V2) activate#(n__s(X)) = X + 6 >= X = activate#(X) isNat#(n__plus(V1,V2)) = 1V1 + V2 + 0 >= V1 = activate#(V1) isNat#(n__plus(V1,V2)) = 1V1 + V2 + 0 >= V1 = isNat#(activate(V1)) isNat#(n__plus(V1,V2)) = 1V1 + V2 + 0 >= V2 + 0 = U11#(isNat(activate(V1)),activate(V2)) U11#(tt(),V2) = V2 + 0 >= V2 = activate#(V2) U11#(tt(),V2) = V2 + 0 >= V2 = isNat#(activate(V2)) isNat#(n__s(V1)) = V1 + 6 >= V1 = activate#(V1) isNat#(n__s(V1)) = V1 + 6 >= V1 = isNat#(activate(V1)) plus#(N,s(M)) = M + N + 6 >= M = isNat#(M) plus#(N,s(M)) = M + N + 6 >= M + N + 6 = U41#(isNat(M),M,N) U41#(tt(),M,N) = M + N + 6 >= M = activate#(M) U41#(tt(),M,N) = M + N + 6 >= N = activate#(N) U41#(tt(),M,N) = M + N + 6 >= N = isNat#(activate(N)) U41#(tt(),M,N) = M + N + 6 >= M + N = U42#(isNat(activate(N)),activate(M),activate(N)) U42#(tt(),M,N) = M + N >= M = activate#(M) U42#(tt(),M,N) = M + N >= N = activate#(N) U42#(tt(),M,N) = M + N >= M + N = plus#(activate(N),activate(M)) U11(tt(),V2) = 4V2 >= 6V2 + 13 = U12(isNat(activate(V2))) U12(tt()) = 13 >= 0 = tt() U21(tt()) = 8 >= 0 = tt() U31(tt(),N) = N + 0 >= N = activate(N) U41(tt(),M,N) = M + 1N + 6 >= M + 1N + 6 = U42(isNat(activate(N)),activate(M),activate(N)) U42(tt(),M,N) = M + 1N + 6 >= M + 1N + 6 = s(plus(activate(N),activate(M))) isNat(n__0()) = 4 >= 0 = tt() isNat(n__plus(V1,V2)) = 1V1 + V2 + 1 >= 4V2 = U11(isNat(activate(V1)),activate(V2)) isNat(n__s(V1)) = V1 + 6 >= 1V1 + 8 = U21(isNat(activate(V1))) plus(N,0()) = 1N + 4 >= N + 0 = U31(isNat(N),N) plus(N,s(M)) = M + 1N + 6 >= M + 1N + 6 = U41(isNat(M),M,N) 0() = 4 >= 4 = n__0() plus(X1,X2) = 1X1 + X2 + 0 >= 1X1 + X2 + 0 = n__plus(X1,X2) s(X) = X + 6 >= X + 6 = n__s(X) activate(n__0()) = 4 >= 4 = 0() activate(n__plus(X1,X2)) = 1X1 + X2 + 0 >= 1X1 + X2 + 0 = plus(activate(X1),activate(X2)) activate(n__s(X)) = X + 6 >= X + 6 = s(activate(X)) activate(X) = X >= X = X problem: DPs: plus#(N,0()) -> U31#(isNat(N),N) U31#(tt(),N) -> activate#(N) activate#(n__plus(X1,X2)) -> activate#(X2) activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) plus#(N,0()) -> isNat#(N) isNat#(n__plus(V1,V2)) -> activate#(V2) activate#(n__s(X)) -> activate#(X) 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(activate(X1),activate(X2)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X Restore Modifier: DPs: plus#(N,0()) -> U31#(isNat(N),N) U31#(tt(),N) -> activate#(N) activate#(n__plus(X1,X2)) -> activate#(X2) activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) plus#(N,0()) -> isNat#(N) isNat#(n__plus(V1,V2)) -> activate#(V2) activate#(n__s(X)) -> activate#(X) 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(activate(X1),activate(X2)) activate(n__s(X)) -> s(activate(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(activate(X1),activate(X2)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X interpretation: [U12](x0) = 6x0 + -16, [U11#](x0, x1) = x1 + 0, [U42](x0, x1, x2) = 2x1 + x2 + 5, [U11](x0, x1) = x1 + -16, [isNat](x0) = x0 + 0, [activate#](x0) = x0, [U41#](x0, x1, x2) = 2x1 + x2 + 0, [isNat#](x0) = x0 + 0, [U42#](x0, x1, x2) = 2x1 + x2 + -16, [U21](x0) = x0 + 0, [s](x0) = x0 + 3, [tt] = 0, [U41](x0, x1, x2) = 2x1 + x2 + 5, [U31#](x0, x1) = x1 + 2, [0] = 0, [n__plus](x0, x1) = x0 + 2x1 + 0, [plus#](x0, x1) = x0 + 2x1, [n__0] = 0, [plus](x0, x1) = x0 + 2x1 + 0, [n__s](x0) = x0 + 3, [U31](x0, x1) = x1 + -8, [activate](x0) = x0 orientation: plus#(N,0()) = N + 2 >= N + 2 = U31#(isNat(N),N) U31#(tt(),N) = N + 2 >= N = activate#(N) activate#(n__plus(X1,X2)) = X1 + 2X2 + 0 >= X2 = activate#(X2) activate#(n__plus(X1,X2)) = X1 + 2X2 + 0 >= X1 + 2X2 = plus#(activate(X1),activate(X2)) plus#(N,0()) = N + 2 >= N + 0 = isNat#(N) isNat#(n__plus(V1,V2)) = V1 + 2V2 + 0 >= V2 = activate#(V2) activate#(n__s(X)) = X + 3 >= X = activate#(X) isNat#(n__plus(V1,V2)) = V1 + 2V2 + 0 >= V2 + 0 = U11#(isNat(activate(V1)),activate(V2)) U11#(tt(),V2) = V2 + 0 >= V2 = activate#(V2) U11#(tt(),V2) = V2 + 0 >= V2 + 0 = isNat#(activate(V2)) isNat#(n__s(V1)) = V1 + 3 >= V1 = activate#(V1) isNat#(n__s(V1)) = V1 + 3 >= V1 + 0 = isNat#(activate(V1)) plus#(N,s(M)) = 2M + N + 5 >= M + 0 = isNat#(M) plus#(N,s(M)) = 2M + N + 5 >= 2M + N + 0 = U41#(isNat(M),M,N) U41#(tt(),M,N) = 2M + N + 0 >= M = activate#(M) U41#(tt(),M,N) = 2M + N + 0 >= N = activate#(N) U41#(tt(),M,N) = 2M + N + 0 >= N + 0 = isNat#(activate(N)) U41#(tt(),M,N) = 2M + N + 0 >= 2M + N + -16 = U42#(isNat(activate(N)),activate(M),activate(N)) U42#(tt(),M,N) = 2M + N + -16 >= M = activate#(M) U42#(tt(),M,N) = 2M + N + -16 >= N = activate#(N) U42#(tt(),M,N) = 2M + N + -16 >= 2M + N = plus#(activate(N),activate(M)) U11(tt(),V2) = V2 + -16 >= 6V2 + 6 = U12(isNat(activate(V2))) U12(tt()) = 6 >= 0 = tt() U21(tt()) = 0 >= 0 = tt() U31(tt(),N) = N + -8 >= N = activate(N) U41(tt(),M,N) = 2M + N + 5 >= 2M + N + 5 = U42(isNat(activate(N)),activate(M),activate(N)) U42(tt(),M,N) = 2M + N + 5 >= 2M + N + 3 = s(plus(activate(N),activate(M))) isNat(n__0()) = 0 >= 0 = tt() isNat(n__plus(V1,V2)) = V1 + 2V2 + 0 >= V2 + -16 = U11(isNat(activate(V1)),activate(V2)) isNat(n__s(V1)) = V1 + 3 >= V1 + 0 = U21(isNat(activate(V1))) plus(N,0()) = N + 2 >= N + -8 = U31(isNat(N),N) plus(N,s(M)) = 2M + N + 5 >= 2M + N + 5 = U41(isNat(M),M,N) 0() = 0 >= 0 = n__0() plus(X1,X2) = X1 + 2X2 + 0 >= X1 + 2X2 + 0 = n__plus(X1,X2) s(X) = X + 3 >= X + 3 = n__s(X) activate(n__0()) = 0 >= 0 = 0() activate(n__plus(X1,X2)) = X1 + 2X2 + 0 >= X1 + 2X2 + 0 = plus(activate(X1),activate(X2)) activate(n__s(X)) = X + 3 >= X + 3 = s(activate(X)) activate(X) = X >= X = X problem: DPs: plus#(N,0()) -> U31#(isNat(N),N) U31#(tt(),N) -> activate#(N) activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) plus#(N,0()) -> isNat#(N) activate#(n__s(X)) -> activate#(X) 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)) -> U41#(isNat(M),M,N) 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#(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(activate(X1),activate(X2)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X Restore Modifier: DPs: plus#(N,0()) -> U31#(isNat(N),N) U31#(tt(),N) -> activate#(N) activate#(n__plus(X1,X2)) -> plus#(activate(X1),activate(X2)) plus#(N,0()) -> isNat#(N) activate#(n__s(X)) -> activate#(X) 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)) -> U41#(isNat(M),M,N) 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#(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(activate(X1),activate(X2)) activate(n__s(X)) -> s(activate(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(activate(X1),activate(X2)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X interpretation: [U12](x0) = x0 + 0, [U11#](x0, x1) = x1 + 0, [U42](x0, x1, x2) = 1x1 + 1x2 + 1, [U11](x0, x1) = x0 + 1x1 + 0, [isNat](x0) = x0 + 0, [activate#](x0) = x0 + 0, [U41#](x0, x1, x2) = x1 + x2 + 0, [isNat#](x0) = x0 + 0, [U42#](x0, x1, x2) = x1 + x2 + 0, [U21](x0) = 0, [s](x0) = x0 + 0, [tt] = 0, [U41](x0, x1, x2) = 1x1 + 1x2 + 1, [U31#](x0, x1) = x1 + 0, [0] = 0, [n__plus](x0, x1) = 1x0 + 1x1 + 1, [plus#](x0, x1) = x0 + x1 + 0, [n__0] = 0, [plus](x0, x1) = 1x0 + 1x1 + 1, [n__s](x0) = x0, [U31](x0, x1) = x1 + 0, [activate](x0) = x0 + 0 orientation: plus#(N,0()) = N + 0 >= N + 0 = U31#(isNat(N),N) U31#(tt(),N) = N + 0 >= N + 0 = activate#(N) activate#(n__plus(X1,X2)) = 1X1 + 1X2 + 1 >= X1 + X2 + 0 = plus#(activate(X1),activate(X2)) plus#(N,0()) = N + 0 >= N + 0 = isNat#(N) activate#(n__s(X)) = X + 0 >= X + 0 = activate#(X) isNat#(n__plus(V1,V2)) = 1V1 + 1V2 + 1 >= V2 + 0 = U11#(isNat(activate(V1)),activate(V2)) U11#(tt(),V2) = V2 + 0 >= V2 + 0 = activate#(V2) U11#(tt(),V2) = V2 + 0 >= V2 + 0 = isNat#(activate(V2)) isNat#(n__s(V1)) = V1 + 0 >= V1 + 0 = activate#(V1) isNat#(n__s(V1)) = V1 + 0 >= V1 + 0 = isNat#(activate(V1)) plus#(N,s(M)) = M + N + 0 >= M + N + 0 = U41#(isNat(M),M,N) U41#(tt(),M,N) = M + N + 0 >= N + 0 = activate#(N) U41#(tt(),M,N) = M + N + 0 >= N + 0 = isNat#(activate(N)) U41#(tt(),M,N) = M + N + 0 >= M + N + 0 = U42#(isNat(activate(N)),activate(M),activate(N)) U42#(tt(),M,N) = M + N + 0 >= N + 0 = activate#(N) U42#(tt(),M,N) = M + N + 0 >= M + N + 0 = plus#(activate(N),activate(M)) U11(tt(),V2) = 1V2 + 0 >= V2 + 0 = U12(isNat(activate(V2))) U12(tt()) = 0 >= 0 = tt() U21(tt()) = 0 >= 0 = tt() U31(tt(),N) = N + 0 >= N + 0 = activate(N) U41(tt(),M,N) = 1M + 1N + 1 >= 1M + 1N + 1 = U42(isNat(activate(N)),activate(M),activate(N)) U42(tt(),M,N) = 1M + 1N + 1 >= 1M + 1N + 1 = s(plus(activate(N),activate(M))) isNat(n__0()) = 0 >= 0 = tt() isNat(n__plus(V1,V2)) = 1V1 + 1V2 + 1 >= V1 + 1V2 + 1 = U11(isNat(activate(V1)),activate(V2)) isNat(n__s(V1)) = V1 + 0 >= 0 = U21(isNat(activate(V1))) plus(N,0()) = 1N + 1 >= N + 0 = U31(isNat(N),N) plus(N,s(M)) = 1M + 1N + 1 >= 1M + 1N + 1 = U41(isNat(M),M,N) 0() = 0 >= 0 = n__0() plus(X1,X2) = 1X1 + 1X2 + 1 >= 1X1 + 1X2 + 1 = n__plus(X1,X2) s(X) = X + 0 >= X = n__s(X) activate(n__0()) = 0 >= 0 = 0() activate(n__plus(X1,X2)) = 1X1 + 1X2 + 1 >= 1X1 + 1X2 + 1 = plus(activate(X1),activate(X2)) activate(n__s(X)) = X + 0 >= X + 0 = s(activate(X)) activate(X) = X + 0 >= X = X problem: DPs: plus#(N,0()) -> U31#(isNat(N),N) U31#(tt(),N) -> activate#(N) plus#(N,0()) -> isNat#(N) activate#(n__s(X)) -> activate#(X) 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)) -> U41#(isNat(M),M,N) 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#(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(activate(X1),activate(X2)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X Restore Modifier: DPs: plus#(N,0()) -> U31#(isNat(N),N) U31#(tt(),N) -> activate#(N) plus#(N,0()) -> isNat#(N) activate#(n__s(X)) -> activate#(X) 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)) -> U41#(isNat(M),M,N) 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#(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(activate(X1),activate(X2)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X SCC Processor: #sccs: 3 #rules: 5 #arcs: 102/196 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(activate(X1),activate(X2)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X Matrix Interpretation Processor: dim=1 usable rules: 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(activate(X1),activate(X2)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X interpretation: [U12](x0) = 0, [U42](x0, x1, x2) = x1 + x2 + 1, [U11](x0, x1) = 0, [isNat](x0) = 1, [U41#](x0, x1, x2) = 4x1 + 4, [U42#](x0, x1, x2) = 2x0 + 4x1 + 2, [U21](x0) = 1, [s](x0) = x0 + 1, [tt] = 0, [U41](x0, x1, x2) = x1 + x2 + 1, [0] = 0, [n__plus](x0, x1) = x0 + x1, [plus#](x0, x1) = 4x1, [n__0] = 0, [plus](x0, x1) = x0 + x1, [n__s](x0) = x0 + 1, [U31](x0, x1) = x1, [activate](x0) = x0 orientation: plus#(N,s(M)) = 4M + 4 >= 4M + 4 = U41#(isNat(M),M,N) U41#(tt(),M,N) = 4M + 4 >= 4M + 4 = U42#(isNat(activate(N)),activate(M),activate(N)) U42#(tt(),M,N) = 4M + 2 >= 4M = plus#(activate(N),activate(M)) U11(tt(),V2) = 0 >= 0 = U12(isNat(activate(V2))) U12(tt()) = 0 >= 0 = tt() U21(tt()) = 1 >= 0 = tt() U31(tt(),N) = N >= N = activate(N) U41(tt(),M,N) = M + N + 1 >= M + N + 1 = U42(isNat(activate(N)),activate(M),activate(N)) U42(tt(),M,N) = M + N + 1 >= M + N + 1 = s(plus(activate(N),activate(M))) isNat(n__0()) = 1 >= 0 = tt() isNat(n__plus(V1,V2)) = 1 >= 0 = U11(isNat(activate(V1)),activate(V2)) isNat(n__s(V1)) = 1 >= 1 = U21(isNat(activate(V1))) plus(N,0()) = N >= N = U31(isNat(N),N) plus(N,s(M)) = M + N + 1 >= M + N + 1 = U41(isNat(M),M,N) 0() = 0 >= 0 = n__0() plus(X1,X2) = X1 + X2 >= X1 + X2 = n__plus(X1,X2) s(X) = X + 1 >= X + 1 = n__s(X) activate(n__0()) = 0 >= 0 = 0() activate(n__plus(X1,X2)) = X1 + X2 >= X1 + X2 = plus(activate(X1),activate(X2)) activate(n__s(X)) = X + 1 >= X + 1 = s(activate(X)) activate(X) = X >= X = X problem: DPs: plus#(N,s(M)) -> U41#(isNat(M),M,N) U41#(tt(),M,N) -> U42#(isNat(activate(N)),activate(M),activate(N)) 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(activate(X1),activate(X2)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X Restore Modifier: DPs: plus#(N,s(M)) -> U41#(isNat(M),M,N) U41#(tt(),M,N) -> U42#(isNat(activate(N)),activate(M),activate(N)) 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(activate(X1),activate(X2)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X SCC Processor: #sccs: 0 #rules: 0 #arcs: 3/4 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(activate(X1),activate(X2)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X Matrix Interpretation Processor: dim=1 usable rules: 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(activate(X1),activate(X2)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X interpretation: [U12](x0) = x0, [U42](x0, x1, x2) = 4x1 + 4x2 + 1, [U11](x0, x1) = x0 + x1, [isNat](x0) = x0, [isNat#](x0) = x0, [U21](x0) = x0, [s](x0) = x0 + 1, [tt] = 1, [U41](x0, x1, x2) = 4x1 + 4x2 + 1, [0] = 6, [n__plus](x0, x1) = 4x0 + 4x1, [n__0] = 6, [plus](x0, x1) = 4x0 + 4x1, [n__s](x0) = x0 + 1, [U31](x0, x1) = x0 + x1 + 6, [activate](x0) = x0 orientation: isNat#(n__s(V1)) = V1 + 1 >= V1 = isNat#(activate(V1)) U11(tt(),V2) = V2 + 1 >= V2 = U12(isNat(activate(V2))) U12(tt()) = 1 >= 1 = tt() U21(tt()) = 1 >= 1 = tt() U31(tt(),N) = N + 7 >= N = activate(N) U41(tt(),M,N) = 4M + 4N + 1 >= 4M + 4N + 1 = U42(isNat(activate(N)),activate(M),activate(N)) U42(tt(),M,N) = 4M + 4N + 1 >= 4M + 4N + 1 = s(plus(activate(N),activate(M))) isNat(n__0()) = 6 >= 1 = tt() isNat(n__plus(V1,V2)) = 4V1 + 4V2 >= V1 + V2 = U11(isNat(activate(V1)),activate(V2)) isNat(n__s(V1)) = V1 + 1 >= V1 = U21(isNat(activate(V1))) plus(N,0()) = 4N + 24 >= 2N + 6 = U31(isNat(N),N) plus(N,s(M)) = 4M + 4N + 4 >= 4M + 4N + 1 = U41(isNat(M),M,N) 0() = 6 >= 6 = n__0() plus(X1,X2) = 4X1 + 4X2 >= 4X1 + 4X2 = n__plus(X1,X2) s(X) = X + 1 >= X + 1 = n__s(X) activate(n__0()) = 6 >= 6 = 0() activate(n__plus(X1,X2)) = 4X1 + 4X2 >= 4X1 + 4X2 = plus(activate(X1),activate(X2)) activate(n__s(X)) = X + 1 >= X + 1 = s(activate(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(activate(X1),activate(X2)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X Qed DPs: activate#(n__s(X)) -> activate#(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(activate(X1),activate(X2)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X Size-Change Termination Processor: 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(activate(X1),activate(X2)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X The DP: activate#(n__s(X)) -> activate#(X) has the edges: 0 > 0 Qed