YES Problem: a__U11(tt(),V1,V2) -> a__U12(a__isNat(V1),V2) a__U12(tt(),V2) -> a__U13(a__isNat(V2)) a__U13(tt()) -> tt() a__U21(tt(),V1) -> a__U22(a__isNat(V1)) a__U22(tt()) -> tt() a__U31(tt(),N) -> mark(N) a__U41(tt(),M,N) -> s(a__plus(mark(N),mark(M))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(plus(V1,V2)) -> a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) -> a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) -> tt() a__isNatKind(plus(V1,V2)) -> a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) -> a__isNatKind(V1) a__plus(N,0()) -> a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) -> a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(U13(X)) -> a__U13(mark(X)) mark(U21(X1,X2)) -> a__U21(mark(X1),X2) mark(U22(X)) -> a__U22(mark(X)) mark(U31(X1,X2)) -> a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) -> a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNatKind(X)) -> a__isNatKind(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2,X3) -> U11(X1,X2,X3) a__U12(X1,X2) -> U12(X1,X2) a__isNat(X) -> isNat(X) a__U13(X) -> U13(X) a__U21(X1,X2) -> U21(X1,X2) a__U22(X) -> U22(X) a__U31(X1,X2) -> U31(X1,X2) a__U41(X1,X2,X3) -> U41(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNatKind(X) -> isNatKind(X) Proof: DP Processor: DPs: a__U11#(tt(),V1,V2) -> a__isNat#(V1) a__U11#(tt(),V1,V2) -> a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) -> a__isNat#(V2) a__U12#(tt(),V2) -> a__U13#(a__isNat(V2)) a__U21#(tt(),V1) -> a__isNat#(V1) a__U21#(tt(),V1) -> a__U22#(a__isNat(V1)) a__U31#(tt(),N) -> mark#(N) a__U41#(tt(),M,N) -> mark#(M) a__U41#(tt(),M,N) -> mark#(N) a__U41#(tt(),M,N) -> a__plus#(mark(N),mark(M)) a__and#(tt(),X) -> mark#(X) a__isNat#(plus(V1,V2)) -> a__isNatKind#(V1) a__isNat#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) -> a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat#(s(V1)) -> a__isNatKind#(V1) a__isNat#(s(V1)) -> a__U21#(a__isNatKind(V1),V1) a__isNatKind#(plus(V1,V2)) -> a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNatKind#(s(V1)) -> a__isNatKind#(V1) a__plus#(N,0()) -> a__isNat#(N) a__plus#(N,0()) -> a__and#(a__isNat(N),isNatKind(N)) a__plus#(N,0()) -> a__U31#(a__and(a__isNat(N),isNatKind(N)),N) a__plus#(N,s(M)) -> a__isNat#(M) a__plus#(N,s(M)) -> a__and#(a__isNat(M),isNatKind(M)) a__plus#(N,s(M)) -> a__and#(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))) a__plus#(N,s(M)) -> a__U41#(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) mark#(U11(X1,X2,X3)) -> mark#(X1) mark#(U11(X1,X2,X3)) -> a__U11#(mark(X1),X2,X3) mark#(U12(X1,X2)) -> mark#(X1) mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(isNat(X)) -> a__isNat#(X) mark#(U13(X)) -> mark#(X) mark#(U13(X)) -> a__U13#(mark(X)) mark#(U21(X1,X2)) -> mark#(X1) mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2) mark#(U22(X)) -> mark#(X) mark#(U22(X)) -> a__U22#(mark(X)) mark#(U31(X1,X2)) -> mark#(X1) mark#(U31(X1,X2)) -> a__U31#(mark(X1),X2) mark#(U41(X1,X2,X3)) -> mark#(X1) mark#(U41(X1,X2,X3)) -> a__U41#(mark(X1),X2,X3) mark#(plus(X1,X2)) -> mark#(X2) mark#(plus(X1,X2)) -> mark#(X1) mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) mark#(and(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(isNatKind(X)) -> a__isNatKind#(X) mark#(s(X)) -> mark#(X) TRS: a__U11(tt(),V1,V2) -> a__U12(a__isNat(V1),V2) a__U12(tt(),V2) -> a__U13(a__isNat(V2)) a__U13(tt()) -> tt() a__U21(tt(),V1) -> a__U22(a__isNat(V1)) a__U22(tt()) -> tt() a__U31(tt(),N) -> mark(N) a__U41(tt(),M,N) -> s(a__plus(mark(N),mark(M))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(plus(V1,V2)) -> a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) -> a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) -> tt() a__isNatKind(plus(V1,V2)) -> a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) -> a__isNatKind(V1) a__plus(N,0()) -> a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) -> a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(U13(X)) -> a__U13(mark(X)) mark(U21(X1,X2)) -> a__U21(mark(X1),X2) mark(U22(X)) -> a__U22(mark(X)) mark(U31(X1,X2)) -> a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) -> a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNatKind(X)) -> a__isNatKind(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2,X3) -> U11(X1,X2,X3) a__U12(X1,X2) -> U12(X1,X2) a__isNat(X) -> isNat(X) a__U13(X) -> U13(X) a__U21(X1,X2) -> U21(X1,X2) a__U22(X) -> U22(X) a__U31(X1,X2) -> U31(X1,X2) a__U41(X1,X2,X3) -> U41(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNatKind(X) -> isNatKind(X) EDG Processor: DPs: a__U11#(tt(),V1,V2) -> a__isNat#(V1) a__U11#(tt(),V1,V2) -> a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) -> a__isNat#(V2) a__U12#(tt(),V2) -> a__U13#(a__isNat(V2)) a__U21#(tt(),V1) -> a__isNat#(V1) a__U21#(tt(),V1) -> a__U22#(a__isNat(V1)) a__U31#(tt(),N) -> mark#(N) a__U41#(tt(),M,N) -> mark#(M) a__U41#(tt(),M,N) -> mark#(N) a__U41#(tt(),M,N) -> a__plus#(mark(N),mark(M)) a__and#(tt(),X) -> mark#(X) a__isNat#(plus(V1,V2)) -> a__isNatKind#(V1) a__isNat#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) -> a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat#(s(V1)) -> a__isNatKind#(V1) a__isNat#(s(V1)) -> a__U21#(a__isNatKind(V1),V1) a__isNatKind#(plus(V1,V2)) -> a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNatKind#(s(V1)) -> a__isNatKind#(V1) a__plus#(N,0()) -> a__isNat#(N) a__plus#(N,0()) -> a__and#(a__isNat(N),isNatKind(N)) a__plus#(N,0()) -> a__U31#(a__and(a__isNat(N),isNatKind(N)),N) a__plus#(N,s(M)) -> a__isNat#(M) a__plus#(N,s(M)) -> a__and#(a__isNat(M),isNatKind(M)) a__plus#(N,s(M)) -> a__and#(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))) a__plus#(N,s(M)) -> a__U41#(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) mark#(U11(X1,X2,X3)) -> mark#(X1) mark#(U11(X1,X2,X3)) -> a__U11#(mark(X1),X2,X3) mark#(U12(X1,X2)) -> mark#(X1) mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(isNat(X)) -> a__isNat#(X) mark#(U13(X)) -> mark#(X) mark#(U13(X)) -> a__U13#(mark(X)) mark#(U21(X1,X2)) -> mark#(X1) mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2) mark#(U22(X)) -> mark#(X) mark#(U22(X)) -> a__U22#(mark(X)) mark#(U31(X1,X2)) -> mark#(X1) mark#(U31(X1,X2)) -> a__U31#(mark(X1),X2) mark#(U41(X1,X2,X3)) -> mark#(X1) mark#(U41(X1,X2,X3)) -> a__U41#(mark(X1),X2,X3) mark#(plus(X1,X2)) -> mark#(X2) mark#(plus(X1,X2)) -> mark#(X1) mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) mark#(and(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(isNatKind(X)) -> a__isNatKind#(X) mark#(s(X)) -> mark#(X) TRS: a__U11(tt(),V1,V2) -> a__U12(a__isNat(V1),V2) a__U12(tt(),V2) -> a__U13(a__isNat(V2)) a__U13(tt()) -> tt() a__U21(tt(),V1) -> a__U22(a__isNat(V1)) a__U22(tt()) -> tt() a__U31(tt(),N) -> mark(N) a__U41(tt(),M,N) -> s(a__plus(mark(N),mark(M))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(plus(V1,V2)) -> a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) -> a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) -> tt() a__isNatKind(plus(V1,V2)) -> a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) -> a__isNatKind(V1) a__plus(N,0()) -> a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) -> a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(U13(X)) -> a__U13(mark(X)) mark(U21(X1,X2)) -> a__U21(mark(X1),X2) mark(U22(X)) -> a__U22(mark(X)) mark(U31(X1,X2)) -> a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) -> a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNatKind(X)) -> a__isNatKind(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2,X3) -> U11(X1,X2,X3) a__U12(X1,X2) -> U12(X1,X2) a__isNat(X) -> isNat(X) a__U13(X) -> U13(X) a__U21(X1,X2) -> U21(X1,X2) a__U22(X) -> U22(X) a__U31(X1,X2) -> U31(X1,X2) a__U41(X1,X2,X3) -> U41(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNatKind(X) -> isNatKind(X) graph: a__isNatKind#(plus(V1,V2)) -> a__isNatKind#(V1) -> a__isNatKind#(plus(V1,V2)) -> a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) -> a__isNatKind#(V1) -> a__isNatKind#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNatKind#(plus(V1,V2)) -> a__isNatKind#(V1) -> a__isNatKind#(s(V1)) -> a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) -> a__and#(tt(),X) -> mark#(X) a__isNatKind#(s(V1)) -> a__isNatKind#(V1) -> a__isNatKind#(plus(V1,V2)) -> a__isNatKind#(V1) a__isNatKind#(s(V1)) -> a__isNatKind#(V1) -> a__isNatKind#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNatKind#(s(V1)) -> a__isNatKind#(V1) -> a__isNatKind#(s(V1)) -> a__isNatKind#(V1) a__and#(tt(),X) -> mark#(X) -> mark#(U11(X1,X2,X3)) -> mark#(X1) a__and#(tt(),X) -> mark#(X) -> mark#(U11(X1,X2,X3)) -> a__U11#(mark(X1),X2,X3) a__and#(tt(),X) -> mark#(X) -> mark#(U12(X1,X2)) -> mark#(X1) a__and#(tt(),X) -> mark#(X) -> mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) a__and#(tt(),X) -> mark#(X) -> mark#(isNat(X)) -> a__isNat#(X) a__and#(tt(),X) -> mark#(X) -> mark#(U13(X)) -> mark#(X) a__and#(tt(),X) -> mark#(X) -> mark#(U13(X)) -> a__U13#(mark(X)) a__and#(tt(),X) -> mark#(X) -> mark#(U21(X1,X2)) -> mark#(X1) a__and#(tt(),X) -> mark#(X) -> mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2) a__and#(tt(),X) -> mark#(X) -> mark#(U22(X)) -> mark#(X) a__and#(tt(),X) -> mark#(X) -> mark#(U22(X)) -> a__U22#(mark(X)) a__and#(tt(),X) -> mark#(X) -> mark#(U31(X1,X2)) -> mark#(X1) a__and#(tt(),X) -> mark#(X) -> mark#(U31(X1,X2)) -> a__U31#(mark(X1),X2) a__and#(tt(),X) -> mark#(X) -> mark#(U41(X1,X2,X3)) -> mark#(X1) a__and#(tt(),X) -> mark#(X) -> mark#(U41(X1,X2,X3)) -> a__U41#(mark(X1),X2,X3) a__and#(tt(),X) -> mark#(X) -> mark#(plus(X1,X2)) -> mark#(X2) a__and#(tt(),X) -> mark#(X) -> mark#(plus(X1,X2)) -> mark#(X1) a__and#(tt(),X) -> mark#(X) -> mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) a__and#(tt(),X) -> mark#(X) -> mark#(and(X1,X2)) -> mark#(X1) a__and#(tt(),X) -> mark#(X) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) a__and#(tt(),X) -> mark#(X) -> mark#(isNatKind(X)) -> a__isNatKind#(X) a__and#(tt(),X) -> mark#(X) -> mark#(s(X)) -> mark#(X) a__plus#(N,0()) -> a__and#(a__isNat(N),isNatKind(N)) -> a__and#(tt(),X) -> mark#(X) a__plus#(N,0()) -> a__U31#(a__and(a__isNat(N),isNatKind(N)),N) -> a__U31#(tt(),N) -> mark#(N) a__plus#(N,0()) -> a__isNat#(N) -> a__isNat#(plus(V1,V2)) -> a__isNatKind#(V1) a__plus#(N,0()) -> a__isNat#(N) -> a__isNat#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__plus#(N,0()) -> a__isNat#(N) -> a__isNat#(plus(V1,V2)) -> a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__plus#(N,0()) -> a__isNat#(N) -> a__isNat#(s(V1)) -> a__isNatKind#(V1) a__plus#(N,0()) -> a__isNat#(N) -> a__isNat#(s(V1)) -> a__U21#(a__isNatKind(V1),V1) a__plus#(N,s(M)) -> a__and#(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))) -> a__and#(tt(),X) -> mark#(X) a__plus#(N,s(M)) -> a__and#(a__isNat(M),isNatKind(M)) -> a__and#(tt(),X) -> mark#(X) a__plus#(N,s(M)) -> a__U41#(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) -> a__U41#(tt(),M,N) -> mark#(M) a__plus#(N,s(M)) -> a__U41#(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) -> a__U41#(tt(),M,N) -> mark#(N) a__plus#(N,s(M)) -> a__U41#(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) -> a__U41#(tt(),M,N) -> a__plus#(mark(N),mark(M)) a__plus#(N,s(M)) -> a__isNat#(M) -> a__isNat#(plus(V1,V2)) -> a__isNatKind#(V1) a__plus#(N,s(M)) -> a__isNat#(M) -> a__isNat#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__plus#(N,s(M)) -> a__isNat#(M) -> a__isNat#(plus(V1,V2)) -> a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__plus#(N,s(M)) -> a__isNat#(M) -> a__isNat#(s(V1)) -> a__isNatKind#(V1) a__plus#(N,s(M)) -> a__isNat#(M) -> a__isNat#(s(V1)) -> a__U21#(a__isNatKind(V1),V1) a__U41#(tt(),M,N) -> a__plus#(mark(N),mark(M)) -> a__plus#(N,0()) -> a__isNat#(N) a__U41#(tt(),M,N) -> a__plus#(mark(N),mark(M)) -> a__plus#(N,0()) -> a__and#(a__isNat(N),isNatKind(N)) a__U41#(tt(),M,N) -> a__plus#(mark(N),mark(M)) -> a__plus#(N,0()) -> a__U31#(a__and(a__isNat(N),isNatKind(N)),N) a__U41#(tt(),M,N) -> a__plus#(mark(N),mark(M)) -> a__plus#(N,s(M)) -> a__isNat#(M) a__U41#(tt(),M,N) -> a__plus#(mark(N),mark(M)) -> a__plus#(N,s(M)) -> a__and#(a__isNat(M),isNatKind(M)) a__U41#(tt(),M,N) -> a__plus#(mark(N),mark(M)) -> a__plus#(N,s(M)) -> a__and#(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))) a__U41#(tt(),M,N) -> a__plus#(mark(N),mark(M)) -> a__plus#(N,s(M)) -> a__U41#(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) a__U41#(tt(),M,N) -> mark#(M) -> mark#(U11(X1,X2,X3)) -> mark#(X1) a__U41#(tt(),M,N) -> mark#(M) -> mark#(U11(X1,X2,X3)) -> a__U11#(mark(X1),X2,X3) a__U41#(tt(),M,N) -> mark#(M) -> mark#(U12(X1,X2)) -> mark#(X1) a__U41#(tt(),M,N) -> mark#(M) -> mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) a__U41#(tt(),M,N) -> mark#(M) -> mark#(isNat(X)) -> a__isNat#(X) a__U41#(tt(),M,N) -> mark#(M) -> mark#(U13(X)) -> mark#(X) a__U41#(tt(),M,N) -> mark#(M) -> mark#(U13(X)) -> a__U13#(mark(X)) a__U41#(tt(),M,N) -> mark#(M) -> mark#(U21(X1,X2)) -> mark#(X1) a__U41#(tt(),M,N) -> mark#(M) -> mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2) a__U41#(tt(),M,N) -> mark#(M) -> mark#(U22(X)) -> mark#(X) a__U41#(tt(),M,N) -> mark#(M) -> mark#(U22(X)) -> a__U22#(mark(X)) a__U41#(tt(),M,N) -> mark#(M) -> mark#(U31(X1,X2)) -> mark#(X1) a__U41#(tt(),M,N) -> mark#(M) -> mark#(U31(X1,X2)) -> a__U31#(mark(X1),X2) a__U41#(tt(),M,N) -> mark#(M) -> mark#(U41(X1,X2,X3)) -> mark#(X1) a__U41#(tt(),M,N) -> mark#(M) -> mark#(U41(X1,X2,X3)) -> a__U41#(mark(X1),X2,X3) a__U41#(tt(),M,N) -> mark#(M) -> mark#(plus(X1,X2)) -> mark#(X2) a__U41#(tt(),M,N) -> mark#(M) -> mark#(plus(X1,X2)) -> mark#(X1) a__U41#(tt(),M,N) -> mark#(M) -> mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) a__U41#(tt(),M,N) -> mark#(M) -> mark#(and(X1,X2)) -> mark#(X1) a__U41#(tt(),M,N) -> mark#(M) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) a__U41#(tt(),M,N) -> mark#(M) -> mark#(isNatKind(X)) -> a__isNatKind#(X) a__U41#(tt(),M,N) -> mark#(M) -> mark#(s(X)) -> mark#(X) a__U41#(tt(),M,N) -> mark#(N) -> mark#(U11(X1,X2,X3)) -> mark#(X1) a__U41#(tt(),M,N) -> mark#(N) -> mark#(U11(X1,X2,X3)) -> a__U11#(mark(X1),X2,X3) a__U41#(tt(),M,N) -> mark#(N) -> mark#(U12(X1,X2)) -> mark#(X1) a__U41#(tt(),M,N) -> mark#(N) -> mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) a__U41#(tt(),M,N) -> mark#(N) -> mark#(isNat(X)) -> a__isNat#(X) a__U41#(tt(),M,N) -> mark#(N) -> mark#(U13(X)) -> mark#(X) a__U41#(tt(),M,N) -> mark#(N) -> mark#(U13(X)) -> a__U13#(mark(X)) a__U41#(tt(),M,N) -> mark#(N) -> mark#(U21(X1,X2)) -> mark#(X1) a__U41#(tt(),M,N) -> mark#(N) -> mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2) a__U41#(tt(),M,N) -> mark#(N) -> mark#(U22(X)) -> mark#(X) a__U41#(tt(),M,N) -> mark#(N) -> mark#(U22(X)) -> a__U22#(mark(X)) a__U41#(tt(),M,N) -> mark#(N) -> mark#(U31(X1,X2)) -> mark#(X1) a__U41#(tt(),M,N) -> mark#(N) -> mark#(U31(X1,X2)) -> a__U31#(mark(X1),X2) a__U41#(tt(),M,N) -> mark#(N) -> mark#(U41(X1,X2,X3)) -> mark#(X1) a__U41#(tt(),M,N) -> mark#(N) -> mark#(U41(X1,X2,X3)) -> a__U41#(mark(X1),X2,X3) a__U41#(tt(),M,N) -> mark#(N) -> mark#(plus(X1,X2)) -> mark#(X2) a__U41#(tt(),M,N) -> mark#(N) -> mark#(plus(X1,X2)) -> mark#(X1) a__U41#(tt(),M,N) -> mark#(N) -> mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) a__U41#(tt(),M,N) -> mark#(N) -> mark#(and(X1,X2)) -> mark#(X1) a__U41#(tt(),M,N) -> mark#(N) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) a__U41#(tt(),M,N) -> mark#(N) -> mark#(isNatKind(X)) -> a__isNatKind#(X) a__U41#(tt(),M,N) -> mark#(N) -> mark#(s(X)) -> mark#(X) mark#(U41(X1,X2,X3)) -> a__U41#(mark(X1),X2,X3) -> a__U41#(tt(),M,N) -> mark#(M) mark#(U41(X1,X2,X3)) -> a__U41#(mark(X1),X2,X3) -> a__U41#(tt(),M,N) -> mark#(N) mark#(U41(X1,X2,X3)) -> a__U41#(mark(X1),X2,X3) -> a__U41#(tt(),M,N) -> a__plus#(mark(N),mark(M)) mark#(U41(X1,X2,X3)) -> mark#(X1) -> mark#(U11(X1,X2,X3)) -> mark#(X1) mark#(U41(X1,X2,X3)) -> mark#(X1) -> mark#(U11(X1,X2,X3)) -> a__U11#(mark(X1),X2,X3) mark#(U41(X1,X2,X3)) -> mark#(X1) -> mark#(U12(X1,X2)) -> mark#(X1) mark#(U41(X1,X2,X3)) -> mark#(X1) -> mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(U41(X1,X2,X3)) -> mark#(X1) -> mark#(isNat(X)) -> a__isNat#(X) mark#(U41(X1,X2,X3)) -> mark#(X1) -> mark#(U13(X)) -> mark#(X) mark#(U41(X1,X2,X3)) -> mark#(X1) -> mark#(U13(X)) -> a__U13#(mark(X)) mark#(U41(X1,X2,X3)) -> mark#(X1) -> mark#(U21(X1,X2)) -> mark#(X1) mark#(U41(X1,X2,X3)) -> mark#(X1) -> mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2) mark#(U41(X1,X2,X3)) -> mark#(X1) -> mark#(U22(X)) -> mark#(X) mark#(U41(X1,X2,X3)) -> mark#(X1) -> mark#(U22(X)) -> a__U22#(mark(X)) mark#(U41(X1,X2,X3)) -> mark#(X1) -> mark#(U31(X1,X2)) -> mark#(X1) mark#(U41(X1,X2,X3)) -> mark#(X1) -> mark#(U31(X1,X2)) -> a__U31#(mark(X1),X2) mark#(U41(X1,X2,X3)) -> mark#(X1) -> mark#(U41(X1,X2,X3)) -> mark#(X1) mark#(U41(X1,X2,X3)) -> mark#(X1) -> mark#(U41(X1,X2,X3)) -> a__U41#(mark(X1),X2,X3) mark#(U41(X1,X2,X3)) -> mark#(X1) -> mark#(plus(X1,X2)) -> mark#(X2) mark#(U41(X1,X2,X3)) -> mark#(X1) -> mark#(plus(X1,X2)) -> mark#(X1) mark#(U41(X1,X2,X3)) -> mark#(X1) -> mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) mark#(U41(X1,X2,X3)) -> mark#(X1) -> mark#(and(X1,X2)) -> mark#(X1) mark#(U41(X1,X2,X3)) -> mark#(X1) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(U41(X1,X2,X3)) -> mark#(X1) -> mark#(isNatKind(X)) -> a__isNatKind#(X) mark#(U41(X1,X2,X3)) -> mark#(X1) -> mark#(s(X)) -> mark#(X) mark#(U31(X1,X2)) -> mark#(X1) -> mark#(U11(X1,X2,X3)) -> mark#(X1) mark#(U31(X1,X2)) -> mark#(X1) -> mark#(U11(X1,X2,X3)) -> a__U11#(mark(X1),X2,X3) mark#(U31(X1,X2)) -> mark#(X1) -> mark#(U12(X1,X2)) -> mark#(X1) mark#(U31(X1,X2)) -> mark#(X1) -> mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(U31(X1,X2)) -> mark#(X1) -> mark#(isNat(X)) -> a__isNat#(X) mark#(U31(X1,X2)) -> mark#(X1) -> mark#(U13(X)) -> mark#(X) mark#(U31(X1,X2)) -> mark#(X1) -> mark#(U13(X)) -> a__U13#(mark(X)) mark#(U31(X1,X2)) -> mark#(X1) -> mark#(U21(X1,X2)) -> mark#(X1) mark#(U31(X1,X2)) -> mark#(X1) -> mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2) mark#(U31(X1,X2)) -> mark#(X1) -> mark#(U22(X)) -> mark#(X) mark#(U31(X1,X2)) -> mark#(X1) -> mark#(U22(X)) -> a__U22#(mark(X)) mark#(U31(X1,X2)) -> mark#(X1) -> mark#(U31(X1,X2)) -> mark#(X1) mark#(U31(X1,X2)) -> mark#(X1) -> mark#(U31(X1,X2)) -> a__U31#(mark(X1),X2) mark#(U31(X1,X2)) -> mark#(X1) -> mark#(U41(X1,X2,X3)) -> mark#(X1) mark#(U31(X1,X2)) -> mark#(X1) -> mark#(U41(X1,X2,X3)) -> a__U41#(mark(X1),X2,X3) mark#(U31(X1,X2)) -> mark#(X1) -> mark#(plus(X1,X2)) -> mark#(X2) mark#(U31(X1,X2)) -> mark#(X1) -> mark#(plus(X1,X2)) -> mark#(X1) mark#(U31(X1,X2)) -> mark#(X1) -> mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) mark#(U31(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> mark#(X1) mark#(U31(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(U31(X1,X2)) -> mark#(X1) -> mark#(isNatKind(X)) -> a__isNatKind#(X) mark#(U31(X1,X2)) -> mark#(X1) -> mark#(s(X)) -> mark#(X) mark#(U31(X1,X2)) -> a__U31#(mark(X1),X2) -> a__U31#(tt(),N) -> mark#(N) mark#(U22(X)) -> mark#(X) -> mark#(U11(X1,X2,X3)) -> mark#(X1) mark#(U22(X)) -> mark#(X) -> mark#(U11(X1,X2,X3)) -> a__U11#(mark(X1),X2,X3) mark#(U22(X)) -> mark#(X) -> mark#(U12(X1,X2)) -> mark#(X1) mark#(U22(X)) -> mark#(X) -> mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(U22(X)) -> mark#(X) -> mark#(isNat(X)) -> a__isNat#(X) mark#(U22(X)) -> mark#(X) -> mark#(U13(X)) -> mark#(X) mark#(U22(X)) -> mark#(X) -> mark#(U13(X)) -> a__U13#(mark(X)) mark#(U22(X)) -> mark#(X) -> mark#(U21(X1,X2)) -> mark#(X1) mark#(U22(X)) -> mark#(X) -> mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2) mark#(U22(X)) -> mark#(X) -> mark#(U22(X)) -> mark#(X) mark#(U22(X)) -> mark#(X) -> mark#(U22(X)) -> a__U22#(mark(X)) mark#(U22(X)) -> mark#(X) -> mark#(U31(X1,X2)) -> mark#(X1) mark#(U22(X)) -> mark#(X) -> mark#(U31(X1,X2)) -> a__U31#(mark(X1),X2) mark#(U22(X)) -> mark#(X) -> mark#(U41(X1,X2,X3)) -> mark#(X1) mark#(U22(X)) -> mark#(X) -> mark#(U41(X1,X2,X3)) -> a__U41#(mark(X1),X2,X3) mark#(U22(X)) -> mark#(X) -> mark#(plus(X1,X2)) -> mark#(X2) mark#(U22(X)) -> mark#(X) -> mark#(plus(X1,X2)) -> mark#(X1) mark#(U22(X)) -> mark#(X) -> mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) mark#(U22(X)) -> mark#(X) -> mark#(and(X1,X2)) -> mark#(X1) mark#(U22(X)) -> mark#(X) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(U22(X)) -> mark#(X) -> mark#(isNatKind(X)) -> a__isNatKind#(X) mark#(U22(X)) -> mark#(X) -> mark#(s(X)) -> mark#(X) mark#(U21(X1,X2)) -> mark#(X1) -> mark#(U11(X1,X2,X3)) -> mark#(X1) mark#(U21(X1,X2)) -> mark#(X1) -> mark#(U11(X1,X2,X3)) -> a__U11#(mark(X1),X2,X3) mark#(U21(X1,X2)) -> mark#(X1) -> mark#(U12(X1,X2)) -> mark#(X1) mark#(U21(X1,X2)) -> mark#(X1) -> mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(U21(X1,X2)) -> mark#(X1) -> mark#(isNat(X)) -> a__isNat#(X) mark#(U21(X1,X2)) -> mark#(X1) -> mark#(U13(X)) -> mark#(X) mark#(U21(X1,X2)) -> mark#(X1) -> mark#(U13(X)) -> a__U13#(mark(X)) mark#(U21(X1,X2)) -> mark#(X1) -> mark#(U21(X1,X2)) -> mark#(X1) mark#(U21(X1,X2)) -> mark#(X1) -> mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2) mark#(U21(X1,X2)) -> mark#(X1) -> mark#(U22(X)) -> mark#(X) mark#(U21(X1,X2)) -> mark#(X1) -> mark#(U22(X)) -> a__U22#(mark(X)) mark#(U21(X1,X2)) -> mark#(X1) -> mark#(U31(X1,X2)) -> mark#(X1) mark#(U21(X1,X2)) -> mark#(X1) -> mark#(U31(X1,X2)) -> a__U31#(mark(X1),X2) mark#(U21(X1,X2)) -> mark#(X1) -> mark#(U41(X1,X2,X3)) -> mark#(X1) mark#(U21(X1,X2)) -> mark#(X1) -> mark#(U41(X1,X2,X3)) -> a__U41#(mark(X1),X2,X3) mark#(U21(X1,X2)) -> mark#(X1) -> mark#(plus(X1,X2)) -> mark#(X2) mark#(U21(X1,X2)) -> mark#(X1) -> mark#(plus(X1,X2)) -> mark#(X1) mark#(U21(X1,X2)) -> mark#(X1) -> mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) mark#(U21(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> mark#(X1) mark#(U21(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(U21(X1,X2)) -> mark#(X1) -> mark#(isNatKind(X)) -> a__isNatKind#(X) mark#(U21(X1,X2)) -> mark#(X1) -> mark#(s(X)) -> mark#(X) mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2) -> a__U21#(tt(),V1) -> a__isNat#(V1) mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2) -> a__U21#(tt(),V1) -> a__U22#(a__isNat(V1)) mark#(U13(X)) -> mark#(X) -> mark#(U11(X1,X2,X3)) -> mark#(X1) mark#(U13(X)) -> mark#(X) -> mark#(U11(X1,X2,X3)) -> a__U11#(mark(X1),X2,X3) mark#(U13(X)) -> mark#(X) -> mark#(U12(X1,X2)) -> mark#(X1) mark#(U13(X)) -> mark#(X) -> mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(U13(X)) -> mark#(X) -> mark#(isNat(X)) -> a__isNat#(X) mark#(U13(X)) -> mark#(X) -> mark#(U13(X)) -> mark#(X) mark#(U13(X)) -> mark#(X) -> mark#(U13(X)) -> a__U13#(mark(X)) mark#(U13(X)) -> mark#(X) -> mark#(U21(X1,X2)) -> mark#(X1) mark#(U13(X)) -> mark#(X) -> mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2) mark#(U13(X)) -> mark#(X) -> mark#(U22(X)) -> mark#(X) mark#(U13(X)) -> mark#(X) -> mark#(U22(X)) -> a__U22#(mark(X)) mark#(U13(X)) -> mark#(X) -> mark#(U31(X1,X2)) -> mark#(X1) mark#(U13(X)) -> mark#(X) -> mark#(U31(X1,X2)) -> a__U31#(mark(X1),X2) mark#(U13(X)) -> mark#(X) -> mark#(U41(X1,X2,X3)) -> mark#(X1) mark#(U13(X)) -> mark#(X) -> mark#(U41(X1,X2,X3)) -> a__U41#(mark(X1),X2,X3) mark#(U13(X)) -> mark#(X) -> mark#(plus(X1,X2)) -> mark#(X2) mark#(U13(X)) -> mark#(X) -> mark#(plus(X1,X2)) -> mark#(X1) mark#(U13(X)) -> mark#(X) -> mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) mark#(U13(X)) -> mark#(X) -> mark#(and(X1,X2)) -> mark#(X1) mark#(U13(X)) -> mark#(X) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(U13(X)) -> mark#(X) -> mark#(isNatKind(X)) -> a__isNatKind#(X) mark#(U13(X)) -> mark#(X) -> mark#(s(X)) -> mark#(X) mark#(U12(X1,X2)) -> mark#(X1) -> mark#(U11(X1,X2,X3)) -> mark#(X1) mark#(U12(X1,X2)) -> mark#(X1) -> mark#(U11(X1,X2,X3)) -> a__U11#(mark(X1),X2,X3) mark#(U12(X1,X2)) -> mark#(X1) -> mark#(U12(X1,X2)) -> mark#(X1) mark#(U12(X1,X2)) -> mark#(X1) -> mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(U12(X1,X2)) -> mark#(X1) -> mark#(isNat(X)) -> a__isNat#(X) mark#(U12(X1,X2)) -> mark#(X1) -> mark#(U13(X)) -> mark#(X) mark#(U12(X1,X2)) -> mark#(X1) -> mark#(U13(X)) -> a__U13#(mark(X)) mark#(U12(X1,X2)) -> mark#(X1) -> mark#(U21(X1,X2)) -> mark#(X1) mark#(U12(X1,X2)) -> mark#(X1) -> mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2) mark#(U12(X1,X2)) -> mark#(X1) -> mark#(U22(X)) -> mark#(X) mark#(U12(X1,X2)) -> mark#(X1) -> mark#(U22(X)) -> a__U22#(mark(X)) mark#(U12(X1,X2)) -> mark#(X1) -> mark#(U31(X1,X2)) -> mark#(X1) mark#(U12(X1,X2)) -> mark#(X1) -> mark#(U31(X1,X2)) -> a__U31#(mark(X1),X2) mark#(U12(X1,X2)) -> mark#(X1) -> mark#(U41(X1,X2,X3)) -> mark#(X1) mark#(U12(X1,X2)) -> mark#(X1) -> mark#(U41(X1,X2,X3)) -> a__U41#(mark(X1),X2,X3) mark#(U12(X1,X2)) -> mark#(X1) -> mark#(plus(X1,X2)) -> mark#(X2) mark#(U12(X1,X2)) -> mark#(X1) -> mark#(plus(X1,X2)) -> mark#(X1) mark#(U12(X1,X2)) -> mark#(X1) -> mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) mark#(U12(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> mark#(X1) mark#(U12(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(U12(X1,X2)) -> mark#(X1) -> mark#(isNatKind(X)) -> a__isNatKind#(X) mark#(U12(X1,X2)) -> mark#(X1) -> mark#(s(X)) -> mark#(X) mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) -> a__U12#(tt(),V2) -> a__isNat#(V2) mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) -> a__U12#(tt(),V2) -> a__U13#(a__isNat(V2)) mark#(U11(X1,X2,X3)) -> mark#(X1) -> mark#(U11(X1,X2,X3)) -> mark#(X1) mark#(U11(X1,X2,X3)) -> mark#(X1) -> mark#(U11(X1,X2,X3)) -> a__U11#(mark(X1),X2,X3) mark#(U11(X1,X2,X3)) -> mark#(X1) -> mark#(U12(X1,X2)) -> mark#(X1) mark#(U11(X1,X2,X3)) -> mark#(X1) -> mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(U11(X1,X2,X3)) -> mark#(X1) -> mark#(isNat(X)) -> a__isNat#(X) mark#(U11(X1,X2,X3)) -> mark#(X1) -> mark#(U13(X)) -> mark#(X) mark#(U11(X1,X2,X3)) -> mark#(X1) -> mark#(U13(X)) -> a__U13#(mark(X)) mark#(U11(X1,X2,X3)) -> mark#(X1) -> mark#(U21(X1,X2)) -> mark#(X1) mark#(U11(X1,X2,X3)) -> mark#(X1) -> mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2) mark#(U11(X1,X2,X3)) -> mark#(X1) -> mark#(U22(X)) -> mark#(X) mark#(U11(X1,X2,X3)) -> mark#(X1) -> mark#(U22(X)) -> a__U22#(mark(X)) mark#(U11(X1,X2,X3)) -> mark#(X1) -> mark#(U31(X1,X2)) -> mark#(X1) mark#(U11(X1,X2,X3)) -> mark#(X1) -> mark#(U31(X1,X2)) -> a__U31#(mark(X1),X2) mark#(U11(X1,X2,X3)) -> mark#(X1) -> mark#(U41(X1,X2,X3)) -> mark#(X1) mark#(U11(X1,X2,X3)) -> mark#(X1) -> mark#(U41(X1,X2,X3)) -> a__U41#(mark(X1),X2,X3) mark#(U11(X1,X2,X3)) -> mark#(X1) -> mark#(plus(X1,X2)) -> mark#(X2) mark#(U11(X1,X2,X3)) -> mark#(X1) -> mark#(plus(X1,X2)) -> mark#(X1) mark#(U11(X1,X2,X3)) -> mark#(X1) -> mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) mark#(U11(X1,X2,X3)) -> mark#(X1) -> mark#(and(X1,X2)) -> mark#(X1) mark#(U11(X1,X2,X3)) -> mark#(X1) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(U11(X1,X2,X3)) -> mark#(X1) -> mark#(isNatKind(X)) -> a__isNatKind#(X) mark#(U11(X1,X2,X3)) -> mark#(X1) -> mark#(s(X)) -> mark#(X) mark#(U11(X1,X2,X3)) -> a__U11#(mark(X1),X2,X3) -> a__U11#(tt(),V1,V2) -> a__isNat#(V1) mark#(U11(X1,X2,X3)) -> a__U11#(mark(X1),X2,X3) -> a__U11#(tt(),V1,V2) -> a__U12#(a__isNat(V1),V2) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) -> a__and#(tt(),X) -> mark#(X) mark#(and(X1,X2)) -> mark#(X1) -> mark#(U11(X1,X2,X3)) -> mark#(X1) mark#(and(X1,X2)) -> mark#(X1) -> mark#(U11(X1,X2,X3)) -> a__U11#(mark(X1),X2,X3) mark#(and(X1,X2)) -> mark#(X1) -> mark#(U12(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> mark#(X1) -> mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) -> mark#(isNat(X)) -> a__isNat#(X) mark#(and(X1,X2)) -> mark#(X1) -> mark#(U13(X)) -> mark#(X) mark#(and(X1,X2)) -> mark#(X1) -> mark#(U13(X)) -> a__U13#(mark(X)) mark#(and(X1,X2)) -> mark#(X1) -> mark#(U21(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> mark#(X1) -> mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) -> mark#(U22(X)) -> mark#(X) mark#(and(X1,X2)) -> mark#(X1) -> mark#(U22(X)) -> a__U22#(mark(X)) mark#(and(X1,X2)) -> mark#(X1) -> mark#(U31(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> mark#(X1) -> mark#(U31(X1,X2)) -> a__U31#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) -> mark#(U41(X1,X2,X3)) -> mark#(X1) mark#(and(X1,X2)) -> mark#(X1) -> mark#(U41(X1,X2,X3)) -> a__U41#(mark(X1),X2,X3) mark#(and(X1,X2)) -> mark#(X1) -> mark#(plus(X1,X2)) -> mark#(X2) mark#(and(X1,X2)) -> mark#(X1) -> mark#(plus(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> mark#(X1) -> mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) mark#(and(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) -> mark#(isNatKind(X)) -> a__isNatKind#(X) mark#(and(X1,X2)) -> mark#(X1) -> mark#(s(X)) -> mark#(X) mark#(isNat(X)) -> a__isNat#(X) -> a__isNat#(plus(V1,V2)) -> a__isNatKind#(V1) mark#(isNat(X)) -> a__isNat#(X) -> a__isNat#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) mark#(isNat(X)) -> a__isNat#(X) -> a__isNat#(plus(V1,V2)) -> a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) mark#(isNat(X)) -> a__isNat#(X) -> a__isNat#(s(V1)) -> a__isNatKind#(V1) mark#(isNat(X)) -> a__isNat#(X) -> a__isNat#(s(V1)) -> a__U21#(a__isNatKind(V1),V1) mark#(isNatKind(X)) -> a__isNatKind#(X) -> a__isNatKind#(plus(V1,V2)) -> a__isNatKind#(V1) mark#(isNatKind(X)) -> a__isNatKind#(X) -> a__isNatKind#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) mark#(isNatKind(X)) -> a__isNatKind#(X) -> a__isNatKind#(s(V1)) -> a__isNatKind#(V1) mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) -> a__plus#(N,0()) -> a__isNat#(N) mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) -> a__plus#(N,0()) -> a__and#(a__isNat(N),isNatKind(N)) mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) -> a__plus#(N,0()) -> a__U31#(a__and(a__isNat(N),isNatKind(N)),N) mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) -> a__plus#(N,s(M)) -> a__isNat#(M) mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) -> a__plus#(N,s(M)) -> a__and#(a__isNat(M),isNatKind(M)) mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) -> a__plus#(N,s(M)) -> a__and#(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))) mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) -> a__plus#(N,s(M)) -> a__U41#(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(U11(X1,X2,X3)) -> mark#(X1) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(U11(X1,X2,X3)) -> a__U11#(mark(X1),X2,X3) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(U12(X1,X2)) -> mark#(X1) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(isNat(X)) -> a__isNat#(X) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(U13(X)) -> mark#(X) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(U13(X)) -> a__U13#(mark(X)) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(U21(X1,X2)) -> mark#(X1) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(U22(X)) -> mark#(X) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(U22(X)) -> a__U22#(mark(X)) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(U31(X1,X2)) -> mark#(X1) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(U31(X1,X2)) -> a__U31#(mark(X1),X2) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(U41(X1,X2,X3)) -> mark#(X1) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(U41(X1,X2,X3)) -> a__U41#(mark(X1),X2,X3) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(plus(X1,X2)) -> mark#(X2) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(plus(X1,X2)) -> mark#(X1) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(and(X1,X2)) -> mark#(X1) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(isNatKind(X)) -> a__isNatKind#(X) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(s(X)) -> mark#(X) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(U11(X1,X2,X3)) -> mark#(X1) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(U11(X1,X2,X3)) -> a__U11#(mark(X1),X2,X3) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(U12(X1,X2)) -> mark#(X1) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(isNat(X)) -> a__isNat#(X) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(U13(X)) -> mark#(X) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(U13(X)) -> a__U13#(mark(X)) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(U21(X1,X2)) -> mark#(X1) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(U22(X)) -> mark#(X) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(U22(X)) -> a__U22#(mark(X)) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(U31(X1,X2)) -> mark#(X1) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(U31(X1,X2)) -> a__U31#(mark(X1),X2) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(U41(X1,X2,X3)) -> mark#(X1) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(U41(X1,X2,X3)) -> a__U41#(mark(X1),X2,X3) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(plus(X1,X2)) -> mark#(X2) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(plus(X1,X2)) -> mark#(X1) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> mark#(X1) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(isNatKind(X)) -> a__isNatKind#(X) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(s(X)) -> mark#(X) mark#(s(X)) -> mark#(X) -> mark#(U11(X1,X2,X3)) -> mark#(X1) mark#(s(X)) -> mark#(X) -> mark#(U11(X1,X2,X3)) -> a__U11#(mark(X1),X2,X3) mark#(s(X)) -> mark#(X) -> mark#(U12(X1,X2)) -> mark#(X1) mark#(s(X)) -> mark#(X) -> mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(s(X)) -> mark#(X) -> mark#(isNat(X)) -> a__isNat#(X) mark#(s(X)) -> mark#(X) -> mark#(U13(X)) -> mark#(X) mark#(s(X)) -> mark#(X) -> mark#(U13(X)) -> a__U13#(mark(X)) mark#(s(X)) -> mark#(X) -> mark#(U21(X1,X2)) -> mark#(X1) mark#(s(X)) -> mark#(X) -> mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2) mark#(s(X)) -> mark#(X) -> mark#(U22(X)) -> mark#(X) mark#(s(X)) -> mark#(X) -> mark#(U22(X)) -> a__U22#(mark(X)) mark#(s(X)) -> mark#(X) -> mark#(U31(X1,X2)) -> mark#(X1) mark#(s(X)) -> mark#(X) -> mark#(U31(X1,X2)) -> a__U31#(mark(X1),X2) mark#(s(X)) -> mark#(X) -> mark#(U41(X1,X2,X3)) -> mark#(X1) mark#(s(X)) -> mark#(X) -> mark#(U41(X1,X2,X3)) -> a__U41#(mark(X1),X2,X3) mark#(s(X)) -> mark#(X) -> mark#(plus(X1,X2)) -> mark#(X2) mark#(s(X)) -> mark#(X) -> mark#(plus(X1,X2)) -> mark#(X1) mark#(s(X)) -> mark#(X) -> mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) mark#(s(X)) -> mark#(X) -> mark#(and(X1,X2)) -> mark#(X1) mark#(s(X)) -> mark#(X) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(s(X)) -> mark#(X) -> mark#(isNatKind(X)) -> a__isNatKind#(X) mark#(s(X)) -> mark#(X) -> mark#(s(X)) -> mark#(X) a__U31#(tt(),N) -> mark#(N) -> mark#(U11(X1,X2,X3)) -> mark#(X1) a__U31#(tt(),N) -> mark#(N) -> mark#(U11(X1,X2,X3)) -> a__U11#(mark(X1),X2,X3) a__U31#(tt(),N) -> mark#(N) -> mark#(U12(X1,X2)) -> mark#(X1) a__U31#(tt(),N) -> mark#(N) -> mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) a__U31#(tt(),N) -> mark#(N) -> mark#(isNat(X)) -> a__isNat#(X) a__U31#(tt(),N) -> mark#(N) -> mark#(U13(X)) -> mark#(X) a__U31#(tt(),N) -> mark#(N) -> mark#(U13(X)) -> a__U13#(mark(X)) a__U31#(tt(),N) -> mark#(N) -> mark#(U21(X1,X2)) -> mark#(X1) a__U31#(tt(),N) -> mark#(N) -> mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2) a__U31#(tt(),N) -> mark#(N) -> mark#(U22(X)) -> mark#(X) a__U31#(tt(),N) -> mark#(N) -> mark#(U22(X)) -> a__U22#(mark(X)) a__U31#(tt(),N) -> mark#(N) -> mark#(U31(X1,X2)) -> mark#(X1) a__U31#(tt(),N) -> mark#(N) -> mark#(U31(X1,X2)) -> a__U31#(mark(X1),X2) a__U31#(tt(),N) -> mark#(N) -> mark#(U41(X1,X2,X3)) -> mark#(X1) a__U31#(tt(),N) -> mark#(N) -> mark#(U41(X1,X2,X3)) -> a__U41#(mark(X1),X2,X3) a__U31#(tt(),N) -> mark#(N) -> mark#(plus(X1,X2)) -> mark#(X2) a__U31#(tt(),N) -> mark#(N) -> mark#(plus(X1,X2)) -> mark#(X1) a__U31#(tt(),N) -> mark#(N) -> mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) a__U31#(tt(),N) -> mark#(N) -> mark#(and(X1,X2)) -> mark#(X1) a__U31#(tt(),N) -> mark#(N) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) a__U31#(tt(),N) -> mark#(N) -> mark#(isNatKind(X)) -> a__isNatKind#(X) a__U31#(tt(),N) -> mark#(N) -> mark#(s(X)) -> mark#(X) a__U21#(tt(),V1) -> a__isNat#(V1) -> a__isNat#(plus(V1,V2)) -> a__isNatKind#(V1) a__U21#(tt(),V1) -> a__isNat#(V1) -> a__isNat#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__U21#(tt(),V1) -> a__isNat#(V1) -> a__isNat#(plus(V1,V2)) -> a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U21#(tt(),V1) -> a__isNat#(V1) -> a__isNat#(s(V1)) -> a__isNatKind#(V1) a__U21#(tt(),V1) -> a__isNat#(V1) -> a__isNat#(s(V1)) -> a__U21#(a__isNatKind(V1),V1) a__U12#(tt(),V2) -> a__isNat#(V2) -> a__isNat#(plus(V1,V2)) -> a__isNatKind#(V1) a__U12#(tt(),V2) -> a__isNat#(V2) -> a__isNat#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__U12#(tt(),V2) -> a__isNat#(V2) -> a__isNat#(plus(V1,V2)) -> a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U12#(tt(),V2) -> a__isNat#(V2) -> a__isNat#(s(V1)) -> a__isNatKind#(V1) a__U12#(tt(),V2) -> a__isNat#(V2) -> a__isNat#(s(V1)) -> a__U21#(a__isNatKind(V1),V1) a__isNat#(plus(V1,V2)) -> a__isNatKind#(V1) -> a__isNatKind#(plus(V1,V2)) -> a__isNatKind#(V1) a__isNat#(plus(V1,V2)) -> a__isNatKind#(V1) -> a__isNatKind#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) -> a__isNatKind#(V1) -> a__isNatKind#(s(V1)) -> a__isNatKind#(V1) a__isNat#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) -> a__and#(tt(),X) -> mark#(X) a__isNat#(plus(V1,V2)) -> a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) -> a__U11#(tt(),V1,V2) -> a__isNat#(V1) a__isNat#(plus(V1,V2)) -> a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) -> a__U11#(tt(),V1,V2) -> a__U12#(a__isNat(V1),V2) a__isNat#(s(V1)) -> a__isNatKind#(V1) -> a__isNatKind#(plus(V1,V2)) -> a__isNatKind#(V1) a__isNat#(s(V1)) -> a__isNatKind#(V1) -> a__isNatKind#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(s(V1)) -> a__isNatKind#(V1) -> a__isNatKind#(s(V1)) -> a__isNatKind#(V1) a__isNat#(s(V1)) -> a__U21#(a__isNatKind(V1),V1) -> a__U21#(tt(),V1) -> a__isNat#(V1) a__isNat#(s(V1)) -> a__U21#(a__isNatKind(V1),V1) -> a__U21#(tt(),V1) -> a__U22#(a__isNat(V1)) a__U11#(tt(),V1,V2) -> a__U12#(a__isNat(V1),V2) -> a__U12#(tt(),V2) -> a__isNat#(V2) a__U11#(tt(),V1,V2) -> a__U12#(a__isNat(V1),V2) -> a__U12#(tt(),V2) -> a__U13#(a__isNat(V2)) a__U11#(tt(),V1,V2) -> a__isNat#(V1) -> a__isNat#(plus(V1,V2)) -> a__isNatKind#(V1) a__U11#(tt(),V1,V2) -> a__isNat#(V1) -> a__isNat#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__U11#(tt(),V1,V2) -> a__isNat#(V1) -> a__isNat#(plus(V1,V2)) -> a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) -> a__isNat#(V1) -> a__isNat#(s(V1)) -> a__isNatKind#(V1) a__U11#(tt(),V1,V2) -> a__isNat#(V1) -> a__isNat#(s(V1)) -> a__U21#(a__isNatKind(V1),V1) SCC Processor: #sccs: 1 #rules: 44 #arcs: 415/2304 DPs: a__isNatKind#(plus(V1,V2)) -> a__isNatKind#(V1) a__isNatKind#(s(V1)) -> a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__and#(tt(),X) -> mark#(X) mark#(s(X)) -> mark#(X) mark#(isNatKind(X)) -> a__isNatKind#(X) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) a__plus#(N,s(M)) -> a__U41#(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) a__U41#(tt(),M,N) -> a__plus#(mark(N),mark(M)) a__plus#(N,s(M)) -> a__and#(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))) a__plus#(N,s(M)) -> a__and#(a__isNat(M),isNatKind(M)) a__plus#(N,s(M)) -> a__isNat#(M) a__isNat#(s(V1)) -> a__U21#(a__isNatKind(V1),V1) a__U21#(tt(),V1) -> a__isNat#(V1) a__isNat#(s(V1)) -> a__isNatKind#(V1) a__isNat#(plus(V1,V2)) -> a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) -> a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) -> a__isNat#(V2) a__isNat#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) -> a__isNatKind#(V1) a__U11#(tt(),V1,V2) -> a__isNat#(V1) a__plus#(N,0()) -> a__U31#(a__and(a__isNat(N),isNatKind(N)),N) a__U31#(tt(),N) -> mark#(N) mark#(plus(X1,X2)) -> mark#(X1) mark#(plus(X1,X2)) -> mark#(X2) mark#(U41(X1,X2,X3)) -> a__U41#(mark(X1),X2,X3) a__U41#(tt(),M,N) -> mark#(N) mark#(U41(X1,X2,X3)) -> mark#(X1) mark#(U31(X1,X2)) -> a__U31#(mark(X1),X2) mark#(U31(X1,X2)) -> mark#(X1) mark#(U22(X)) -> mark#(X) mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2) mark#(U21(X1,X2)) -> mark#(X1) mark#(U13(X)) -> mark#(X) mark#(isNat(X)) -> a__isNat#(X) mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(U12(X1,X2)) -> mark#(X1) mark#(U11(X1,X2,X3)) -> a__U11#(mark(X1),X2,X3) mark#(U11(X1,X2,X3)) -> mark#(X1) a__U41#(tt(),M,N) -> mark#(M) a__plus#(N,0()) -> a__and#(a__isNat(N),isNatKind(N)) a__plus#(N,0()) -> a__isNat#(N) TRS: a__U11(tt(),V1,V2) -> a__U12(a__isNat(V1),V2) a__U12(tt(),V2) -> a__U13(a__isNat(V2)) a__U13(tt()) -> tt() a__U21(tt(),V1) -> a__U22(a__isNat(V1)) a__U22(tt()) -> tt() a__U31(tt(),N) -> mark(N) a__U41(tt(),M,N) -> s(a__plus(mark(N),mark(M))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(plus(V1,V2)) -> a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) -> a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) -> tt() a__isNatKind(plus(V1,V2)) -> a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) -> a__isNatKind(V1) a__plus(N,0()) -> a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) -> a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(U13(X)) -> a__U13(mark(X)) mark(U21(X1,X2)) -> a__U21(mark(X1),X2) mark(U22(X)) -> a__U22(mark(X)) mark(U31(X1,X2)) -> a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) -> a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNatKind(X)) -> a__isNatKind(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2,X3) -> U11(X1,X2,X3) a__U12(X1,X2) -> U12(X1,X2) a__isNat(X) -> isNat(X) a__U13(X) -> U13(X) a__U21(X1,X2) -> U21(X1,X2) a__U22(X) -> U22(X) a__U31(X1,X2) -> U31(X1,X2) a__U41(X1,X2,X3) -> U41(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNatKind(X) -> isNatKind(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatKind#](x0) = 0, [a__and#](x0, x1) = x1, [a__plus#](x0, x1) = x0 + x1, [a__U41#](x0, x1, x2) = x1 + x2, [mark#](x0) = x0, [a__U31#](x0, x1) = x1, [a__U21#](x0, x1) = 0, [a__U12#](x0, x1) = 0, [a__isNat#](x0) = 0, [a__U11#](x0, x1, x2) = 0, [U41](x0, x1, x2) = x0 + x1 + x2 + 1, [U31](x0, x1) = x0 + x1, [U22](x0) = x0, [U21](x0, x1) = x0, [U13](x0) = x0, [U12](x0, x1) = x0, [U11](x0, x1, x2) = x0, [and](x0, x1) = x0 + x1, [isNat](x0) = 0, [isNatKind](x0) = 0, [a__isNatKind](x0) = 0, [plus](x0, x1) = x0 + x1 + 1, [0] = 0, [a__and](x0, x1) = x0 + x1, [s](x0) = x0, [a__plus](x0, x1) = x0 + x1 + 1, [a__U41](x0, x1, x2) = x0 + x1 + x2 + 1, [mark](x0) = x0, [a__U31](x0, x1) = x0 + x1, [a__U22](x0) = x0, [a__U21](x0, x1) = x0, [a__U13](x0) = x0, [a__U12](x0, x1) = x0, [a__isNat](x0) = 0, [a__U11](x0, x1, x2) = x0, [tt] = 0 orientation: a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__isNatKind#(V1) a__isNatKind#(s(V1)) = 0 >= 0 = a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__and#(tt(),X) = X >= X = mark#(X) mark#(s(X)) = X >= X = mark#(X) mark#(isNatKind(X)) = 0 >= 0 = a__isNatKind#(X) mark#(and(X1,X2)) = X1 + X2 >= X2 = a__and#(mark(X1),X2) mark#(and(X1,X2)) = X1 + X2 >= X1 = mark#(X1) mark#(plus(X1,X2)) = X1 + X2 + 1 >= X1 + X2 = a__plus#(mark(X1),mark(X2)) a__plus#(N,s(M)) = M + N >= M + N = a__U41#(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))), M,N) a__U41#(tt(),M,N) = M + N >= M + N = a__plus#(mark(N),mark(M)) a__plus#(N,s(M)) = M + N >= 0 = a__and#(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))) a__plus#(N,s(M)) = M + N >= 0 = a__and#(a__isNat(M),isNatKind(M)) a__plus#(N,s(M)) = M + N >= 0 = a__isNat#(M) a__isNat#(s(V1)) = 0 >= 0 = a__U21#(a__isNatKind(V1),V1) a__U21#(tt(),V1) = 0 >= 0 = a__isNat#(V1) a__isNat#(s(V1)) = 0 >= 0 = a__isNatKind#(V1) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) = 0 >= 0 = a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) = 0 >= 0 = a__isNat#(V2) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__isNatKind#(V1) a__U11#(tt(),V1,V2) = 0 >= 0 = a__isNat#(V1) a__plus#(N,0()) = N >= N = a__U31#(a__and(a__isNat(N),isNatKind(N)),N) a__U31#(tt(),N) = N >= N = mark#(N) mark#(plus(X1,X2)) = X1 + X2 + 1 >= X1 = mark#(X1) mark#(plus(X1,X2)) = X1 + X2 + 1 >= X2 = mark#(X2) mark#(U41(X1,X2,X3)) = X1 + X2 + X3 + 1 >= X2 + X3 = a__U41#(mark(X1),X2,X3) a__U41#(tt(),M,N) = M + N >= N = mark#(N) mark#(U41(X1,X2,X3)) = X1 + X2 + X3 + 1 >= X1 = mark#(X1) mark#(U31(X1,X2)) = X1 + X2 >= X2 = a__U31#(mark(X1),X2) mark#(U31(X1,X2)) = X1 + X2 >= X1 = mark#(X1) mark#(U22(X)) = X >= X = mark#(X) mark#(U21(X1,X2)) = X1 >= 0 = a__U21#(mark(X1),X2) mark#(U21(X1,X2)) = X1 >= X1 = mark#(X1) mark#(U13(X)) = X >= X = mark#(X) mark#(isNat(X)) = 0 >= 0 = a__isNat#(X) mark#(U12(X1,X2)) = X1 >= 0 = a__U12#(mark(X1),X2) mark#(U12(X1,X2)) = X1 >= X1 = mark#(X1) mark#(U11(X1,X2,X3)) = X1 >= 0 = a__U11#(mark(X1),X2,X3) mark#(U11(X1,X2,X3)) = X1 >= X1 = mark#(X1) a__U41#(tt(),M,N) = M + N >= M = mark#(M) a__plus#(N,0()) = N >= 0 = a__and#(a__isNat(N),isNatKind(N)) a__plus#(N,0()) = N >= 0 = a__isNat#(N) a__U11(tt(),V1,V2) = 0 >= 0 = a__U12(a__isNat(V1),V2) a__U12(tt(),V2) = 0 >= 0 = a__U13(a__isNat(V2)) a__U13(tt()) = 0 >= 0 = tt() a__U21(tt(),V1) = 0 >= 0 = a__U22(a__isNat(V1)) a__U22(tt()) = 0 >= 0 = tt() a__U31(tt(),N) = N >= N = mark(N) a__U41(tt(),M,N) = M + N + 1 >= M + N + 1 = s(a__plus(mark(N),mark(M))) a__and(tt(),X) = X >= X = mark(X) a__isNat(0()) = 0 >= 0 = tt() a__isNat(plus(V1,V2)) = 0 >= 0 = a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) = 0 >= 0 = a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) = 0 >= 0 = tt() a__isNatKind(plus(V1,V2)) = 0 >= 0 = a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) = 0 >= 0 = a__isNatKind(V1) a__plus(N,0()) = N + 1 >= N = a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) = M + N + 1 >= M + N + 1 = a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))), M,N) mark(U11(X1,X2,X3)) = X1 >= X1 = a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) = X1 >= X1 = a__U12(mark(X1),X2) mark(isNat(X)) = 0 >= 0 = a__isNat(X) mark(U13(X)) = X >= X = a__U13(mark(X)) mark(U21(X1,X2)) = X1 >= X1 = a__U21(mark(X1),X2) mark(U22(X)) = X >= X = a__U22(mark(X)) mark(U31(X1,X2)) = X1 + X2 >= X1 + X2 = a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) = X1 + X2 + X3 + 1 >= X1 + X2 + X3 + 1 = a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) = X1 + X2 + 1 >= X1 + X2 + 1 = a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) = X1 + X2 >= X1 + X2 = a__and(mark(X1),X2) mark(isNatKind(X)) = 0 >= 0 = a__isNatKind(X) mark(tt()) = 0 >= 0 = tt() mark(s(X)) = X >= X = s(mark(X)) mark(0()) = 0 >= 0 = 0() a__U11(X1,X2,X3) = X1 >= X1 = U11(X1,X2,X3) a__U12(X1,X2) = X1 >= X1 = U12(X1,X2) a__isNat(X) = 0 >= 0 = isNat(X) a__U13(X) = X >= X = U13(X) a__U21(X1,X2) = X1 >= X1 = U21(X1,X2) a__U22(X) = X >= X = U22(X) a__U31(X1,X2) = X1 + X2 >= X1 + X2 = U31(X1,X2) a__U41(X1,X2,X3) = X1 + X2 + X3 + 1 >= X1 + X2 + X3 + 1 = U41(X1,X2,X3) a__plus(X1,X2) = X1 + X2 + 1 >= X1 + X2 + 1 = plus(X1,X2) a__and(X1,X2) = X1 + X2 >= X1 + X2 = and(X1,X2) a__isNatKind(X) = 0 >= 0 = isNatKind(X) problem: DPs: a__isNatKind#(plus(V1,V2)) -> a__isNatKind#(V1) a__isNatKind#(s(V1)) -> a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__and#(tt(),X) -> mark#(X) mark#(s(X)) -> mark#(X) mark#(isNatKind(X)) -> a__isNatKind#(X) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) a__plus#(N,s(M)) -> a__U41#(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) a__U41#(tt(),M,N) -> a__plus#(mark(N),mark(M)) a__plus#(N,s(M)) -> a__and#(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))) a__plus#(N,s(M)) -> a__and#(a__isNat(M),isNatKind(M)) a__plus#(N,s(M)) -> a__isNat#(M) a__isNat#(s(V1)) -> a__U21#(a__isNatKind(V1),V1) a__U21#(tt(),V1) -> a__isNat#(V1) a__isNat#(s(V1)) -> a__isNatKind#(V1) a__isNat#(plus(V1,V2)) -> a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) -> a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) -> a__isNat#(V2) a__isNat#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) -> a__isNatKind#(V1) a__U11#(tt(),V1,V2) -> a__isNat#(V1) a__plus#(N,0()) -> a__U31#(a__and(a__isNat(N),isNatKind(N)),N) a__U31#(tt(),N) -> mark#(N) a__U41#(tt(),M,N) -> mark#(N) mark#(U31(X1,X2)) -> a__U31#(mark(X1),X2) mark#(U31(X1,X2)) -> mark#(X1) mark#(U22(X)) -> mark#(X) mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2) mark#(U21(X1,X2)) -> mark#(X1) mark#(U13(X)) -> mark#(X) mark#(isNat(X)) -> a__isNat#(X) mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(U12(X1,X2)) -> mark#(X1) mark#(U11(X1,X2,X3)) -> a__U11#(mark(X1),X2,X3) mark#(U11(X1,X2,X3)) -> mark#(X1) a__U41#(tt(),M,N) -> mark#(M) a__plus#(N,0()) -> a__and#(a__isNat(N),isNatKind(N)) a__plus#(N,0()) -> a__isNat#(N) TRS: a__U11(tt(),V1,V2) -> a__U12(a__isNat(V1),V2) a__U12(tt(),V2) -> a__U13(a__isNat(V2)) a__U13(tt()) -> tt() a__U21(tt(),V1) -> a__U22(a__isNat(V1)) a__U22(tt()) -> tt() a__U31(tt(),N) -> mark(N) a__U41(tt(),M,N) -> s(a__plus(mark(N),mark(M))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(plus(V1,V2)) -> a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) -> a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) -> tt() a__isNatKind(plus(V1,V2)) -> a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) -> a__isNatKind(V1) a__plus(N,0()) -> a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) -> a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(U13(X)) -> a__U13(mark(X)) mark(U21(X1,X2)) -> a__U21(mark(X1),X2) mark(U22(X)) -> a__U22(mark(X)) mark(U31(X1,X2)) -> a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) -> a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNatKind(X)) -> a__isNatKind(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2,X3) -> U11(X1,X2,X3) a__U12(X1,X2) -> U12(X1,X2) a__isNat(X) -> isNat(X) a__U13(X) -> U13(X) a__U21(X1,X2) -> U21(X1,X2) a__U22(X) -> U22(X) a__U31(X1,X2) -> U31(X1,X2) a__U41(X1,X2,X3) -> U41(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNatKind(X) -> isNatKind(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatKind#](x0) = 0, [a__and#](x0, x1) = 0, [a__plus#](x0, x1) = 1, [a__U41#](x0, x1, x2) = 1, [mark#](x0) = 0, [a__U31#](x0, x1) = 0, [a__U21#](x0, x1) = 0, [a__U12#](x0, x1) = 0, [a__isNat#](x0) = 0, [a__U11#](x0, x1, x2) = 0, [U41](x0, x1, x2) = 0, [U31](x0, x1) = 0, [U22](x0) = 0, [U21](x0, x1) = 0, [U13](x0) = 0, [U12](x0, x1) = 0, [U11](x0, x1, x2) = 0, [and](x0, x1) = 0, [isNat](x0) = 0, [isNatKind](x0) = 0, [a__isNatKind](x0) = 0, [plus](x0, x1) = 0, [0] = 0, [a__and](x0, x1) = x0, [s](x0) = 0, [a__plus](x0, x1) = 0, [a__U41](x0, x1, x2) = 0, [mark](x0) = 0, [a__U31](x0, x1) = 0, [a__U22](x0) = 0, [a__U21](x0, x1) = 0, [a__U13](x0) = 0, [a__U12](x0, x1) = 0, [a__isNat](x0) = 0, [a__U11](x0, x1, x2) = 0, [tt] = 0 orientation: a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__isNatKind#(V1) a__isNatKind#(s(V1)) = 0 >= 0 = a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__and#(tt(),X) = 0 >= 0 = mark#(X) mark#(s(X)) = 0 >= 0 = mark#(X) mark#(isNatKind(X)) = 0 >= 0 = a__isNatKind#(X) mark#(and(X1,X2)) = 0 >= 0 = a__and#(mark(X1),X2) mark#(and(X1,X2)) = 0 >= 0 = mark#(X1) a__plus#(N,s(M)) = 1 >= 1 = a__U41#(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))), M,N) a__U41#(tt(),M,N) = 1 >= 1 = a__plus#(mark(N),mark(M)) a__plus#(N,s(M)) = 1 >= 0 = a__and#(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))) a__plus#(N,s(M)) = 1 >= 0 = a__and#(a__isNat(M),isNatKind(M)) a__plus#(N,s(M)) = 1 >= 0 = a__isNat#(M) a__isNat#(s(V1)) = 0 >= 0 = a__U21#(a__isNatKind(V1),V1) a__U21#(tt(),V1) = 0 >= 0 = a__isNat#(V1) a__isNat#(s(V1)) = 0 >= 0 = a__isNatKind#(V1) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) = 0 >= 0 = a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) = 0 >= 0 = a__isNat#(V2) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__isNatKind#(V1) a__U11#(tt(),V1,V2) = 0 >= 0 = a__isNat#(V1) a__plus#(N,0()) = 1 >= 0 = a__U31#(a__and(a__isNat(N),isNatKind(N)),N) a__U31#(tt(),N) = 0 >= 0 = mark#(N) a__U41#(tt(),M,N) = 1 >= 0 = mark#(N) mark#(U31(X1,X2)) = 0 >= 0 = a__U31#(mark(X1),X2) mark#(U31(X1,X2)) = 0 >= 0 = mark#(X1) mark#(U22(X)) = 0 >= 0 = mark#(X) mark#(U21(X1,X2)) = 0 >= 0 = a__U21#(mark(X1),X2) mark#(U21(X1,X2)) = 0 >= 0 = mark#(X1) mark#(U13(X)) = 0 >= 0 = mark#(X) mark#(isNat(X)) = 0 >= 0 = a__isNat#(X) mark#(U12(X1,X2)) = 0 >= 0 = a__U12#(mark(X1),X2) mark#(U12(X1,X2)) = 0 >= 0 = mark#(X1) mark#(U11(X1,X2,X3)) = 0 >= 0 = a__U11#(mark(X1),X2,X3) mark#(U11(X1,X2,X3)) = 0 >= 0 = mark#(X1) a__U41#(tt(),M,N) = 1 >= 0 = mark#(M) a__plus#(N,0()) = 1 >= 0 = a__and#(a__isNat(N),isNatKind(N)) a__plus#(N,0()) = 1 >= 0 = a__isNat#(N) a__U11(tt(),V1,V2) = 0 >= 0 = a__U12(a__isNat(V1),V2) a__U12(tt(),V2) = 0 >= 0 = a__U13(a__isNat(V2)) a__U13(tt()) = 0 >= 0 = tt() a__U21(tt(),V1) = 0 >= 0 = a__U22(a__isNat(V1)) a__U22(tt()) = 0 >= 0 = tt() a__U31(tt(),N) = 0 >= 0 = mark(N) a__U41(tt(),M,N) = 0 >= 0 = s(a__plus(mark(N),mark(M))) a__and(tt(),X) = 0 >= 0 = mark(X) a__isNat(0()) = 0 >= 0 = tt() a__isNat(plus(V1,V2)) = 0 >= 0 = a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) = 0 >= 0 = a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) = 0 >= 0 = tt() a__isNatKind(plus(V1,V2)) = 0 >= 0 = a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) = 0 >= 0 = a__isNatKind(V1) a__plus(N,0()) = 0 >= 0 = a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) = 0 >= 0 = a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))), M,N) mark(U11(X1,X2,X3)) = 0 >= 0 = a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) = 0 >= 0 = a__U12(mark(X1),X2) mark(isNat(X)) = 0 >= 0 = a__isNat(X) mark(U13(X)) = 0 >= 0 = a__U13(mark(X)) mark(U21(X1,X2)) = 0 >= 0 = a__U21(mark(X1),X2) mark(U22(X)) = 0 >= 0 = a__U22(mark(X)) mark(U31(X1,X2)) = 0 >= 0 = a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) = 0 >= 0 = a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) = 0 >= 0 = a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) = 0 >= 0 = a__and(mark(X1),X2) mark(isNatKind(X)) = 0 >= 0 = a__isNatKind(X) mark(tt()) = 0 >= 0 = tt() mark(s(X)) = 0 >= 0 = s(mark(X)) mark(0()) = 0 >= 0 = 0() a__U11(X1,X2,X3) = 0 >= 0 = U11(X1,X2,X3) a__U12(X1,X2) = 0 >= 0 = U12(X1,X2) a__isNat(X) = 0 >= 0 = isNat(X) a__U13(X) = 0 >= 0 = U13(X) a__U21(X1,X2) = 0 >= 0 = U21(X1,X2) a__U22(X) = 0 >= 0 = U22(X) a__U31(X1,X2) = 0 >= 0 = U31(X1,X2) a__U41(X1,X2,X3) = 0 >= 0 = U41(X1,X2,X3) a__plus(X1,X2) = 0 >= 0 = plus(X1,X2) a__and(X1,X2) = X1 >= 0 = and(X1,X2) a__isNatKind(X) = 0 >= 0 = isNatKind(X) problem: DPs: a__isNatKind#(plus(V1,V2)) -> a__isNatKind#(V1) a__isNatKind#(s(V1)) -> a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__and#(tt(),X) -> mark#(X) mark#(s(X)) -> mark#(X) mark#(isNatKind(X)) -> a__isNatKind#(X) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) a__plus#(N,s(M)) -> a__U41#(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) a__U41#(tt(),M,N) -> a__plus#(mark(N),mark(M)) a__isNat#(s(V1)) -> a__U21#(a__isNatKind(V1),V1) a__U21#(tt(),V1) -> a__isNat#(V1) a__isNat#(s(V1)) -> a__isNatKind#(V1) a__isNat#(plus(V1,V2)) -> a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) -> a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) -> a__isNat#(V2) a__isNat#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) -> a__isNatKind#(V1) a__U11#(tt(),V1,V2) -> a__isNat#(V1) a__U31#(tt(),N) -> mark#(N) mark#(U31(X1,X2)) -> a__U31#(mark(X1),X2) mark#(U31(X1,X2)) -> mark#(X1) mark#(U22(X)) -> mark#(X) mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2) mark#(U21(X1,X2)) -> mark#(X1) mark#(U13(X)) -> mark#(X) mark#(isNat(X)) -> a__isNat#(X) mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(U12(X1,X2)) -> mark#(X1) mark#(U11(X1,X2,X3)) -> a__U11#(mark(X1),X2,X3) mark#(U11(X1,X2,X3)) -> mark#(X1) TRS: a__U11(tt(),V1,V2) -> a__U12(a__isNat(V1),V2) a__U12(tt(),V2) -> a__U13(a__isNat(V2)) a__U13(tt()) -> tt() a__U21(tt(),V1) -> a__U22(a__isNat(V1)) a__U22(tt()) -> tt() a__U31(tt(),N) -> mark(N) a__U41(tt(),M,N) -> s(a__plus(mark(N),mark(M))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(plus(V1,V2)) -> a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) -> a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) -> tt() a__isNatKind(plus(V1,V2)) -> a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) -> a__isNatKind(V1) a__plus(N,0()) -> a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) -> a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(U13(X)) -> a__U13(mark(X)) mark(U21(X1,X2)) -> a__U21(mark(X1),X2) mark(U22(X)) -> a__U22(mark(X)) mark(U31(X1,X2)) -> a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) -> a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNatKind(X)) -> a__isNatKind(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2,X3) -> U11(X1,X2,X3) a__U12(X1,X2) -> U12(X1,X2) a__isNat(X) -> isNat(X) a__U13(X) -> U13(X) a__U21(X1,X2) -> U21(X1,X2) a__U22(X) -> U22(X) a__U31(X1,X2) -> U31(X1,X2) a__U41(X1,X2,X3) -> U41(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNatKind(X) -> isNatKind(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatKind#](x0) = 0, [a__and#](x0, x1) = 0, [a__plus#](x0, x1) = x1, [a__U41#](x0, x1, x2) = x1 + 1, [mark#](x0) = 0, [a__U31#](x0, x1) = 0, [a__U21#](x0, x1) = 0, [a__U12#](x0, x1) = 0, [a__isNat#](x0) = 0, [a__U11#](x0, x1, x2) = 0, [U41](x0, x1, x2) = x1 + x2 + 1, [U31](x0, x1) = x1, [U22](x0) = 0, [U21](x0, x1) = 0, [U13](x0) = 0, [U12](x0, x1) = 0, [U11](x0, x1, x2) = 0, [and](x0, x1) = x1, [isNat](x0) = x0, [isNatKind](x0) = 0, [a__isNatKind](x0) = 0, [plus](x0, x1) = x0 + x1, [0] = 0, [a__and](x0, x1) = x1, [s](x0) = x0 + 1, [a__plus](x0, x1) = x0 + x1, [a__U41](x0, x1, x2) = x1 + x2 + 1, [mark](x0) = x0, [a__U31](x0, x1) = x1, [a__U22](x0) = 0, [a__U21](x0, x1) = 0, [a__U13](x0) = 0, [a__U12](x0, x1) = 0, [a__isNat](x0) = x0, [a__U11](x0, x1, x2) = 0, [tt] = 0 orientation: a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__isNatKind#(V1) a__isNatKind#(s(V1)) = 0 >= 0 = a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__and#(tt(),X) = 0 >= 0 = mark#(X) mark#(s(X)) = 0 >= 0 = mark#(X) mark#(isNatKind(X)) = 0 >= 0 = a__isNatKind#(X) mark#(and(X1,X2)) = 0 >= 0 = a__and#(mark(X1),X2) mark#(and(X1,X2)) = 0 >= 0 = mark#(X1) a__plus#(N,s(M)) = M + 1 >= M + 1 = a__U41#(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))), M,N) a__U41#(tt(),M,N) = M + 1 >= M = a__plus#(mark(N),mark(M)) a__isNat#(s(V1)) = 0 >= 0 = a__U21#(a__isNatKind(V1),V1) a__U21#(tt(),V1) = 0 >= 0 = a__isNat#(V1) a__isNat#(s(V1)) = 0 >= 0 = a__isNatKind#(V1) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) = 0 >= 0 = a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) = 0 >= 0 = a__isNat#(V2) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__isNatKind#(V1) a__U11#(tt(),V1,V2) = 0 >= 0 = a__isNat#(V1) a__U31#(tt(),N) = 0 >= 0 = mark#(N) mark#(U31(X1,X2)) = 0 >= 0 = a__U31#(mark(X1),X2) mark#(U31(X1,X2)) = 0 >= 0 = mark#(X1) mark#(U22(X)) = 0 >= 0 = mark#(X) mark#(U21(X1,X2)) = 0 >= 0 = a__U21#(mark(X1),X2) mark#(U21(X1,X2)) = 0 >= 0 = mark#(X1) mark#(U13(X)) = 0 >= 0 = mark#(X) mark#(isNat(X)) = 0 >= 0 = a__isNat#(X) mark#(U12(X1,X2)) = 0 >= 0 = a__U12#(mark(X1),X2) mark#(U12(X1,X2)) = 0 >= 0 = mark#(X1) mark#(U11(X1,X2,X3)) = 0 >= 0 = a__U11#(mark(X1),X2,X3) mark#(U11(X1,X2,X3)) = 0 >= 0 = mark#(X1) a__U11(tt(),V1,V2) = 0 >= 0 = a__U12(a__isNat(V1),V2) a__U12(tt(),V2) = 0 >= 0 = a__U13(a__isNat(V2)) a__U13(tt()) = 0 >= 0 = tt() a__U21(tt(),V1) = 0 >= 0 = a__U22(a__isNat(V1)) a__U22(tt()) = 0 >= 0 = tt() a__U31(tt(),N) = N >= N = mark(N) a__U41(tt(),M,N) = M + N + 1 >= M + N + 1 = s(a__plus(mark(N),mark(M))) a__and(tt(),X) = X >= X = mark(X) a__isNat(0()) = 0 >= 0 = tt() a__isNat(plus(V1,V2)) = V1 + V2 >= 0 = a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) = V1 + 1 >= 0 = a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) = 0 >= 0 = tt() a__isNatKind(plus(V1,V2)) = 0 >= 0 = a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) = 0 >= 0 = a__isNatKind(V1) a__plus(N,0()) = N >= N = a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) = M + N + 1 >= M + N + 1 = a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))), M,N) mark(U11(X1,X2,X3)) = 0 >= 0 = a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) = 0 >= 0 = a__U12(mark(X1),X2) mark(isNat(X)) = X >= X = a__isNat(X) mark(U13(X)) = 0 >= 0 = a__U13(mark(X)) mark(U21(X1,X2)) = 0 >= 0 = a__U21(mark(X1),X2) mark(U22(X)) = 0 >= 0 = a__U22(mark(X)) mark(U31(X1,X2)) = X2 >= X2 = a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) = X2 + X3 + 1 >= X2 + X3 + 1 = a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) = X1 + X2 >= X1 + X2 = a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) = X2 >= X2 = a__and(mark(X1),X2) mark(isNatKind(X)) = 0 >= 0 = a__isNatKind(X) mark(tt()) = 0 >= 0 = tt() mark(s(X)) = X + 1 >= X + 1 = s(mark(X)) mark(0()) = 0 >= 0 = 0() a__U11(X1,X2,X3) = 0 >= 0 = U11(X1,X2,X3) a__U12(X1,X2) = 0 >= 0 = U12(X1,X2) a__isNat(X) = X >= X = isNat(X) a__U13(X) = 0 >= 0 = U13(X) a__U21(X1,X2) = 0 >= 0 = U21(X1,X2) a__U22(X) = 0 >= 0 = U22(X) a__U31(X1,X2) = X2 >= X2 = U31(X1,X2) a__U41(X1,X2,X3) = X2 + X3 + 1 >= X2 + X3 + 1 = U41(X1,X2,X3) a__plus(X1,X2) = X1 + X2 >= X1 + X2 = plus(X1,X2) a__and(X1,X2) = X2 >= X2 = and(X1,X2) a__isNatKind(X) = 0 >= 0 = isNatKind(X) problem: DPs: a__isNatKind#(plus(V1,V2)) -> a__isNatKind#(V1) a__isNatKind#(s(V1)) -> a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__and#(tt(),X) -> mark#(X) mark#(s(X)) -> mark#(X) mark#(isNatKind(X)) -> a__isNatKind#(X) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) a__plus#(N,s(M)) -> a__U41#(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) a__isNat#(s(V1)) -> a__U21#(a__isNatKind(V1),V1) a__U21#(tt(),V1) -> a__isNat#(V1) a__isNat#(s(V1)) -> a__isNatKind#(V1) a__isNat#(plus(V1,V2)) -> a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) -> a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) -> a__isNat#(V2) a__isNat#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) -> a__isNatKind#(V1) a__U11#(tt(),V1,V2) -> a__isNat#(V1) a__U31#(tt(),N) -> mark#(N) mark#(U31(X1,X2)) -> a__U31#(mark(X1),X2) mark#(U31(X1,X2)) -> mark#(X1) mark#(U22(X)) -> mark#(X) mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2) mark#(U21(X1,X2)) -> mark#(X1) mark#(U13(X)) -> mark#(X) mark#(isNat(X)) -> a__isNat#(X) mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(U12(X1,X2)) -> mark#(X1) mark#(U11(X1,X2,X3)) -> a__U11#(mark(X1),X2,X3) mark#(U11(X1,X2,X3)) -> mark#(X1) TRS: a__U11(tt(),V1,V2) -> a__U12(a__isNat(V1),V2) a__U12(tt(),V2) -> a__U13(a__isNat(V2)) a__U13(tt()) -> tt() a__U21(tt(),V1) -> a__U22(a__isNat(V1)) a__U22(tt()) -> tt() a__U31(tt(),N) -> mark(N) a__U41(tt(),M,N) -> s(a__plus(mark(N),mark(M))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(plus(V1,V2)) -> a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) -> a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) -> tt() a__isNatKind(plus(V1,V2)) -> a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) -> a__isNatKind(V1) a__plus(N,0()) -> a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) -> a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(U13(X)) -> a__U13(mark(X)) mark(U21(X1,X2)) -> a__U21(mark(X1),X2) mark(U22(X)) -> a__U22(mark(X)) mark(U31(X1,X2)) -> a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) -> a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNatKind(X)) -> a__isNatKind(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2,X3) -> U11(X1,X2,X3) a__U12(X1,X2) -> U12(X1,X2) a__isNat(X) -> isNat(X) a__U13(X) -> U13(X) a__U21(X1,X2) -> U21(X1,X2) a__U22(X) -> U22(X) a__U31(X1,X2) -> U31(X1,X2) a__U41(X1,X2,X3) -> U41(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNatKind(X) -> isNatKind(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatKind#](x0) = 0, [a__and#](x0, x1) = 0, [a__plus#](x0, x1) = x0 + 1, [a__U41#](x0, x1, x2) = 0, [mark#](x0) = 0, [a__U31#](x0, x1) = 0, [a__U21#](x0, x1) = 0, [a__U12#](x0, x1) = 0, [a__isNat#](x0) = 0, [a__U11#](x0, x1, x2) = 0, [U41](x0, x1, x2) = 0, [U31](x0, x1) = 0, [U22](x0) = 0, [U21](x0, x1) = 0, [U13](x0) = 0, [U12](x0, x1) = 0, [U11](x0, x1, x2) = 0, [and](x0, x1) = 0, [isNat](x0) = 0, [isNatKind](x0) = 0, [a__isNatKind](x0) = 0, [plus](x0, x1) = 0, [0] = 0, [a__and](x0, x1) = 0, [s](x0) = 0, [a__plus](x0, x1) = 0, [a__U41](x0, x1, x2) = 0, [mark](x0) = 0, [a__U31](x0, x1) = 0, [a__U22](x0) = 0, [a__U21](x0, x1) = 0, [a__U13](x0) = 0, [a__U12](x0, x1) = 0, [a__isNat](x0) = 0, [a__U11](x0, x1, x2) = 0, [tt] = 0 orientation: a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__isNatKind#(V1) a__isNatKind#(s(V1)) = 0 >= 0 = a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__and#(tt(),X) = 0 >= 0 = mark#(X) mark#(s(X)) = 0 >= 0 = mark#(X) mark#(isNatKind(X)) = 0 >= 0 = a__isNatKind#(X) mark#(and(X1,X2)) = 0 >= 0 = a__and#(mark(X1),X2) mark#(and(X1,X2)) = 0 >= 0 = mark#(X1) a__plus#(N,s(M)) = N + 1 >= 0 = a__U41#(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))), M,N) a__isNat#(s(V1)) = 0 >= 0 = a__U21#(a__isNatKind(V1),V1) a__U21#(tt(),V1) = 0 >= 0 = a__isNat#(V1) a__isNat#(s(V1)) = 0 >= 0 = a__isNatKind#(V1) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) = 0 >= 0 = a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) = 0 >= 0 = a__isNat#(V2) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__isNatKind#(V1) a__U11#(tt(),V1,V2) = 0 >= 0 = a__isNat#(V1) a__U31#(tt(),N) = 0 >= 0 = mark#(N) mark#(U31(X1,X2)) = 0 >= 0 = a__U31#(mark(X1),X2) mark#(U31(X1,X2)) = 0 >= 0 = mark#(X1) mark#(U22(X)) = 0 >= 0 = mark#(X) mark#(U21(X1,X2)) = 0 >= 0 = a__U21#(mark(X1),X2) mark#(U21(X1,X2)) = 0 >= 0 = mark#(X1) mark#(U13(X)) = 0 >= 0 = mark#(X) mark#(isNat(X)) = 0 >= 0 = a__isNat#(X) mark#(U12(X1,X2)) = 0 >= 0 = a__U12#(mark(X1),X2) mark#(U12(X1,X2)) = 0 >= 0 = mark#(X1) mark#(U11(X1,X2,X3)) = 0 >= 0 = a__U11#(mark(X1),X2,X3) mark#(U11(X1,X2,X3)) = 0 >= 0 = mark#(X1) a__U11(tt(),V1,V2) = 0 >= 0 = a__U12(a__isNat(V1),V2) a__U12(tt(),V2) = 0 >= 0 = a__U13(a__isNat(V2)) a__U13(tt()) = 0 >= 0 = tt() a__U21(tt(),V1) = 0 >= 0 = a__U22(a__isNat(V1)) a__U22(tt()) = 0 >= 0 = tt() a__U31(tt(),N) = 0 >= 0 = mark(N) a__U41(tt(),M,N) = 0 >= 0 = s(a__plus(mark(N),mark(M))) a__and(tt(),X) = 0 >= 0 = mark(X) a__isNat(0()) = 0 >= 0 = tt() a__isNat(plus(V1,V2)) = 0 >= 0 = a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) = 0 >= 0 = a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) = 0 >= 0 = tt() a__isNatKind(plus(V1,V2)) = 0 >= 0 = a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) = 0 >= 0 = a__isNatKind(V1) a__plus(N,0()) = 0 >= 0 = a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) = 0 >= 0 = a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))), M,N) mark(U11(X1,X2,X3)) = 0 >= 0 = a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) = 0 >= 0 = a__U12(mark(X1),X2) mark(isNat(X)) = 0 >= 0 = a__isNat(X) mark(U13(X)) = 0 >= 0 = a__U13(mark(X)) mark(U21(X1,X2)) = 0 >= 0 = a__U21(mark(X1),X2) mark(U22(X)) = 0 >= 0 = a__U22(mark(X)) mark(U31(X1,X2)) = 0 >= 0 = a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) = 0 >= 0 = a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) = 0 >= 0 = a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) = 0 >= 0 = a__and(mark(X1),X2) mark(isNatKind(X)) = 0 >= 0 = a__isNatKind(X) mark(tt()) = 0 >= 0 = tt() mark(s(X)) = 0 >= 0 = s(mark(X)) mark(0()) = 0 >= 0 = 0() a__U11(X1,X2,X3) = 0 >= 0 = U11(X1,X2,X3) a__U12(X1,X2) = 0 >= 0 = U12(X1,X2) a__isNat(X) = 0 >= 0 = isNat(X) a__U13(X) = 0 >= 0 = U13(X) a__U21(X1,X2) = 0 >= 0 = U21(X1,X2) a__U22(X) = 0 >= 0 = U22(X) a__U31(X1,X2) = 0 >= 0 = U31(X1,X2) a__U41(X1,X2,X3) = 0 >= 0 = U41(X1,X2,X3) a__plus(X1,X2) = 0 >= 0 = plus(X1,X2) a__and(X1,X2) = 0 >= 0 = and(X1,X2) a__isNatKind(X) = 0 >= 0 = isNatKind(X) problem: DPs: a__isNatKind#(plus(V1,V2)) -> a__isNatKind#(V1) a__isNatKind#(s(V1)) -> a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__and#(tt(),X) -> mark#(X) mark#(s(X)) -> mark#(X) mark#(isNatKind(X)) -> a__isNatKind#(X) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) a__isNat#(s(V1)) -> a__U21#(a__isNatKind(V1),V1) a__U21#(tt(),V1) -> a__isNat#(V1) a__isNat#(s(V1)) -> a__isNatKind#(V1) a__isNat#(plus(V1,V2)) -> a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) -> a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) -> a__isNat#(V2) a__isNat#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) -> a__isNatKind#(V1) a__U11#(tt(),V1,V2) -> a__isNat#(V1) a__U31#(tt(),N) -> mark#(N) mark#(U31(X1,X2)) -> a__U31#(mark(X1),X2) mark#(U31(X1,X2)) -> mark#(X1) mark#(U22(X)) -> mark#(X) mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2) mark#(U21(X1,X2)) -> mark#(X1) mark#(U13(X)) -> mark#(X) mark#(isNat(X)) -> a__isNat#(X) mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(U12(X1,X2)) -> mark#(X1) mark#(U11(X1,X2,X3)) -> a__U11#(mark(X1),X2,X3) mark#(U11(X1,X2,X3)) -> mark#(X1) TRS: a__U11(tt(),V1,V2) -> a__U12(a__isNat(V1),V2) a__U12(tt(),V2) -> a__U13(a__isNat(V2)) a__U13(tt()) -> tt() a__U21(tt(),V1) -> a__U22(a__isNat(V1)) a__U22(tt()) -> tt() a__U31(tt(),N) -> mark(N) a__U41(tt(),M,N) -> s(a__plus(mark(N),mark(M))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(plus(V1,V2)) -> a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) -> a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) -> tt() a__isNatKind(plus(V1,V2)) -> a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) -> a__isNatKind(V1) a__plus(N,0()) -> a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) -> a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(U13(X)) -> a__U13(mark(X)) mark(U21(X1,X2)) -> a__U21(mark(X1),X2) mark(U22(X)) -> a__U22(mark(X)) mark(U31(X1,X2)) -> a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) -> a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNatKind(X)) -> a__isNatKind(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2,X3) -> U11(X1,X2,X3) a__U12(X1,X2) -> U12(X1,X2) a__isNat(X) -> isNat(X) a__U13(X) -> U13(X) a__U21(X1,X2) -> U21(X1,X2) a__U22(X) -> U22(X) a__U31(X1,X2) -> U31(X1,X2) a__U41(X1,X2,X3) -> U41(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNatKind(X) -> isNatKind(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatKind#](x0) = 0, [a__and#](x0, x1) = x1, [mark#](x0) = x0, [a__U31#](x0, x1) = x1 + 1, [a__U21#](x0, x1) = 0, [a__U12#](x0, x1) = 0, [a__isNat#](x0) = 0, [a__U11#](x0, x1, x2) = 0, [U41](x0, x1, x2) = x1 + x2, [U31](x0, x1) = x0 + x1 + 1, [U22](x0) = x0, [U21](x0, x1) = x0, [U13](x0) = x0, [U12](x0, x1) = x0, [U11](x0, x1, x2) = x0, [and](x0, x1) = x0 + x1, [isNat](x0) = 0, [isNatKind](x0) = 0, [a__isNatKind](x0) = 0, [plus](x0, x1) = x0 + x1, [0] = 1, [a__and](x0, x1) = x0 + x1, [s](x0) = x0, [a__plus](x0, x1) = x0 + x1, [a__U41](x0, x1, x2) = x1 + x2, [mark](x0) = x0, [a__U31](x0, x1) = x0 + x1 + 1, [a__U22](x0) = x0, [a__U21](x0, x1) = x0, [a__U13](x0) = x0, [a__U12](x0, x1) = x0, [a__isNat](x0) = 0, [a__U11](x0, x1, x2) = x0, [tt] = 0 orientation: a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__isNatKind#(V1) a__isNatKind#(s(V1)) = 0 >= 0 = a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__and#(tt(),X) = X >= X = mark#(X) mark#(s(X)) = X >= X = mark#(X) mark#(isNatKind(X)) = 0 >= 0 = a__isNatKind#(X) mark#(and(X1,X2)) = X1 + X2 >= X2 = a__and#(mark(X1),X2) mark#(and(X1,X2)) = X1 + X2 >= X1 = mark#(X1) a__isNat#(s(V1)) = 0 >= 0 = a__U21#(a__isNatKind(V1),V1) a__U21#(tt(),V1) = 0 >= 0 = a__isNat#(V1) a__isNat#(s(V1)) = 0 >= 0 = a__isNatKind#(V1) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) = 0 >= 0 = a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) = 0 >= 0 = a__isNat#(V2) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__isNatKind#(V1) a__U11#(tt(),V1,V2) = 0 >= 0 = a__isNat#(V1) a__U31#(tt(),N) = N + 1 >= N = mark#(N) mark#(U31(X1,X2)) = X1 + X2 + 1 >= X2 + 1 = a__U31#(mark(X1),X2) mark#(U31(X1,X2)) = X1 + X2 + 1 >= X1 = mark#(X1) mark#(U22(X)) = X >= X = mark#(X) mark#(U21(X1,X2)) = X1 >= 0 = a__U21#(mark(X1),X2) mark#(U21(X1,X2)) = X1 >= X1 = mark#(X1) mark#(U13(X)) = X >= X = mark#(X) mark#(isNat(X)) = 0 >= 0 = a__isNat#(X) mark#(U12(X1,X2)) = X1 >= 0 = a__U12#(mark(X1),X2) mark#(U12(X1,X2)) = X1 >= X1 = mark#(X1) mark#(U11(X1,X2,X3)) = X1 >= 0 = a__U11#(mark(X1),X2,X3) mark#(U11(X1,X2,X3)) = X1 >= X1 = mark#(X1) a__U11(tt(),V1,V2) = 0 >= 0 = a__U12(a__isNat(V1),V2) a__U12(tt(),V2) = 0 >= 0 = a__U13(a__isNat(V2)) a__U13(tt()) = 0 >= 0 = tt() a__U21(tt(),V1) = 0 >= 0 = a__U22(a__isNat(V1)) a__U22(tt()) = 0 >= 0 = tt() a__U31(tt(),N) = N + 1 >= N = mark(N) a__U41(tt(),M,N) = M + N >= M + N = s(a__plus(mark(N),mark(M))) a__and(tt(),X) = X >= X = mark(X) a__isNat(0()) = 0 >= 0 = tt() a__isNat(plus(V1,V2)) = 0 >= 0 = a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) = 0 >= 0 = a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) = 0 >= 0 = tt() a__isNatKind(plus(V1,V2)) = 0 >= 0 = a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) = 0 >= 0 = a__isNatKind(V1) a__plus(N,0()) = N + 1 >= N + 1 = a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) = M + N >= M + N = a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))), M,N) mark(U11(X1,X2,X3)) = X1 >= X1 = a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) = X1 >= X1 = a__U12(mark(X1),X2) mark(isNat(X)) = 0 >= 0 = a__isNat(X) mark(U13(X)) = X >= X = a__U13(mark(X)) mark(U21(X1,X2)) = X1 >= X1 = a__U21(mark(X1),X2) mark(U22(X)) = X >= X = a__U22(mark(X)) mark(U31(X1,X2)) = X1 + X2 + 1 >= X1 + X2 + 1 = a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) = X2 + X3 >= X2 + X3 = a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) = X1 + X2 >= X1 + X2 = a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) = X1 + X2 >= X1 + X2 = a__and(mark(X1),X2) mark(isNatKind(X)) = 0 >= 0 = a__isNatKind(X) mark(tt()) = 0 >= 0 = tt() mark(s(X)) = X >= X = s(mark(X)) mark(0()) = 1 >= 1 = 0() a__U11(X1,X2,X3) = X1 >= X1 = U11(X1,X2,X3) a__U12(X1,X2) = X1 >= X1 = U12(X1,X2) a__isNat(X) = 0 >= 0 = isNat(X) a__U13(X) = X >= X = U13(X) a__U21(X1,X2) = X1 >= X1 = U21(X1,X2) a__U22(X) = X >= X = U22(X) a__U31(X1,X2) = X1 + X2 + 1 >= X1 + X2 + 1 = U31(X1,X2) a__U41(X1,X2,X3) = X2 + X3 >= X2 + X3 = U41(X1,X2,X3) a__plus(X1,X2) = X1 + X2 >= X1 + X2 = plus(X1,X2) a__and(X1,X2) = X1 + X2 >= X1 + X2 = and(X1,X2) a__isNatKind(X) = 0 >= 0 = isNatKind(X) problem: DPs: a__isNatKind#(plus(V1,V2)) -> a__isNatKind#(V1) a__isNatKind#(s(V1)) -> a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__and#(tt(),X) -> mark#(X) mark#(s(X)) -> mark#(X) mark#(isNatKind(X)) -> a__isNatKind#(X) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) a__isNat#(s(V1)) -> a__U21#(a__isNatKind(V1),V1) a__U21#(tt(),V1) -> a__isNat#(V1) a__isNat#(s(V1)) -> a__isNatKind#(V1) a__isNat#(plus(V1,V2)) -> a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) -> a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) -> a__isNat#(V2) a__isNat#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) -> a__isNatKind#(V1) a__U11#(tt(),V1,V2) -> a__isNat#(V1) mark#(U31(X1,X2)) -> a__U31#(mark(X1),X2) mark#(U22(X)) -> mark#(X) mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2) mark#(U21(X1,X2)) -> mark#(X1) mark#(U13(X)) -> mark#(X) mark#(isNat(X)) -> a__isNat#(X) mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(U12(X1,X2)) -> mark#(X1) mark#(U11(X1,X2,X3)) -> a__U11#(mark(X1),X2,X3) mark#(U11(X1,X2,X3)) -> mark#(X1) TRS: a__U11(tt(),V1,V2) -> a__U12(a__isNat(V1),V2) a__U12(tt(),V2) -> a__U13(a__isNat(V2)) a__U13(tt()) -> tt() a__U21(tt(),V1) -> a__U22(a__isNat(V1)) a__U22(tt()) -> tt() a__U31(tt(),N) -> mark(N) a__U41(tt(),M,N) -> s(a__plus(mark(N),mark(M))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(plus(V1,V2)) -> a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) -> a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) -> tt() a__isNatKind(plus(V1,V2)) -> a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) -> a__isNatKind(V1) a__plus(N,0()) -> a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) -> a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(U13(X)) -> a__U13(mark(X)) mark(U21(X1,X2)) -> a__U21(mark(X1),X2) mark(U22(X)) -> a__U22(mark(X)) mark(U31(X1,X2)) -> a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) -> a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNatKind(X)) -> a__isNatKind(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2,X3) -> U11(X1,X2,X3) a__U12(X1,X2) -> U12(X1,X2) a__isNat(X) -> isNat(X) a__U13(X) -> U13(X) a__U21(X1,X2) -> U21(X1,X2) a__U22(X) -> U22(X) a__U31(X1,X2) -> U31(X1,X2) a__U41(X1,X2,X3) -> U41(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNatKind(X) -> isNatKind(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatKind#](x0) = 1, [a__and#](x0, x1) = 1, [mark#](x0) = 1, [a__U31#](x0, x1) = 0, [a__U21#](x0, x1) = 1, [a__U12#](x0, x1) = 1, [a__isNat#](x0) = 1, [a__U11#](x0, x1, x2) = 1, [U41](x0, x1, x2) = 0, [U31](x0, x1) = 0, [U22](x0) = 0, [U21](x0, x1) = 0, [U13](x0) = 0, [U12](x0, x1) = 0, [U11](x0, x1, x2) = 0, [and](x0, x1) = 0, [isNat](x0) = 0, [isNatKind](x0) = 0, [a__isNatKind](x0) = 0, [plus](x0, x1) = 0, [0] = 0, [a__and](x0, x1) = 0, [s](x0) = 0, [a__plus](x0, x1) = 0, [a__U41](x0, x1, x2) = 0, [mark](x0) = 0, [a__U31](x0, x1) = 0, [a__U22](x0) = 0, [a__U21](x0, x1) = 0, [a__U13](x0) = 0, [a__U12](x0, x1) = 0, [a__isNat](x0) = 0, [a__U11](x0, x1, x2) = x0, [tt] = 0 orientation: a__isNatKind#(plus(V1,V2)) = 1 >= 1 = a__isNatKind#(V1) a__isNatKind#(s(V1)) = 1 >= 1 = a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) = 1 >= 1 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__and#(tt(),X) = 1 >= 1 = mark#(X) mark#(s(X)) = 1 >= 1 = mark#(X) mark#(isNatKind(X)) = 1 >= 1 = a__isNatKind#(X) mark#(and(X1,X2)) = 1 >= 1 = a__and#(mark(X1),X2) mark#(and(X1,X2)) = 1 >= 1 = mark#(X1) a__isNat#(s(V1)) = 1 >= 1 = a__U21#(a__isNatKind(V1),V1) a__U21#(tt(),V1) = 1 >= 1 = a__isNat#(V1) a__isNat#(s(V1)) = 1 >= 1 = a__isNatKind#(V1) a__isNat#(plus(V1,V2)) = 1 >= 1 = a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) = 1 >= 1 = a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) = 1 >= 1 = a__isNat#(V2) a__isNat#(plus(V1,V2)) = 1 >= 1 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) = 1 >= 1 = a__isNatKind#(V1) a__U11#(tt(),V1,V2) = 1 >= 1 = a__isNat#(V1) mark#(U31(X1,X2)) = 1 >= 0 = a__U31#(mark(X1),X2) mark#(U22(X)) = 1 >= 1 = mark#(X) mark#(U21(X1,X2)) = 1 >= 1 = a__U21#(mark(X1),X2) mark#(U21(X1,X2)) = 1 >= 1 = mark#(X1) mark#(U13(X)) = 1 >= 1 = mark#(X) mark#(isNat(X)) = 1 >= 1 = a__isNat#(X) mark#(U12(X1,X2)) = 1 >= 1 = a__U12#(mark(X1),X2) mark#(U12(X1,X2)) = 1 >= 1 = mark#(X1) mark#(U11(X1,X2,X3)) = 1 >= 1 = a__U11#(mark(X1),X2,X3) mark#(U11(X1,X2,X3)) = 1 >= 1 = mark#(X1) a__U11(tt(),V1,V2) = 0 >= 0 = a__U12(a__isNat(V1),V2) a__U12(tt(),V2) = 0 >= 0 = a__U13(a__isNat(V2)) a__U13(tt()) = 0 >= 0 = tt() a__U21(tt(),V1) = 0 >= 0 = a__U22(a__isNat(V1)) a__U22(tt()) = 0 >= 0 = tt() a__U31(tt(),N) = 0 >= 0 = mark(N) a__U41(tt(),M,N) = 0 >= 0 = s(a__plus(mark(N),mark(M))) a__and(tt(),X) = 0 >= 0 = mark(X) a__isNat(0()) = 0 >= 0 = tt() a__isNat(plus(V1,V2)) = 0 >= 0 = a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) = 0 >= 0 = a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) = 0 >= 0 = tt() a__isNatKind(plus(V1,V2)) = 0 >= 0 = a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) = 0 >= 0 = a__isNatKind(V1) a__plus(N,0()) = 0 >= 0 = a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) = 0 >= 0 = a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))), M,N) mark(U11(X1,X2,X3)) = 0 >= 0 = a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) = 0 >= 0 = a__U12(mark(X1),X2) mark(isNat(X)) = 0 >= 0 = a__isNat(X) mark(U13(X)) = 0 >= 0 = a__U13(mark(X)) mark(U21(X1,X2)) = 0 >= 0 = a__U21(mark(X1),X2) mark(U22(X)) = 0 >= 0 = a__U22(mark(X)) mark(U31(X1,X2)) = 0 >= 0 = a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) = 0 >= 0 = a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) = 0 >= 0 = a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) = 0 >= 0 = a__and(mark(X1),X2) mark(isNatKind(X)) = 0 >= 0 = a__isNatKind(X) mark(tt()) = 0 >= 0 = tt() mark(s(X)) = 0 >= 0 = s(mark(X)) mark(0()) = 0 >= 0 = 0() a__U11(X1,X2,X3) = X1 >= 0 = U11(X1,X2,X3) a__U12(X1,X2) = 0 >= 0 = U12(X1,X2) a__isNat(X) = 0 >= 0 = isNat(X) a__U13(X) = 0 >= 0 = U13(X) a__U21(X1,X2) = 0 >= 0 = U21(X1,X2) a__U22(X) = 0 >= 0 = U22(X) a__U31(X1,X2) = 0 >= 0 = U31(X1,X2) a__U41(X1,X2,X3) = 0 >= 0 = U41(X1,X2,X3) a__plus(X1,X2) = 0 >= 0 = plus(X1,X2) a__and(X1,X2) = 0 >= 0 = and(X1,X2) a__isNatKind(X) = 0 >= 0 = isNatKind(X) problem: DPs: a__isNatKind#(plus(V1,V2)) -> a__isNatKind#(V1) a__isNatKind#(s(V1)) -> a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__and#(tt(),X) -> mark#(X) mark#(s(X)) -> mark#(X) mark#(isNatKind(X)) -> a__isNatKind#(X) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) a__isNat#(s(V1)) -> a__U21#(a__isNatKind(V1),V1) a__U21#(tt(),V1) -> a__isNat#(V1) a__isNat#(s(V1)) -> a__isNatKind#(V1) a__isNat#(plus(V1,V2)) -> a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) -> a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) -> a__isNat#(V2) a__isNat#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) -> a__isNatKind#(V1) a__U11#(tt(),V1,V2) -> a__isNat#(V1) mark#(U22(X)) -> mark#(X) mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2) mark#(U21(X1,X2)) -> mark#(X1) mark#(U13(X)) -> mark#(X) mark#(isNat(X)) -> a__isNat#(X) mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(U12(X1,X2)) -> mark#(X1) mark#(U11(X1,X2,X3)) -> a__U11#(mark(X1),X2,X3) mark#(U11(X1,X2,X3)) -> mark#(X1) TRS: a__U11(tt(),V1,V2) -> a__U12(a__isNat(V1),V2) a__U12(tt(),V2) -> a__U13(a__isNat(V2)) a__U13(tt()) -> tt() a__U21(tt(),V1) -> a__U22(a__isNat(V1)) a__U22(tt()) -> tt() a__U31(tt(),N) -> mark(N) a__U41(tt(),M,N) -> s(a__plus(mark(N),mark(M))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(plus(V1,V2)) -> a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) -> a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) -> tt() a__isNatKind(plus(V1,V2)) -> a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) -> a__isNatKind(V1) a__plus(N,0()) -> a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) -> a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(U13(X)) -> a__U13(mark(X)) mark(U21(X1,X2)) -> a__U21(mark(X1),X2) mark(U22(X)) -> a__U22(mark(X)) mark(U31(X1,X2)) -> a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) -> a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNatKind(X)) -> a__isNatKind(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2,X3) -> U11(X1,X2,X3) a__U12(X1,X2) -> U12(X1,X2) a__isNat(X) -> isNat(X) a__U13(X) -> U13(X) a__U21(X1,X2) -> U21(X1,X2) a__U22(X) -> U22(X) a__U31(X1,X2) -> U31(X1,X2) a__U41(X1,X2,X3) -> U41(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNatKind(X) -> isNatKind(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatKind#](x0) = 0, [a__and#](x0, x1) = x1, [mark#](x0) = x0, [a__U21#](x0, x1) = 0, [a__U12#](x0, x1) = 0, [a__isNat#](x0) = 0, [a__U11#](x0, x1, x2) = 0, [U41](x0, x1, x2) = x1 + x2 + 1, [U31](x0, x1) = x1, [U22](x0) = x0, [U21](x0, x1) = x0, [U13](x0) = x0, [U12](x0, x1) = x0, [U11](x0, x1, x2) = x0, [and](x0, x1) = x0 + x1, [isNat](x0) = 0, [isNatKind](x0) = 0, [a__isNatKind](x0) = 0, [plus](x0, x1) = x0 + x1, [0] = 0, [a__and](x0, x1) = x0 + x1, [s](x0) = x0 + 1, [a__plus](x0, x1) = x0 + x1, [a__U41](x0, x1, x2) = x1 + x2 + 1, [mark](x0) = x0, [a__U31](x0, x1) = x1, [a__U22](x0) = x0, [a__U21](x0, x1) = x0, [a__U13](x0) = x0, [a__U12](x0, x1) = x0, [a__isNat](x0) = 0, [a__U11](x0, x1, x2) = x0, [tt] = 0 orientation: a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__isNatKind#(V1) a__isNatKind#(s(V1)) = 0 >= 0 = a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__and#(tt(),X) = X >= X = mark#(X) mark#(s(X)) = X + 1 >= X = mark#(X) mark#(isNatKind(X)) = 0 >= 0 = a__isNatKind#(X) mark#(and(X1,X2)) = X1 + X2 >= X2 = a__and#(mark(X1),X2) mark#(and(X1,X2)) = X1 + X2 >= X1 = mark#(X1) a__isNat#(s(V1)) = 0 >= 0 = a__U21#(a__isNatKind(V1),V1) a__U21#(tt(),V1) = 0 >= 0 = a__isNat#(V1) a__isNat#(s(V1)) = 0 >= 0 = a__isNatKind#(V1) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) = 0 >= 0 = a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) = 0 >= 0 = a__isNat#(V2) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__isNatKind#(V1) a__U11#(tt(),V1,V2) = 0 >= 0 = a__isNat#(V1) mark#(U22(X)) = X >= X = mark#(X) mark#(U21(X1,X2)) = X1 >= 0 = a__U21#(mark(X1),X2) mark#(U21(X1,X2)) = X1 >= X1 = mark#(X1) mark#(U13(X)) = X >= X = mark#(X) mark#(isNat(X)) = 0 >= 0 = a__isNat#(X) mark#(U12(X1,X2)) = X1 >= 0 = a__U12#(mark(X1),X2) mark#(U12(X1,X2)) = X1 >= X1 = mark#(X1) mark#(U11(X1,X2,X3)) = X1 >= 0 = a__U11#(mark(X1),X2,X3) mark#(U11(X1,X2,X3)) = X1 >= X1 = mark#(X1) a__U11(tt(),V1,V2) = 0 >= 0 = a__U12(a__isNat(V1),V2) a__U12(tt(),V2) = 0 >= 0 = a__U13(a__isNat(V2)) a__U13(tt()) = 0 >= 0 = tt() a__U21(tt(),V1) = 0 >= 0 = a__U22(a__isNat(V1)) a__U22(tt()) = 0 >= 0 = tt() a__U31(tt(),N) = N >= N = mark(N) a__U41(tt(),M,N) = M + N + 1 >= M + N + 1 = s(a__plus(mark(N),mark(M))) a__and(tt(),X) = X >= X = mark(X) a__isNat(0()) = 0 >= 0 = tt() a__isNat(plus(V1,V2)) = 0 >= 0 = a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) = 0 >= 0 = a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) = 0 >= 0 = tt() a__isNatKind(plus(V1,V2)) = 0 >= 0 = a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) = 0 >= 0 = a__isNatKind(V1) a__plus(N,0()) = N >= N = a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) = M + N + 1 >= M + N + 1 = a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))), M,N) mark(U11(X1,X2,X3)) = X1 >= X1 = a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) = X1 >= X1 = a__U12(mark(X1),X2) mark(isNat(X)) = 0 >= 0 = a__isNat(X) mark(U13(X)) = X >= X = a__U13(mark(X)) mark(U21(X1,X2)) = X1 >= X1 = a__U21(mark(X1),X2) mark(U22(X)) = X >= X = a__U22(mark(X)) mark(U31(X1,X2)) = X2 >= X2 = a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) = X2 + X3 + 1 >= X2 + X3 + 1 = a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) = X1 + X2 >= X1 + X2 = a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) = X1 + X2 >= X1 + X2 = a__and(mark(X1),X2) mark(isNatKind(X)) = 0 >= 0 = a__isNatKind(X) mark(tt()) = 0 >= 0 = tt() mark(s(X)) = X + 1 >= X + 1 = s(mark(X)) mark(0()) = 0 >= 0 = 0() a__U11(X1,X2,X3) = X1 >= X1 = U11(X1,X2,X3) a__U12(X1,X2) = X1 >= X1 = U12(X1,X2) a__isNat(X) = 0 >= 0 = isNat(X) a__U13(X) = X >= X = U13(X) a__U21(X1,X2) = X1 >= X1 = U21(X1,X2) a__U22(X) = X >= X = U22(X) a__U31(X1,X2) = X2 >= X2 = U31(X1,X2) a__U41(X1,X2,X3) = X2 + X3 + 1 >= X2 + X3 + 1 = U41(X1,X2,X3) a__plus(X1,X2) = X1 + X2 >= X1 + X2 = plus(X1,X2) a__and(X1,X2) = X1 + X2 >= X1 + X2 = and(X1,X2) a__isNatKind(X) = 0 >= 0 = isNatKind(X) problem: DPs: a__isNatKind#(plus(V1,V2)) -> a__isNatKind#(V1) a__isNatKind#(s(V1)) -> a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__and#(tt(),X) -> mark#(X) mark#(isNatKind(X)) -> a__isNatKind#(X) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) a__isNat#(s(V1)) -> a__U21#(a__isNatKind(V1),V1) a__U21#(tt(),V1) -> a__isNat#(V1) a__isNat#(s(V1)) -> a__isNatKind#(V1) a__isNat#(plus(V1,V2)) -> a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) -> a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) -> a__isNat#(V2) a__isNat#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) -> a__isNatKind#(V1) a__U11#(tt(),V1,V2) -> a__isNat#(V1) mark#(U22(X)) -> mark#(X) mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2) mark#(U21(X1,X2)) -> mark#(X1) mark#(U13(X)) -> mark#(X) mark#(isNat(X)) -> a__isNat#(X) mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(U12(X1,X2)) -> mark#(X1) mark#(U11(X1,X2,X3)) -> a__U11#(mark(X1),X2,X3) mark#(U11(X1,X2,X3)) -> mark#(X1) TRS: a__U11(tt(),V1,V2) -> a__U12(a__isNat(V1),V2) a__U12(tt(),V2) -> a__U13(a__isNat(V2)) a__U13(tt()) -> tt() a__U21(tt(),V1) -> a__U22(a__isNat(V1)) a__U22(tt()) -> tt() a__U31(tt(),N) -> mark(N) a__U41(tt(),M,N) -> s(a__plus(mark(N),mark(M))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(plus(V1,V2)) -> a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) -> a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) -> tt() a__isNatKind(plus(V1,V2)) -> a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) -> a__isNatKind(V1) a__plus(N,0()) -> a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) -> a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(U13(X)) -> a__U13(mark(X)) mark(U21(X1,X2)) -> a__U21(mark(X1),X2) mark(U22(X)) -> a__U22(mark(X)) mark(U31(X1,X2)) -> a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) -> a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNatKind(X)) -> a__isNatKind(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2,X3) -> U11(X1,X2,X3) a__U12(X1,X2) -> U12(X1,X2) a__isNat(X) -> isNat(X) a__U13(X) -> U13(X) a__U21(X1,X2) -> U21(X1,X2) a__U22(X) -> U22(X) a__U31(X1,X2) -> U31(X1,X2) a__U41(X1,X2,X3) -> U41(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNatKind(X) -> isNatKind(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatKind#](x0) = 0, [a__and#](x0, x1) = x1, [mark#](x0) = x0, [a__U21#](x0, x1) = 0, [a__U12#](x0, x1) = 0, [a__isNat#](x0) = 0, [a__U11#](x0, x1, x2) = 0, [U41](x0, x1, x2) = 0, [U31](x0, x1) = x0 + x1, [U22](x0) = x0, [U21](x0, x1) = x0, [U13](x0) = x0, [U12](x0, x1) = x0, [U11](x0, x1, x2) = x0, [and](x0, x1) = x0 + x1, [isNat](x0) = 1, [isNatKind](x0) = 0, [a__isNatKind](x0) = 1, [plus](x0, x1) = x0 + 1, [0] = 1, [a__and](x0, x1) = x0 + x1, [s](x0) = 0, [a__plus](x0, x1) = x0 + 1, [a__U41](x0, x1, x2) = 0, [mark](x0) = x0 + 1, [a__U31](x0, x1) = x0 + x1, [a__U22](x0) = x0, [a__U21](x0, x1) = x0, [a__U13](x0) = x0, [a__U12](x0, x1) = x0, [a__isNat](x0) = 1, [a__U11](x0, x1, x2) = x0, [tt] = 1 orientation: a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__isNatKind#(V1) a__isNatKind#(s(V1)) = 0 >= 0 = a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__and#(tt(),X) = X >= X = mark#(X) mark#(isNatKind(X)) = 0 >= 0 = a__isNatKind#(X) mark#(and(X1,X2)) = X1 + X2 >= X2 = a__and#(mark(X1),X2) mark#(and(X1,X2)) = X1 + X2 >= X1 = mark#(X1) a__isNat#(s(V1)) = 0 >= 0 = a__U21#(a__isNatKind(V1),V1) a__U21#(tt(),V1) = 0 >= 0 = a__isNat#(V1) a__isNat#(s(V1)) = 0 >= 0 = a__isNatKind#(V1) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) = 0 >= 0 = a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) = 0 >= 0 = a__isNat#(V2) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__isNatKind#(V1) a__U11#(tt(),V1,V2) = 0 >= 0 = a__isNat#(V1) mark#(U22(X)) = X >= X = mark#(X) mark#(U21(X1,X2)) = X1 >= 0 = a__U21#(mark(X1),X2) mark#(U21(X1,X2)) = X1 >= X1 = mark#(X1) mark#(U13(X)) = X >= X = mark#(X) mark#(isNat(X)) = 1 >= 0 = a__isNat#(X) mark#(U12(X1,X2)) = X1 >= 0 = a__U12#(mark(X1),X2) mark#(U12(X1,X2)) = X1 >= X1 = mark#(X1) mark#(U11(X1,X2,X3)) = X1 >= 0 = a__U11#(mark(X1),X2,X3) mark#(U11(X1,X2,X3)) = X1 >= X1 = mark#(X1) a__U11(tt(),V1,V2) = 1 >= 1 = a__U12(a__isNat(V1),V2) a__U12(tt(),V2) = 1 >= 1 = a__U13(a__isNat(V2)) a__U13(tt()) = 1 >= 1 = tt() a__U21(tt(),V1) = 1 >= 1 = a__U22(a__isNat(V1)) a__U22(tt()) = 1 >= 1 = tt() a__U31(tt(),N) = N + 1 >= N + 1 = mark(N) a__U41(tt(),M,N) = 0 >= 0 = s(a__plus(mark(N),mark(M))) a__and(tt(),X) = X + 1 >= X + 1 = mark(X) a__isNat(0()) = 1 >= 1 = tt() a__isNat(plus(V1,V2)) = 1 >= 1 = a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) = 1 >= 1 = a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) = 1 >= 1 = tt() a__isNatKind(plus(V1,V2)) = 1 >= 1 = a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) = 1 >= 1 = a__isNatKind(V1) a__plus(N,0()) = N + 1 >= N + 1 = a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) = N + 1 >= 0 = a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))), M,N) mark(U11(X1,X2,X3)) = X1 + 1 >= X1 + 1 = a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) = X1 + 1 >= X1 + 1 = a__U12(mark(X1),X2) mark(isNat(X)) = 2 >= 1 = a__isNat(X) mark(U13(X)) = X + 1 >= X + 1 = a__U13(mark(X)) mark(U21(X1,X2)) = X1 + 1 >= X1 + 1 = a__U21(mark(X1),X2) mark(U22(X)) = X + 1 >= X + 1 = a__U22(mark(X)) mark(U31(X1,X2)) = X1 + X2 + 1 >= X1 + X2 + 1 = a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) = 1 >= 0 = a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) = X1 + 2 >= X1 + 2 = a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) = X1 + X2 + 1 >= X1 + X2 + 1 = a__and(mark(X1),X2) mark(isNatKind(X)) = 1 >= 1 = a__isNatKind(X) mark(tt()) = 2 >= 1 = tt() mark(s(X)) = 1 >= 0 = s(mark(X)) mark(0()) = 2 >= 1 = 0() a__U11(X1,X2,X3) = X1 >= X1 = U11(X1,X2,X3) a__U12(X1,X2) = X1 >= X1 = U12(X1,X2) a__isNat(X) = 1 >= 1 = isNat(X) a__U13(X) = X >= X = U13(X) a__U21(X1,X2) = X1 >= X1 = U21(X1,X2) a__U22(X) = X >= X = U22(X) a__U31(X1,X2) = X1 + X2 >= X1 + X2 = U31(X1,X2) a__U41(X1,X2,X3) = 0 >= 0 = U41(X1,X2,X3) a__plus(X1,X2) = X1 + 1 >= X1 + 1 = plus(X1,X2) a__and(X1,X2) = X1 + X2 >= X1 + X2 = and(X1,X2) a__isNatKind(X) = 1 >= 0 = isNatKind(X) problem: DPs: a__isNatKind#(plus(V1,V2)) -> a__isNatKind#(V1) a__isNatKind#(s(V1)) -> a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__and#(tt(),X) -> mark#(X) mark#(isNatKind(X)) -> a__isNatKind#(X) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) a__isNat#(s(V1)) -> a__U21#(a__isNatKind(V1),V1) a__U21#(tt(),V1) -> a__isNat#(V1) a__isNat#(s(V1)) -> a__isNatKind#(V1) a__isNat#(plus(V1,V2)) -> a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) -> a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) -> a__isNat#(V2) a__isNat#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) -> a__isNatKind#(V1) a__U11#(tt(),V1,V2) -> a__isNat#(V1) mark#(U22(X)) -> mark#(X) mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2) mark#(U21(X1,X2)) -> mark#(X1) mark#(U13(X)) -> mark#(X) mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(U12(X1,X2)) -> mark#(X1) mark#(U11(X1,X2,X3)) -> a__U11#(mark(X1),X2,X3) mark#(U11(X1,X2,X3)) -> mark#(X1) TRS: a__U11(tt(),V1,V2) -> a__U12(a__isNat(V1),V2) a__U12(tt(),V2) -> a__U13(a__isNat(V2)) a__U13(tt()) -> tt() a__U21(tt(),V1) -> a__U22(a__isNat(V1)) a__U22(tt()) -> tt() a__U31(tt(),N) -> mark(N) a__U41(tt(),M,N) -> s(a__plus(mark(N),mark(M))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(plus(V1,V2)) -> a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) -> a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) -> tt() a__isNatKind(plus(V1,V2)) -> a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) -> a__isNatKind(V1) a__plus(N,0()) -> a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) -> a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(U13(X)) -> a__U13(mark(X)) mark(U21(X1,X2)) -> a__U21(mark(X1),X2) mark(U22(X)) -> a__U22(mark(X)) mark(U31(X1,X2)) -> a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) -> a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNatKind(X)) -> a__isNatKind(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2,X3) -> U11(X1,X2,X3) a__U12(X1,X2) -> U12(X1,X2) a__isNat(X) -> isNat(X) a__U13(X) -> U13(X) a__U21(X1,X2) -> U21(X1,X2) a__U22(X) -> U22(X) a__U31(X1,X2) -> U31(X1,X2) a__U41(X1,X2,X3) -> U41(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNatKind(X) -> isNatKind(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatKind#](x0) = 0, [a__and#](x0, x1) = x1, [mark#](x0) = x0, [a__U21#](x0, x1) = 0, [a__U12#](x0, x1) = 0, [a__isNat#](x0) = 0, [a__U11#](x0, x1, x2) = 0, [U41](x0, x1, x2) = x1 + x2 + 1, [U31](x0, x1) = x1, [U22](x0) = x0, [U21](x0, x1) = x0 + x1, [U13](x0) = x0, [U12](x0, x1) = x0 + x1, [U11](x0, x1, x2) = x0 + x1 + x2 + 1, [and](x0, x1) = x0 + x1, [isNat](x0) = x0, [isNatKind](x0) = 0, [a__isNatKind](x0) = 0, [plus](x0, x1) = x0 + x1 + 1, [0] = 0, [a__and](x0, x1) = x0 + x1, [s](x0) = x0, [a__plus](x0, x1) = x0 + x1 + 1, [a__U41](x0, x1, x2) = x1 + x2 + 1, [mark](x0) = x0, [a__U31](x0, x1) = x1, [a__U22](x0) = x0, [a__U21](x0, x1) = x0 + x1, [a__U13](x0) = x0, [a__U12](x0, x1) = x0 + x1, [a__isNat](x0) = x0, [a__U11](x0, x1, x2) = x0 + x1 + x2 + 1, [tt] = 0 orientation: a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__isNatKind#(V1) a__isNatKind#(s(V1)) = 0 >= 0 = a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__and#(tt(),X) = X >= X = mark#(X) mark#(isNatKind(X)) = 0 >= 0 = a__isNatKind#(X) mark#(and(X1,X2)) = X1 + X2 >= X2 = a__and#(mark(X1),X2) mark#(and(X1,X2)) = X1 + X2 >= X1 = mark#(X1) a__isNat#(s(V1)) = 0 >= 0 = a__U21#(a__isNatKind(V1),V1) a__U21#(tt(),V1) = 0 >= 0 = a__isNat#(V1) a__isNat#(s(V1)) = 0 >= 0 = a__isNatKind#(V1) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) = 0 >= 0 = a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) = 0 >= 0 = a__isNat#(V2) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__isNatKind#(V1) a__U11#(tt(),V1,V2) = 0 >= 0 = a__isNat#(V1) mark#(U22(X)) = X >= X = mark#(X) mark#(U21(X1,X2)) = X1 + X2 >= 0 = a__U21#(mark(X1),X2) mark#(U21(X1,X2)) = X1 + X2 >= X1 = mark#(X1) mark#(U13(X)) = X >= X = mark#(X) mark#(U12(X1,X2)) = X1 + X2 >= 0 = a__U12#(mark(X1),X2) mark#(U12(X1,X2)) = X1 + X2 >= X1 = mark#(X1) mark#(U11(X1,X2,X3)) = X1 + X2 + X3 + 1 >= 0 = a__U11#(mark(X1),X2,X3) mark#(U11(X1,X2,X3)) = X1 + X2 + X3 + 1 >= X1 = mark#(X1) a__U11(tt(),V1,V2) = V1 + V2 + 1 >= V1 + V2 = a__U12(a__isNat(V1),V2) a__U12(tt(),V2) = V2 >= V2 = a__U13(a__isNat(V2)) a__U13(tt()) = 0 >= 0 = tt() a__U21(tt(),V1) = V1 >= V1 = a__U22(a__isNat(V1)) a__U22(tt()) = 0 >= 0 = tt() a__U31(tt(),N) = N >= N = mark(N) a__U41(tt(),M,N) = M + N + 1 >= M + N + 1 = s(a__plus(mark(N),mark(M))) a__and(tt(),X) = X >= X = mark(X) a__isNat(0()) = 0 >= 0 = tt() a__isNat(plus(V1,V2)) = V1 + V2 + 1 >= V1 + V2 + 1 = a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) = V1 >= V1 = a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) = 0 >= 0 = tt() a__isNatKind(plus(V1,V2)) = 0 >= 0 = a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) = 0 >= 0 = a__isNatKind(V1) a__plus(N,0()) = N + 1 >= N = a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) = M + N + 1 >= M + N + 1 = a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))), M,N) mark(U11(X1,X2,X3)) = X1 + X2 + X3 + 1 >= X1 + X2 + X3 + 1 = a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) = X1 + X2 >= X1 + X2 = a__U12(mark(X1),X2) mark(isNat(X)) = X >= X = a__isNat(X) mark(U13(X)) = X >= X = a__U13(mark(X)) mark(U21(X1,X2)) = X1 + X2 >= X1 + X2 = a__U21(mark(X1),X2) mark(U22(X)) = X >= X = a__U22(mark(X)) mark(U31(X1,X2)) = X2 >= X2 = a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) = X2 + X3 + 1 >= X2 + X3 + 1 = a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) = X1 + X2 + 1 >= X1 + X2 + 1 = a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) = X1 + X2 >= X1 + X2 = a__and(mark(X1),X2) mark(isNatKind(X)) = 0 >= 0 = a__isNatKind(X) mark(tt()) = 0 >= 0 = tt() mark(s(X)) = X >= X = s(mark(X)) mark(0()) = 0 >= 0 = 0() a__U11(X1,X2,X3) = X1 + X2 + X3 + 1 >= X1 + X2 + X3 + 1 = U11(X1,X2,X3) a__U12(X1,X2) = X1 + X2 >= X1 + X2 = U12(X1,X2) a__isNat(X) = X >= X = isNat(X) a__U13(X) = X >= X = U13(X) a__U21(X1,X2) = X1 + X2 >= X1 + X2 = U21(X1,X2) a__U22(X) = X >= X = U22(X) a__U31(X1,X2) = X2 >= X2 = U31(X1,X2) a__U41(X1,X2,X3) = X2 + X3 + 1 >= X2 + X3 + 1 = U41(X1,X2,X3) a__plus(X1,X2) = X1 + X2 + 1 >= X1 + X2 + 1 = plus(X1,X2) a__and(X1,X2) = X1 + X2 >= X1 + X2 = and(X1,X2) a__isNatKind(X) = 0 >= 0 = isNatKind(X) problem: DPs: a__isNatKind#(plus(V1,V2)) -> a__isNatKind#(V1) a__isNatKind#(s(V1)) -> a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__and#(tt(),X) -> mark#(X) mark#(isNatKind(X)) -> a__isNatKind#(X) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) a__isNat#(s(V1)) -> a__U21#(a__isNatKind(V1),V1) a__U21#(tt(),V1) -> a__isNat#(V1) a__isNat#(s(V1)) -> a__isNatKind#(V1) a__isNat#(plus(V1,V2)) -> a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) -> a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) -> a__isNat#(V2) a__isNat#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) -> a__isNatKind#(V1) a__U11#(tt(),V1,V2) -> a__isNat#(V1) mark#(U22(X)) -> mark#(X) mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2) mark#(U21(X1,X2)) -> mark#(X1) mark#(U13(X)) -> mark#(X) mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(U12(X1,X2)) -> mark#(X1) TRS: a__U11(tt(),V1,V2) -> a__U12(a__isNat(V1),V2) a__U12(tt(),V2) -> a__U13(a__isNat(V2)) a__U13(tt()) -> tt() a__U21(tt(),V1) -> a__U22(a__isNat(V1)) a__U22(tt()) -> tt() a__U31(tt(),N) -> mark(N) a__U41(tt(),M,N) -> s(a__plus(mark(N),mark(M))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(plus(V1,V2)) -> a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) -> a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) -> tt() a__isNatKind(plus(V1,V2)) -> a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) -> a__isNatKind(V1) a__plus(N,0()) -> a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) -> a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(U13(X)) -> a__U13(mark(X)) mark(U21(X1,X2)) -> a__U21(mark(X1),X2) mark(U22(X)) -> a__U22(mark(X)) mark(U31(X1,X2)) -> a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) -> a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNatKind(X)) -> a__isNatKind(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2,X3) -> U11(X1,X2,X3) a__U12(X1,X2) -> U12(X1,X2) a__isNat(X) -> isNat(X) a__U13(X) -> U13(X) a__U21(X1,X2) -> U21(X1,X2) a__U22(X) -> U22(X) a__U31(X1,X2) -> U31(X1,X2) a__U41(X1,X2,X3) -> U41(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNatKind(X) -> isNatKind(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatKind#](x0) = 0, [a__and#](x0, x1) = x1, [mark#](x0) = x0, [a__U21#](x0, x1) = x1, [a__U12#](x0, x1) = x1, [a__isNat#](x0) = x0, [a__U11#](x0, x1, x2) = x1 + x2, [U41](x0, x1, x2) = x1 + x2 + 1, [U31](x0, x1) = x1, [U22](x0) = x0, [U21](x0, x1) = x0 + x1, [U13](x0) = x0, [U12](x0, x1) = x0 + x1, [U11](x0, x1, x2) = x1 + x2, [and](x0, x1) = x0 + x1, [isNat](x0) = x0, [isNatKind](x0) = 0, [a__isNatKind](x0) = 0, [plus](x0, x1) = x0 + x1, [0] = 0, [a__and](x0, x1) = x0 + x1, [s](x0) = x0 + 1, [a__plus](x0, x1) = x0 + x1, [a__U41](x0, x1, x2) = x1 + x2 + 1, [mark](x0) = x0, [a__U31](x0, x1) = x1, [a__U22](x0) = x0, [a__U21](x0, x1) = x0 + x1, [a__U13](x0) = x0, [a__U12](x0, x1) = x0 + x1, [a__isNat](x0) = x0, [a__U11](x0, x1, x2) = x1 + x2, [tt] = 0 orientation: a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__isNatKind#(V1) a__isNatKind#(s(V1)) = 0 >= 0 = a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__and#(tt(),X) = X >= X = mark#(X) mark#(isNatKind(X)) = 0 >= 0 = a__isNatKind#(X) mark#(and(X1,X2)) = X1 + X2 >= X2 = a__and#(mark(X1),X2) mark#(and(X1,X2)) = X1 + X2 >= X1 = mark#(X1) a__isNat#(s(V1)) = V1 + 1 >= V1 = a__U21#(a__isNatKind(V1),V1) a__U21#(tt(),V1) = V1 >= V1 = a__isNat#(V1) a__isNat#(s(V1)) = V1 + 1 >= 0 = a__isNatKind#(V1) a__isNat#(plus(V1,V2)) = V1 + V2 >= V1 + V2 = a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) = V1 + V2 >= V2 = a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) = V2 >= V2 = a__isNat#(V2) a__isNat#(plus(V1,V2)) = V1 + V2 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) = V1 + V2 >= 0 = a__isNatKind#(V1) a__U11#(tt(),V1,V2) = V1 + V2 >= V1 = a__isNat#(V1) mark#(U22(X)) = X >= X = mark#(X) mark#(U21(X1,X2)) = X1 + X2 >= X2 = a__U21#(mark(X1),X2) mark#(U21(X1,X2)) = X1 + X2 >= X1 = mark#(X1) mark#(U13(X)) = X >= X = mark#(X) mark#(U12(X1,X2)) = X1 + X2 >= X2 = a__U12#(mark(X1),X2) mark#(U12(X1,X2)) = X1 + X2 >= X1 = mark#(X1) a__U11(tt(),V1,V2) = V1 + V2 >= V1 + V2 = a__U12(a__isNat(V1),V2) a__U12(tt(),V2) = V2 >= V2 = a__U13(a__isNat(V2)) a__U13(tt()) = 0 >= 0 = tt() a__U21(tt(),V1) = V1 >= V1 = a__U22(a__isNat(V1)) a__U22(tt()) = 0 >= 0 = tt() a__U31(tt(),N) = N >= N = mark(N) a__U41(tt(),M,N) = M + N + 1 >= M + N + 1 = s(a__plus(mark(N),mark(M))) a__and(tt(),X) = X >= X = mark(X) a__isNat(0()) = 0 >= 0 = tt() a__isNat(plus(V1,V2)) = V1 + V2 >= V1 + V2 = a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) = V1 + 1 >= V1 = a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) = 0 >= 0 = tt() a__isNatKind(plus(V1,V2)) = 0 >= 0 = a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) = 0 >= 0 = a__isNatKind(V1) a__plus(N,0()) = N >= N = a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) = M + N + 1 >= M + N + 1 = a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))), M,N) mark(U11(X1,X2,X3)) = X2 + X3 >= X2 + X3 = a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) = X1 + X2 >= X1 + X2 = a__U12(mark(X1),X2) mark(isNat(X)) = X >= X = a__isNat(X) mark(U13(X)) = X >= X = a__U13(mark(X)) mark(U21(X1,X2)) = X1 + X2 >= X1 + X2 = a__U21(mark(X1),X2) mark(U22(X)) = X >= X = a__U22(mark(X)) mark(U31(X1,X2)) = X2 >= X2 = a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) = X2 + X3 + 1 >= X2 + X3 + 1 = a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) = X1 + X2 >= X1 + X2 = a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) = X1 + X2 >= X1 + X2 = a__and(mark(X1),X2) mark(isNatKind(X)) = 0 >= 0 = a__isNatKind(X) mark(tt()) = 0 >= 0 = tt() mark(s(X)) = X + 1 >= X + 1 = s(mark(X)) mark(0()) = 0 >= 0 = 0() a__U11(X1,X2,X3) = X2 + X3 >= X2 + X3 = U11(X1,X2,X3) a__U12(X1,X2) = X1 + X2 >= X1 + X2 = U12(X1,X2) a__isNat(X) = X >= X = isNat(X) a__U13(X) = X >= X = U13(X) a__U21(X1,X2) = X1 + X2 >= X1 + X2 = U21(X1,X2) a__U22(X) = X >= X = U22(X) a__U31(X1,X2) = X2 >= X2 = U31(X1,X2) a__U41(X1,X2,X3) = X2 + X3 + 1 >= X2 + X3 + 1 = U41(X1,X2,X3) a__plus(X1,X2) = X1 + X2 >= X1 + X2 = plus(X1,X2) a__and(X1,X2) = X1 + X2 >= X1 + X2 = and(X1,X2) a__isNatKind(X) = 0 >= 0 = isNatKind(X) problem: DPs: a__isNatKind#(plus(V1,V2)) -> a__isNatKind#(V1) a__isNatKind#(s(V1)) -> a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__and#(tt(),X) -> mark#(X) mark#(isNatKind(X)) -> a__isNatKind#(X) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) a__U21#(tt(),V1) -> a__isNat#(V1) a__isNat#(plus(V1,V2)) -> a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) -> a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) -> a__isNat#(V2) a__isNat#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) -> a__isNatKind#(V1) a__U11#(tt(),V1,V2) -> a__isNat#(V1) mark#(U22(X)) -> mark#(X) mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2) mark#(U21(X1,X2)) -> mark#(X1) mark#(U13(X)) -> mark#(X) mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(U12(X1,X2)) -> mark#(X1) TRS: a__U11(tt(),V1,V2) -> a__U12(a__isNat(V1),V2) a__U12(tt(),V2) -> a__U13(a__isNat(V2)) a__U13(tt()) -> tt() a__U21(tt(),V1) -> a__U22(a__isNat(V1)) a__U22(tt()) -> tt() a__U31(tt(),N) -> mark(N) a__U41(tt(),M,N) -> s(a__plus(mark(N),mark(M))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(plus(V1,V2)) -> a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) -> a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) -> tt() a__isNatKind(plus(V1,V2)) -> a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) -> a__isNatKind(V1) a__plus(N,0()) -> a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) -> a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(U13(X)) -> a__U13(mark(X)) mark(U21(X1,X2)) -> a__U21(mark(X1),X2) mark(U22(X)) -> a__U22(mark(X)) mark(U31(X1,X2)) -> a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) -> a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNatKind(X)) -> a__isNatKind(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2,X3) -> U11(X1,X2,X3) a__U12(X1,X2) -> U12(X1,X2) a__isNat(X) -> isNat(X) a__U13(X) -> U13(X) a__U21(X1,X2) -> U21(X1,X2) a__U22(X) -> U22(X) a__U31(X1,X2) -> U31(X1,X2) a__U41(X1,X2,X3) -> U41(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNatKind(X) -> isNatKind(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatKind#](x0) = 0, [a__and#](x0, x1) = x1, [mark#](x0) = x0, [a__U21#](x0, x1) = x1, [a__U12#](x0, x1) = 0, [a__isNat#](x0) = 0, [a__U11#](x0, x1, x2) = 0, [U41](x0, x1, x2) = x1 + x2 + 1, [U31](x0, x1) = x1, [U22](x0) = x0, [U21](x0, x1) = x0 + x1 + 1, [U13](x0) = x0, [U12](x0, x1) = x0 + x1, [U11](x0, x1, x2) = x1 + x2, [and](x0, x1) = x0 + x1, [isNat](x0) = x0, [isNatKind](x0) = 0, [a__isNatKind](x0) = 0, [plus](x0, x1) = x0 + x1, [0] = 0, [a__and](x0, x1) = x0 + x1, [s](x0) = x0 + 1, [a__plus](x0, x1) = x0 + x1, [a__U41](x0, x1, x2) = x1 + x2 + 1, [mark](x0) = x0, [a__U31](x0, x1) = x1, [a__U22](x0) = x0, [a__U21](x0, x1) = x0 + x1 + 1, [a__U13](x0) = x0, [a__U12](x0, x1) = x0 + x1, [a__isNat](x0) = x0, [a__U11](x0, x1, x2) = x1 + x2, [tt] = 0 orientation: a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__isNatKind#(V1) a__isNatKind#(s(V1)) = 0 >= 0 = a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__and#(tt(),X) = X >= X = mark#(X) mark#(isNatKind(X)) = 0 >= 0 = a__isNatKind#(X) mark#(and(X1,X2)) = X1 + X2 >= X2 = a__and#(mark(X1),X2) mark#(and(X1,X2)) = X1 + X2 >= X1 = mark#(X1) a__U21#(tt(),V1) = V1 >= 0 = a__isNat#(V1) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) = 0 >= 0 = a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) = 0 >= 0 = a__isNat#(V2) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__isNatKind#(V1) a__U11#(tt(),V1,V2) = 0 >= 0 = a__isNat#(V1) mark#(U22(X)) = X >= X = mark#(X) mark#(U21(X1,X2)) = X1 + X2 + 1 >= X2 = a__U21#(mark(X1),X2) mark#(U21(X1,X2)) = X1 + X2 + 1 >= X1 = mark#(X1) mark#(U13(X)) = X >= X = mark#(X) mark#(U12(X1,X2)) = X1 + X2 >= 0 = a__U12#(mark(X1),X2) mark#(U12(X1,X2)) = X1 + X2 >= X1 = mark#(X1) a__U11(tt(),V1,V2) = V1 + V2 >= V1 + V2 = a__U12(a__isNat(V1),V2) a__U12(tt(),V2) = V2 >= V2 = a__U13(a__isNat(V2)) a__U13(tt()) = 0 >= 0 = tt() a__U21(tt(),V1) = V1 + 1 >= V1 = a__U22(a__isNat(V1)) a__U22(tt()) = 0 >= 0 = tt() a__U31(tt(),N) = N >= N = mark(N) a__U41(tt(),M,N) = M + N + 1 >= M + N + 1 = s(a__plus(mark(N),mark(M))) a__and(tt(),X) = X >= X = mark(X) a__isNat(0()) = 0 >= 0 = tt() a__isNat(plus(V1,V2)) = V1 + V2 >= V1 + V2 = a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) = V1 + 1 >= V1 + 1 = a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) = 0 >= 0 = tt() a__isNatKind(plus(V1,V2)) = 0 >= 0 = a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) = 0 >= 0 = a__isNatKind(V1) a__plus(N,0()) = N >= N = a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) = M + N + 1 >= M + N + 1 = a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))), M,N) mark(U11(X1,X2,X3)) = X2 + X3 >= X2 + X3 = a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) = X1 + X2 >= X1 + X2 = a__U12(mark(X1),X2) mark(isNat(X)) = X >= X = a__isNat(X) mark(U13(X)) = X >= X = a__U13(mark(X)) mark(U21(X1,X2)) = X1 + X2 + 1 >= X1 + X2 + 1 = a__U21(mark(X1),X2) mark(U22(X)) = X >= X = a__U22(mark(X)) mark(U31(X1,X2)) = X2 >= X2 = a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) = X2 + X3 + 1 >= X2 + X3 + 1 = a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) = X1 + X2 >= X1 + X2 = a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) = X1 + X2 >= X1 + X2 = a__and(mark(X1),X2) mark(isNatKind(X)) = 0 >= 0 = a__isNatKind(X) mark(tt()) = 0 >= 0 = tt() mark(s(X)) = X + 1 >= X + 1 = s(mark(X)) mark(0()) = 0 >= 0 = 0() a__U11(X1,X2,X3) = X2 + X3 >= X2 + X3 = U11(X1,X2,X3) a__U12(X1,X2) = X1 + X2 >= X1 + X2 = U12(X1,X2) a__isNat(X) = X >= X = isNat(X) a__U13(X) = X >= X = U13(X) a__U21(X1,X2) = X1 + X2 + 1 >= X1 + X2 + 1 = U21(X1,X2) a__U22(X) = X >= X = U22(X) a__U31(X1,X2) = X2 >= X2 = U31(X1,X2) a__U41(X1,X2,X3) = X2 + X3 + 1 >= X2 + X3 + 1 = U41(X1,X2,X3) a__plus(X1,X2) = X1 + X2 >= X1 + X2 = plus(X1,X2) a__and(X1,X2) = X1 + X2 >= X1 + X2 = and(X1,X2) a__isNatKind(X) = 0 >= 0 = isNatKind(X) problem: DPs: a__isNatKind#(plus(V1,V2)) -> a__isNatKind#(V1) a__isNatKind#(s(V1)) -> a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__and#(tt(),X) -> mark#(X) mark#(isNatKind(X)) -> a__isNatKind#(X) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) a__U21#(tt(),V1) -> a__isNat#(V1) a__isNat#(plus(V1,V2)) -> a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) -> a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) -> a__isNat#(V2) a__isNat#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) -> a__isNatKind#(V1) a__U11#(tt(),V1,V2) -> a__isNat#(V1) mark#(U22(X)) -> mark#(X) mark#(U13(X)) -> mark#(X) mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(U12(X1,X2)) -> mark#(X1) TRS: a__U11(tt(),V1,V2) -> a__U12(a__isNat(V1),V2) a__U12(tt(),V2) -> a__U13(a__isNat(V2)) a__U13(tt()) -> tt() a__U21(tt(),V1) -> a__U22(a__isNat(V1)) a__U22(tt()) -> tt() a__U31(tt(),N) -> mark(N) a__U41(tt(),M,N) -> s(a__plus(mark(N),mark(M))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(plus(V1,V2)) -> a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) -> a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) -> tt() a__isNatKind(plus(V1,V2)) -> a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) -> a__isNatKind(V1) a__plus(N,0()) -> a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) -> a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(U13(X)) -> a__U13(mark(X)) mark(U21(X1,X2)) -> a__U21(mark(X1),X2) mark(U22(X)) -> a__U22(mark(X)) mark(U31(X1,X2)) -> a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) -> a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNatKind(X)) -> a__isNatKind(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2,X3) -> U11(X1,X2,X3) a__U12(X1,X2) -> U12(X1,X2) a__isNat(X) -> isNat(X) a__U13(X) -> U13(X) a__U21(X1,X2) -> U21(X1,X2) a__U22(X) -> U22(X) a__U31(X1,X2) -> U31(X1,X2) a__U41(X1,X2,X3) -> U41(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNatKind(X) -> isNatKind(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatKind#](x0) = 0, [a__and#](x0, x1) = 0, [mark#](x0) = 0, [a__U21#](x0, x1) = 1, [a__U12#](x0, x1) = 0, [a__isNat#](x0) = 0, [a__U11#](x0, x1, x2) = 0, [U41](x0, x1, x2) = 0, [U31](x0, x1) = 0, [U22](x0) = 0, [U21](x0, x1) = 0, [U13](x0) = 0, [U12](x0, x1) = 0, [U11](x0, x1, x2) = 0, [and](x0, x1) = 0, [isNat](x0) = 0, [isNatKind](x0) = 0, [a__isNatKind](x0) = 0, [plus](x0, x1) = 0, [0] = 0, [a__and](x0, x1) = 0, [s](x0) = 0, [a__plus](x0, x1) = 0, [a__U41](x0, x1, x2) = 0, [mark](x0) = 0, [a__U31](x0, x1) = 0, [a__U22](x0) = 0, [a__U21](x0, x1) = 0, [a__U13](x0) = 0, [a__U12](x0, x1) = 0, [a__isNat](x0) = 0, [a__U11](x0, x1, x2) = 0, [tt] = 0 orientation: a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__isNatKind#(V1) a__isNatKind#(s(V1)) = 0 >= 0 = a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__and#(tt(),X) = 0 >= 0 = mark#(X) mark#(isNatKind(X)) = 0 >= 0 = a__isNatKind#(X) mark#(and(X1,X2)) = 0 >= 0 = a__and#(mark(X1),X2) mark#(and(X1,X2)) = 0 >= 0 = mark#(X1) a__U21#(tt(),V1) = 1 >= 0 = a__isNat#(V1) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) = 0 >= 0 = a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) = 0 >= 0 = a__isNat#(V2) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__isNatKind#(V1) a__U11#(tt(),V1,V2) = 0 >= 0 = a__isNat#(V1) mark#(U22(X)) = 0 >= 0 = mark#(X) mark#(U13(X)) = 0 >= 0 = mark#(X) mark#(U12(X1,X2)) = 0 >= 0 = a__U12#(mark(X1),X2) mark#(U12(X1,X2)) = 0 >= 0 = mark#(X1) a__U11(tt(),V1,V2) = 0 >= 0 = a__U12(a__isNat(V1),V2) a__U12(tt(),V2) = 0 >= 0 = a__U13(a__isNat(V2)) a__U13(tt()) = 0 >= 0 = tt() a__U21(tt(),V1) = 0 >= 0 = a__U22(a__isNat(V1)) a__U22(tt()) = 0 >= 0 = tt() a__U31(tt(),N) = 0 >= 0 = mark(N) a__U41(tt(),M,N) = 0 >= 0 = s(a__plus(mark(N),mark(M))) a__and(tt(),X) = 0 >= 0 = mark(X) a__isNat(0()) = 0 >= 0 = tt() a__isNat(plus(V1,V2)) = 0 >= 0 = a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) = 0 >= 0 = a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) = 0 >= 0 = tt() a__isNatKind(plus(V1,V2)) = 0 >= 0 = a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) = 0 >= 0 = a__isNatKind(V1) a__plus(N,0()) = 0 >= 0 = a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) = 0 >= 0 = a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))), M,N) mark(U11(X1,X2,X3)) = 0 >= 0 = a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) = 0 >= 0 = a__U12(mark(X1),X2) mark(isNat(X)) = 0 >= 0 = a__isNat(X) mark(U13(X)) = 0 >= 0 = a__U13(mark(X)) mark(U21(X1,X2)) = 0 >= 0 = a__U21(mark(X1),X2) mark(U22(X)) = 0 >= 0 = a__U22(mark(X)) mark(U31(X1,X2)) = 0 >= 0 = a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) = 0 >= 0 = a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) = 0 >= 0 = a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) = 0 >= 0 = a__and(mark(X1),X2) mark(isNatKind(X)) = 0 >= 0 = a__isNatKind(X) mark(tt()) = 0 >= 0 = tt() mark(s(X)) = 0 >= 0 = s(mark(X)) mark(0()) = 0 >= 0 = 0() a__U11(X1,X2,X3) = 0 >= 0 = U11(X1,X2,X3) a__U12(X1,X2) = 0 >= 0 = U12(X1,X2) a__isNat(X) = 0 >= 0 = isNat(X) a__U13(X) = 0 >= 0 = U13(X) a__U21(X1,X2) = 0 >= 0 = U21(X1,X2) a__U22(X) = 0 >= 0 = U22(X) a__U31(X1,X2) = 0 >= 0 = U31(X1,X2) a__U41(X1,X2,X3) = 0 >= 0 = U41(X1,X2,X3) a__plus(X1,X2) = 0 >= 0 = plus(X1,X2) a__and(X1,X2) = 0 >= 0 = and(X1,X2) a__isNatKind(X) = 0 >= 0 = isNatKind(X) problem: DPs: a__isNatKind#(plus(V1,V2)) -> a__isNatKind#(V1) a__isNatKind#(s(V1)) -> a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__and#(tt(),X) -> mark#(X) mark#(isNatKind(X)) -> a__isNatKind#(X) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) a__isNat#(plus(V1,V2)) -> a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) -> a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) -> a__isNat#(V2) a__isNat#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) -> a__isNatKind#(V1) a__U11#(tt(),V1,V2) -> a__isNat#(V1) mark#(U22(X)) -> mark#(X) mark#(U13(X)) -> mark#(X) mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(U12(X1,X2)) -> mark#(X1) TRS: a__U11(tt(),V1,V2) -> a__U12(a__isNat(V1),V2) a__U12(tt(),V2) -> a__U13(a__isNat(V2)) a__U13(tt()) -> tt() a__U21(tt(),V1) -> a__U22(a__isNat(V1)) a__U22(tt()) -> tt() a__U31(tt(),N) -> mark(N) a__U41(tt(),M,N) -> s(a__plus(mark(N),mark(M))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(plus(V1,V2)) -> a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) -> a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) -> tt() a__isNatKind(plus(V1,V2)) -> a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) -> a__isNatKind(V1) a__plus(N,0()) -> a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) -> a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(U13(X)) -> a__U13(mark(X)) mark(U21(X1,X2)) -> a__U21(mark(X1),X2) mark(U22(X)) -> a__U22(mark(X)) mark(U31(X1,X2)) -> a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) -> a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNatKind(X)) -> a__isNatKind(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2,X3) -> U11(X1,X2,X3) a__U12(X1,X2) -> U12(X1,X2) a__isNat(X) -> isNat(X) a__U13(X) -> U13(X) a__U21(X1,X2) -> U21(X1,X2) a__U22(X) -> U22(X) a__U31(X1,X2) -> U31(X1,X2) a__U41(X1,X2,X3) -> U41(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNatKind(X) -> isNatKind(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatKind#](x0) = x0 + 1, [a__and#](x0, x1) = x0 + x1 + 1, [mark#](x0) = x0 + 1, [a__U12#](x0, x1) = x1 + 1, [a__isNat#](x0) = x0 + 1, [a__U11#](x0, x1, x2) = x1 + x2 + 1, [U41](x0, x1, x2) = x1 + x2, [U31](x0, x1) = x1 + 1, [U22](x0) = x0, [U21](x0, x1) = x1, [U13](x0) = x0, [U12](x0, x1) = x0 + x1, [U11](x0, x1, x2) = x1 + x2, [and](x0, x1) = x0 + x1, [isNat](x0) = x0, [isNatKind](x0) = x0, [a__isNatKind](x0) = x0, [plus](x0, x1) = x0 + x1, [0] = 1, [a__and](x0, x1) = x0 + x1, [s](x0) = x0, [a__plus](x0, x1) = x0 + x1, [a__U41](x0, x1, x2) = x1 + x2, [mark](x0) = x0, [a__U31](x0, x1) = x1 + 1, [a__U22](x0) = x0, [a__U21](x0, x1) = x1, [a__U13](x0) = x0, [a__U12](x0, x1) = x0 + x1, [a__isNat](x0) = x0, [a__U11](x0, x1, x2) = x1 + x2, [tt] = 1 orientation: a__isNatKind#(plus(V1,V2)) = V1 + V2 + 1 >= V1 + 1 = a__isNatKind#(V1) a__isNatKind#(s(V1)) = V1 + 1 >= V1 + 1 = a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) = V1 + V2 + 1 >= V1 + V2 + 1 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__and#(tt(),X) = X + 2 >= X + 1 = mark#(X) mark#(isNatKind(X)) = X + 1 >= X + 1 = a__isNatKind#(X) mark#(and(X1,X2)) = X1 + X2 + 1 >= X1 + X2 + 1 = a__and#(mark(X1),X2) mark#(and(X1,X2)) = X1 + X2 + 1 >= X1 + 1 = mark#(X1) a__isNat#(plus(V1,V2)) = V1 + V2 + 1 >= V1 + V2 + 1 = a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) = V1 + V2 + 1 >= V2 + 1 = a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) = V2 + 1 >= V2 + 1 = a__isNat#(V2) a__isNat#(plus(V1,V2)) = V1 + V2 + 1 >= V1 + V2 + 1 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) = V1 + V2 + 1 >= V1 + 1 = a__isNatKind#(V1) a__U11#(tt(),V1,V2) = V1 + V2 + 1 >= V1 + 1 = a__isNat#(V1) mark#(U22(X)) = X + 1 >= X + 1 = mark#(X) mark#(U13(X)) = X + 1 >= X + 1 = mark#(X) mark#(U12(X1,X2)) = X1 + X2 + 1 >= X2 + 1 = a__U12#(mark(X1),X2) mark#(U12(X1,X2)) = X1 + X2 + 1 >= X1 + 1 = mark#(X1) a__U11(tt(),V1,V2) = V1 + V2 >= V1 + V2 = a__U12(a__isNat(V1),V2) a__U12(tt(),V2) = V2 + 1 >= V2 = a__U13(a__isNat(V2)) a__U13(tt()) = 1 >= 1 = tt() a__U21(tt(),V1) = V1 >= V1 = a__U22(a__isNat(V1)) a__U22(tt()) = 1 >= 1 = tt() a__U31(tt(),N) = N + 1 >= N = mark(N) a__U41(tt(),M,N) = M + N >= M + N = s(a__plus(mark(N),mark(M))) a__and(tt(),X) = X + 1 >= X = mark(X) a__isNat(0()) = 1 >= 1 = tt() a__isNat(plus(V1,V2)) = V1 + V2 >= V1 + V2 = a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) = V1 >= V1 = a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) = 1 >= 1 = tt() a__isNatKind(plus(V1,V2)) = V1 + V2 >= V1 + V2 = a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) = V1 >= V1 = a__isNatKind(V1) a__plus(N,0()) = N + 1 >= N + 1 = a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) = M + N >= M + N = a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))), M,N) mark(U11(X1,X2,X3)) = X2 + X3 >= X2 + X3 = a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) = X1 + X2 >= X1 + X2 = a__U12(mark(X1),X2) mark(isNat(X)) = X >= X = a__isNat(X) mark(U13(X)) = X >= X = a__U13(mark(X)) mark(U21(X1,X2)) = X2 >= X2 = a__U21(mark(X1),X2) mark(U22(X)) = X >= X = a__U22(mark(X)) mark(U31(X1,X2)) = X2 + 1 >= X2 + 1 = a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) = X2 + X3 >= X2 + X3 = a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) = X1 + X2 >= X1 + X2 = a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) = X1 + X2 >= X1 + X2 = a__and(mark(X1),X2) mark(isNatKind(X)) = X >= X = a__isNatKind(X) mark(tt()) = 1 >= 1 = tt() mark(s(X)) = X >= X = s(mark(X)) mark(0()) = 1 >= 1 = 0() a__U11(X1,X2,X3) = X2 + X3 >= X2 + X3 = U11(X1,X2,X3) a__U12(X1,X2) = X1 + X2 >= X1 + X2 = U12(X1,X2) a__isNat(X) = X >= X = isNat(X) a__U13(X) = X >= X = U13(X) a__U21(X1,X2) = X2 >= X2 = U21(X1,X2) a__U22(X) = X >= X = U22(X) a__U31(X1,X2) = X2 + 1 >= X2 + 1 = U31(X1,X2) a__U41(X1,X2,X3) = X2 + X3 >= X2 + X3 = U41(X1,X2,X3) a__plus(X1,X2) = X1 + X2 >= X1 + X2 = plus(X1,X2) a__and(X1,X2) = X1 + X2 >= X1 + X2 = and(X1,X2) a__isNatKind(X) = X >= X = isNatKind(X) problem: DPs: a__isNatKind#(plus(V1,V2)) -> a__isNatKind#(V1) a__isNatKind#(s(V1)) -> a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) mark#(isNatKind(X)) -> a__isNatKind#(X) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) a__isNat#(plus(V1,V2)) -> a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) -> a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) -> a__isNat#(V2) a__isNat#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) -> a__isNatKind#(V1) a__U11#(tt(),V1,V2) -> a__isNat#(V1) mark#(U22(X)) -> mark#(X) mark#(U13(X)) -> mark#(X) mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(U12(X1,X2)) -> mark#(X1) TRS: a__U11(tt(),V1,V2) -> a__U12(a__isNat(V1),V2) a__U12(tt(),V2) -> a__U13(a__isNat(V2)) a__U13(tt()) -> tt() a__U21(tt(),V1) -> a__U22(a__isNat(V1)) a__U22(tt()) -> tt() a__U31(tt(),N) -> mark(N) a__U41(tt(),M,N) -> s(a__plus(mark(N),mark(M))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(plus(V1,V2)) -> a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) -> a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) -> tt() a__isNatKind(plus(V1,V2)) -> a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) -> a__isNatKind(V1) a__plus(N,0()) -> a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) -> a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(U13(X)) -> a__U13(mark(X)) mark(U21(X1,X2)) -> a__U21(mark(X1),X2) mark(U22(X)) -> a__U22(mark(X)) mark(U31(X1,X2)) -> a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) -> a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNatKind(X)) -> a__isNatKind(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2,X3) -> U11(X1,X2,X3) a__U12(X1,X2) -> U12(X1,X2) a__isNat(X) -> isNat(X) a__U13(X) -> U13(X) a__U21(X1,X2) -> U21(X1,X2) a__U22(X) -> U22(X) a__U31(X1,X2) -> U31(X1,X2) a__U41(X1,X2,X3) -> U41(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNatKind(X) -> isNatKind(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatKind#](x0) = 0, [a__and#](x0, x1) = 0, [mark#](x0) = 1, [a__U12#](x0, x1) = 0, [a__isNat#](x0) = 0, [a__U11#](x0, x1, x2) = 0, [U41](x0, x1, x2) = x1 + x2 + 1, [U31](x0, x1) = x1, [U22](x0) = 0, [U21](x0, x1) = x0, [U13](x0) = 0, [U12](x0, x1) = 1, [U11](x0, x1, x2) = x1 + x2 + 1, [and](x0, x1) = x0 + x1, [isNat](x0) = x0, [isNatKind](x0) = x0, [a__isNatKind](x0) = x0, [plus](x0, x1) = x0 + x1 + 1, [0] = 0, [a__and](x0, x1) = x0 + x1, [s](x0) = x0, [a__plus](x0, x1) = x0 + x1 + 1, [a__U41](x0, x1, x2) = x1 + x2 + 1, [mark](x0) = x0, [a__U31](x0, x1) = x1, [a__U22](x0) = 0, [a__U21](x0, x1) = x0, [a__U13](x0) = 0, [a__U12](x0, x1) = 1, [a__isNat](x0) = x0, [a__U11](x0, x1, x2) = x1 + x2 + 1, [tt] = 0 orientation: a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__isNatKind#(V1) a__isNatKind#(s(V1)) = 0 >= 0 = a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) mark#(isNatKind(X)) = 1 >= 0 = a__isNatKind#(X) mark#(and(X1,X2)) = 1 >= 0 = a__and#(mark(X1),X2) mark#(and(X1,X2)) = 1 >= 1 = mark#(X1) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) = 0 >= 0 = a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) = 0 >= 0 = a__isNat#(V2) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__isNatKind#(V1) a__U11#(tt(),V1,V2) = 0 >= 0 = a__isNat#(V1) mark#(U22(X)) = 1 >= 1 = mark#(X) mark#(U13(X)) = 1 >= 1 = mark#(X) mark#(U12(X1,X2)) = 1 >= 0 = a__U12#(mark(X1),X2) mark#(U12(X1,X2)) = 1 >= 1 = mark#(X1) a__U11(tt(),V1,V2) = V1 + V2 + 1 >= 1 = a__U12(a__isNat(V1),V2) a__U12(tt(),V2) = 1 >= 0 = a__U13(a__isNat(V2)) a__U13(tt()) = 0 >= 0 = tt() a__U21(tt(),V1) = 0 >= 0 = a__U22(a__isNat(V1)) a__U22(tt()) = 0 >= 0 = tt() a__U31(tt(),N) = N >= N = mark(N) a__U41(tt(),M,N) = M + N + 1 >= M + N + 1 = s(a__plus(mark(N),mark(M))) a__and(tt(),X) = X >= X = mark(X) a__isNat(0()) = 0 >= 0 = tt() a__isNat(plus(V1,V2)) = V1 + V2 + 1 >= V1 + V2 + 1 = a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) = V1 >= V1 = a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) = 0 >= 0 = tt() a__isNatKind(plus(V1,V2)) = V1 + V2 + 1 >= V1 + V2 = a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) = V1 >= V1 = a__isNatKind(V1) a__plus(N,0()) = N + 1 >= N = a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) = M + N + 1 >= M + N + 1 = a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))), M,N) mark(U11(X1,X2,X3)) = X2 + X3 + 1 >= X2 + X3 + 1 = a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) = 1 >= 1 = a__U12(mark(X1),X2) mark(isNat(X)) = X >= X = a__isNat(X) mark(U13(X)) = 0 >= 0 = a__U13(mark(X)) mark(U21(X1,X2)) = X1 >= X1 = a__U21(mark(X1),X2) mark(U22(X)) = 0 >= 0 = a__U22(mark(X)) mark(U31(X1,X2)) = X2 >= X2 = a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) = X2 + X3 + 1 >= X2 + X3 + 1 = a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) = X1 + X2 + 1 >= X1 + X2 + 1 = a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) = X1 + X2 >= X1 + X2 = a__and(mark(X1),X2) mark(isNatKind(X)) = X >= X = a__isNatKind(X) mark(tt()) = 0 >= 0 = tt() mark(s(X)) = X >= X = s(mark(X)) mark(0()) = 0 >= 0 = 0() a__U11(X1,X2,X3) = X2 + X3 + 1 >= X2 + X3 + 1 = U11(X1,X2,X3) a__U12(X1,X2) = 1 >= 1 = U12(X1,X2) a__isNat(X) = X >= X = isNat(X) a__U13(X) = 0 >= 0 = U13(X) a__U21(X1,X2) = X1 >= X1 = U21(X1,X2) a__U22(X) = 0 >= 0 = U22(X) a__U31(X1,X2) = X2 >= X2 = U31(X1,X2) a__U41(X1,X2,X3) = X2 + X3 + 1 >= X2 + X3 + 1 = U41(X1,X2,X3) a__plus(X1,X2) = X1 + X2 + 1 >= X1 + X2 + 1 = plus(X1,X2) a__and(X1,X2) = X1 + X2 >= X1 + X2 = and(X1,X2) a__isNatKind(X) = X >= X = isNatKind(X) problem: DPs: a__isNatKind#(plus(V1,V2)) -> a__isNatKind#(V1) a__isNatKind#(s(V1)) -> a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) mark#(and(X1,X2)) -> mark#(X1) a__isNat#(plus(V1,V2)) -> a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) -> a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) -> a__isNat#(V2) a__isNat#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) -> a__isNatKind#(V1) a__U11#(tt(),V1,V2) -> a__isNat#(V1) mark#(U22(X)) -> mark#(X) mark#(U13(X)) -> mark#(X) mark#(U12(X1,X2)) -> mark#(X1) TRS: a__U11(tt(),V1,V2) -> a__U12(a__isNat(V1),V2) a__U12(tt(),V2) -> a__U13(a__isNat(V2)) a__U13(tt()) -> tt() a__U21(tt(),V1) -> a__U22(a__isNat(V1)) a__U22(tt()) -> tt() a__U31(tt(),N) -> mark(N) a__U41(tt(),M,N) -> s(a__plus(mark(N),mark(M))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(plus(V1,V2)) -> a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) -> a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) -> tt() a__isNatKind(plus(V1,V2)) -> a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) -> a__isNatKind(V1) a__plus(N,0()) -> a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) -> a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(U13(X)) -> a__U13(mark(X)) mark(U21(X1,X2)) -> a__U21(mark(X1),X2) mark(U22(X)) -> a__U22(mark(X)) mark(U31(X1,X2)) -> a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) -> a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNatKind(X)) -> a__isNatKind(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2,X3) -> U11(X1,X2,X3) a__U12(X1,X2) -> U12(X1,X2) a__isNat(X) -> isNat(X) a__U13(X) -> U13(X) a__U21(X1,X2) -> U21(X1,X2) a__U22(X) -> U22(X) a__U31(X1,X2) -> U31(X1,X2) a__U41(X1,X2,X3) -> U41(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNatKind(X) -> isNatKind(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatKind#](x0) = 0, [a__and#](x0, x1) = 0, [mark#](x0) = x0, [a__U12#](x0, x1) = 1, [a__isNat#](x0) = 1, [a__U11#](x0, x1, x2) = 1, [U41](x0, x1, x2) = x1 + x2 + 1, [U31](x0, x1) = x1 + 1, [U22](x0) = x0, [U21](x0, x1) = x1, [U13](x0) = x0, [U12](x0, x1) = x0 + x1, [U11](x0, x1, x2) = x1 + x2, [and](x0, x1) = x0 + x1 + 1, [isNat](x0) = x0, [isNatKind](x0) = x0, [a__isNatKind](x0) = x0, [plus](x0, x1) = x0 + x1 + 1, [0] = 1, [a__and](x0, x1) = x0 + x1 + 1, [s](x0) = x0, [a__plus](x0, x1) = x0 + x1 + 1, [a__U41](x0, x1, x2) = x1 + x2 + 1, [mark](x0) = x0, [a__U31](x0, x1) = x1 + 1, [a__U22](x0) = x0, [a__U21](x0, x1) = x1, [a__U13](x0) = x0, [a__U12](x0, x1) = x0 + x1, [a__isNat](x0) = x0, [a__U11](x0, x1, x2) = x1 + x2, [tt] = 0 orientation: a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__isNatKind#(V1) a__isNatKind#(s(V1)) = 0 >= 0 = a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) mark#(and(X1,X2)) = X1 + X2 + 1 >= X1 = mark#(X1) a__isNat#(plus(V1,V2)) = 1 >= 1 = a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) = 1 >= 1 = a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) = 1 >= 1 = a__isNat#(V2) a__isNat#(plus(V1,V2)) = 1 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) = 1 >= 0 = a__isNatKind#(V1) a__U11#(tt(),V1,V2) = 1 >= 1 = a__isNat#(V1) mark#(U22(X)) = X >= X = mark#(X) mark#(U13(X)) = X >= X = mark#(X) mark#(U12(X1,X2)) = X1 + X2 >= X1 = mark#(X1) a__U11(tt(),V1,V2) = V1 + V2 >= V1 + V2 = a__U12(a__isNat(V1),V2) a__U12(tt(),V2) = V2 >= V2 = a__U13(a__isNat(V2)) a__U13(tt()) = 0 >= 0 = tt() a__U21(tt(),V1) = V1 >= V1 = a__U22(a__isNat(V1)) a__U22(tt()) = 0 >= 0 = tt() a__U31(tt(),N) = N + 1 >= N = mark(N) a__U41(tt(),M,N) = M + N + 1 >= M + N + 1 = s(a__plus(mark(N),mark(M))) a__and(tt(),X) = X + 1 >= X = mark(X) a__isNat(0()) = 1 >= 0 = tt() a__isNat(plus(V1,V2)) = V1 + V2 + 1 >= V1 + V2 = a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) = V1 >= V1 = a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) = 1 >= 0 = tt() a__isNatKind(plus(V1,V2)) = V1 + V2 + 1 >= V1 + V2 + 1 = a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) = V1 >= V1 = a__isNatKind(V1) a__plus(N,0()) = N + 2 >= N + 1 = a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) = M + N + 1 >= M + N + 1 = a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))), M,N) mark(U11(X1,X2,X3)) = X2 + X3 >= X2 + X3 = a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) = X1 + X2 >= X1 + X2 = a__U12(mark(X1),X2) mark(isNat(X)) = X >= X = a__isNat(X) mark(U13(X)) = X >= X = a__U13(mark(X)) mark(U21(X1,X2)) = X2 >= X2 = a__U21(mark(X1),X2) mark(U22(X)) = X >= X = a__U22(mark(X)) mark(U31(X1,X2)) = X2 + 1 >= X2 + 1 = a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) = X2 + X3 + 1 >= X2 + X3 + 1 = a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) = X1 + X2 + 1 >= X1 + X2 + 1 = a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) = X1 + X2 + 1 >= X1 + X2 + 1 = a__and(mark(X1),X2) mark(isNatKind(X)) = X >= X = a__isNatKind(X) mark(tt()) = 0 >= 0 = tt() mark(s(X)) = X >= X = s(mark(X)) mark(0()) = 1 >= 1 = 0() a__U11(X1,X2,X3) = X2 + X3 >= X2 + X3 = U11(X1,X2,X3) a__U12(X1,X2) = X1 + X2 >= X1 + X2 = U12(X1,X2) a__isNat(X) = X >= X = isNat(X) a__U13(X) = X >= X = U13(X) a__U21(X1,X2) = X2 >= X2 = U21(X1,X2) a__U22(X) = X >= X = U22(X) a__U31(X1,X2) = X2 + 1 >= X2 + 1 = U31(X1,X2) a__U41(X1,X2,X3) = X2 + X3 + 1 >= X2 + X3 + 1 = U41(X1,X2,X3) a__plus(X1,X2) = X1 + X2 + 1 >= X1 + X2 + 1 = plus(X1,X2) a__and(X1,X2) = X1 + X2 + 1 >= X1 + X2 + 1 = and(X1,X2) a__isNatKind(X) = X >= X = isNatKind(X) problem: DPs: a__isNatKind#(plus(V1,V2)) -> a__isNatKind#(V1) a__isNatKind#(s(V1)) -> a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) -> a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) -> a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) -> a__isNat#(V2) a__U11#(tt(),V1,V2) -> a__isNat#(V1) mark#(U22(X)) -> mark#(X) mark#(U13(X)) -> mark#(X) mark#(U12(X1,X2)) -> mark#(X1) TRS: a__U11(tt(),V1,V2) -> a__U12(a__isNat(V1),V2) a__U12(tt(),V2) -> a__U13(a__isNat(V2)) a__U13(tt()) -> tt() a__U21(tt(),V1) -> a__U22(a__isNat(V1)) a__U22(tt()) -> tt() a__U31(tt(),N) -> mark(N) a__U41(tt(),M,N) -> s(a__plus(mark(N),mark(M))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(plus(V1,V2)) -> a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) -> a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) -> tt() a__isNatKind(plus(V1,V2)) -> a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) -> a__isNatKind(V1) a__plus(N,0()) -> a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) -> a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(U13(X)) -> a__U13(mark(X)) mark(U21(X1,X2)) -> a__U21(mark(X1),X2) mark(U22(X)) -> a__U22(mark(X)) mark(U31(X1,X2)) -> a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) -> a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNatKind(X)) -> a__isNatKind(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2,X3) -> U11(X1,X2,X3) a__U12(X1,X2) -> U12(X1,X2) a__isNat(X) -> isNat(X) a__U13(X) -> U13(X) a__U21(X1,X2) -> U21(X1,X2) a__U22(X) -> U22(X) a__U31(X1,X2) -> U31(X1,X2) a__U41(X1,X2,X3) -> U41(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNatKind(X) -> isNatKind(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatKind#](x0) = 0, [a__and#](x0, x1) = 0, [mark#](x0) = 0, [a__U12#](x0, x1) = x0 + x1, [a__isNat#](x0) = x0 + 1, [a__U11#](x0, x1, x2) = x1 + x2 + 1, [U41](x0, x1, x2) = 1, [U31](x0, x1) = x1 + 1, [U22](x0) = 1, [U21](x0, x1) = 1, [U13](x0) = 1, [U12](x0, x1) = 1, [U11](x0, x1, x2) = 1, [and](x0, x1) = x1, [isNat](x0) = x0, [isNatKind](x0) = 1, [a__isNatKind](x0) = 1, [plus](x0, x1) = x0 + x1 + 1, [0] = 1, [a__and](x0, x1) = x1, [s](x0) = 1, [a__plus](x0, x1) = x0 + x1 + 1, [a__U41](x0, x1, x2) = 1, [mark](x0) = x0, [a__U31](x0, x1) = x1 + 1, [a__U22](x0) = 1, [a__U21](x0, x1) = 1, [a__U13](x0) = 1, [a__U12](x0, x1) = 1, [a__isNat](x0) = x0, [a__U11](x0, x1, x2) = 1, [tt] = 1 orientation: a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__isNatKind#(V1) a__isNatKind#(s(V1)) = 0 >= 0 = a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__isNat#(plus(V1,V2)) = V1 + V2 + 2 >= V1 + V2 + 1 = a__U11#(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__U11#(tt(),V1,V2) = V1 + V2 + 1 >= V1 + V2 = a__U12#(a__isNat(V1),V2) a__U12#(tt(),V2) = V2 + 1 >= V2 + 1 = a__isNat#(V2) a__U11#(tt(),V1,V2) = V1 + V2 + 1 >= V1 + 1 = a__isNat#(V1) mark#(U22(X)) = 0 >= 0 = mark#(X) mark#(U13(X)) = 0 >= 0 = mark#(X) mark#(U12(X1,X2)) = 0 >= 0 = mark#(X1) a__U11(tt(),V1,V2) = 1 >= 1 = a__U12(a__isNat(V1),V2) a__U12(tt(),V2) = 1 >= 1 = a__U13(a__isNat(V2)) a__U13(tt()) = 1 >= 1 = tt() a__U21(tt(),V1) = 1 >= 1 = a__U22(a__isNat(V1)) a__U22(tt()) = 1 >= 1 = tt() a__U31(tt(),N) = N + 1 >= N = mark(N) a__U41(tt(),M,N) = 1 >= 1 = s(a__plus(mark(N),mark(M))) a__and(tt(),X) = X >= X = mark(X) a__isNat(0()) = 1 >= 1 = tt() a__isNat(plus(V1,V2)) = V1 + V2 + 1 >= 1 = a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) = 1 >= 1 = a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) = 1 >= 1 = tt() a__isNatKind(plus(V1,V2)) = 1 >= 1 = a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) = 1 >= 1 = a__isNatKind(V1) a__plus(N,0()) = N + 2 >= N + 1 = a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) = N + 2 >= 1 = a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))), M,N) mark(U11(X1,X2,X3)) = 1 >= 1 = a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) = 1 >= 1 = a__U12(mark(X1),X2) mark(isNat(X)) = X >= X = a__isNat(X) mark(U13(X)) = 1 >= 1 = a__U13(mark(X)) mark(U21(X1,X2)) = 1 >= 1 = a__U21(mark(X1),X2) mark(U22(X)) = 1 >= 1 = a__U22(mark(X)) mark(U31(X1,X2)) = X2 + 1 >= X2 + 1 = a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) = 1 >= 1 = a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) = X1 + X2 + 1 >= X1 + X2 + 1 = a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) = X2 >= X2 = a__and(mark(X1),X2) mark(isNatKind(X)) = 1 >= 1 = a__isNatKind(X) mark(tt()) = 1 >= 1 = tt() mark(s(X)) = 1 >= 1 = s(mark(X)) mark(0()) = 1 >= 1 = 0() a__U11(X1,X2,X3) = 1 >= 1 = U11(X1,X2,X3) a__U12(X1,X2) = 1 >= 1 = U12(X1,X2) a__isNat(X) = X >= X = isNat(X) a__U13(X) = 1 >= 1 = U13(X) a__U21(X1,X2) = 1 >= 1 = U21(X1,X2) a__U22(X) = 1 >= 1 = U22(X) a__U31(X1,X2) = X2 + 1 >= X2 + 1 = U31(X1,X2) a__U41(X1,X2,X3) = 1 >= 1 = U41(X1,X2,X3) a__plus(X1,X2) = X1 + X2 + 1 >= X1 + X2 + 1 = plus(X1,X2) a__and(X1,X2) = X2 >= X2 = and(X1,X2) a__isNatKind(X) = 1 >= 1 = isNatKind(X) problem: DPs: a__isNatKind#(plus(V1,V2)) -> a__isNatKind#(V1) a__isNatKind#(s(V1)) -> a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__U12#(tt(),V2) -> a__isNat#(V2) a__U11#(tt(),V1,V2) -> a__isNat#(V1) mark#(U22(X)) -> mark#(X) mark#(U13(X)) -> mark#(X) mark#(U12(X1,X2)) -> mark#(X1) TRS: a__U11(tt(),V1,V2) -> a__U12(a__isNat(V1),V2) a__U12(tt(),V2) -> a__U13(a__isNat(V2)) a__U13(tt()) -> tt() a__U21(tt(),V1) -> a__U22(a__isNat(V1)) a__U22(tt()) -> tt() a__U31(tt(),N) -> mark(N) a__U41(tt(),M,N) -> s(a__plus(mark(N),mark(M))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(plus(V1,V2)) -> a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) -> a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) -> tt() a__isNatKind(plus(V1,V2)) -> a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) -> a__isNatKind(V1) a__plus(N,0()) -> a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) -> a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))), M,N) mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(U13(X)) -> a__U13(mark(X)) mark(U21(X1,X2)) -> a__U21(mark(X1),X2) mark(U22(X)) -> a__U22(mark(X)) mark(U31(X1,X2)) -> a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) -> a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNatKind(X)) -> a__isNatKind(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2,X3) -> U11(X1,X2,X3) a__U12(X1,X2) -> U12(X1,X2) a__isNat(X) -> isNat(X) a__U13(X) -> U13(X) a__U21(X1,X2) -> U21(X1,X2) a__U22(X) -> U22(X) a__U31(X1,X2) -> U31(X1,X2) a__U41(X1,X2,X3) -> U41(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNatKind(X) -> isNatKind(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatKind#](x0) = 0, [a__and#](x0, x1) = 0, [mark#](x0) = 0, [a__U12#](x0, x1) = 0, [a__isNat#](x0) = 0, [a__U11#](x0, x1, x2) = 1, [U41](x0, x1, x2) = 0, [U31](x0, x1) = x1, [U22](x0) = 0, [U21](x0, x1) = 1, [U13](x0) = 0, [U12](x0, x1) = 0, [U11](x0, x1, x2) = 1, [and](x0, x1) = x0 + x1, [isNat](x0) = x0 + 1, [isNatKind](x0) = 0, [a__isNatKind](x0) = 0, [plus](x0, x1) = x0 + x1, [0] = 0, [a__and](x0, x1) = x0 + x1, [s](x0) = 0, [a__plus](x0, x1) = x0 + x1, [a__U41](x0, x1, x2) = 0, [mark](x0) = x0, [a__U31](x0, x1) = x1, [a__U22](x0) = 0, [a__U21](x0, x1) = 1, [a__U13](x0) = 0, [a__U12](x0, x1) = 0, [a__isNat](x0) = x0 + 1, [a__U11](x0, x1, x2) = 1, [tt] = 0 orientation: a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__isNatKind#(V1) a__isNatKind#(s(V1)) = 0 >= 0 = a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__U12#(tt(),V2) = 0 >= 0 = a__isNat#(V2) a__U11#(tt(),V1,V2) = 1 >= 0 = a__isNat#(V1) mark#(U22(X)) = 0 >= 0 = mark#(X) mark#(U13(X)) = 0 >= 0 = mark#(X) mark#(U12(X1,X2)) = 0 >= 0 = mark#(X1) a__U11(tt(),V1,V2) = 1 >= 0 = a__U12(a__isNat(V1),V2) a__U12(tt(),V2) = 0 >= 0 = a__U13(a__isNat(V2)) a__U13(tt()) = 0 >= 0 = tt() a__U21(tt(),V1) = 1 >= 0 = a__U22(a__isNat(V1)) a__U22(tt()) = 0 >= 0 = tt() a__U31(tt(),N) = N >= N = mark(N) a__U41(tt(),M,N) = 0 >= 0 = s(a__plus(mark(N),mark(M))) a__and(tt(),X) = X >= X = mark(X) a__isNat(0()) = 1 >= 0 = tt() a__isNat(plus(V1,V2)) = V1 + V2 + 1 >= 1 = a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) = 1 >= 1 = a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) = 0 >= 0 = tt() a__isNatKind(plus(V1,V2)) = 0 >= 0 = a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) = 0 >= 0 = a__isNatKind(V1) a__plus(N,0()) = N >= N = a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) = N >= 0 = a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))), M,N) mark(U11(X1,X2,X3)) = 1 >= 1 = a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) = 0 >= 0 = a__U12(mark(X1),X2) mark(isNat(X)) = X + 1 >= X + 1 = a__isNat(X) mark(U13(X)) = 0 >= 0 = a__U13(mark(X)) mark(U21(X1,X2)) = 1 >= 1 = a__U21(mark(X1),X2) mark(U22(X)) = 0 >= 0 = a__U22(mark(X)) mark(U31(X1,X2)) = X2 >= X2 = a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) = 0 >= 0 = a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) = X1 + X2 >= X1 + X2 = a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) = X1 + X2 >= X1 + X2 = a__and(mark(X1),X2) mark(isNatKind(X)) = 0 >= 0 = a__isNatKind(X) mark(tt()) = 0 >= 0 = tt() mark(s(X)) = 0 >= 0 = s(mark(X)) mark(0()) = 0 >= 0 = 0() a__U11(X1,X2,X3) = 1 >= 1 = U11(X1,X2,X3) a__U12(X1,X2) = 0 >= 0 = U12(X1,X2) a__isNat(X) = X + 1 >= X + 1 = isNat(X) a__U13(X) = 0 >= 0 = U13(X) a__U21(X1,X2) = 1 >= 1 = U21(X1,X2) a__U22(X) = 0 >= 0 = U22(X) a__U31(X1,X2) = X2 >= X2 = U31(X1,X2) a__U41(X1,X2,X3) = 0 >= 0 = U41(X1,X2,X3) a__plus(X1,X2) = X1 + X2 >= X1 + X2 = plus(X1,X2) a__and(X1,X2) = X1 + X2 >= X1 + X2 = and(X1,X2) a__isNatKind(X) = 0 >= 0 = isNatKind(X) problem: DPs: a__isNatKind#(plus(V1,V2)) -> a__isNatKind#(V1) a__isNatKind#(s(V1)) -> a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) a__U12#(tt(),V2) -> a__isNat#(V2) mark#(U22(X)) -> mark#(X) mark#(U13(X)) -> mark#(X) mark#(U12(X1,X2)) -> mark#(X1) TRS: a__U11(tt(),V1,V2) -> a__U12(a__isNat(V1),V2) a__U12(tt(),V2) -> a__U13(a__isNat(V2)) a__U13(tt()) -> tt() a__U21(tt(),V1) -> a__U22(a__isNat(V1)) a__U22(tt()) -> tt() a__U31(tt(),N) -> mark(N) a__U41(tt(),M,N) -> s(a__plus(mark(N),mark(M))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(plus(V1,V2)) -> a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) -> a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) -> tt() a__isNatKind(plus(V1,V2)) -> a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) -> a__isNatKind(V1) a__plus(N,0()) -> a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) -> a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))), M,N) mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(U13(X)) -> a__U13(mark(X)) mark(U21(X1,X2)) -> a__U21(mark(X1),X2) mark(U22(X)) -> a__U22(mark(X)) mark(U31(X1,X2)) -> a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) -> a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNatKind(X)) -> a__isNatKind(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2,X3) -> U11(X1,X2,X3) a__U12(X1,X2) -> U12(X1,X2) a__isNat(X) -> isNat(X) a__U13(X) -> U13(X) a__U21(X1,X2) -> U21(X1,X2) a__U22(X) -> U22(X) a__U31(X1,X2) -> U31(X1,X2) a__U41(X1,X2,X3) -> U41(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNatKind(X) -> isNatKind(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatKind#](x0) = x0 + 1, [a__and#](x0, x1) = x0 + 1, [mark#](x0) = 0, [a__U12#](x0, x1) = 1, [a__isNat#](x0) = 0, [U41](x0, x1, x2) = x0 + x1 + x2 + 1, [U31](x0, x1) = x1, [U22](x0) = x0, [U21](x0, x1) = x1 + 1, [U13](x0) = 1, [U12](x0, x1) = 1, [U11](x0, x1, x2) = x0 + 1, [and](x0, x1) = x1, [isNat](x0) = x0 + 1, [isNatKind](x0) = 1, [a__isNatKind](x0) = 1, [plus](x0, x1) = x0 + x1 + 1, [0] = 1, [a__and](x0, x1) = x1, [s](x0) = x0 + 1, [a__plus](x0, x1) = x0 + x1 + 1, [a__U41](x0, x1, x2) = x0 + x1 + x2 + 1, [mark](x0) = x0, [a__U31](x0, x1) = x1, [a__U22](x0) = x0, [a__U21](x0, x1) = x1 + 1, [a__U13](x0) = 1, [a__U12](x0, x1) = 1, [a__isNat](x0) = x0 + 1, [a__U11](x0, x1, x2) = x0 + 1, [tt] = 1 orientation: a__isNatKind#(plus(V1,V2)) = V1 + V2 + 2 >= V1 + 1 = a__isNatKind#(V1) a__isNatKind#(s(V1)) = V1 + 2 >= V1 + 1 = a__isNatKind#(V1) a__isNatKind#(plus(V1,V2)) = V1 + V2 + 2 >= 2 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__U12#(tt(),V2) = 1 >= 0 = a__isNat#(V2) mark#(U22(X)) = 0 >= 0 = mark#(X) mark#(U13(X)) = 0 >= 0 = mark#(X) mark#(U12(X1,X2)) = 0 >= 0 = mark#(X1) a__U11(tt(),V1,V2) = 2 >= 1 = a__U12(a__isNat(V1),V2) a__U12(tt(),V2) = 1 >= 1 = a__U13(a__isNat(V2)) a__U13(tt()) = 1 >= 1 = tt() a__U21(tt(),V1) = V1 + 1 >= V1 + 1 = a__U22(a__isNat(V1)) a__U22(tt()) = 1 >= 1 = tt() a__U31(tt(),N) = N >= N = mark(N) a__U41(tt(),M,N) = M + N + 2 >= M + N + 2 = s(a__plus(mark(N),mark(M))) a__and(tt(),X) = X >= X = mark(X) a__isNat(0()) = 2 >= 1 = tt() a__isNat(plus(V1,V2)) = V1 + V2 + 2 >= 2 = a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) = V1 + 2 >= V1 + 1 = a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) = 1 >= 1 = tt() a__isNatKind(plus(V1,V2)) = 1 >= 1 = a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) = 1 >= 1 = a__isNatKind(V1) a__plus(N,0()) = N + 2 >= N = a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) = M + N + 2 >= M + N + 2 = a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))), M,N) mark(U11(X1,X2,X3)) = X1 + 1 >= X1 + 1 = a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) = 1 >= 1 = a__U12(mark(X1),X2) mark(isNat(X)) = X + 1 >= X + 1 = a__isNat(X) mark(U13(X)) = 1 >= 1 = a__U13(mark(X)) mark(U21(X1,X2)) = X2 + 1 >= X2 + 1 = a__U21(mark(X1),X2) mark(U22(X)) = X >= X = a__U22(mark(X)) mark(U31(X1,X2)) = X2 >= X2 = a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) = X1 + X2 + X3 + 1 >= X1 + X2 + X3 + 1 = a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) = X1 + X2 + 1 >= X1 + X2 + 1 = a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) = X2 >= X2 = a__and(mark(X1),X2) mark(isNatKind(X)) = 1 >= 1 = a__isNatKind(X) mark(tt()) = 1 >= 1 = tt() mark(s(X)) = X + 1 >= X + 1 = s(mark(X)) mark(0()) = 1 >= 1 = 0() a__U11(X1,X2,X3) = X1 + 1 >= X1 + 1 = U11(X1,X2,X3) a__U12(X1,X2) = 1 >= 1 = U12(X1,X2) a__isNat(X) = X + 1 >= X + 1 = isNat(X) a__U13(X) = 1 >= 1 = U13(X) a__U21(X1,X2) = X2 + 1 >= X2 + 1 = U21(X1,X2) a__U22(X) = X >= X = U22(X) a__U31(X1,X2) = X2 >= X2 = U31(X1,X2) a__U41(X1,X2,X3) = X1 + X2 + X3 + 1 >= X1 + X2 + X3 + 1 = U41(X1,X2,X3) a__plus(X1,X2) = X1 + X2 + 1 >= X1 + X2 + 1 = plus(X1,X2) a__and(X1,X2) = X2 >= X2 = and(X1,X2) a__isNatKind(X) = 1 >= 1 = isNatKind(X) problem: DPs: a__isNatKind#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) mark#(U22(X)) -> mark#(X) mark#(U13(X)) -> mark#(X) mark#(U12(X1,X2)) -> mark#(X1) TRS: a__U11(tt(),V1,V2) -> a__U12(a__isNat(V1),V2) a__U12(tt(),V2) -> a__U13(a__isNat(V2)) a__U13(tt()) -> tt() a__U21(tt(),V1) -> a__U22(a__isNat(V1)) a__U22(tt()) -> tt() a__U31(tt(),N) -> mark(N) a__U41(tt(),M,N) -> s(a__plus(mark(N),mark(M))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(plus(V1,V2)) -> a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) -> a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) -> tt() a__isNatKind(plus(V1,V2)) -> a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) -> a__isNatKind(V1) a__plus(N,0()) -> a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) -> a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))), M,N) mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(U13(X)) -> a__U13(mark(X)) mark(U21(X1,X2)) -> a__U21(mark(X1),X2) mark(U22(X)) -> a__U22(mark(X)) mark(U31(X1,X2)) -> a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) -> a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNatKind(X)) -> a__isNatKind(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2,X3) -> U11(X1,X2,X3) a__U12(X1,X2) -> U12(X1,X2) a__isNat(X) -> isNat(X) a__U13(X) -> U13(X) a__U21(X1,X2) -> U21(X1,X2) a__U22(X) -> U22(X) a__U31(X1,X2) -> U31(X1,X2) a__U41(X1,X2,X3) -> U41(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNatKind(X) -> isNatKind(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatKind#](x0) = 0, [a__and#](x0, x1) = 0, [mark#](x0) = x0 + 1, [U41](x0, x1, x2) = x0 + x1 + x2, [U31](x0, x1) = x0 + x1, [U22](x0) = x0 + 1, [U21](x0, x1) = x1 + 1, [U13](x0) = x0 + 1, [U12](x0, x1) = x0 + x1, [U11](x0, x1, x2) = x1 + x2, [and](x0, x1) = x1, [isNat](x0) = x0, [isNatKind](x0) = 1, [a__isNatKind](x0) = 1, [plus](x0, x1) = x0 + x1, [0] = 1, [a__and](x0, x1) = x1, [s](x0) = x0 + 1, [a__plus](x0, x1) = x0 + x1, [a__U41](x0, x1, x2) = x0 + x1 + x2, [mark](x0) = x0, [a__U31](x0, x1) = x0 + x1, [a__U22](x0) = x0 + 1, [a__U21](x0, x1) = x1 + 1, [a__U13](x0) = x0 + 1, [a__U12](x0, x1) = x0 + x1, [a__isNat](x0) = x0, [a__U11](x0, x1, x2) = x1 + x2, [tt] = 1 orientation: a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) mark#(U22(X)) = X + 2 >= X + 1 = mark#(X) mark#(U13(X)) = X + 2 >= X + 1 = mark#(X) mark#(U12(X1,X2)) = X1 + X2 + 1 >= X1 + 1 = mark#(X1) a__U11(tt(),V1,V2) = V1 + V2 >= V1 + V2 = a__U12(a__isNat(V1),V2) a__U12(tt(),V2) = V2 + 1 >= V2 + 1 = a__U13(a__isNat(V2)) a__U13(tt()) = 2 >= 1 = tt() a__U21(tt(),V1) = V1 + 1 >= V1 + 1 = a__U22(a__isNat(V1)) a__U22(tt()) = 2 >= 1 = tt() a__U31(tt(),N) = N + 1 >= N = mark(N) a__U41(tt(),M,N) = M + N + 1 >= M + N + 1 = s(a__plus(mark(N),mark(M))) a__and(tt(),X) = X >= X = mark(X) a__isNat(0()) = 1 >= 1 = tt() a__isNat(plus(V1,V2)) = V1 + V2 >= V1 + V2 = a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) = V1 + 1 >= V1 + 1 = a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) = 1 >= 1 = tt() a__isNatKind(plus(V1,V2)) = 1 >= 1 = a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) = 1 >= 1 = a__isNatKind(V1) a__plus(N,0()) = N + 1 >= N + 1 = a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) = M + N + 1 >= M + N + 1 = a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))), M,N) mark(U11(X1,X2,X3)) = X2 + X3 >= X2 + X3 = a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) = X1 + X2 >= X1 + X2 = a__U12(mark(X1),X2) mark(isNat(X)) = X >= X = a__isNat(X) mark(U13(X)) = X + 1 >= X + 1 = a__U13(mark(X)) mark(U21(X1,X2)) = X2 + 1 >= X2 + 1 = a__U21(mark(X1),X2) mark(U22(X)) = X + 1 >= X + 1 = a__U22(mark(X)) mark(U31(X1,X2)) = X1 + X2 >= X1 + X2 = a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) = X1 + X2 + X3 >= X1 + X2 + X3 = a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) = X1 + X2 >= X1 + X2 = a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) = X2 >= X2 = a__and(mark(X1),X2) mark(isNatKind(X)) = 1 >= 1 = a__isNatKind(X) mark(tt()) = 1 >= 1 = tt() mark(s(X)) = X + 1 >= X + 1 = s(mark(X)) mark(0()) = 1 >= 1 = 0() a__U11(X1,X2,X3) = X2 + X3 >= X2 + X3 = U11(X1,X2,X3) a__U12(X1,X2) = X1 + X2 >= X1 + X2 = U12(X1,X2) a__isNat(X) = X >= X = isNat(X) a__U13(X) = X + 1 >= X + 1 = U13(X) a__U21(X1,X2) = X2 + 1 >= X2 + 1 = U21(X1,X2) a__U22(X) = X + 1 >= X + 1 = U22(X) a__U31(X1,X2) = X1 + X2 >= X1 + X2 = U31(X1,X2) a__U41(X1,X2,X3) = X1 + X2 + X3 >= X1 + X2 + X3 = U41(X1,X2,X3) a__plus(X1,X2) = X1 + X2 >= X1 + X2 = plus(X1,X2) a__and(X1,X2) = X2 >= X2 = and(X1,X2) a__isNatKind(X) = 1 >= 1 = isNatKind(X) problem: DPs: a__isNatKind#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) mark#(U12(X1,X2)) -> mark#(X1) TRS: a__U11(tt(),V1,V2) -> a__U12(a__isNat(V1),V2) a__U12(tt(),V2) -> a__U13(a__isNat(V2)) a__U13(tt()) -> tt() a__U21(tt(),V1) -> a__U22(a__isNat(V1)) a__U22(tt()) -> tt() a__U31(tt(),N) -> mark(N) a__U41(tt(),M,N) -> s(a__plus(mark(N),mark(M))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(plus(V1,V2)) -> a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) -> a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) -> tt() a__isNatKind(plus(V1,V2)) -> a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) -> a__isNatKind(V1) a__plus(N,0()) -> a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) -> a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))), M,N) mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(U13(X)) -> a__U13(mark(X)) mark(U21(X1,X2)) -> a__U21(mark(X1),X2) mark(U22(X)) -> a__U22(mark(X)) mark(U31(X1,X2)) -> a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) -> a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNatKind(X)) -> a__isNatKind(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2,X3) -> U11(X1,X2,X3) a__U12(X1,X2) -> U12(X1,X2) a__isNat(X) -> isNat(X) a__U13(X) -> U13(X) a__U21(X1,X2) -> U21(X1,X2) a__U22(X) -> U22(X) a__U31(X1,X2) -> U31(X1,X2) a__U41(X1,X2,X3) -> U41(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNatKind(X) -> isNatKind(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatKind#](x0) = 0, [a__and#](x0, x1) = 0, [mark#](x0) = x0 + 1, [U41](x0, x1, x2) = 1, [U31](x0, x1) = x1, [U22](x0) = 0, [U21](x0, x1) = 0, [U13](x0) = 0, [U12](x0, x1) = x0 + 1, [U11](x0, x1, x2) = x1 + 1, [and](x0, x1) = x1, [isNat](x0) = x0, [isNatKind](x0) = 0, [a__isNatKind](x0) = 0, [plus](x0, x1) = x0 + 1, [0] = 1, [a__and](x0, x1) = x1, [s](x0) = 1, [a__plus](x0, x1) = x0 + 1, [a__U41](x0, x1, x2) = 1, [mark](x0) = x0, [a__U31](x0, x1) = x1, [a__U22](x0) = 0, [a__U21](x0, x1) = 0, [a__U13](x0) = 0, [a__U12](x0, x1) = x0 + 1, [a__isNat](x0) = x0, [a__U11](x0, x1, x2) = x1 + 1, [tt] = 0 orientation: a__isNatKind#(plus(V1,V2)) = 0 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) mark#(U12(X1,X2)) = X1 + 2 >= X1 + 1 = mark#(X1) a__U11(tt(),V1,V2) = V1 + 1 >= V1 + 1 = a__U12(a__isNat(V1),V2) a__U12(tt(),V2) = 1 >= 0 = a__U13(a__isNat(V2)) a__U13(tt()) = 0 >= 0 = tt() a__U21(tt(),V1) = 0 >= 0 = a__U22(a__isNat(V1)) a__U22(tt()) = 0 >= 0 = tt() a__U31(tt(),N) = N >= N = mark(N) a__U41(tt(),M,N) = 1 >= 1 = s(a__plus(mark(N),mark(M))) a__and(tt(),X) = X >= X = mark(X) a__isNat(0()) = 1 >= 0 = tt() a__isNat(plus(V1,V2)) = V1 + 1 >= V1 + 1 = a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) = 1 >= 0 = a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) = 0 >= 0 = tt() a__isNatKind(plus(V1,V2)) = 0 >= 0 = a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) = 0 >= 0 = a__isNatKind(V1) a__plus(N,0()) = N + 1 >= N = a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) = N + 1 >= 1 = a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))), M,N) mark(U11(X1,X2,X3)) = X2 + 1 >= X2 + 1 = a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) = X1 + 1 >= X1 + 1 = a__U12(mark(X1),X2) mark(isNat(X)) = X >= X = a__isNat(X) mark(U13(X)) = 0 >= 0 = a__U13(mark(X)) mark(U21(X1,X2)) = 0 >= 0 = a__U21(mark(X1),X2) mark(U22(X)) = 0 >= 0 = a__U22(mark(X)) mark(U31(X1,X2)) = X2 >= X2 = a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) = 1 >= 1 = a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) = X1 + 1 >= X1 + 1 = a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) = X2 >= X2 = a__and(mark(X1),X2) mark(isNatKind(X)) = 0 >= 0 = a__isNatKind(X) mark(tt()) = 0 >= 0 = tt() mark(s(X)) = 1 >= 1 = s(mark(X)) mark(0()) = 1 >= 1 = 0() a__U11(X1,X2,X3) = X2 + 1 >= X2 + 1 = U11(X1,X2,X3) a__U12(X1,X2) = X1 + 1 >= X1 + 1 = U12(X1,X2) a__isNat(X) = X >= X = isNat(X) a__U13(X) = 0 >= 0 = U13(X) a__U21(X1,X2) = 0 >= 0 = U21(X1,X2) a__U22(X) = 0 >= 0 = U22(X) a__U31(X1,X2) = X2 >= X2 = U31(X1,X2) a__U41(X1,X2,X3) = 1 >= 1 = U41(X1,X2,X3) a__plus(X1,X2) = X1 + 1 >= X1 + 1 = plus(X1,X2) a__and(X1,X2) = X2 >= X2 = and(X1,X2) a__isNatKind(X) = 0 >= 0 = isNatKind(X) problem: DPs: a__isNatKind#(plus(V1,V2)) -> a__and#(a__isNatKind(V1),isNatKind(V2)) TRS: a__U11(tt(),V1,V2) -> a__U12(a__isNat(V1),V2) a__U12(tt(),V2) -> a__U13(a__isNat(V2)) a__U13(tt()) -> tt() a__U21(tt(),V1) -> a__U22(a__isNat(V1)) a__U22(tt()) -> tt() a__U31(tt(),N) -> mark(N) a__U41(tt(),M,N) -> s(a__plus(mark(N),mark(M))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(plus(V1,V2)) -> a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) -> a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) -> tt() a__isNatKind(plus(V1,V2)) -> a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) -> a__isNatKind(V1) a__plus(N,0()) -> a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) -> a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))), M,N) mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(U13(X)) -> a__U13(mark(X)) mark(U21(X1,X2)) -> a__U21(mark(X1),X2) mark(U22(X)) -> a__U22(mark(X)) mark(U31(X1,X2)) -> a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) -> a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNatKind(X)) -> a__isNatKind(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2,X3) -> U11(X1,X2,X3) a__U12(X1,X2) -> U12(X1,X2) a__isNat(X) -> isNat(X) a__U13(X) -> U13(X) a__U21(X1,X2) -> U21(X1,X2) a__U22(X) -> U22(X) a__U31(X1,X2) -> U31(X1,X2) a__U41(X1,X2,X3) -> U41(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNatKind(X) -> isNatKind(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatKind#](x0) = 1, [a__and#](x0, x1) = 0, [U41](x0, x1, x2) = 0, [U31](x0, x1) = 0, [U22](x0) = 0, [U21](x0, x1) = 0, [U13](x0) = 0, [U12](x0, x1) = 0, [U11](x0, x1, x2) = 0, [and](x0, x1) = 0, [isNat](x0) = 0, [isNatKind](x0) = 0, [a__isNatKind](x0) = 0, [plus](x0, x1) = 0, [0] = 0, [a__and](x0, x1) = 0, [s](x0) = 0, [a__plus](x0, x1) = 0, [a__U41](x0, x1, x2) = 0, [mark](x0) = 0, [a__U31](x0, x1) = 0, [a__U22](x0) = 0, [a__U21](x0, x1) = 0, [a__U13](x0) = 0, [a__U12](x0, x1) = 0, [a__isNat](x0) = 0, [a__U11](x0, x1, x2) = 0, [tt] = 0 orientation: a__isNatKind#(plus(V1,V2)) = 1 >= 0 = a__and#(a__isNatKind(V1),isNatKind(V2)) a__U11(tt(),V1,V2) = 0 >= 0 = a__U12(a__isNat(V1),V2) a__U12(tt(),V2) = 0 >= 0 = a__U13(a__isNat(V2)) a__U13(tt()) = 0 >= 0 = tt() a__U21(tt(),V1) = 0 >= 0 = a__U22(a__isNat(V1)) a__U22(tt()) = 0 >= 0 = tt() a__U31(tt(),N) = 0 >= 0 = mark(N) a__U41(tt(),M,N) = 0 >= 0 = s(a__plus(mark(N),mark(M))) a__and(tt(),X) = 0 >= 0 = mark(X) a__isNat(0()) = 0 >= 0 = tt() a__isNat(plus(V1,V2)) = 0 >= 0 = a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) = 0 >= 0 = a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) = 0 >= 0 = tt() a__isNatKind(plus(V1,V2)) = 0 >= 0 = a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) = 0 >= 0 = a__isNatKind(V1) a__plus(N,0()) = 0 >= 0 = a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) = 0 >= 0 = a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))), M,N) mark(U11(X1,X2,X3)) = 0 >= 0 = a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) = 0 >= 0 = a__U12(mark(X1),X2) mark(isNat(X)) = 0 >= 0 = a__isNat(X) mark(U13(X)) = 0 >= 0 = a__U13(mark(X)) mark(U21(X1,X2)) = 0 >= 0 = a__U21(mark(X1),X2) mark(U22(X)) = 0 >= 0 = a__U22(mark(X)) mark(U31(X1,X2)) = 0 >= 0 = a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) = 0 >= 0 = a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) = 0 >= 0 = a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) = 0 >= 0 = a__and(mark(X1),X2) mark(isNatKind(X)) = 0 >= 0 = a__isNatKind(X) mark(tt()) = 0 >= 0 = tt() mark(s(X)) = 0 >= 0 = s(mark(X)) mark(0()) = 0 >= 0 = 0() a__U11(X1,X2,X3) = 0 >= 0 = U11(X1,X2,X3) a__U12(X1,X2) = 0 >= 0 = U12(X1,X2) a__isNat(X) = 0 >= 0 = isNat(X) a__U13(X) = 0 >= 0 = U13(X) a__U21(X1,X2) = 0 >= 0 = U21(X1,X2) a__U22(X) = 0 >= 0 = U22(X) a__U31(X1,X2) = 0 >= 0 = U31(X1,X2) a__U41(X1,X2,X3) = 0 >= 0 = U41(X1,X2,X3) a__plus(X1,X2) = 0 >= 0 = plus(X1,X2) a__and(X1,X2) = 0 >= 0 = and(X1,X2) a__isNatKind(X) = 0 >= 0 = isNatKind(X) problem: DPs: TRS: a__U11(tt(),V1,V2) -> a__U12(a__isNat(V1),V2) a__U12(tt(),V2) -> a__U13(a__isNat(V2)) a__U13(tt()) -> tt() a__U21(tt(),V1) -> a__U22(a__isNat(V1)) a__U22(tt()) -> tt() a__U31(tt(),N) -> mark(N) a__U41(tt(),M,N) -> s(a__plus(mark(N),mark(M))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(plus(V1,V2)) -> a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) a__isNat(s(V1)) -> a__U21(a__isNatKind(V1),V1) a__isNatKind(0()) -> tt() a__isNatKind(plus(V1,V2)) -> a__and(a__isNatKind(V1),isNatKind(V2)) a__isNatKind(s(V1)) -> a__isNatKind(V1) a__plus(N,0()) -> a__U31(a__and(a__isNat(N),isNatKind(N)),N) a__plus(N,s(M)) -> a__U41(a__and(a__and(a__isNat(M),isNatKind(M)), and(isNat(N),isNatKind(N))), M,N) mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(U13(X)) -> a__U13(mark(X)) mark(U21(X1,X2)) -> a__U21(mark(X1),X2) mark(U22(X)) -> a__U22(mark(X)) mark(U31(X1,X2)) -> a__U31(mark(X1),X2) mark(U41(X1,X2,X3)) -> a__U41(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNatKind(X)) -> a__isNatKind(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2,X3) -> U11(X1,X2,X3) a__U12(X1,X2) -> U12(X1,X2) a__isNat(X) -> isNat(X) a__U13(X) -> U13(X) a__U21(X1,X2) -> U21(X1,X2) a__U22(X) -> U22(X) a__U31(X1,X2) -> U31(X1,X2) a__U41(X1,X2,X3) -> U41(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNatKind(X) -> isNatKind(X) Qed