YES Problem: a__U11(tt(),N) -> mark(N) a__U21(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__and(a__isNat(V1),isNat(V2)) a__isNat(s(V1)) -> a__isNat(V1) a__plus(N,0()) -> a__U11(a__isNat(N),N) a__plus(N,s(M)) -> a__U21(a__and(a__isNat(M),isNat(N)),M,N) mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(U21(X1,X2,X3)) -> a__U21(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2) -> U11(X1,X2) a__U21(X1,X2,X3) -> U21(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNat(X) -> isNat(X) Proof: DP Processor: DPs: a__U11#(tt(),N) -> mark#(N) a__U21#(tt(),M,N) -> mark#(M) a__U21#(tt(),M,N) -> mark#(N) a__U21#(tt(),M,N) -> a__plus#(mark(N),mark(M)) a__and#(tt(),X) -> mark#(X) a__isNat#(plus(V1,V2)) -> a__isNat#(V1) a__isNat#(plus(V1,V2)) -> a__and#(a__isNat(V1),isNat(V2)) a__isNat#(s(V1)) -> a__isNat#(V1) a__plus#(N,0()) -> a__isNat#(N) a__plus#(N,0()) -> a__U11#(a__isNat(N),N) a__plus#(N,s(M)) -> a__isNat#(M) a__plus#(N,s(M)) -> a__and#(a__isNat(M),isNat(N)) a__plus#(N,s(M)) -> a__U21#(a__and(a__isNat(M),isNat(N)),M,N) mark#(U11(X1,X2)) -> mark#(X1) mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) mark#(U21(X1,X2,X3)) -> mark#(X1) mark#(U21(X1,X2,X3)) -> a__U21#(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#(isNat(X)) -> a__isNat#(X) mark#(s(X)) -> mark#(X) TRS: a__U11(tt(),N) -> mark(N) a__U21(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__and(a__isNat(V1),isNat(V2)) a__isNat(s(V1)) -> a__isNat(V1) a__plus(N,0()) -> a__U11(a__isNat(N),N) a__plus(N,s(M)) -> a__U21(a__and(a__isNat(M),isNat(N)),M,N) mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(U21(X1,X2,X3)) -> a__U21(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2) -> U11(X1,X2) a__U21(X1,X2,X3) -> U21(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNat(X) -> isNat(X) TDG Processor: DPs: a__U11#(tt(),N) -> mark#(N) a__U21#(tt(),M,N) -> mark#(M) a__U21#(tt(),M,N) -> mark#(N) a__U21#(tt(),M,N) -> a__plus#(mark(N),mark(M)) a__and#(tt(),X) -> mark#(X) a__isNat#(plus(V1,V2)) -> a__isNat#(V1) a__isNat#(plus(V1,V2)) -> a__and#(a__isNat(V1),isNat(V2)) a__isNat#(s(V1)) -> a__isNat#(V1) a__plus#(N,0()) -> a__isNat#(N) a__plus#(N,0()) -> a__U11#(a__isNat(N),N) a__plus#(N,s(M)) -> a__isNat#(M) a__plus#(N,s(M)) -> a__and#(a__isNat(M),isNat(N)) a__plus#(N,s(M)) -> a__U21#(a__and(a__isNat(M),isNat(N)),M,N) mark#(U11(X1,X2)) -> mark#(X1) mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) mark#(U21(X1,X2,X3)) -> mark#(X1) mark#(U21(X1,X2,X3)) -> a__U21#(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#(isNat(X)) -> a__isNat#(X) mark#(s(X)) -> mark#(X) TRS: a__U11(tt(),N) -> mark(N) a__U21(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__and(a__isNat(V1),isNat(V2)) a__isNat(s(V1)) -> a__isNat(V1) a__plus(N,0()) -> a__U11(a__isNat(N),N) a__plus(N,s(M)) -> a__U21(a__and(a__isNat(M),isNat(N)),M,N) mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(U21(X1,X2,X3)) -> a__U21(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2) -> U11(X1,X2) a__U21(X1,X2,X3) -> U21(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNat(X) -> isNat(X) graph: a__isNat#(plus(V1,V2)) -> a__isNat#(V1) -> a__isNat#(s(V1)) -> a__isNat#(V1) a__isNat#(plus(V1,V2)) -> a__isNat#(V1) -> a__isNat#(plus(V1,V2)) -> a__and#(a__isNat(V1),isNat(V2)) a__isNat#(plus(V1,V2)) -> a__isNat#(V1) -> a__isNat#(plus(V1,V2)) -> a__isNat#(V1) a__isNat#(plus(V1,V2)) -> a__and#(a__isNat(V1),isNat(V2)) -> a__and#(tt(),X) -> mark#(X) a__isNat#(s(V1)) -> a__isNat#(V1) -> a__isNat#(s(V1)) -> a__isNat#(V1) a__isNat#(s(V1)) -> a__isNat#(V1) -> a__isNat#(plus(V1,V2)) -> a__and#(a__isNat(V1),isNat(V2)) a__isNat#(s(V1)) -> a__isNat#(V1) -> a__isNat#(plus(V1,V2)) -> a__isNat#(V1) a__and#(tt(),X) -> mark#(X) -> mark#(s(X)) -> mark#(X) a__and#(tt(),X) -> mark#(X) -> mark#(isNat(X)) -> a__isNat#(X) a__and#(tt(),X) -> mark#(X) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) a__and#(tt(),X) -> mark#(X) -> mark#(and(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#(plus(X1,X2)) -> mark#(X1) a__and#(tt(),X) -> mark#(X) -> mark#(plus(X1,X2)) -> mark#(X2) a__and#(tt(),X) -> mark#(X) -> mark#(U21(X1,X2,X3)) -> a__U21#(mark(X1),X2,X3) a__and#(tt(),X) -> mark#(X) -> mark#(U21(X1,X2,X3)) -> mark#(X1) a__and#(tt(),X) -> mark#(X) -> mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) a__and#(tt(),X) -> mark#(X) -> mark#(U11(X1,X2)) -> mark#(X1) a__plus#(N,0()) -> a__isNat#(N) -> a__isNat#(s(V1)) -> a__isNat#(V1) a__plus#(N,0()) -> a__isNat#(N) -> a__isNat#(plus(V1,V2)) -> a__and#(a__isNat(V1),isNat(V2)) a__plus#(N,0()) -> a__isNat#(N) -> a__isNat#(plus(V1,V2)) -> a__isNat#(V1) a__plus#(N,0()) -> a__U11#(a__isNat(N),N) -> a__U11#(tt(),N) -> mark#(N) a__plus#(N,s(M)) -> a__isNat#(M) -> a__isNat#(s(V1)) -> a__isNat#(V1) a__plus#(N,s(M)) -> a__isNat#(M) -> a__isNat#(plus(V1,V2)) -> a__and#(a__isNat(V1),isNat(V2)) a__plus#(N,s(M)) -> a__isNat#(M) -> a__isNat#(plus(V1,V2)) -> a__isNat#(V1) a__plus#(N,s(M)) -> a__and#(a__isNat(M),isNat(N)) -> a__and#(tt(),X) -> mark#(X) a__plus#(N,s(M)) -> a__U21#(a__and(a__isNat(M),isNat(N)),M,N) -> a__U21#(tt(),M,N) -> a__plus#(mark(N),mark(M)) a__plus#(N,s(M)) -> a__U21#(a__and(a__isNat(M),isNat(N)),M,N) -> a__U21#(tt(),M,N) -> mark#(N) a__plus#(N,s(M)) -> a__U21#(a__and(a__isNat(M),isNat(N)),M,N) -> a__U21#(tt(),M,N) -> mark#(M) a__U21#(tt(),M,N) -> a__plus#(mark(N),mark(M)) -> a__plus#(N,s(M)) -> a__U21#(a__and(a__isNat(M),isNat(N)),M,N) a__U21#(tt(),M,N) -> a__plus#(mark(N),mark(M)) -> a__plus#(N,s(M)) -> a__and#(a__isNat(M),isNat(N)) a__U21#(tt(),M,N) -> a__plus#(mark(N),mark(M)) -> a__plus#(N,s(M)) -> a__isNat#(M) a__U21#(tt(),M,N) -> a__plus#(mark(N),mark(M)) -> a__plus#(N,0()) -> a__U11#(a__isNat(N),N) a__U21#(tt(),M,N) -> a__plus#(mark(N),mark(M)) -> a__plus#(N,0()) -> a__isNat#(N) a__U21#(tt(),M,N) -> mark#(N) -> mark#(s(X)) -> mark#(X) a__U21#(tt(),M,N) -> mark#(N) -> mark#(isNat(X)) -> a__isNat#(X) a__U21#(tt(),M,N) -> mark#(N) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) a__U21#(tt(),M,N) -> mark#(N) -> mark#(and(X1,X2)) -> mark#(X1) a__U21#(tt(),M,N) -> mark#(N) -> mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) a__U21#(tt(),M,N) -> mark#(N) -> mark#(plus(X1,X2)) -> mark#(X1) a__U21#(tt(),M,N) -> mark#(N) -> mark#(plus(X1,X2)) -> mark#(X2) a__U21#(tt(),M,N) -> mark#(N) -> mark#(U21(X1,X2,X3)) -> a__U21#(mark(X1),X2,X3) a__U21#(tt(),M,N) -> mark#(N) -> mark#(U21(X1,X2,X3)) -> mark#(X1) a__U21#(tt(),M,N) -> mark#(N) -> mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) a__U21#(tt(),M,N) -> mark#(N) -> mark#(U11(X1,X2)) -> mark#(X1) a__U21#(tt(),M,N) -> mark#(M) -> mark#(s(X)) -> mark#(X) a__U21#(tt(),M,N) -> mark#(M) -> mark#(isNat(X)) -> a__isNat#(X) a__U21#(tt(),M,N) -> mark#(M) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) a__U21#(tt(),M,N) -> mark#(M) -> mark#(and(X1,X2)) -> mark#(X1) a__U21#(tt(),M,N) -> mark#(M) -> mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) a__U21#(tt(),M,N) -> mark#(M) -> mark#(plus(X1,X2)) -> mark#(X1) a__U21#(tt(),M,N) -> mark#(M) -> mark#(plus(X1,X2)) -> mark#(X2) a__U21#(tt(),M,N) -> mark#(M) -> mark#(U21(X1,X2,X3)) -> a__U21#(mark(X1),X2,X3) a__U21#(tt(),M,N) -> mark#(M) -> mark#(U21(X1,X2,X3)) -> mark#(X1) a__U21#(tt(),M,N) -> mark#(M) -> mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) a__U21#(tt(),M,N) -> mark#(M) -> mark#(U11(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) -> a__and#(tt(),X) -> mark#(X) mark#(and(X1,X2)) -> mark#(X1) -> mark#(s(X)) -> mark#(X) mark#(and(X1,X2)) -> mark#(X1) -> mark#(isNat(X)) -> a__isNat#(X) mark#(and(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) -> mark#(and(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#(plus(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> mark#(X1) -> mark#(plus(X1,X2)) -> mark#(X2) mark#(and(X1,X2)) -> mark#(X1) -> mark#(U21(X1,X2,X3)) -> a__U21#(mark(X1),X2,X3) mark#(and(X1,X2)) -> mark#(X1) -> mark#(U21(X1,X2,X3)) -> mark#(X1) mark#(and(X1,X2)) -> mark#(X1) -> mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) -> mark#(U11(X1,X2)) -> mark#(X1) mark#(U21(X1,X2,X3)) -> a__U21#(mark(X1),X2,X3) -> a__U21#(tt(),M,N) -> a__plus#(mark(N),mark(M)) mark#(U21(X1,X2,X3)) -> a__U21#(mark(X1),X2,X3) -> a__U21#(tt(),M,N) -> mark#(N) mark#(U21(X1,X2,X3)) -> a__U21#(mark(X1),X2,X3) -> a__U21#(tt(),M,N) -> mark#(M) mark#(U21(X1,X2,X3)) -> mark#(X1) -> mark#(s(X)) -> mark#(X) mark#(U21(X1,X2,X3)) -> mark#(X1) -> mark#(isNat(X)) -> a__isNat#(X) mark#(U21(X1,X2,X3)) -> mark#(X1) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(U21(X1,X2,X3)) -> mark#(X1) -> mark#(and(X1,X2)) -> mark#(X1) mark#(U21(X1,X2,X3)) -> mark#(X1) -> mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) mark#(U21(X1,X2,X3)) -> mark#(X1) -> mark#(plus(X1,X2)) -> mark#(X1) mark#(U21(X1,X2,X3)) -> mark#(X1) -> mark#(plus(X1,X2)) -> mark#(X2) mark#(U21(X1,X2,X3)) -> mark#(X1) -> mark#(U21(X1,X2,X3)) -> a__U21#(mark(X1),X2,X3) mark#(U21(X1,X2,X3)) -> mark#(X1) -> mark#(U21(X1,X2,X3)) -> mark#(X1) mark#(U21(X1,X2,X3)) -> mark#(X1) -> mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) mark#(U21(X1,X2,X3)) -> mark#(X1) -> mark#(U11(X1,X2)) -> mark#(X1) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(s(X)) -> mark#(X) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(isNat(X)) -> a__isNat#(X) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> mark#(X1) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(plus(X1,X2)) -> mark#(X1) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(plus(X1,X2)) -> mark#(X2) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(U21(X1,X2,X3)) -> a__U21#(mark(X1),X2,X3) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(U21(X1,X2,X3)) -> mark#(X1) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(U11(X1,X2)) -> mark#(X1) mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) -> a__U11#(tt(),N) -> mark#(N) mark#(isNat(X)) -> a__isNat#(X) -> a__isNat#(s(V1)) -> a__isNat#(V1) mark#(isNat(X)) -> a__isNat#(X) -> a__isNat#(plus(V1,V2)) -> a__and#(a__isNat(V1),isNat(V2)) mark#(isNat(X)) -> a__isNat#(X) -> a__isNat#(plus(V1,V2)) -> a__isNat#(V1) mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) -> a__plus#(N,s(M)) -> a__U21#(a__and(a__isNat(M),isNat(N)),M,N) mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) -> a__plus#(N,s(M)) -> a__and#(a__isNat(M),isNat(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,0()) -> a__U11#(a__isNat(N),N) mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) -> a__plus#(N,0()) -> a__isNat#(N) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(s(X)) -> mark#(X) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(isNat(X)) -> a__isNat#(X) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(and(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#(plus(X1,X2)) -> mark#(X1) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(plus(X1,X2)) -> mark#(X2) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(U21(X1,X2,X3)) -> a__U21#(mark(X1),X2,X3) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(U21(X1,X2,X3)) -> mark#(X1) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) mark#(plus(X1,X2)) -> mark#(X2) -> mark#(U11(X1,X2)) -> mark#(X1) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(s(X)) -> mark#(X) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(isNat(X)) -> a__isNat#(X) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(and(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#(plus(X1,X2)) -> mark#(X1) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(plus(X1,X2)) -> mark#(X2) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(U21(X1,X2,X3)) -> a__U21#(mark(X1),X2,X3) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(U21(X1,X2,X3)) -> mark#(X1) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) mark#(plus(X1,X2)) -> mark#(X1) -> mark#(U11(X1,X2)) -> mark#(X1) mark#(s(X)) -> mark#(X) -> mark#(s(X)) -> mark#(X) mark#(s(X)) -> mark#(X) -> mark#(isNat(X)) -> a__isNat#(X) mark#(s(X)) -> mark#(X) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(s(X)) -> mark#(X) -> mark#(and(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#(plus(X1,X2)) -> mark#(X1) mark#(s(X)) -> mark#(X) -> mark#(plus(X1,X2)) -> mark#(X2) mark#(s(X)) -> mark#(X) -> mark#(U21(X1,X2,X3)) -> a__U21#(mark(X1),X2,X3) mark#(s(X)) -> mark#(X) -> mark#(U21(X1,X2,X3)) -> mark#(X1) mark#(s(X)) -> mark#(X) -> mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) mark#(s(X)) -> mark#(X) -> mark#(U11(X1,X2)) -> mark#(X1) a__U11#(tt(),N) -> mark#(N) -> mark#(s(X)) -> mark#(X) a__U11#(tt(),N) -> mark#(N) -> mark#(isNat(X)) -> a__isNat#(X) a__U11#(tt(),N) -> mark#(N) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) a__U11#(tt(),N) -> mark#(N) -> mark#(and(X1,X2)) -> mark#(X1) a__U11#(tt(),N) -> mark#(N) -> mark#(plus(X1,X2)) -> a__plus#(mark(X1),mark(X2)) a__U11#(tt(),N) -> mark#(N) -> mark#(plus(X1,X2)) -> mark#(X1) a__U11#(tt(),N) -> mark#(N) -> mark#(plus(X1,X2)) -> mark#(X2) a__U11#(tt(),N) -> mark#(N) -> mark#(U21(X1,X2,X3)) -> a__U21#(mark(X1),X2,X3) a__U11#(tt(),N) -> mark#(N) -> mark#(U21(X1,X2,X3)) -> mark#(X1) a__U11#(tt(),N) -> mark#(N) -> mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) a__U11#(tt(),N) -> mark#(N) -> mark#(U11(X1,X2)) -> mark#(X1) Arctic Interpretation Processor: dimension: 1 interpretation: [a__isNat#](x0) = x0 + 0, [a__and#](x0, x1) = x0 + x1 + 0, [a__plus#](x0, x1) = x0 + x1 + 0, [a__U21#](x0, x1, x2) = x0 + x1 + x2 + 0, [mark#](x0) = x0 + 0, [a__U11#](x0, x1) = x0 + x1 + 0, [and](x0, x1) = x0 + x1 + 0, [U21](x0, x1, x2) = x0 + 1x1 + x2 + 2, [U11](x0, x1) = x0 + x1 + 0, [isNat](x0) = x0 + 0, [plus](x0, x1) = x0 + 1x1 + 2, [a__isNat](x0) = x0 + 0, [0] = 0, [a__and](x0, x1) = x0 + x1 + 0, [s](x0) = x0 + 0, [a__plus](x0, x1) = x0 + 1x1 + 2, [a__U21](x0, x1, x2) = x0 + 1x1 + x2 + 2, [mark](x0) = x0 + 0, [a__U11](x0, x1) = x0 + x1 + 0, [tt] = 0 orientation: a__U11#(tt(),N) = N + 0 >= N + 0 = mark#(N) a__U21#(tt(),M,N) = M + N + 0 >= M + 0 = mark#(M) a__U21#(tt(),M,N) = M + N + 0 >= N + 0 = mark#(N) a__U21#(tt(),M,N) = M + N + 0 >= M + N + 0 = a__plus#(mark(N),mark(M)) a__and#(tt(),X) = X + 0 >= X + 0 = mark#(X) a__isNat#(plus(V1,V2)) = V1 + 1V2 + 2 >= V1 + 0 = a__isNat#(V1) a__isNat#(plus(V1,V2)) = V1 + 1V2 + 2 >= V1 + V2 + 0 = a__and#(a__isNat(V1),isNat(V2)) a__isNat#(s(V1)) = V1 + 0 >= V1 + 0 = a__isNat#(V1) a__plus#(N,0()) = N + 0 >= N + 0 = a__isNat#(N) a__plus#(N,0()) = N + 0 >= N + 0 = a__U11#(a__isNat(N),N) a__plus#(N,s(M)) = M + N + 0 >= M + 0 = a__isNat#(M) a__plus#(N,s(M)) = M + N + 0 >= M + N + 0 = a__and#(a__isNat(M),isNat(N)) a__plus#(N,s(M)) = M + N + 0 >= M + N + 0 = a__U21#(a__and(a__isNat(M),isNat(N)),M,N) mark#(U11(X1,X2)) = X1 + X2 + 0 >= X1 + 0 = mark#(X1) mark#(U11(X1,X2)) = X1 + X2 + 0 >= X1 + X2 + 0 = a__U11#(mark(X1),X2) mark#(U21(X1,X2,X3)) = X1 + 1X2 + X3 + 2 >= X1 + 0 = mark#(X1) mark#(U21(X1,X2,X3)) = X1 + 1X2 + X3 + 2 >= X1 + X2 + X3 + 0 = a__U21#(mark(X1),X2,X3) mark#(plus(X1,X2)) = X1 + 1X2 + 2 >= X2 + 0 = mark#(X2) mark#(plus(X1,X2)) = X1 + 1X2 + 2 >= X1 + 0 = mark#(X1) mark#(plus(X1,X2)) = X1 + 1X2 + 2 >= X1 + X2 + 0 = a__plus#(mark(X1),mark(X2)) mark#(and(X1,X2)) = X1 + X2 + 0 >= X1 + 0 = mark#(X1) mark#(and(X1,X2)) = X1 + X2 + 0 >= X1 + X2 + 0 = a__and#(mark(X1),X2) mark#(isNat(X)) = X + 0 >= X + 0 = a__isNat#(X) mark#(s(X)) = X + 0 >= X + 0 = mark#(X) a__U11(tt(),N) = N + 0 >= N + 0 = mark(N) a__U21(tt(),M,N) = 1M + N + 2 >= 1M + N + 2 = s(a__plus(mark(N),mark(M))) a__and(tt(),X) = X + 0 >= X + 0 = mark(X) a__isNat(0()) = 0 >= 0 = tt() a__isNat(plus(V1,V2)) = V1 + 1V2 + 2 >= V1 + V2 + 0 = a__and(a__isNat(V1),isNat(V2)) a__isNat(s(V1)) = V1 + 0 >= V1 + 0 = a__isNat(V1) a__plus(N,0()) = N + 2 >= N + 0 = a__U11(a__isNat(N),N) a__plus(N,s(M)) = 1M + N + 2 >= 1M + N + 2 = a__U21(a__and(a__isNat(M),isNat(N)),M,N) mark(U11(X1,X2)) = X1 + X2 + 0 >= X1 + X2 + 0 = a__U11(mark(X1),X2) mark(U21(X1,X2,X3)) = X1 + 1X2 + X3 + 2 >= X1 + 1X2 + X3 + 2 = a__U21(mark(X1),X2,X3) mark(plus(X1,X2)) = X1 + 1X2 + 2 >= X1 + 1X2 + 2 = a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) = X1 + X2 + 0 >= X1 + X2 + 0 = a__and(mark(X1),X2) mark(isNat(X)) = X + 0 >= X + 0 = a__isNat(X) mark(tt()) = 0 >= 0 = tt() mark(s(X)) = X + 0 >= X + 0 = s(mark(X)) mark(0()) = 0 >= 0 = 0() a__U11(X1,X2) = X1 + X2 + 0 >= X1 + X2 + 0 = U11(X1,X2) a__U21(X1,X2,X3) = X1 + 1X2 + X3 + 2 >= X1 + 1X2 + X3 + 2 = U21(X1,X2,X3) a__plus(X1,X2) = X1 + 1X2 + 2 >= X1 + 1X2 + 2 = plus(X1,X2) a__and(X1,X2) = X1 + X2 + 0 >= X1 + X2 + 0 = and(X1,X2) a__isNat(X) = X + 0 >= X + 0 = isNat(X) problem: DPs: a__U11#(tt(),N) -> mark#(N) a__U21#(tt(),M,N) -> mark#(M) a__U21#(tt(),M,N) -> mark#(N) a__U21#(tt(),M,N) -> a__plus#(mark(N),mark(M)) a__and#(tt(),X) -> mark#(X) a__isNat#(plus(V1,V2)) -> a__isNat#(V1) a__isNat#(plus(V1,V2)) -> a__and#(a__isNat(V1),isNat(V2)) a__isNat#(s(V1)) -> a__isNat#(V1) a__plus#(N,0()) -> a__isNat#(N) a__plus#(N,0()) -> a__U11#(a__isNat(N),N) a__plus#(N,s(M)) -> a__isNat#(M) a__plus#(N,s(M)) -> a__and#(a__isNat(M),isNat(N)) a__plus#(N,s(M)) -> a__U21#(a__and(a__isNat(M),isNat(N)),M,N) mark#(U11(X1,X2)) -> mark#(X1) mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) mark#(U21(X1,X2,X3)) -> mark#(X1) mark#(U21(X1,X2,X3)) -> a__U21#(mark(X1),X2,X3) 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#(isNat(X)) -> a__isNat#(X) mark#(s(X)) -> mark#(X) TRS: a__U11(tt(),N) -> mark(N) a__U21(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__and(a__isNat(V1),isNat(V2)) a__isNat(s(V1)) -> a__isNat(V1) a__plus(N,0()) -> a__U11(a__isNat(N),N) a__plus(N,s(M)) -> a__U21(a__and(a__isNat(M),isNat(N)),M,N) mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(U21(X1,X2,X3)) -> a__U21(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2) -> U11(X1,X2) a__U21(X1,X2,X3) -> U21(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNat(X) -> isNat(X) Arctic Interpretation Processor: dimension: 1 interpretation: [a__isNat#](x0) = 0, [a__and#](x0, x1) = x1, [a__plus#](x0, x1) = x0 + x1 + 0, [a__U21#](x0, x1, x2) = x0 + x1 + x2 + 0, [mark#](x0) = x0, [a__U11#](x0, x1) = x1, [and](x0, x1) = x0 + x1, [U21](x0, x1, x2) = x0 + 6x1 + 6x2 + 6, [U11](x0, x1) = x0 + 6x1, [isNat](x0) = 0, [plus](x0, x1) = 6x0 + 6x1 + 6, [a__isNat](x0) = 0, [0] = 0, [a__and](x0, x1) = x0 + x1 + 0, [s](x0) = x0 + 0, [a__plus](x0, x1) = 6x0 + 6x1 + 6, [a__U21](x0, x1, x2) = x0 + 6x1 + 6x2 + 6, [mark](x0) = x0 + 0, [a__U11](x0, x1) = x0 + 6x1 + 0, [tt] = 0 orientation: a__U11#(tt(),N) = N >= N = mark#(N) a__U21#(tt(),M,N) = M + N + 0 >= M = mark#(M) a__U21#(tt(),M,N) = M + N + 0 >= N = mark#(N) a__U21#(tt(),M,N) = M + N + 0 >= M + N + 0 = a__plus#(mark(N),mark(M)) a__and#(tt(),X) = X >= X = mark#(X) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__isNat#(V1) a__isNat#(plus(V1,V2)) = 0 >= 0 = a__and#(a__isNat(V1),isNat(V2)) a__isNat#(s(V1)) = 0 >= 0 = a__isNat#(V1) a__plus#(N,0()) = N + 0 >= 0 = a__isNat#(N) a__plus#(N,0()) = N + 0 >= N = a__U11#(a__isNat(N),N) a__plus#(N,s(M)) = M + N + 0 >= 0 = a__isNat#(M) a__plus#(N,s(M)) = M + N + 0 >= 0 = a__and#(a__isNat(M),isNat(N)) a__plus#(N,s(M)) = M + N + 0 >= M + N + 0 = a__U21#(a__and(a__isNat(M),isNat(N)),M,N) mark#(U11(X1,X2)) = X1 + 6X2 >= X1 = mark#(X1) mark#(U11(X1,X2)) = X1 + 6X2 >= X2 = a__U11#(mark(X1),X2) mark#(U21(X1,X2,X3)) = X1 + 6X2 + 6X3 + 6 >= X1 = mark#(X1) mark#(U21(X1,X2,X3)) = X1 + 6X2 + 6X3 + 6 >= X1 + X2 + X3 + 0 = a__U21#(mark(X1),X2,X3) mark#(plus(X1,X2)) = 6X1 + 6X2 + 6 >= X1 = mark#(X1) mark#(plus(X1,X2)) = 6X1 + 6X2 + 6 >= X1 + X2 + 0 = a__plus#(mark(X1),mark(X2)) mark#(and(X1,X2)) = X1 + X2 >= X1 = mark#(X1) mark#(and(X1,X2)) = X1 + X2 >= X2 = a__and#(mark(X1),X2) mark#(isNat(X)) = 0 >= 0 = a__isNat#(X) mark#(s(X)) = X + 0 >= X = mark#(X) a__U11(tt(),N) = 6N + 0 >= N + 0 = mark(N) a__U21(tt(),M,N) = 6M + 6N + 6 >= 6M + 6N + 6 = s(a__plus(mark(N),mark(M))) a__and(tt(),X) = X + 0 >= X + 0 = mark(X) a__isNat(0()) = 0 >= 0 = tt() a__isNat(plus(V1,V2)) = 0 >= 0 = a__and(a__isNat(V1),isNat(V2)) a__isNat(s(V1)) = 0 >= 0 = a__isNat(V1) a__plus(N,0()) = 6N + 6 >= 6N + 0 = a__U11(a__isNat(N),N) a__plus(N,s(M)) = 6M + 6N + 6 >= 6M + 6N + 6 = a__U21(a__and(a__isNat(M),isNat(N)),M,N) mark(U11(X1,X2)) = X1 + 6X2 + 0 >= X1 + 6X2 + 0 = a__U11(mark(X1),X2) mark(U21(X1,X2,X3)) = X1 + 6X2 + 6X3 + 6 >= X1 + 6X2 + 6X3 + 6 = a__U21(mark(X1),X2,X3) mark(plus(X1,X2)) = 6X1 + 6X2 + 6 >= 6X1 + 6X2 + 6 = a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) = X1 + X2 + 0 >= X1 + X2 + 0 = a__and(mark(X1),X2) mark(isNat(X)) = 0 >= 0 = a__isNat(X) mark(tt()) = 0 >= 0 = tt() mark(s(X)) = X + 0 >= X + 0 = s(mark(X)) mark(0()) = 0 >= 0 = 0() a__U11(X1,X2) = X1 + 6X2 + 0 >= X1 + 6X2 = U11(X1,X2) a__U21(X1,X2,X3) = X1 + 6X2 + 6X3 + 6 >= X1 + 6X2 + 6X3 + 6 = U21(X1,X2,X3) a__plus(X1,X2) = 6X1 + 6X2 + 6 >= 6X1 + 6X2 + 6 = plus(X1,X2) a__and(X1,X2) = X1 + X2 + 0 >= X1 + X2 = and(X1,X2) a__isNat(X) = 0 >= 0 = isNat(X) problem: DPs: a__U11#(tt(),N) -> mark#(N) a__U21#(tt(),M,N) -> mark#(M) a__U21#(tt(),M,N) -> mark#(N) a__U21#(tt(),M,N) -> a__plus#(mark(N),mark(M)) a__and#(tt(),X) -> mark#(X) a__isNat#(plus(V1,V2)) -> a__isNat#(V1) a__isNat#(plus(V1,V2)) -> a__and#(a__isNat(V1),isNat(V2)) a__isNat#(s(V1)) -> a__isNat#(V1) a__plus#(N,0()) -> a__isNat#(N) a__plus#(N,0()) -> a__U11#(a__isNat(N),N) a__plus#(N,s(M)) -> a__isNat#(M) a__plus#(N,s(M)) -> a__and#(a__isNat(M),isNat(N)) a__plus#(N,s(M)) -> a__U21#(a__and(a__isNat(M),isNat(N)),M,N) mark#(U11(X1,X2)) -> mark#(X1) mark#(U21(X1,X2,X3)) -> mark#(X1) mark#(U21(X1,X2,X3)) -> a__U21#(mark(X1),X2,X3) mark#(and(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(isNat(X)) -> a__isNat#(X) mark#(s(X)) -> mark#(X) TRS: a__U11(tt(),N) -> mark(N) a__U21(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__and(a__isNat(V1),isNat(V2)) a__isNat(s(V1)) -> a__isNat(V1) a__plus(N,0()) -> a__U11(a__isNat(N),N) a__plus(N,s(M)) -> a__U21(a__and(a__isNat(M),isNat(N)),M,N) mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(U21(X1,X2,X3)) -> a__U21(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2) -> U11(X1,X2) a__U21(X1,X2,X3) -> U21(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNat(X) -> isNat(X) Arctic Interpretation Processor: dimension: 1 interpretation: [a__isNat#](x0) = x0, [a__and#](x0, x1) = x1, [a__plus#](x0, x1) = 4x0 + 4x1, [a__U21#](x0, x1, x2) = 3x0 + 4x1 + 4x2 + 0, [mark#](x0) = x0, [a__U11#](x0, x1) = 4x1 + 4, [and](x0, x1) = x0 + x1 + 0, [U21](x0, x1, x2) = 4x0 + 6x1 + 6x2 + 0, [U11](x0, x1) = x0 + x1, [isNat](x0) = 1x0 + 0, [plus](x0, x1) = 6x0 + 6x1 + 0, [a__isNat](x0) = 1x0 + 0, [0] = 0, [a__and](x0, x1) = x0 + x1 + 0, [s](x0) = x0 + 0, [a__plus](x0, x1) = 6x0 + 6x1 + 0, [a__U21](x0, x1, x2) = 4x0 + 6x1 + 6x2 + 0, [mark](x0) = x0, [a__U11](x0, x1) = x0 + x1, [tt] = 1 orientation: a__U11#(tt(),N) = 4N + 4 >= N = mark#(N) a__U21#(tt(),M,N) = 4M + 4N + 4 >= M = mark#(M) a__U21#(tt(),M,N) = 4M + 4N + 4 >= N = mark#(N) a__U21#(tt(),M,N) = 4M + 4N + 4 >= 4M + 4N = a__plus#(mark(N),mark(M)) a__and#(tt(),X) = X >= X = mark#(X) a__isNat#(plus(V1,V2)) = 6V1 + 6V2 + 0 >= V1 = a__isNat#(V1) a__isNat#(plus(V1,V2)) = 6V1 + 6V2 + 0 >= 1V2 + 0 = a__and#(a__isNat(V1),isNat(V2)) a__isNat#(s(V1)) = V1 + 0 >= V1 = a__isNat#(V1) a__plus#(N,0()) = 4N + 4 >= N = a__isNat#(N) a__plus#(N,0()) = 4N + 4 >= 4N + 4 = a__U11#(a__isNat(N),N) a__plus#(N,s(M)) = 4M + 4N + 4 >= M = a__isNat#(M) a__plus#(N,s(M)) = 4M + 4N + 4 >= 1N + 0 = a__and#(a__isNat(M),isNat(N)) a__plus#(N,s(M)) = 4M + 4N + 4 >= 4M + 4N + 3 = a__U21#(a__and(a__isNat(M),isNat(N)),M,N) mark#(U11(X1,X2)) = X1 + X2 >= X1 = mark#(X1) mark#(U21(X1,X2,X3)) = 4X1 + 6X2 + 6X3 + 0 >= X1 = mark#(X1) mark#(U21(X1,X2,X3)) = 4X1 + 6X2 + 6X3 + 0 >= 3X1 + 4X2 + 4X3 + 0 = a__U21#(mark(X1),X2,X3) mark#(and(X1,X2)) = X1 + X2 + 0 >= X1 = mark#(X1) mark#(and(X1,X2)) = X1 + X2 + 0 >= X2 = a__and#(mark(X1),X2) mark#(isNat(X)) = 1X + 0 >= X = a__isNat#(X) mark#(s(X)) = X + 0 >= X = mark#(X) a__U11(tt(),N) = N + 1 >= N = mark(N) a__U21(tt(),M,N) = 6M + 6N + 5 >= 6M + 6N + 0 = 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)) = 7V1 + 7V2 + 1 >= 1V1 + 1V2 + 0 = a__and(a__isNat(V1),isNat(V2)) a__isNat(s(V1)) = 1V1 + 1 >= 1V1 + 0 = a__isNat(V1) a__plus(N,0()) = 6N + 6 >= 1N + 0 = a__U11(a__isNat(N),N) a__plus(N,s(M)) = 6M + 6N + 6 >= 6M + 6N + 4 = a__U21(a__and(a__isNat(M),isNat(N)),M,N) mark(U11(X1,X2)) = X1 + X2 >= X1 + X2 = a__U11(mark(X1),X2) mark(U21(X1,X2,X3)) = 4X1 + 6X2 + 6X3 + 0 >= 4X1 + 6X2 + 6X3 + 0 = a__U21(mark(X1),X2,X3) mark(plus(X1,X2)) = 6X1 + 6X2 + 0 >= 6X1 + 6X2 + 0 = a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) = X1 + X2 + 0 >= X1 + X2 + 0 = a__and(mark(X1),X2) mark(isNat(X)) = 1X + 0 >= 1X + 0 = a__isNat(X) mark(tt()) = 1 >= 1 = tt() mark(s(X)) = X + 0 >= X + 0 = s(mark(X)) mark(0()) = 0 >= 0 = 0() a__U11(X1,X2) = X1 + X2 >= X1 + X2 = U11(X1,X2) a__U21(X1,X2,X3) = 4X1 + 6X2 + 6X3 + 0 >= 4X1 + 6X2 + 6X3 + 0 = U21(X1,X2,X3) a__plus(X1,X2) = 6X1 + 6X2 + 0 >= 6X1 + 6X2 + 0 = plus(X1,X2) a__and(X1,X2) = X1 + X2 + 0 >= X1 + X2 + 0 = and(X1,X2) a__isNat(X) = 1X + 0 >= 1X + 0 = isNat(X) problem: DPs: a__U21#(tt(),M,N) -> a__plus#(mark(N),mark(M)) a__and#(tt(),X) -> mark#(X) a__isNat#(plus(V1,V2)) -> a__and#(a__isNat(V1),isNat(V2)) a__isNat#(s(V1)) -> a__isNat#(V1) a__plus#(N,0()) -> a__U11#(a__isNat(N),N) a__plus#(N,s(M)) -> a__U21#(a__and(a__isNat(M),isNat(N)),M,N) mark#(U11(X1,X2)) -> mark#(X1) mark#(U21(X1,X2,X3)) -> a__U21#(mark(X1),X2,X3) mark#(and(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(s(X)) -> mark#(X) TRS: a__U11(tt(),N) -> mark(N) a__U21(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__and(a__isNat(V1),isNat(V2)) a__isNat(s(V1)) -> a__isNat(V1) a__plus(N,0()) -> a__U11(a__isNat(N),N) a__plus(N,s(M)) -> a__U21(a__and(a__isNat(M),isNat(N)),M,N) mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(U21(X1,X2,X3)) -> a__U21(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2) -> U11(X1,X2) a__U21(X1,X2,X3) -> U21(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNat(X) -> isNat(X) SCC Processor: #sccs: 3 #rules: 8 #arcs: 146/121 DPs: a__isNat#(s(V1)) -> a__isNat#(V1) TRS: a__U11(tt(),N) -> mark(N) a__U21(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__and(a__isNat(V1),isNat(V2)) a__isNat(s(V1)) -> a__isNat(V1) a__plus(N,0()) -> a__U11(a__isNat(N),N) a__plus(N,s(M)) -> a__U21(a__and(a__isNat(M),isNat(N)),M,N) mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(U21(X1,X2,X3)) -> a__U21(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2) -> U11(X1,X2) a__U21(X1,X2,X3) -> U21(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNat(X) -> isNat(X) Subterm Criterion Processor: simple projection: pi(a__isNat#) = 0 problem: DPs: TRS: a__U11(tt(),N) -> mark(N) a__U21(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__and(a__isNat(V1),isNat(V2)) a__isNat(s(V1)) -> a__isNat(V1) a__plus(N,0()) -> a__U11(a__isNat(N),N) a__plus(N,s(M)) -> a__U21(a__and(a__isNat(M),isNat(N)),M,N) mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(U21(X1,X2,X3)) -> a__U21(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2) -> U11(X1,X2) a__U21(X1,X2,X3) -> U21(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNat(X) -> isNat(X) Qed DPs: a__and#(tt(),X) -> mark#(X) mark#(U11(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(s(X)) -> mark#(X) TRS: a__U11(tt(),N) -> mark(N) a__U21(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__and(a__isNat(V1),isNat(V2)) a__isNat(s(V1)) -> a__isNat(V1) a__plus(N,0()) -> a__U11(a__isNat(N),N) a__plus(N,s(M)) -> a__U21(a__and(a__isNat(M),isNat(N)),M,N) mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(U21(X1,X2,X3)) -> a__U21(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2) -> U11(X1,X2) a__U21(X1,X2,X3) -> U21(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNat(X) -> isNat(X) Subterm Criterion Processor: simple projection: pi(mark#) = 0 pi(a__and#) = 1 problem: DPs: a__and#(tt(),X) -> mark#(X) TRS: a__U11(tt(),N) -> mark(N) a__U21(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__and(a__isNat(V1),isNat(V2)) a__isNat(s(V1)) -> a__isNat(V1) a__plus(N,0()) -> a__U11(a__isNat(N),N) a__plus(N,s(M)) -> a__U21(a__and(a__isNat(M),isNat(N)),M,N) mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(U21(X1,X2,X3)) -> a__U21(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2) -> U11(X1,X2) a__U21(X1,X2,X3) -> U21(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNat(X) -> isNat(X) SCC Processor: #sccs: 0 #rules: 0 #arcs: 17/1 DPs: a__U21#(tt(),M,N) -> a__plus#(mark(N),mark(M)) a__plus#(N,s(M)) -> a__U21#(a__and(a__isNat(M),isNat(N)),M,N) TRS: a__U11(tt(),N) -> mark(N) a__U21(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__and(a__isNat(V1),isNat(V2)) a__isNat(s(V1)) -> a__isNat(V1) a__plus(N,0()) -> a__U11(a__isNat(N),N) a__plus(N,s(M)) -> a__U21(a__and(a__isNat(M),isNat(N)),M,N) mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(U21(X1,X2,X3)) -> a__U21(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2) -> U11(X1,X2) a__U21(X1,X2,X3) -> U21(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNat(X) -> isNat(X) KBO Processor: argument filtering: pi(tt) = [] pi(a__U11) = [1] pi(mark) = [0] pi(a__U21) = [1,2] pi(a__plus) = [0,1] pi(s) = [0] pi(a__and) = [1] pi(0) = [] pi(a__isNat) = 0 pi(plus) = [0,1] pi(isNat) = 0 pi(U11) = [1] pi(U21) = [1,2] pi(and) = [1] pi(a__U21#) = [1] pi(a__plus#) = 1 weight function: w0 = 1 w(a__U21#) = w(and) = w(U21) = w(U11) = w(0) = w(a__and) = w( s) = w(a__U21) = w(a__U11) = w(tt) = 1 w(a__plus#) = w(isNat) = w(plus) = w(a__isNat) = w(a__plus) = w( mark) = 0 precedence: mark > a__plus > a__U21 ~ a__U11 > plus > a__and > s > 0 > a__plus# ~ a__U21# ~ and ~ U21 ~ U11 ~ isNat ~ a__isNat ~ tt problem: DPs: TRS: a__U11(tt(),N) -> mark(N) a__U21(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__and(a__isNat(V1),isNat(V2)) a__isNat(s(V1)) -> a__isNat(V1) a__plus(N,0()) -> a__U11(a__isNat(N),N) a__plus(N,s(M)) -> a__U21(a__and(a__isNat(M),isNat(N)),M,N) mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(U21(X1,X2,X3)) -> a__U21(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2) -> U11(X1,X2) a__U21(X1,X2,X3) -> U21(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNat(X) -> isNat(X) Qed