/export/starexec/sandbox/solver/bin/starexec_run_ttt2 /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X Proof: DP Processor: DPs: U11#(tt(),V1,V2) -> activate#(V2) U11#(tt(),V1,V2) -> activate#(V1) U11#(tt(),V1,V2) -> isNat#(activate(V1)) U11#(tt(),V1,V2) -> U12#(isNat(activate(V1)),activate(V2)) U12#(tt(),V2) -> activate#(V2) U12#(tt(),V2) -> isNat#(activate(V2)) U12#(tt(),V2) -> U13#(isNat(activate(V2))) U21#(tt(),V1) -> activate#(V1) U21#(tt(),V1) -> isNat#(activate(V1)) U21#(tt(),V1) -> U22#(isNat(activate(V1))) U31#(tt(),N) -> activate#(N) U41#(tt(),M,N) -> activate#(M) U41#(tt(),M,N) -> activate#(N) U41#(tt(),M,N) -> plus#(activate(N),activate(M)) U41#(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)) -> isNatKind#(activate(V1)) isNat#(n__plus(V1,V2)) -> and#(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNat#(n__plus(V1,V2)) -> U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) isNat#(n__s(V1)) -> activate#(V1) isNat#(n__s(V1)) -> isNatKind#(activate(V1)) isNat#(n__s(V1)) -> U21#(isNatKind(activate(V1)),activate(V1)) isNatKind#(n__plus(V1,V2)) -> activate#(V2) isNatKind#(n__plus(V1,V2)) -> activate#(V1) isNatKind#(n__plus(V1,V2)) -> isNatKind#(activate(V1)) isNatKind#(n__plus(V1,V2)) -> and#(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind#(n__s(V1)) -> activate#(V1) isNatKind#(n__s(V1)) -> isNatKind#(activate(V1)) plus#(N,0()) -> isNat#(N) plus#(N,0()) -> and#(isNat(N),n__isNatKind(N)) plus#(N,0()) -> U31#(and(isNat(N),n__isNatKind(N)),N) plus#(N,s(M)) -> isNat#(N) plus#(N,s(M)) -> isNat#(M) plus#(N,s(M)) -> and#(isNat(M),n__isNatKind(M)) plus#(N,s(M)) -> and#(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))) plus#(N,s(M)) -> U41#(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) activate#(n__0()) -> 0#() activate#(n__plus(X1,X2)) -> plus#(X1,X2) activate#(n__isNatKind(X)) -> isNatKind#(X) activate#(n__s(X)) -> s#(X) activate#(n__and(X1,X2)) -> and#(X1,X2) TRS: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X TDG Processor: DPs: U11#(tt(),V1,V2) -> activate#(V2) U11#(tt(),V1,V2) -> activate#(V1) U11#(tt(),V1,V2) -> isNat#(activate(V1)) U11#(tt(),V1,V2) -> U12#(isNat(activate(V1)),activate(V2)) U12#(tt(),V2) -> activate#(V2) U12#(tt(),V2) -> isNat#(activate(V2)) U12#(tt(),V2) -> U13#(isNat(activate(V2))) U21#(tt(),V1) -> activate#(V1) U21#(tt(),V1) -> isNat#(activate(V1)) U21#(tt(),V1) -> U22#(isNat(activate(V1))) U31#(tt(),N) -> activate#(N) U41#(tt(),M,N) -> activate#(M) U41#(tt(),M,N) -> activate#(N) U41#(tt(),M,N) -> plus#(activate(N),activate(M)) U41#(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)) -> isNatKind#(activate(V1)) isNat#(n__plus(V1,V2)) -> and#(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNat#(n__plus(V1,V2)) -> U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) isNat#(n__s(V1)) -> activate#(V1) isNat#(n__s(V1)) -> isNatKind#(activate(V1)) isNat#(n__s(V1)) -> U21#(isNatKind(activate(V1)),activate(V1)) isNatKind#(n__plus(V1,V2)) -> activate#(V2) isNatKind#(n__plus(V1,V2)) -> activate#(V1) isNatKind#(n__plus(V1,V2)) -> isNatKind#(activate(V1)) isNatKind#(n__plus(V1,V2)) -> and#(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind#(n__s(V1)) -> activate#(V1) isNatKind#(n__s(V1)) -> isNatKind#(activate(V1)) plus#(N,0()) -> isNat#(N) plus#(N,0()) -> and#(isNat(N),n__isNatKind(N)) plus#(N,0()) -> U31#(and(isNat(N),n__isNatKind(N)),N) plus#(N,s(M)) -> isNat#(N) plus#(N,s(M)) -> isNat#(M) plus#(N,s(M)) -> and#(isNat(M),n__isNatKind(M)) plus#(N,s(M)) -> and#(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))) plus#(N,s(M)) -> U41#(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) activate#(n__0()) -> 0#() activate#(n__plus(X1,X2)) -> plus#(X1,X2) activate#(n__isNatKind(X)) -> isNatKind#(X) activate#(n__s(X)) -> s#(X) activate#(n__and(X1,X2)) -> and#(X1,X2) TRS: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X graph: isNatKind#(n__s(V1)) -> isNatKind#(activate(V1)) -> isNatKind#(n__s(V1)) -> isNatKind#(activate(V1)) isNatKind#(n__s(V1)) -> isNatKind#(activate(V1)) -> isNatKind#(n__s(V1)) -> activate#(V1) isNatKind#(n__s(V1)) -> isNatKind#(activate(V1)) -> isNatKind#(n__plus(V1,V2)) -> and#(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind#(n__s(V1)) -> isNatKind#(activate(V1)) -> isNatKind#(n__plus(V1,V2)) -> isNatKind#(activate(V1)) isNatKind#(n__s(V1)) -> isNatKind#(activate(V1)) -> isNatKind#(n__plus(V1,V2)) -> activate#(V1) isNatKind#(n__s(V1)) -> isNatKind#(activate(V1)) -> isNatKind#(n__plus(V1,V2)) -> activate#(V2) isNatKind#(n__s(V1)) -> activate#(V1) -> activate#(n__and(X1,X2)) -> and#(X1,X2) isNatKind#(n__s(V1)) -> activate#(V1) -> activate#(n__s(X)) -> s#(X) isNatKind#(n__s(V1)) -> activate#(V1) -> activate#(n__isNatKind(X)) -> isNatKind#(X) isNatKind#(n__s(V1)) -> activate#(V1) -> activate#(n__plus(X1,X2)) -> plus#(X1,X2) isNatKind#(n__s(V1)) -> activate#(V1) -> activate#(n__0()) -> 0#() isNatKind#(n__plus(V1,V2)) -> isNatKind#(activate(V1)) -> isNatKind#(n__s(V1)) -> isNatKind#(activate(V1)) isNatKind#(n__plus(V1,V2)) -> isNatKind#(activate(V1)) -> isNatKind#(n__s(V1)) -> activate#(V1) isNatKind#(n__plus(V1,V2)) -> isNatKind#(activate(V1)) -> isNatKind#(n__plus(V1,V2)) -> and#(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind#(n__plus(V1,V2)) -> isNatKind#(activate(V1)) -> isNatKind#(n__plus(V1,V2)) -> isNatKind#(activate(V1)) isNatKind#(n__plus(V1,V2)) -> isNatKind#(activate(V1)) -> isNatKind#(n__plus(V1,V2)) -> activate#(V1) isNatKind#(n__plus(V1,V2)) -> isNatKind#(activate(V1)) -> isNatKind#(n__plus(V1,V2)) -> activate#(V2) isNatKind#(n__plus(V1,V2)) -> and#(isNatKind(activate(V1)),n__isNatKind(activate(V2))) -> and#(tt(),X) -> activate#(X) isNatKind#(n__plus(V1,V2)) -> activate#(V2) -> activate#(n__and(X1,X2)) -> and#(X1,X2) isNatKind#(n__plus(V1,V2)) -> activate#(V2) -> activate#(n__s(X)) -> s#(X) isNatKind#(n__plus(V1,V2)) -> activate#(V2) -> activate#(n__isNatKind(X)) -> isNatKind#(X) isNatKind#(n__plus(V1,V2)) -> activate#(V2) -> activate#(n__plus(X1,X2)) -> plus#(X1,X2) isNatKind#(n__plus(V1,V2)) -> activate#(V2) -> activate#(n__0()) -> 0#() isNatKind#(n__plus(V1,V2)) -> activate#(V1) -> activate#(n__and(X1,X2)) -> and#(X1,X2) isNatKind#(n__plus(V1,V2)) -> activate#(V1) -> activate#(n__s(X)) -> s#(X) isNatKind#(n__plus(V1,V2)) -> activate#(V1) -> activate#(n__isNatKind(X)) -> isNatKind#(X) isNatKind#(n__plus(V1,V2)) -> activate#(V1) -> activate#(n__plus(X1,X2)) -> plus#(X1,X2) isNatKind#(n__plus(V1,V2)) -> activate#(V1) -> activate#(n__0()) -> 0#() and#(tt(),X) -> activate#(X) -> activate#(n__and(X1,X2)) -> and#(X1,X2) and#(tt(),X) -> activate#(X) -> activate#(n__s(X)) -> s#(X) and#(tt(),X) -> activate#(X) -> activate#(n__isNatKind(X)) -> isNatKind#(X) and#(tt(),X) -> activate#(X) -> activate#(n__plus(X1,X2)) -> plus#(X1,X2) and#(tt(),X) -> activate#(X) -> activate#(n__0()) -> 0#() plus#(N,0()) -> and#(isNat(N),n__isNatKind(N)) -> and#(tt(),X) -> activate#(X) plus#(N,0()) -> U31#(and(isNat(N),n__isNatKind(N)),N) -> U31#(tt(),N) -> activate#(N) plus#(N,0()) -> isNat#(N) -> isNat#(n__s(V1)) -> U21#(isNatKind(activate(V1)),activate(V1)) plus#(N,0()) -> isNat#(N) -> isNat#(n__s(V1)) -> isNatKind#(activate(V1)) plus#(N,0()) -> isNat#(N) -> isNat#(n__s(V1)) -> activate#(V1) plus#(N,0()) -> isNat#(N) -> isNat#(n__plus(V1,V2)) -> U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) plus#(N,0()) -> isNat#(N) -> isNat#(n__plus(V1,V2)) -> and#(isNatKind(activate(V1)),n__isNatKind(activate(V2))) plus#(N,0()) -> isNat#(N) -> isNat#(n__plus(V1,V2)) -> isNatKind#(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)) -> and#(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))) -> and#(tt(),X) -> activate#(X) plus#(N,s(M)) -> and#(isNat(M),n__isNatKind(M)) -> and#(tt(),X) -> activate#(X) plus#(N,s(M)) -> U41#(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) -> U41#(tt(),M,N) -> s#(plus(activate(N),activate(M))) plus#(N,s(M)) -> U41#(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) -> U41#(tt(),M,N) -> plus#(activate(N),activate(M)) plus#(N,s(M)) -> U41#(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) -> U41#(tt(),M,N) -> activate#(N) plus#(N,s(M)) -> U41#(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) -> U41#(tt(),M,N) -> activate#(M) plus#(N,s(M)) -> isNat#(M) -> isNat#(n__s(V1)) -> U21#(isNatKind(activate(V1)),activate(V1)) plus#(N,s(M)) -> isNat#(M) -> isNat#(n__s(V1)) -> isNatKind#(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#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) plus#(N,s(M)) -> isNat#(M) -> isNat#(n__plus(V1,V2)) -> and#(isNatKind(activate(V1)),n__isNatKind(activate(V2))) plus#(N,s(M)) -> isNat#(M) -> isNat#(n__plus(V1,V2)) -> isNatKind#(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)) -> isNat#(N) -> isNat#(n__s(V1)) -> U21#(isNatKind(activate(V1)),activate(V1)) plus#(N,s(M)) -> isNat#(N) -> isNat#(n__s(V1)) -> isNatKind#(activate(V1)) plus#(N,s(M)) -> isNat#(N) -> isNat#(n__s(V1)) -> activate#(V1) plus#(N,s(M)) -> isNat#(N) -> isNat#(n__plus(V1,V2)) -> U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) plus#(N,s(M)) -> isNat#(N) -> isNat#(n__plus(V1,V2)) -> and#(isNatKind(activate(V1)),n__isNatKind(activate(V2))) plus#(N,s(M)) -> isNat#(N) -> isNat#(n__plus(V1,V2)) -> isNatKind#(activate(V1)) plus#(N,s(M)) -> isNat#(N) -> isNat#(n__plus(V1,V2)) -> activate#(V1) plus#(N,s(M)) -> isNat#(N) -> isNat#(n__plus(V1,V2)) -> activate#(V2) U41#(tt(),M,N) -> plus#(activate(N),activate(M)) -> plus#(N,s(M)) -> U41#(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) U41#(tt(),M,N) -> plus#(activate(N),activate(M)) -> plus#(N,s(M)) -> and#(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))) U41#(tt(),M,N) -> plus#(activate(N),activate(M)) -> plus#(N,s(M)) -> and#(isNat(M),n__isNatKind(M)) U41#(tt(),M,N) -> plus#(activate(N),activate(M)) -> plus#(N,s(M)) -> isNat#(M) U41#(tt(),M,N) -> plus#(activate(N),activate(M)) -> plus#(N,s(M)) -> isNat#(N) U41#(tt(),M,N) -> plus#(activate(N),activate(M)) -> plus#(N,0()) -> U31#(and(isNat(N),n__isNatKind(N)),N) U41#(tt(),M,N) -> plus#(activate(N),activate(M)) -> plus#(N,0()) -> and#(isNat(N),n__isNatKind(N)) U41#(tt(),M,N) -> plus#(activate(N),activate(M)) -> plus#(N,0()) -> isNat#(N) U41#(tt(),M,N) -> activate#(M) -> activate#(n__and(X1,X2)) -> and#(X1,X2) U41#(tt(),M,N) -> activate#(M) -> activate#(n__s(X)) -> s#(X) U41#(tt(),M,N) -> activate#(M) -> activate#(n__isNatKind(X)) -> isNatKind#(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__and(X1,X2)) -> and#(X1,X2) U41#(tt(),M,N) -> activate#(N) -> activate#(n__s(X)) -> s#(X) U41#(tt(),M,N) -> activate#(N) -> activate#(n__isNatKind(X)) -> isNatKind#(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__and(X1,X2)) -> and#(X1,X2) U31#(tt(),N) -> activate#(N) -> activate#(n__s(X)) -> s#(X) U31#(tt(),N) -> activate#(N) -> activate#(n__isNatKind(X)) -> isNatKind#(X) U31#(tt(),N) -> activate#(N) -> activate#(n__plus(X1,X2)) -> plus#(X1,X2) U31#(tt(),N) -> activate#(N) -> activate#(n__0()) -> 0#() U21#(tt(),V1) -> isNat#(activate(V1)) -> isNat#(n__s(V1)) -> U21#(isNatKind(activate(V1)),activate(V1)) U21#(tt(),V1) -> isNat#(activate(V1)) -> isNat#(n__s(V1)) -> isNatKind#(activate(V1)) U21#(tt(),V1) -> isNat#(activate(V1)) -> isNat#(n__s(V1)) -> activate#(V1) U21#(tt(),V1) -> isNat#(activate(V1)) -> isNat#(n__plus(V1,V2)) -> U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) U21#(tt(),V1) -> isNat#(activate(V1)) -> isNat#(n__plus(V1,V2)) -> and#(isNatKind(activate(V1)),n__isNatKind(activate(V2))) U21#(tt(),V1) -> isNat#(activate(V1)) -> isNat#(n__plus(V1,V2)) -> isNatKind#(activate(V1)) U21#(tt(),V1) -> isNat#(activate(V1)) -> isNat#(n__plus(V1,V2)) -> activate#(V1) U21#(tt(),V1) -> isNat#(activate(V1)) -> isNat#(n__plus(V1,V2)) -> activate#(V2) U21#(tt(),V1) -> activate#(V1) -> activate#(n__and(X1,X2)) -> and#(X1,X2) U21#(tt(),V1) -> activate#(V1) -> activate#(n__s(X)) -> s#(X) U21#(tt(),V1) -> activate#(V1) -> activate#(n__isNatKind(X)) -> isNatKind#(X) U21#(tt(),V1) -> activate#(V1) -> activate#(n__plus(X1,X2)) -> plus#(X1,X2) U21#(tt(),V1) -> activate#(V1) -> activate#(n__0()) -> 0#() U12#(tt(),V2) -> isNat#(activate(V2)) -> isNat#(n__s(V1)) -> U21#(isNatKind(activate(V1)),activate(V1)) U12#(tt(),V2) -> isNat#(activate(V2)) -> isNat#(n__s(V1)) -> isNatKind#(activate(V1)) U12#(tt(),V2) -> isNat#(activate(V2)) -> isNat#(n__s(V1)) -> activate#(V1) U12#(tt(),V2) -> isNat#(activate(V2)) -> isNat#(n__plus(V1,V2)) -> U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) U12#(tt(),V2) -> isNat#(activate(V2)) -> isNat#(n__plus(V1,V2)) -> and#(isNatKind(activate(V1)),n__isNatKind(activate(V2))) U12#(tt(),V2) -> isNat#(activate(V2)) -> isNat#(n__plus(V1,V2)) -> isNatKind#(activate(V1)) U12#(tt(),V2) -> isNat#(activate(V2)) -> isNat#(n__plus(V1,V2)) -> activate#(V1) U12#(tt(),V2) -> isNat#(activate(V2)) -> isNat#(n__plus(V1,V2)) -> activate#(V2) U12#(tt(),V2) -> activate#(V2) -> activate#(n__and(X1,X2)) -> and#(X1,X2) U12#(tt(),V2) -> activate#(V2) -> activate#(n__s(X)) -> s#(X) U12#(tt(),V2) -> activate#(V2) -> activate#(n__isNatKind(X)) -> isNatKind#(X) U12#(tt(),V2) -> activate#(V2) -> activate#(n__plus(X1,X2)) -> plus#(X1,X2) U12#(tt(),V2) -> activate#(V2) -> activate#(n__0()) -> 0#() isNat#(n__s(V1)) -> isNatKind#(activate(V1)) -> isNatKind#(n__s(V1)) -> isNatKind#(activate(V1)) isNat#(n__s(V1)) -> isNatKind#(activate(V1)) -> isNatKind#(n__s(V1)) -> activate#(V1) isNat#(n__s(V1)) -> isNatKind#(activate(V1)) -> isNatKind#(n__plus(V1,V2)) -> and#(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNat#(n__s(V1)) -> isNatKind#(activate(V1)) -> isNatKind#(n__plus(V1,V2)) -> isNatKind#(activate(V1)) isNat#(n__s(V1)) -> isNatKind#(activate(V1)) -> isNatKind#(n__plus(V1,V2)) -> activate#(V1) isNat#(n__s(V1)) -> isNatKind#(activate(V1)) -> isNatKind#(n__plus(V1,V2)) -> activate#(V2) isNat#(n__s(V1)) -> U21#(isNatKind(activate(V1)),activate(V1)) -> U21#(tt(),V1) -> U22#(isNat(activate(V1))) isNat#(n__s(V1)) -> U21#(isNatKind(activate(V1)),activate(V1)) -> U21#(tt(),V1) -> isNat#(activate(V1)) isNat#(n__s(V1)) -> U21#(isNatKind(activate(V1)),activate(V1)) -> U21#(tt(),V1) -> activate#(V1) isNat#(n__s(V1)) -> activate#(V1) -> activate#(n__and(X1,X2)) -> and#(X1,X2) isNat#(n__s(V1)) -> activate#(V1) -> activate#(n__s(X)) -> s#(X) isNat#(n__s(V1)) -> activate#(V1) -> activate#(n__isNatKind(X)) -> isNatKind#(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)) -> isNatKind#(activate(V1)) -> isNatKind#(n__s(V1)) -> isNatKind#(activate(V1)) isNat#(n__plus(V1,V2)) -> isNatKind#(activate(V1)) -> isNatKind#(n__s(V1)) -> activate#(V1) isNat#(n__plus(V1,V2)) -> isNatKind#(activate(V1)) -> isNatKind#(n__plus(V1,V2)) -> and#(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNat#(n__plus(V1,V2)) -> isNatKind#(activate(V1)) -> isNatKind#(n__plus(V1,V2)) -> isNatKind#(activate(V1)) isNat#(n__plus(V1,V2)) -> isNatKind#(activate(V1)) -> isNatKind#(n__plus(V1,V2)) -> activate#(V1) isNat#(n__plus(V1,V2)) -> isNatKind#(activate(V1)) -> isNatKind#(n__plus(V1,V2)) -> activate#(V2) isNat#(n__plus(V1,V2)) -> and#(isNatKind(activate(V1)),n__isNatKind(activate(V2))) -> and#(tt(),X) -> activate#(X) isNat#(n__plus(V1,V2)) -> activate#(V2) -> activate#(n__and(X1,X2)) -> and#(X1,X2) isNat#(n__plus(V1,V2)) -> activate#(V2) -> activate#(n__s(X)) -> s#(X) isNat#(n__plus(V1,V2)) -> activate#(V2) -> activate#(n__isNatKind(X)) -> isNatKind#(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)) -> activate#(V1) -> activate#(n__and(X1,X2)) -> and#(X1,X2) isNat#(n__plus(V1,V2)) -> activate#(V1) -> activate#(n__s(X)) -> s#(X) isNat#(n__plus(V1,V2)) -> activate#(V1) -> activate#(n__isNatKind(X)) -> isNatKind#(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)) -> U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) -> U11#(tt(),V1,V2) -> U12#(isNat(activate(V1)),activate(V2)) isNat#(n__plus(V1,V2)) -> U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) -> U11#(tt(),V1,V2) -> isNat#(activate(V1)) isNat#(n__plus(V1,V2)) -> U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) -> U11#(tt(),V1,V2) -> activate#(V1) isNat#(n__plus(V1,V2)) -> U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) -> U11#(tt(),V1,V2) -> activate#(V2) activate#(n__and(X1,X2)) -> and#(X1,X2) -> and#(tt(),X) -> activate#(X) activate#(n__isNatKind(X)) -> isNatKind#(X) -> isNatKind#(n__s(V1)) -> isNatKind#(activate(V1)) activate#(n__isNatKind(X)) -> isNatKind#(X) -> isNatKind#(n__s(V1)) -> activate#(V1) activate#(n__isNatKind(X)) -> isNatKind#(X) -> isNatKind#(n__plus(V1,V2)) -> and#(isNatKind(activate(V1)),n__isNatKind(activate(V2))) activate#(n__isNatKind(X)) -> isNatKind#(X) -> isNatKind#(n__plus(V1,V2)) -> isNatKind#(activate(V1)) activate#(n__isNatKind(X)) -> isNatKind#(X) -> isNatKind#(n__plus(V1,V2)) -> activate#(V1) activate#(n__isNatKind(X)) -> isNatKind#(X) -> isNatKind#(n__plus(V1,V2)) -> activate#(V2) activate#(n__plus(X1,X2)) -> plus#(X1,X2) -> plus#(N,s(M)) -> U41#(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) activate#(n__plus(X1,X2)) -> plus#(X1,X2) -> plus#(N,s(M)) -> and#(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))) activate#(n__plus(X1,X2)) -> plus#(X1,X2) -> plus#(N,s(M)) -> and#(isNat(M),n__isNatKind(M)) activate#(n__plus(X1,X2)) -> plus#(X1,X2) -> plus#(N,s(M)) -> isNat#(M) activate#(n__plus(X1,X2)) -> plus#(X1,X2) -> plus#(N,s(M)) -> isNat#(N) activate#(n__plus(X1,X2)) -> plus#(X1,X2) -> plus#(N,0()) -> U31#(and(isNat(N),n__isNatKind(N)),N) activate#(n__plus(X1,X2)) -> plus#(X1,X2) -> plus#(N,0()) -> and#(isNat(N),n__isNatKind(N)) activate#(n__plus(X1,X2)) -> plus#(X1,X2) -> plus#(N,0()) -> isNat#(N) U11#(tt(),V1,V2) -> U12#(isNat(activate(V1)),activate(V2)) -> U12#(tt(),V2) -> U13#(isNat(activate(V2))) U11#(tt(),V1,V2) -> U12#(isNat(activate(V1)),activate(V2)) -> U12#(tt(),V2) -> isNat#(activate(V2)) U11#(tt(),V1,V2) -> U12#(isNat(activate(V1)),activate(V2)) -> U12#(tt(),V2) -> activate#(V2) U11#(tt(),V1,V2) -> isNat#(activate(V1)) -> isNat#(n__s(V1)) -> U21#(isNatKind(activate(V1)),activate(V1)) U11#(tt(),V1,V2) -> isNat#(activate(V1)) -> isNat#(n__s(V1)) -> isNatKind#(activate(V1)) U11#(tt(),V1,V2) -> isNat#(activate(V1)) -> isNat#(n__s(V1)) -> activate#(V1) U11#(tt(),V1,V2) -> isNat#(activate(V1)) -> isNat#(n__plus(V1,V2)) -> U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) U11#(tt(),V1,V2) -> isNat#(activate(V1)) -> isNat#(n__plus(V1,V2)) -> and#(isNatKind(activate(V1)),n__isNatKind(activate(V2))) U11#(tt(),V1,V2) -> isNat#(activate(V1)) -> isNat#(n__plus(V1,V2)) -> isNatKind#(activate(V1)) U11#(tt(),V1,V2) -> isNat#(activate(V1)) -> isNat#(n__plus(V1,V2)) -> activate#(V1) U11#(tt(),V1,V2) -> isNat#(activate(V1)) -> isNat#(n__plus(V1,V2)) -> activate#(V2) U11#(tt(),V1,V2) -> activate#(V2) -> activate#(n__and(X1,X2)) -> and#(X1,X2) U11#(tt(),V1,V2) -> activate#(V2) -> activate#(n__s(X)) -> s#(X) U11#(tt(),V1,V2) -> activate#(V2) -> activate#(n__isNatKind(X)) -> isNatKind#(X) U11#(tt(),V1,V2) -> activate#(V2) -> activate#(n__plus(X1,X2)) -> plus#(X1,X2) U11#(tt(),V1,V2) -> activate#(V2) -> activate#(n__0()) -> 0#() U11#(tt(),V1,V2) -> activate#(V1) -> activate#(n__and(X1,X2)) -> and#(X1,X2) U11#(tt(),V1,V2) -> activate#(V1) -> activate#(n__s(X)) -> s#(X) U11#(tt(),V1,V2) -> activate#(V1) -> activate#(n__isNatKind(X)) -> isNatKind#(X) U11#(tt(),V1,V2) -> activate#(V1) -> activate#(n__plus(X1,X2)) -> plus#(X1,X2) U11#(tt(),V1,V2) -> activate#(V1) -> activate#(n__0()) -> 0#() SCC Processor: #sccs: 1 #rules: 38 #arcs: 185/1849 DPs: isNatKind#(n__s(V1)) -> isNatKind#(activate(V1)) isNatKind#(n__plus(V1,V2)) -> activate#(V2) activate#(n__plus(X1,X2)) -> plus#(X1,X2) plus#(N,0()) -> isNat#(N) isNat#(n__plus(V1,V2)) -> activate#(V2) activate#(n__isNatKind(X)) -> isNatKind#(X) isNatKind#(n__plus(V1,V2)) -> activate#(V1) activate#(n__and(X1,X2)) -> and#(X1,X2) and#(tt(),X) -> activate#(X) isNatKind#(n__plus(V1,V2)) -> isNatKind#(activate(V1)) isNatKind#(n__plus(V1,V2)) -> and#(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind#(n__s(V1)) -> activate#(V1) isNat#(n__plus(V1,V2)) -> activate#(V1) isNat#(n__plus(V1,V2)) -> isNatKind#(activate(V1)) isNat#(n__plus(V1,V2)) -> and#(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNat#(n__plus(V1,V2)) -> U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) U11#(tt(),V1,V2) -> activate#(V2) U11#(tt(),V1,V2) -> activate#(V1) U11#(tt(),V1,V2) -> isNat#(activate(V1)) isNat#(n__s(V1)) -> activate#(V1) isNat#(n__s(V1)) -> isNatKind#(activate(V1)) isNat#(n__s(V1)) -> U21#(isNatKind(activate(V1)),activate(V1)) U21#(tt(),V1) -> activate#(V1) U21#(tt(),V1) -> isNat#(activate(V1)) U11#(tt(),V1,V2) -> U12#(isNat(activate(V1)),activate(V2)) U12#(tt(),V2) -> activate#(V2) U12#(tt(),V2) -> isNat#(activate(V2)) plus#(N,0()) -> and#(isNat(N),n__isNatKind(N)) plus#(N,0()) -> U31#(and(isNat(N),n__isNatKind(N)),N) U31#(tt(),N) -> activate#(N) plus#(N,s(M)) -> isNat#(N) plus#(N,s(M)) -> isNat#(M) plus#(N,s(M)) -> and#(isNat(M),n__isNatKind(M)) plus#(N,s(M)) -> and#(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))) plus#(N,s(M)) -> U41#(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) U41#(tt(),M,N) -> activate#(M) U41#(tt(),M,N) -> activate#(N) U41#(tt(),M,N) -> plus#(activate(N),activate(M)) TRS: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X Arctic Interpretation Processor: dimension: 1 usable rules: U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X interpretation: [0] = 2, [U12](x0, x1) = x0 + 4x1 + 0, [isNatKind](x0) = x0 + 2, [U31](x0, x1) = x0 + 1x1 + 0, [U11](x0, x1, x2) = 2x1 + 6x2, [isNat](x0) = 5x0 + 0, [n__isNatKind](x0) = x0 + 2, [activate#](x0) = x0, [n__and](x0, x1) = x1, [isNatKind#](x0) = x0 + 0, [n__s](x0) = x0 + 2, [U31#](x0, x1) = x0 + x1 + 0, [isNat#](x0) = x0, [U41#](x0, x1, x2) = x0 + x1 + x2 + 0, [U13](x0) = x0 + 0, [plus](x0, x1) = 1x0 + x1 + 2, [tt] = 0, [U22](x0) = 1x0 + 0, [U11#](x0, x1, x2) = x0 + x1 + x2 + 0, [U21#](x0, x1) = x1, [n__plus](x0, x1) = 1x0 + x1 + 2, [and#](x0, x1) = x1, [and](x0, x1) = x1, [U12#](x0, x1) = x1, [s](x0) = x0 + 2, [U41](x0, x1, x2) = x0 + x1 + 1x2 + 2, [n__0] = 2, [U21](x0, x1) = x0 + x1 + 0, [plus#](x0, x1) = x0 + x1, [activate](x0) = x0 orientation: isNatKind#(n__s(V1)) = V1 + 2 >= V1 + 0 = isNatKind#(activate(V1)) isNatKind#(n__plus(V1,V2)) = 1V1 + V2 + 2 >= V2 = activate#(V2) activate#(n__plus(X1,X2)) = 1X1 + X2 + 2 >= X1 + X2 = plus#(X1,X2) plus#(N,0()) = N + 2 >= N = isNat#(N) isNat#(n__plus(V1,V2)) = 1V1 + V2 + 2 >= V2 = activate#(V2) activate#(n__isNatKind(X)) = X + 2 >= X + 0 = isNatKind#(X) isNatKind#(n__plus(V1,V2)) = 1V1 + V2 + 2 >= V1 = activate#(V1) activate#(n__and(X1,X2)) = X2 >= X2 = and#(X1,X2) and#(tt(),X) = X >= X = activate#(X) isNatKind#(n__plus(V1,V2)) = 1V1 + V2 + 2 >= V1 + 0 = isNatKind#(activate(V1)) isNatKind#(n__plus(V1,V2)) = 1V1 + V2 + 2 >= V2 + 2 = and#(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind#(n__s(V1)) = V1 + 2 >= V1 = activate#(V1) isNat#(n__plus(V1,V2)) = 1V1 + V2 + 2 >= V1 = activate#(V1) isNat#(n__plus(V1,V2)) = 1V1 + V2 + 2 >= V1 + 0 = isNatKind#(activate(V1)) isNat#(n__plus(V1,V2)) = 1V1 + V2 + 2 >= V2 + 2 = and#(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNat#(n__plus(V1,V2)) = 1V1 + V2 + 2 >= V1 + V2 + 2 = U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1), activate(V2)) U11#(tt(),V1,V2) = V1 + V2 + 0 >= V2 = activate#(V2) U11#(tt(),V1,V2) = V1 + V2 + 0 >= V1 = activate#(V1) U11#(tt(),V1,V2) = V1 + V2 + 0 >= V1 = isNat#(activate(V1)) isNat#(n__s(V1)) = V1 + 2 >= V1 = activate#(V1) isNat#(n__s(V1)) = V1 + 2 >= V1 + 0 = isNatKind#(activate(V1)) isNat#(n__s(V1)) = V1 + 2 >= V1 = U21#(isNatKind(activate(V1)),activate(V1)) U21#(tt(),V1) = V1 >= V1 = activate#(V1) U21#(tt(),V1) = V1 >= V1 = isNat#(activate(V1)) U11#(tt(),V1,V2) = V1 + V2 + 0 >= V2 = U12#(isNat(activate(V1)),activate(V2)) U12#(tt(),V2) = V2 >= V2 = activate#(V2) U12#(tt(),V2) = V2 >= V2 = isNat#(activate(V2)) plus#(N,0()) = N + 2 >= N + 2 = and#(isNat(N),n__isNatKind(N)) plus#(N,0()) = N + 2 >= N + 2 = U31#(and(isNat(N),n__isNatKind(N)),N) U31#(tt(),N) = N + 0 >= N = activate#(N) plus#(N,s(M)) = M + N + 2 >= N = isNat#(N) plus#(N,s(M)) = M + N + 2 >= M = isNat#(M) plus#(N,s(M)) = M + N + 2 >= M + 2 = and#(isNat(M),n__isNatKind(M)) plus#(N,s(M)) = M + N + 2 >= N + 2 = and#(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))) plus#(N,s(M)) = M + N + 2 >= M + N + 2 = U41#(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) U41#(tt(),M,N) = M + N + 0 >= M = activate#(M) U41#(tt(),M,N) = M + N + 0 >= N = activate#(N) U41#(tt(),M,N) = M + N + 0 >= M + N = plus#(activate(N),activate(M)) U11(tt(),V1,V2) = 2V1 + 6V2 >= 5V1 + 4V2 + 0 = U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) = 4V2 + 0 >= 5V2 + 0 = U13(isNat(activate(V2))) U13(tt()) = 0 >= 0 = tt() U21(tt(),V1) = V1 + 0 >= 6V1 + 1 = U22(isNat(activate(V1))) U22(tt()) = 1 >= 0 = tt() U31(tt(),N) = 1N + 0 >= N = activate(N) U41(tt(),M,N) = M + 1N + 2 >= M + 1N + 2 = s(plus(activate(N),activate(M))) and(tt(),X) = X >= X = activate(X) isNat(n__0()) = 7 >= 0 = tt() isNat(n__plus(V1,V2)) = 6V1 + 5V2 + 7 >= 2V1 + 6V2 = U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1), activate(V2)) isNat(n__s(V1)) = 5V1 + 7 >= V1 + 2 = U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) = 2 >= 0 = tt() isNatKind(n__plus(V1,V2)) = 1V1 + V2 + 2 >= V2 + 2 = and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) = V1 + 2 >= V1 + 2 = isNatKind(activate(V1)) plus(N,0()) = 1N + 2 >= 1N + 2 = U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) = M + 1N + 2 >= M + 1N + 2 = U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() = 2 >= 2 = n__0() plus(X1,X2) = 1X1 + X2 + 2 >= 1X1 + X2 + 2 = n__plus(X1,X2) isNatKind(X) = X + 2 >= X + 2 = n__isNatKind(X) s(X) = X + 2 >= X + 2 = n__s(X) and(X1,X2) = X2 >= X2 = n__and(X1,X2) activate(n__0()) = 2 >= 2 = 0() activate(n__plus(X1,X2)) = 1X1 + X2 + 2 >= 1X1 + X2 + 2 = plus(X1,X2) activate(n__isNatKind(X)) = X + 2 >= X + 2 = isNatKind(X) activate(n__s(X)) = X + 2 >= X + 2 = s(X) activate(n__and(X1,X2)) = X2 >= X2 = and(X1,X2) activate(X) = X >= X = X problem: DPs: isNatKind#(n__s(V1)) -> isNatKind#(activate(V1)) isNatKind#(n__plus(V1,V2)) -> activate#(V2) activate#(n__plus(X1,X2)) -> plus#(X1,X2) plus#(N,0()) -> isNat#(N) isNat#(n__plus(V1,V2)) -> activate#(V2) activate#(n__isNatKind(X)) -> isNatKind#(X) activate#(n__and(X1,X2)) -> and#(X1,X2) and#(tt(),X) -> activate#(X) isNatKind#(n__plus(V1,V2)) -> and#(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind#(n__s(V1)) -> activate#(V1) isNat#(n__plus(V1,V2)) -> and#(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNat#(n__plus(V1,V2)) -> U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) U11#(tt(),V1,V2) -> activate#(V2) U11#(tt(),V1,V2) -> activate#(V1) U11#(tt(),V1,V2) -> isNat#(activate(V1)) isNat#(n__s(V1)) -> activate#(V1) isNat#(n__s(V1)) -> isNatKind#(activate(V1)) isNat#(n__s(V1)) -> U21#(isNatKind(activate(V1)),activate(V1)) U21#(tt(),V1) -> activate#(V1) U21#(tt(),V1) -> isNat#(activate(V1)) U11#(tt(),V1,V2) -> U12#(isNat(activate(V1)),activate(V2)) U12#(tt(),V2) -> activate#(V2) U12#(tt(),V2) -> isNat#(activate(V2)) plus#(N,0()) -> and#(isNat(N),n__isNatKind(N)) plus#(N,0()) -> U31#(and(isNat(N),n__isNatKind(N)),N) U31#(tt(),N) -> activate#(N) plus#(N,s(M)) -> isNat#(N) plus#(N,s(M)) -> isNat#(M) plus#(N,s(M)) -> and#(isNat(M),n__isNatKind(M)) plus#(N,s(M)) -> and#(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))) plus#(N,s(M)) -> U41#(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) U41#(tt(),M,N) -> activate#(M) U41#(tt(),M,N) -> activate#(N) U41#(tt(),M,N) -> plus#(activate(N),activate(M)) TRS: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X Restore Modifier: DPs: isNatKind#(n__s(V1)) -> isNatKind#(activate(V1)) isNatKind#(n__plus(V1,V2)) -> activate#(V2) activate#(n__plus(X1,X2)) -> plus#(X1,X2) plus#(N,0()) -> isNat#(N) isNat#(n__plus(V1,V2)) -> activate#(V2) activate#(n__isNatKind(X)) -> isNatKind#(X) activate#(n__and(X1,X2)) -> and#(X1,X2) and#(tt(),X) -> activate#(X) isNatKind#(n__plus(V1,V2)) -> and#(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind#(n__s(V1)) -> activate#(V1) isNat#(n__plus(V1,V2)) -> and#(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNat#(n__plus(V1,V2)) -> U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) U11#(tt(),V1,V2) -> activate#(V2) U11#(tt(),V1,V2) -> activate#(V1) U11#(tt(),V1,V2) -> isNat#(activate(V1)) isNat#(n__s(V1)) -> activate#(V1) isNat#(n__s(V1)) -> isNatKind#(activate(V1)) isNat#(n__s(V1)) -> U21#(isNatKind(activate(V1)),activate(V1)) U21#(tt(),V1) -> activate#(V1) U21#(tt(),V1) -> isNat#(activate(V1)) U11#(tt(),V1,V2) -> U12#(isNat(activate(V1)),activate(V2)) U12#(tt(),V2) -> activate#(V2) U12#(tt(),V2) -> isNat#(activate(V2)) plus#(N,0()) -> and#(isNat(N),n__isNatKind(N)) plus#(N,0()) -> U31#(and(isNat(N),n__isNatKind(N)),N) U31#(tt(),N) -> activate#(N) plus#(N,s(M)) -> isNat#(N) plus#(N,s(M)) -> isNat#(M) plus#(N,s(M)) -> and#(isNat(M),n__isNatKind(M)) plus#(N,s(M)) -> and#(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))) plus#(N,s(M)) -> U41#(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) U41#(tt(),M,N) -> activate#(M) U41#(tt(),M,N) -> activate#(N) U41#(tt(),M,N) -> plus#(activate(N),activate(M)) TRS: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X Arctic Interpretation Processor: dimension: 1 usable rules: U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X interpretation: [0] = 3, [U12](x0, x1) = x1 + 0, [isNatKind](x0) = x0, [U31](x0, x1) = x1, [U11](x0, x1, x2) = x1 + 4x2, [isNat](x0) = 0, [n__isNatKind](x0) = x0, [activate#](x0) = x0, [n__and](x0, x1) = x1, [isNatKind#](x0) = x0, [n__s](x0) = x0 + 0, [U31#](x0, x1) = x0 + x1, [isNat#](x0) = x0 + 0, [U41#](x0, x1, x2) = x0 + 1x1 + x2, [U13](x0) = 5x0 + 6, [plus](x0, x1) = x0 + 1x1 + 0, [tt] = 0, [U22](x0) = 5x0 + 0, [U11#](x0, x1, x2) = x1 + x2 + 0, [U21#](x0, x1) = x1 + 0, [n__plus](x0, x1) = x0 + 1x1 + 0, [and#](x0, x1) = x1, [and](x0, x1) = x1, [U12#](x0, x1) = x1 + 0, [s](x0) = x0 + 0, [U41](x0, x1, x2) = 1x1 + x2 + 0, [n__0] = 3, [U21](x0, x1) = x0 + x1, [plus#](x0, x1) = x0 + 1x1 + 0, [activate](x0) = x0 orientation: isNatKind#(n__s(V1)) = V1 + 0 >= V1 = isNatKind#(activate(V1)) isNatKind#(n__plus(V1,V2)) = V1 + 1V2 + 0 >= V2 = activate#(V2) activate#(n__plus(X1,X2)) = X1 + 1X2 + 0 >= X1 + 1X2 + 0 = plus#(X1,X2) plus#(N,0()) = N + 4 >= N + 0 = isNat#(N) isNat#(n__plus(V1,V2)) = V1 + 1V2 + 0 >= V2 = activate#(V2) activate#(n__isNatKind(X)) = X >= X = isNatKind#(X) activate#(n__and(X1,X2)) = X2 >= X2 = and#(X1,X2) and#(tt(),X) = X >= X = activate#(X) isNatKind#(n__plus(V1,V2)) = V1 + 1V2 + 0 >= V2 = and#(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind#(n__s(V1)) = V1 + 0 >= V1 = activate#(V1) isNat#(n__plus(V1,V2)) = V1 + 1V2 + 0 >= V2 = and#(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNat#(n__plus(V1,V2)) = V1 + 1V2 + 0 >= V1 + V2 + 0 = U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1), activate(V2)) U11#(tt(),V1,V2) = V1 + V2 + 0 >= V2 = activate#(V2) U11#(tt(),V1,V2) = V1 + V2 + 0 >= V1 = activate#(V1) U11#(tt(),V1,V2) = V1 + V2 + 0 >= V1 + 0 = isNat#(activate(V1)) isNat#(n__s(V1)) = V1 + 0 >= V1 = activate#(V1) isNat#(n__s(V1)) = V1 + 0 >= V1 = isNatKind#(activate(V1)) isNat#(n__s(V1)) = V1 + 0 >= V1 + 0 = U21#(isNatKind(activate(V1)),activate(V1)) U21#(tt(),V1) = V1 + 0 >= V1 = activate#(V1) U21#(tt(),V1) = V1 + 0 >= V1 + 0 = isNat#(activate(V1)) U11#(tt(),V1,V2) = V1 + V2 + 0 >= V2 + 0 = U12#(isNat(activate(V1)),activate(V2)) U12#(tt(),V2) = V2 + 0 >= V2 = activate#(V2) U12#(tt(),V2) = V2 + 0 >= V2 + 0 = isNat#(activate(V2)) plus#(N,0()) = N + 4 >= N = and#(isNat(N),n__isNatKind(N)) plus#(N,0()) = N + 4 >= N = U31#(and(isNat(N),n__isNatKind(N)),N) U31#(tt(),N) = N + 0 >= N = activate#(N) plus#(N,s(M)) = 1M + N + 1 >= N + 0 = isNat#(N) plus#(N,s(M)) = 1M + N + 1 >= M + 0 = isNat#(M) plus#(N,s(M)) = 1M + N + 1 >= M = and#(isNat(M),n__isNatKind(M)) plus#(N,s(M)) = 1M + N + 1 >= N = and#(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))) plus#(N,s(M)) = 1M + N + 1 >= 1M + N = U41#(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) U41#(tt(),M,N) = 1M + N + 0 >= M = activate#(M) U41#(tt(),M,N) = 1M + N + 0 >= N = activate#(N) U41#(tt(),M,N) = 1M + N + 0 >= 1M + N + 0 = plus#(activate(N),activate(M)) U11(tt(),V1,V2) = V1 + 4V2 >= V2 + 0 = U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) = V2 + 0 >= 6 = U13(isNat(activate(V2))) U13(tt()) = 6 >= 0 = tt() U21(tt(),V1) = V1 + 0 >= 5 = U22(isNat(activate(V1))) U22(tt()) = 5 >= 0 = tt() U31(tt(),N) = N >= N = activate(N) U41(tt(),M,N) = 1M + N + 0 >= 1M + N + 0 = 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 >= V1 + 4V2 = U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1), activate(V2)) isNat(n__s(V1)) = 0 >= V1 = U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) = 3 >= 0 = tt() isNatKind(n__plus(V1,V2)) = V1 + 1V2 + 0 >= V2 = and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) = V1 + 0 >= V1 = isNatKind(activate(V1)) plus(N,0()) = N + 4 >= N = U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) = 1M + N + 1 >= 1M + N + 0 = U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() = 3 >= 3 = n__0() plus(X1,X2) = X1 + 1X2 + 0 >= X1 + 1X2 + 0 = n__plus(X1,X2) isNatKind(X) = X >= X = n__isNatKind(X) s(X) = X + 0 >= X + 0 = n__s(X) and(X1,X2) = X2 >= X2 = n__and(X1,X2) activate(n__0()) = 3 >= 3 = 0() activate(n__plus(X1,X2)) = X1 + 1X2 + 0 >= X1 + 1X2 + 0 = plus(X1,X2) activate(n__isNatKind(X)) = X >= X = isNatKind(X) activate(n__s(X)) = X + 0 >= X + 0 = s(X) activate(n__and(X1,X2)) = X2 >= X2 = and(X1,X2) activate(X) = X >= X = X problem: DPs: isNatKind#(n__s(V1)) -> isNatKind#(activate(V1)) activate#(n__plus(X1,X2)) -> plus#(X1,X2) plus#(N,0()) -> isNat#(N) activate#(n__isNatKind(X)) -> isNatKind#(X) activate#(n__and(X1,X2)) -> and#(X1,X2) and#(tt(),X) -> activate#(X) isNatKind#(n__s(V1)) -> activate#(V1) isNat#(n__plus(V1,V2)) -> U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) U11#(tt(),V1,V2) -> activate#(V2) U11#(tt(),V1,V2) -> activate#(V1) U11#(tt(),V1,V2) -> isNat#(activate(V1)) isNat#(n__s(V1)) -> activate#(V1) isNat#(n__s(V1)) -> isNatKind#(activate(V1)) isNat#(n__s(V1)) -> U21#(isNatKind(activate(V1)),activate(V1)) U21#(tt(),V1) -> activate#(V1) U21#(tt(),V1) -> isNat#(activate(V1)) U11#(tt(),V1,V2) -> U12#(isNat(activate(V1)),activate(V2)) U12#(tt(),V2) -> activate#(V2) U12#(tt(),V2) -> isNat#(activate(V2)) plus#(N,0()) -> and#(isNat(N),n__isNatKind(N)) plus#(N,0()) -> U31#(and(isNat(N),n__isNatKind(N)),N) U31#(tt(),N) -> activate#(N) plus#(N,s(M)) -> isNat#(N) plus#(N,s(M)) -> and#(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))) plus#(N,s(M)) -> U41#(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) U41#(tt(),M,N) -> activate#(N) U41#(tt(),M,N) -> plus#(activate(N),activate(M)) TRS: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X Restore Modifier: DPs: isNatKind#(n__s(V1)) -> isNatKind#(activate(V1)) activate#(n__plus(X1,X2)) -> plus#(X1,X2) plus#(N,0()) -> isNat#(N) activate#(n__isNatKind(X)) -> isNatKind#(X) activate#(n__and(X1,X2)) -> and#(X1,X2) and#(tt(),X) -> activate#(X) isNatKind#(n__s(V1)) -> activate#(V1) isNat#(n__plus(V1,V2)) -> U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) U11#(tt(),V1,V2) -> activate#(V2) U11#(tt(),V1,V2) -> activate#(V1) U11#(tt(),V1,V2) -> isNat#(activate(V1)) isNat#(n__s(V1)) -> activate#(V1) isNat#(n__s(V1)) -> isNatKind#(activate(V1)) isNat#(n__s(V1)) -> U21#(isNatKind(activate(V1)),activate(V1)) U21#(tt(),V1) -> activate#(V1) U21#(tt(),V1) -> isNat#(activate(V1)) U11#(tt(),V1,V2) -> U12#(isNat(activate(V1)),activate(V2)) U12#(tt(),V2) -> activate#(V2) U12#(tt(),V2) -> isNat#(activate(V2)) plus#(N,0()) -> and#(isNat(N),n__isNatKind(N)) plus#(N,0()) -> U31#(and(isNat(N),n__isNatKind(N)),N) U31#(tt(),N) -> activate#(N) plus#(N,s(M)) -> isNat#(N) plus#(N,s(M)) -> and#(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))) plus#(N,s(M)) -> U41#(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) U41#(tt(),M,N) -> activate#(N) U41#(tt(),M,N) -> plus#(activate(N),activate(M)) TRS: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X Arctic Interpretation Processor: dimension: 1 usable rules: U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X interpretation: [0] = 4, [U12](x0, x1) = 3x0 + 4x1 + 5, [isNatKind](x0) = x0 + 0, [U31](x0, x1) = x0 + 2x1 + 5, [U11](x0, x1, x2) = x0 + 6x1 + x2 + 5, [isNat](x0) = 0, [n__isNatKind](x0) = x0 + 0, [activate#](x0) = x0 + 0, [n__and](x0, x1) = x1 + 0, [isNatKind#](x0) = x0 + 0, [n__s](x0) = x0 + 0, [U31#](x0, x1) = 3x0 + x1 + 0, [isNat#](x0) = x0, [U41#](x0, x1, x2) = x0 + x1 + 3x2 + 0, [U13](x0) = 1x0 + 8, [plus](x0, x1) = 3x0 + 1x1 + 0, [tt] = 4, [U22](x0) = 0, [U11#](x0, x1, x2) = x0 + x1 + x2 + 0, [U21#](x0, x1) = x0 + x1 + 0, [n__plus](x0, x1) = 3x0 + 1x1 + 0, [and#](x0, x1) = x1 + 0, [and](x0, x1) = x1 + 0, [U12#](x0, x1) = x1 + 0, [s](x0) = x0 + 0, [U41](x0, x1, x2) = 1x0 + 1x1 + 3x2 + 0, [n__0] = 4, [U21](x0, x1) = 1x0 + 1x1 + 1, [plus#](x0, x1) = 3x0 + x1, [activate](x0) = x0 + 0 orientation: isNatKind#(n__s(V1)) = V1 + 0 >= V1 + 0 = isNatKind#(activate(V1)) activate#(n__plus(X1,X2)) = 3X1 + 1X2 + 0 >= 3X1 + X2 = plus#(X1,X2) plus#(N,0()) = 3N + 4 >= N = isNat#(N) activate#(n__isNatKind(X)) = X + 0 >= X + 0 = isNatKind#(X) activate#(n__and(X1,X2)) = X2 + 0 >= X2 + 0 = and#(X1,X2) and#(tt(),X) = X + 0 >= X + 0 = activate#(X) isNatKind#(n__s(V1)) = V1 + 0 >= V1 + 0 = activate#(V1) isNat#(n__plus(V1,V2)) = 3V1 + 1V2 + 0 >= V1 + V2 + 0 = U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1), activate(V2)) U11#(tt(),V1,V2) = V1 + V2 + 4 >= V2 + 0 = activate#(V2) U11#(tt(),V1,V2) = V1 + V2 + 4 >= V1 + 0 = activate#(V1) U11#(tt(),V1,V2) = V1 + V2 + 4 >= V1 + 0 = isNat#(activate(V1)) isNat#(n__s(V1)) = V1 + 0 >= V1 + 0 = activate#(V1) isNat#(n__s(V1)) = V1 + 0 >= V1 + 0 = isNatKind#(activate(V1)) isNat#(n__s(V1)) = V1 + 0 >= V1 + 0 = U21#(isNatKind(activate(V1)),activate(V1)) U21#(tt(),V1) = V1 + 4 >= V1 + 0 = activate#(V1) U21#(tt(),V1) = V1 + 4 >= V1 + 0 = isNat#(activate(V1)) U11#(tt(),V1,V2) = V1 + V2 + 4 >= V2 + 0 = U12#(isNat(activate(V1)),activate(V2)) U12#(tt(),V2) = V2 + 0 >= V2 + 0 = activate#(V2) U12#(tt(),V2) = V2 + 0 >= V2 + 0 = isNat#(activate(V2)) plus#(N,0()) = 3N + 4 >= N + 0 = and#(isNat(N),n__isNatKind(N)) plus#(N,0()) = 3N + 4 >= 3N + 3 = U31#(and(isNat(N),n__isNatKind(N)),N) U31#(tt(),N) = N + 7 >= N + 0 = activate#(N) plus#(N,s(M)) = M + 3N + 0 >= N = isNat#(N) plus#(N,s(M)) = M + 3N + 0 >= N + 0 = and#(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))) plus#(N,s(M)) = M + 3N + 0 >= M + 3N + 0 = U41#(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) U41#(tt(),M,N) = M + 3N + 4 >= N + 0 = activate#(N) U41#(tt(),M,N) = M + 3N + 4 >= M + 3N + 3 = plus#(activate(N),activate(M)) U11(tt(),V1,V2) = 6V1 + V2 + 5 >= 4V2 + 5 = U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) = 4V2 + 7 >= 8 = U13(isNat(activate(V2))) U13(tt()) = 8 >= 4 = tt() U21(tt(),V1) = 1V1 + 5 >= 0 = U22(isNat(activate(V1))) U22(tt()) = 0 >= 4 = tt() U31(tt(),N) = 2N + 5 >= N + 0 = activate(N) U41(tt(),M,N) = 1M + 3N + 5 >= 1M + 3N + 3 = s(plus(activate(N),activate(M))) and(tt(),X) = X + 0 >= X + 0 = activate(X) isNat(n__0()) = 0 >= 4 = tt() isNat(n__plus(V1,V2)) = 0 >= 6V1 + V2 + 6 = U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1), activate(V2)) isNat(n__s(V1)) = 0 >= 1V1 + 1 = U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) = 4 >= 4 = tt() isNatKind(n__plus(V1,V2)) = 3V1 + 1V2 + 0 >= V2 + 0 = and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) = V1 + 0 >= V1 + 0 = isNatKind(activate(V1)) plus(N,0()) = 3N + 5 >= 2N + 5 = U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) = 1M + 3N + 1 >= 1M + 3N + 1 = U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() = 4 >= 4 = n__0() plus(X1,X2) = 3X1 + 1X2 + 0 >= 3X1 + 1X2 + 0 = n__plus(X1,X2) isNatKind(X) = X + 0 >= X + 0 = n__isNatKind(X) s(X) = X + 0 >= X + 0 = n__s(X) and(X1,X2) = X2 + 0 >= X2 + 0 = n__and(X1,X2) activate(n__0()) = 4 >= 4 = 0() activate(n__plus(X1,X2)) = 3X1 + 1X2 + 0 >= 3X1 + 1X2 + 0 = plus(X1,X2) activate(n__isNatKind(X)) = X + 0 >= X + 0 = isNatKind(X) activate(n__s(X)) = X + 0 >= X + 0 = s(X) activate(n__and(X1,X2)) = X2 + 0 >= X2 + 0 = and(X1,X2) activate(X) = X + 0 >= X = X problem: DPs: isNatKind#(n__s(V1)) -> isNatKind#(activate(V1)) activate#(n__plus(X1,X2)) -> plus#(X1,X2) activate#(n__isNatKind(X)) -> isNatKind#(X) activate#(n__and(X1,X2)) -> and#(X1,X2) and#(tt(),X) -> activate#(X) isNatKind#(n__s(V1)) -> activate#(V1) isNat#(n__plus(V1,V2)) -> U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) U11#(tt(),V1,V2) -> activate#(V2) U11#(tt(),V1,V2) -> activate#(V1) U11#(tt(),V1,V2) -> isNat#(activate(V1)) isNat#(n__s(V1)) -> activate#(V1) isNat#(n__s(V1)) -> isNatKind#(activate(V1)) isNat#(n__s(V1)) -> U21#(isNatKind(activate(V1)),activate(V1)) U21#(tt(),V1) -> activate#(V1) U21#(tt(),V1) -> isNat#(activate(V1)) U11#(tt(),V1,V2) -> U12#(isNat(activate(V1)),activate(V2)) U12#(tt(),V2) -> activate#(V2) U12#(tt(),V2) -> isNat#(activate(V2)) plus#(N,0()) -> U31#(and(isNat(N),n__isNatKind(N)),N) U31#(tt(),N) -> activate#(N) plus#(N,s(M)) -> and#(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))) plus#(N,s(M)) -> U41#(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) U41#(tt(),M,N) -> plus#(activate(N),activate(M)) TRS: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X Restore Modifier: DPs: isNatKind#(n__s(V1)) -> isNatKind#(activate(V1)) activate#(n__plus(X1,X2)) -> plus#(X1,X2) activate#(n__isNatKind(X)) -> isNatKind#(X) activate#(n__and(X1,X2)) -> and#(X1,X2) and#(tt(),X) -> activate#(X) isNatKind#(n__s(V1)) -> activate#(V1) isNat#(n__plus(V1,V2)) -> U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) U11#(tt(),V1,V2) -> activate#(V2) U11#(tt(),V1,V2) -> activate#(V1) U11#(tt(),V1,V2) -> isNat#(activate(V1)) isNat#(n__s(V1)) -> activate#(V1) isNat#(n__s(V1)) -> isNatKind#(activate(V1)) isNat#(n__s(V1)) -> U21#(isNatKind(activate(V1)),activate(V1)) U21#(tt(),V1) -> activate#(V1) U21#(tt(),V1) -> isNat#(activate(V1)) U11#(tt(),V1,V2) -> U12#(isNat(activate(V1)),activate(V2)) U12#(tt(),V2) -> activate#(V2) U12#(tt(),V2) -> isNat#(activate(V2)) plus#(N,0()) -> U31#(and(isNat(N),n__isNatKind(N)),N) U31#(tt(),N) -> activate#(N) plus#(N,s(M)) -> and#(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))) plus#(N,s(M)) -> U41#(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) U41#(tt(),M,N) -> plus#(activate(N),activate(M)) TRS: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X SCC Processor: #sccs: 2 #rules: 17 #arcs: 154/529 DPs: U21#(tt(),V1) -> isNat#(activate(V1)) isNat#(n__plus(V1,V2)) -> U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) U11#(tt(),V1,V2) -> isNat#(activate(V1)) isNat#(n__s(V1)) -> U21#(isNatKind(activate(V1)),activate(V1)) U11#(tt(),V1,V2) -> U12#(isNat(activate(V1)),activate(V2)) U12#(tt(),V2) -> isNat#(activate(V2)) TRS: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X Arctic Interpretation Processor: dimension: 1 usable rules: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X interpretation: [0] = 0, [U12](x0, x1) = x0 + x1, [isNatKind](x0) = 1x0 + 0, [U31](x0, x1) = x1 + 1, [U11](x0, x1, x2) = x0 + x1 + x2 + 0, [isNat](x0) = x0, [n__isNatKind](x0) = 1x0 + 0, [n__and](x0, x1) = x1 + 0, [n__s](x0) = x0 + 0, [isNat#](x0) = x0, [U13](x0) = x0 + 0, [plus](x0, x1) = x0 + 2x1 + 0, [tt] = 0, [U22](x0) = 0, [U11#](x0, x1, x2) = x0 + x1 + 2x2 + 0, [U21#](x0, x1) = x1 + 0, [n__plus](x0, x1) = x0 + 2x1 + 0, [and](x0, x1) = x1 + 0, [U12#](x0, x1) = x0 + 2x1, [s](x0) = x0 + 0, [U41](x0, x1, x2) = 2x1 + x2 + 1, [n__0] = 0, [U21](x0, x1) = x1 + 0, [activate](x0) = x0 orientation: U21#(tt(),V1) = V1 + 0 >= V1 = isNat#(activate(V1)) isNat#(n__plus(V1,V2)) = V1 + 2V2 + 0 >= V1 + 2V2 + 0 = U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1), activate(V2)) U11#(tt(),V1,V2) = V1 + 2V2 + 0 >= V1 = isNat#(activate(V1)) isNat#(n__s(V1)) = V1 + 0 >= V1 + 0 = U21#(isNatKind(activate(V1)),activate(V1)) U11#(tt(),V1,V2) = V1 + 2V2 + 0 >= V1 + 2V2 = U12#(isNat(activate(V1)),activate(V2)) U12#(tt(),V2) = 2V2 + 0 >= V2 = isNat#(activate(V2)) U11(tt(),V1,V2) = V1 + V2 + 0 >= V1 + V2 = U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) = V2 + 0 >= V2 + 0 = U13(isNat(activate(V2))) U13(tt()) = 0 >= 0 = tt() U21(tt(),V1) = V1 + 0 >= 0 = U22(isNat(activate(V1))) U22(tt()) = 0 >= 0 = tt() U31(tt(),N) = N + 1 >= N = activate(N) U41(tt(),M,N) = 2M + N + 1 >= 2M + N + 0 = s(plus(activate(N),activate(M))) and(tt(),X) = X + 0 >= X = activate(X) isNat(n__0()) = 0 >= 0 = tt() isNat(n__plus(V1,V2)) = V1 + 2V2 + 0 >= V1 + 1V2 + 0 = U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1), activate(V2)) isNat(n__s(V1)) = V1 + 0 >= V1 + 0 = U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) = 1 >= 0 = tt() isNatKind(n__plus(V1,V2)) = 1V1 + 3V2 + 1 >= 1V2 + 0 = and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) = 1V1 + 1 >= 1V1 + 0 = isNatKind(activate(V1)) plus(N,0()) = N + 2 >= N + 1 = U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) = 2M + N + 2 >= 2M + N + 1 = U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() = 0 >= 0 = n__0() plus(X1,X2) = X1 + 2X2 + 0 >= X1 + 2X2 + 0 = n__plus(X1,X2) isNatKind(X) = 1X + 0 >= 1X + 0 = n__isNatKind(X) s(X) = X + 0 >= X + 0 = n__s(X) and(X1,X2) = X2 + 0 >= X2 + 0 = n__and(X1,X2) activate(n__0()) = 0 >= 0 = 0() activate(n__plus(X1,X2)) = X1 + 2X2 + 0 >= X1 + 2X2 + 0 = plus(X1,X2) activate(n__isNatKind(X)) = 1X + 0 >= 1X + 0 = isNatKind(X) activate(n__s(X)) = X + 0 >= X + 0 = s(X) activate(n__and(X1,X2)) = X2 + 0 >= X2 + 0 = and(X1,X2) activate(X) = X >= X = X problem: DPs: U21#(tt(),V1) -> isNat#(activate(V1)) isNat#(n__plus(V1,V2)) -> U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))), activate(V1),activate(V2)) U11#(tt(),V1,V2) -> isNat#(activate(V1)) isNat#(n__s(V1)) -> U21#(isNatKind(activate(V1)),activate(V1)) U11#(tt(),V1,V2) -> U12#(isNat(activate(V1)),activate(V2)) TRS: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X Restore Modifier: DPs: U21#(tt(),V1) -> isNat#(activate(V1)) isNat#(n__plus(V1,V2)) -> U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))), activate(V1),activate(V2)) U11#(tt(),V1,V2) -> isNat#(activate(V1)) isNat#(n__s(V1)) -> U21#(isNatKind(activate(V1)),activate(V1)) U11#(tt(),V1,V2) -> U12#(isNat(activate(V1)),activate(V2)) TRS: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X SCC Processor: #sccs: 1 #rules: 4 #arcs: 10/25 DPs: U21#(tt(),V1) -> isNat#(activate(V1)) isNat#(n__plus(V1,V2)) -> U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))), activate(V1),activate(V2)) U11#(tt(),V1,V2) -> isNat#(activate(V1)) isNat#(n__s(V1)) -> U21#(isNatKind(activate(V1)),activate(V1)) TRS: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))), activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X Arctic Interpretation Processor: dimension: 1 usable rules: U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X interpretation: [0] = 0, [U12](x0, x1) = 3x0 + 5, [isNatKind](x0) = x0 + 0, [U31](x0, x1) = x1 + 0, [U11](x0, x1, x2) = 4x2 + 0, [isNat](x0) = 1, [n__isNatKind](x0) = x0, [n__and](x0, x1) = x0 + 1x1, [n__s](x0) = x0 + 0, [isNat#](x0) = x0 + 0, [U13](x0) = 3x0 + 5, [plus](x0, x1) = 1x0 + 4x1 + 1, [tt] = 0, [U22](x0) = x0 + 0, [U11#](x0, x1, x2) = x0 + 1x1 + 1x2 + 1, [U21#](x0, x1) = x0 + x1 + 0, [n__plus](x0, x1) = 1x0 + 4x1 + 1, [and](x0, x1) = x0 + 1x1 + 0, [s](x0) = x0 + 0, [U41](x0, x1, x2) = 4x1 + 1x2 + 4, [n__0] = 0, [U21](x0, x1) = 2x1, [activate](x0) = x0 + 0 orientation: U21#(tt(),V1) = V1 + 0 >= V1 + 0 = isNat#(activate(V1)) isNat#(n__plus(V1,V2)) = 1V1 + 4V2 + 1 >= 1V1 + 1V2 + 1 = U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1), activate(V2)) U11#(tt(),V1,V2) = 1V1 + 1V2 + 1 >= V1 + 0 = isNat#(activate(V1)) isNat#(n__s(V1)) = V1 + 0 >= V1 + 0 = U21#(isNatKind(activate(V1)),activate(V1)) U11(tt(),V1,V2) = 4V2 + 0 >= 5 = U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) = 5 >= 5 = U13(isNat(activate(V2))) U13(tt()) = 5 >= 0 = tt() U21(tt(),V1) = 2V1 >= 1 = U22(isNat(activate(V1))) U22(tt()) = 0 >= 0 = tt() U31(tt(),N) = N + 0 >= N + 0 = activate(N) U41(tt(),M,N) = 4M + 1N + 4 >= 4M + 1N + 4 = s(plus(activate(N),activate(M))) and(tt(),X) = 1X + 0 >= X + 0 = activate(X) isNat(n__0()) = 1 >= 0 = tt() isNat(n__plus(V1,V2)) = 1 >= 4V2 + 4 = U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1), activate(V2)) isNat(n__s(V1)) = 1 >= 2V1 + 2 = U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) = 0 >= 0 = tt() isNatKind(n__plus(V1,V2)) = 1V1 + 4V2 + 1 >= V1 + 1V2 + 1 = and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) = V1 + 0 >= V1 + 0 = isNatKind(activate(V1)) plus(N,0()) = 1N + 4 >= N + 0 = U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) = 4M + 1N + 4 >= 4M + 1N + 4 = U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() = 0 >= 0 = n__0() plus(X1,X2) = 1X1 + 4X2 + 1 >= 1X1 + 4X2 + 1 = n__plus(X1,X2) isNatKind(X) = X + 0 >= X = n__isNatKind(X) s(X) = X + 0 >= X + 0 = n__s(X) and(X1,X2) = X1 + 1X2 + 0 >= X1 + 1X2 = n__and(X1,X2) activate(n__0()) = 0 >= 0 = 0() activate(n__plus(X1,X2)) = 1X1 + 4X2 + 1 >= 1X1 + 4X2 + 1 = plus(X1,X2) activate(n__isNatKind(X)) = X + 0 >= X + 0 = isNatKind(X) activate(n__s(X)) = X + 0 >= X + 0 = s(X) activate(n__and(X1,X2)) = X1 + 1X2 + 0 >= X1 + 1X2 + 0 = and(X1,X2) activate(X) = X + 0 >= X = X problem: DPs: U21#(tt(),V1) -> isNat#(activate(V1)) isNat#(n__plus(V1,V2)) -> U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))), activate(V1),activate(V2)) isNat#(n__s(V1)) -> U21#(isNatKind(activate(V1)),activate(V1)) TRS: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))), activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X Restore Modifier: DPs: U21#(tt(),V1) -> isNat#(activate(V1)) isNat#(n__plus(V1,V2)) -> U11#(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))), activate(V1),activate(V2)) isNat#(n__s(V1)) -> U21#(isNatKind(activate(V1)),activate(V1)) TRS: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))), activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X SCC Processor: #sccs: 1 #rules: 2 #arcs: 6/9 DPs: U21#(tt(),V1) -> isNat#(activate(V1)) isNat#(n__s(V1)) -> U21#(isNatKind(activate(V1)),activate(V1)) TRS: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))), activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X Matrix Interpretation Processor: dim=1 usable rules: U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X interpretation: [0] = 0, [U12](x0, x1) = 4x1 + 4, [isNatKind](x0) = 2, [U31](x0, x1) = x1, [U11](x0, x1, x2) = 5x1 + 1, [isNat](x0) = 0, [n__isNatKind](x0) = 2, [n__and](x0, x1) = x1, [n__s](x0) = x0 + 1, [isNat#](x0) = 4x0 + 4, [U13](x0) = 4, [plus](x0, x1) = x0 + 4x1, [tt] = 1, [U22](x0) = 2x0 + 4, [U21#](x0, x1) = x0 + 4x1 + 6, [n__plus](x0, x1) = x0 + 4x1, [and](x0, x1) = x1, [s](x0) = x0 + 1, [U41](x0, x1, x2) = 4x1 + x2 + 4, [n__0] = 0, [U21](x0, x1) = 4x0, [activate](x0) = x0 orientation: U21#(tt(),V1) = 4V1 + 7 >= 4V1 + 4 = isNat#(activate(V1)) isNat#(n__s(V1)) = 4V1 + 8 >= 4V1 + 8 = U21#(isNatKind(activate(V1)),activate(V1)) U11(tt(),V1,V2) = 5V1 + 1 >= 4V2 + 4 = U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) = 4V2 + 4 >= 4 = U13(isNat(activate(V2))) U13(tt()) = 4 >= 1 = tt() U21(tt(),V1) = 4 >= 4 = U22(isNat(activate(V1))) U22(tt()) = 6 >= 1 = tt() U31(tt(),N) = N >= N = activate(N) U41(tt(),M,N) = 4M + N + 4 >= 4M + N + 1 = s(plus(activate(N),activate(M))) and(tt(),X) = X >= X = activate(X) isNat(n__0()) = 0 >= 1 = tt() isNat(n__plus(V1,V2)) = 0 >= 5V1 + 1 = U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1), activate(V2)) isNat(n__s(V1)) = 0 >= 8 = U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) = 2 >= 1 = tt() isNatKind(n__plus(V1,V2)) = 2 >= 2 = and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) = 2 >= 2 = isNatKind(activate(V1)) plus(N,0()) = N >= N = U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) = 4M + N + 4 >= 4M + N + 4 = U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() = 0 >= 0 = n__0() plus(X1,X2) = X1 + 4X2 >= X1 + 4X2 = n__plus(X1,X2) isNatKind(X) = 2 >= 2 = n__isNatKind(X) s(X) = X + 1 >= X + 1 = n__s(X) and(X1,X2) = X2 >= X2 = n__and(X1,X2) activate(n__0()) = 0 >= 0 = 0() activate(n__plus(X1,X2)) = X1 + 4X2 >= X1 + 4X2 = plus(X1,X2) activate(n__isNatKind(X)) = 2 >= 2 = isNatKind(X) activate(n__s(X)) = X + 1 >= X + 1 = s(X) activate(n__and(X1,X2)) = X2 >= X2 = and(X1,X2) activate(X) = X >= X = X problem: DPs: isNat#(n__s(V1)) -> U21#(isNatKind(activate(V1)),activate(V1)) TRS: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))), activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X Restore Modifier: DPs: isNat#(n__s(V1)) -> U21#(isNatKind(activate(V1)),activate(V1)) TRS: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))), activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X SCC Processor: #sccs: 0 #rules: 0 #arcs: 2/1 DPs: isNatKind#(n__s(V1)) -> isNatKind#(activate(V1)) isNatKind#(n__s(V1)) -> activate#(V1) activate#(n__plus(X1,X2)) -> plus#(X1,X2) plus#(N,0()) -> U31#(and(isNat(N),n__isNatKind(N)),N) U31#(tt(),N) -> activate#(N) activate#(n__isNatKind(X)) -> isNatKind#(X) activate#(n__and(X1,X2)) -> and#(X1,X2) and#(tt(),X) -> activate#(X) plus#(N,s(M)) -> and#(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))) plus#(N,s(M)) -> U41#(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) U41#(tt(),M,N) -> plus#(activate(N),activate(M)) TRS: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X Arctic Interpretation Processor: dimension: 1 usable rules: U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X interpretation: [0] = 0, [U12](x0, x1) = 1x0 + 1x1 + 0, [isNatKind](x0) = x0, [U31](x0, x1) = 1x1, [U11](x0, x1, x2) = x0 + 3x2, [isNat](x0) = 2x0 + 5, [n__isNatKind](x0) = x0, [activate#](x0) = 4x0 + 0, [n__and](x0, x1) = x1, [isNatKind#](x0) = 4x0 + 0, [n__s](x0) = x0, [U31#](x0, x1) = 4x1 + 0, [U41#](x0, x1, x2) = x0 + 4x2 + 0, [U13](x0) = 4, [plus](x0, x1) = 1x0 + 2x1 + 1, [tt] = 0, [U22](x0) = 2x0 + 0, [n__plus](x0, x1) = 1x0 + 2x1 + 1, [and#](x0, x1) = 4x1 + 0, [and](x0, x1) = x1, [s](x0) = x0, [U41](x0, x1, x2) = x0 + 2x1 + 1x2 + 1, [n__0] = 0, [U21](x0, x1) = x0 + x1 + 0, [plus#](x0, x1) = 4x0 + 0, [activate](x0) = x0 orientation: isNatKind#(n__s(V1)) = 4V1 + 0 >= 4V1 + 0 = isNatKind#(activate(V1)) isNatKind#(n__s(V1)) = 4V1 + 0 >= 4V1 + 0 = activate#(V1) activate#(n__plus(X1,X2)) = 5X1 + 6X2 + 5 >= 4X1 + 0 = plus#(X1,X2) plus#(N,0()) = 4N + 0 >= 4N + 0 = U31#(and(isNat(N),n__isNatKind(N)),N) U31#(tt(),N) = 4N + 0 >= 4N + 0 = activate#(N) activate#(n__isNatKind(X)) = 4X + 0 >= 4X + 0 = isNatKind#(X) activate#(n__and(X1,X2)) = 4X2 + 0 >= 4X2 + 0 = and#(X1,X2) and#(tt(),X) = 4X + 0 >= 4X + 0 = activate#(X) plus#(N,s(M)) = 4N + 0 >= 4N + 0 = and#(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))) plus#(N,s(M)) = 4N + 0 >= 4N + 0 = U41#(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) U41#(tt(),M,N) = 4N + 0 >= 4N + 0 = plus#(activate(N),activate(M)) U11(tt(),V1,V2) = 3V2 + 0 >= 3V1 + 1V2 + 6 = U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) = 1V2 + 1 >= 4 = U13(isNat(activate(V2))) U13(tt()) = 4 >= 0 = tt() U21(tt(),V1) = V1 + 0 >= 4V1 + 7 = U22(isNat(activate(V1))) U22(tt()) = 2 >= 0 = tt() U31(tt(),N) = 1N >= N = activate(N) U41(tt(),M,N) = 2M + 1N + 1 >= 2M + 1N + 1 = s(plus(activate(N),activate(M))) and(tt(),X) = X >= X = activate(X) isNat(n__0()) = 5 >= 0 = tt() isNat(n__plus(V1,V2)) = 3V1 + 4V2 + 5 >= 3V2 = U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1), activate(V2)) isNat(n__s(V1)) = 2V1 + 5 >= V1 + 0 = U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) = 0 >= 0 = tt() isNatKind(n__plus(V1,V2)) = 1V1 + 2V2 + 1 >= V2 = and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) = V1 >= V1 = isNatKind(activate(V1)) plus(N,0()) = 1N + 2 >= 1N = U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) = 2M + 1N + 1 >= 2M + 1N + 1 = U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() = 0 >= 0 = n__0() plus(X1,X2) = 1X1 + 2X2 + 1 >= 1X1 + 2X2 + 1 = n__plus(X1,X2) isNatKind(X) = X >= X = n__isNatKind(X) s(X) = X >= X = n__s(X) and(X1,X2) = X2 >= X2 = n__and(X1,X2) activate(n__0()) = 0 >= 0 = 0() activate(n__plus(X1,X2)) = 1X1 + 2X2 + 1 >= 1X1 + 2X2 + 1 = plus(X1,X2) activate(n__isNatKind(X)) = X >= X = isNatKind(X) activate(n__s(X)) = X >= X = s(X) activate(n__and(X1,X2)) = X2 >= X2 = and(X1,X2) activate(X) = X >= X = X problem: DPs: isNatKind#(n__s(V1)) -> isNatKind#(activate(V1)) isNatKind#(n__s(V1)) -> activate#(V1) plus#(N,0()) -> U31#(and(isNat(N),n__isNatKind(N)),N) U31#(tt(),N) -> activate#(N) activate#(n__isNatKind(X)) -> isNatKind#(X) activate#(n__and(X1,X2)) -> and#(X1,X2) and#(tt(),X) -> activate#(X) plus#(N,s(M)) -> and#(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))) plus#(N,s(M)) -> U41#(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) U41#(tt(),M,N) -> plus#(activate(N),activate(M)) TRS: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X Restore Modifier: DPs: isNatKind#(n__s(V1)) -> isNatKind#(activate(V1)) isNatKind#(n__s(V1)) -> activate#(V1) plus#(N,0()) -> U31#(and(isNat(N),n__isNatKind(N)),N) U31#(tt(),N) -> activate#(N) activate#(n__isNatKind(X)) -> isNatKind#(X) activate#(n__and(X1,X2)) -> and#(X1,X2) and#(tt(),X) -> activate#(X) plus#(N,s(M)) -> and#(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))) plus#(N,s(M)) -> U41#(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) U41#(tt(),M,N) -> plus#(activate(N),activate(M)) TRS: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X SCC Processor: #sccs: 2 #rules: 7 #arcs: 23/100 DPs: plus#(N,s(M)) -> U41#(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) U41#(tt(),M,N) -> plus#(activate(N),activate(M)) TRS: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))), activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X Matrix Interpretation Processor: dim=1 usable rules: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))), activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X interpretation: [0] = 0, [U12](x0, x1) = 0, [isNatKind](x0) = 0, [U31](x0, x1) = 2x1, [U11](x0, x1, x2) = 1, [isNat](x0) = 1, [n__isNatKind](x0) = 0, [n__and](x0, x1) = 4x0 + 2x1, [n__s](x0) = x0 + 5, [U41#](x0, x1, x2) = 4x1 + 4, [U13](x0) = 0, [plus](x0, x1) = 2x0 + 6x1, [tt] = 0, [U22](x0) = 0, [n__plus](x0, x1) = 2x0 + 6x1, [and](x0, x1) = 4x0 + 2x1, [s](x0) = x0 + 5, [U41](x0, x1, x2) = x0 + 6x1 + 2x2 + 6, [n__0] = 0, [U21](x0, x1) = 1, [plus#](x0, x1) = 4x1 + 1, [activate](x0) = x0 orientation: plus#(N,s(M)) = 4M + 21 >= 4M + 4 = U41#(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) U41#(tt(),M,N) = 4M + 4 >= 4M + 1 = plus#(activate(N),activate(M)) U11(tt(),V1,V2) = 1 >= 0 = U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) = 0 >= 0 = U13(isNat(activate(V2))) U13(tt()) = 0 >= 0 = tt() U21(tt(),V1) = 1 >= 0 = U22(isNat(activate(V1))) U22(tt()) = 0 >= 0 = tt() U31(tt(),N) = 2N >= N = activate(N) U41(tt(),M,N) = 6M + 2N + 6 >= 6M + 2N + 5 = s(plus(activate(N),activate(M))) and(tt(),X) = 2X >= X = activate(X) isNat(n__0()) = 1 >= 0 = tt() isNat(n__plus(V1,V2)) = 1 >= 1 = U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1), activate(V2)) isNat(n__s(V1)) = 1 >= 1 = U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) = 0 >= 0 = tt() isNatKind(n__plus(V1,V2)) = 0 >= 0 = and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) = 0 >= 0 = isNatKind(activate(V1)) plus(N,0()) = 2N >= 2N = U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) = 6M + 2N + 30 >= 6M + 2N + 30 = U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() = 0 >= 0 = n__0() plus(X1,X2) = 2X1 + 6X2 >= 2X1 + 6X2 = n__plus(X1,X2) isNatKind(X) = 0 >= 0 = n__isNatKind(X) s(X) = X + 5 >= X + 5 = n__s(X) and(X1,X2) = 4X1 + 2X2 >= 4X1 + 2X2 = n__and(X1,X2) activate(n__0()) = 0 >= 0 = 0() activate(n__plus(X1,X2)) = 2X1 + 6X2 >= 2X1 + 6X2 = plus(X1,X2) activate(n__isNatKind(X)) = 0 >= 0 = isNatKind(X) activate(n__s(X)) = X + 5 >= X + 5 = s(X) activate(n__and(X1,X2)) = 4X1 + 2X2 >= 4X1 + 2X2 = and(X1,X2) activate(X) = X >= X = X problem: DPs: TRS: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))), activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X Qed DPs: isNatKind#(n__s(V1)) -> isNatKind#(activate(V1)) isNatKind#(n__s(V1)) -> activate#(V1) activate#(n__isNatKind(X)) -> isNatKind#(X) activate#(n__and(X1,X2)) -> and#(X1,X2) and#(tt(),X) -> activate#(X) TRS: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))), activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X Arctic Interpretation Processor: dimension: 1 usable rules: U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X interpretation: [0] = 2, [U12](x0, x1) = x0 + x1, [isNatKind](x0) = 2x0, [U31](x0, x1) = 1x1, [U11](x0, x1, x2) = x1 + 2x2, [isNat](x0) = x0, [n__isNatKind](x0) = 2x0, [activate#](x0) = x0, [n__and](x0, x1) = 1x0 + x1, [isNatKind#](x0) = x0, [n__s](x0) = x0 + 0, [U13](x0) = 0, [plus](x0, x1) = 1x0 + x1, [tt] = 3, [U22](x0) = 0, [n__plus](x0, x1) = 1x0 + x1, [and#](x0, x1) = 1x0 + x1, [and](x0, x1) = 1x0 + x1, [s](x0) = x0 + 0, [U41](x0, x1, x2) = x1 + 1x2 + 0, [n__0] = 2, [U21](x0, x1) = 2x0 + 1x1 + 12, [activate](x0) = x0 orientation: isNatKind#(n__s(V1)) = V1 + 0 >= V1 = isNatKind#(activate(V1)) isNatKind#(n__s(V1)) = V1 + 0 >= V1 = activate#(V1) activate#(n__isNatKind(X)) = 2X >= X = isNatKind#(X) activate#(n__and(X1,X2)) = 1X1 + X2 >= 1X1 + X2 = and#(X1,X2) and#(tt(),X) = X + 4 >= X = activate#(X) U11(tt(),V1,V2) = V1 + 2V2 >= V1 + V2 = U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) = V2 + 3 >= 0 = U13(isNat(activate(V2))) U13(tt()) = 0 >= 3 = tt() U21(tt(),V1) = 1V1 + 12 >= 0 = U22(isNat(activate(V1))) U22(tt()) = 0 >= 3 = tt() U31(tt(),N) = 1N >= N = activate(N) U41(tt(),M,N) = M + 1N + 0 >= M + 1N + 0 = s(plus(activate(N),activate(M))) and(tt(),X) = X + 4 >= X = activate(X) isNat(n__0()) = 2 >= 3 = tt() isNat(n__plus(V1,V2)) = 1V1 + V2 >= V1 + 2V2 = U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1), activate(V2)) isNat(n__s(V1)) = V1 + 0 >= 4V1 + 12 = U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) = 4 >= 3 = tt() isNatKind(n__plus(V1,V2)) = 3V1 + 2V2 >= 3V1 + 2V2 = and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) = 2V1 + 2 >= 2V1 = isNatKind(activate(V1)) plus(N,0()) = 1N + 2 >= 1N = U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) = M + 1N + 0 >= M + 1N + 0 = U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() = 2 >= 2 = n__0() plus(X1,X2) = 1X1 + X2 >= 1X1 + X2 = n__plus(X1,X2) isNatKind(X) = 2X >= 2X = n__isNatKind(X) s(X) = X + 0 >= X + 0 = n__s(X) and(X1,X2) = 1X1 + X2 >= 1X1 + X2 = n__and(X1,X2) activate(n__0()) = 2 >= 2 = 0() activate(n__plus(X1,X2)) = 1X1 + X2 >= 1X1 + X2 = plus(X1,X2) activate(n__isNatKind(X)) = 2X >= 2X = isNatKind(X) activate(n__s(X)) = X + 0 >= X + 0 = s(X) activate(n__and(X1,X2)) = 1X1 + X2 >= 1X1 + X2 = and(X1,X2) activate(X) = X >= X = X problem: DPs: isNatKind#(n__s(V1)) -> isNatKind#(activate(V1)) isNatKind#(n__s(V1)) -> activate#(V1) activate#(n__and(X1,X2)) -> and#(X1,X2) and#(tt(),X) -> activate#(X) TRS: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))), activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X Restore Modifier: DPs: isNatKind#(n__s(V1)) -> isNatKind#(activate(V1)) isNatKind#(n__s(V1)) -> activate#(V1) activate#(n__and(X1,X2)) -> and#(X1,X2) and#(tt(),X) -> activate#(X) TRS: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))), activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X SCC Processor: #sccs: 2 #rules: 3 #arcs: 9/16 DPs: isNatKind#(n__s(V1)) -> isNatKind#(activate(V1)) TRS: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))), activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X Matrix Interpretation Processor: dim=1 usable rules: U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X interpretation: [0] = 2, [U12](x0, x1) = 0, [isNatKind](x0) = 1, [U31](x0, x1) = x0 + x1 + 6, [U11](x0, x1, x2) = 2x1 + 2, [isNat](x0) = 0, [n__isNatKind](x0) = 0, [n__and](x0, x1) = 4x1, [isNatKind#](x0) = x0, [n__s](x0) = x0 + 2, [U13](x0) = 4x0, [plus](x0, x1) = x0 + 3x1 + 1, [tt] = 1, [U22](x0) = 2, [n__plus](x0, x1) = x0 + 3x1 + 1, [and](x0, x1) = 4x1 + 1, [s](x0) = x0 + 2, [U41](x0, x1, x2) = 3x1 + x2 + 7, [n__0] = 2, [U21](x0, x1) = 3, [activate](x0) = x0 + 1 orientation: isNatKind#(n__s(V1)) = V1 + 2 >= V1 + 1 = isNatKind#(activate(V1)) U11(tt(),V1,V2) = 2V1 + 2 >= 0 = U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) = 0 >= 0 = U13(isNat(activate(V2))) U13(tt()) = 4 >= 1 = tt() U21(tt(),V1) = 3 >= 2 = U22(isNat(activate(V1))) U22(tt()) = 2 >= 1 = tt() U31(tt(),N) = N + 7 >= N + 1 = activate(N) U41(tt(),M,N) = 3M + N + 7 >= 3M + N + 7 = s(plus(activate(N),activate(M))) and(tt(),X) = 4X + 1 >= X + 1 = activate(X) isNat(n__0()) = 0 >= 1 = tt() isNat(n__plus(V1,V2)) = 0 >= 2V1 + 4 = U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1), activate(V2)) isNat(n__s(V1)) = 0 >= 3 = U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) = 1 >= 1 = tt() isNatKind(n__plus(V1,V2)) = 1 >= 1 = and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) = 1 >= 1 = isNatKind(activate(V1)) plus(N,0()) = N + 7 >= N + 7 = U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) = 3M + N + 7 >= 3M + N + 7 = U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() = 2 >= 2 = n__0() plus(X1,X2) = X1 + 3X2 + 1 >= X1 + 3X2 + 1 = n__plus(X1,X2) isNatKind(X) = 1 >= 0 = n__isNatKind(X) s(X) = X + 2 >= X + 2 = n__s(X) and(X1,X2) = 4X2 + 1 >= 4X2 = n__and(X1,X2) activate(n__0()) = 3 >= 2 = 0() activate(n__plus(X1,X2)) = X1 + 3X2 + 2 >= X1 + 3X2 + 1 = plus(X1,X2) activate(n__isNatKind(X)) = 1 >= 1 = isNatKind(X) activate(n__s(X)) = X + 3 >= X + 2 = s(X) activate(n__and(X1,X2)) = 4X2 + 1 >= 4X2 + 1 = and(X1,X2) activate(X) = X + 1 >= X = X problem: DPs: TRS: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))), activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X Qed DPs: activate#(n__and(X1,X2)) -> and#(X1,X2) and#(tt(),X) -> activate#(X) TRS: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))), activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X Size-Change Termination Processor: DPs: TRS: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) U12(tt(),V2) -> U13(isNat(activate(V2))) U13(tt()) -> tt() U21(tt(),V1) -> U22(isNat(activate(V1))) U22(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> s(plus(activate(N),activate(M))) and(tt(),X) -> activate(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))), activate(V1),activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) isNatKind(n__0()) -> tt() isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N) 0() -> n__0() plus(X1,X2) -> n__plus(X1,X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) and(X1,X2) -> n__and(X1,X2) activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(X) activate(n__and(X1,X2)) -> and(X1,X2) activate(X) -> X The DP: activate#(n__and(X1,X2)) -> and#(X1,X2) has the edges: 0 > 1 0 > 0 The DP: and#(tt(),X) -> activate#(X) has the edges: 1 >= 0 Qed