MAYBE Problem: a__zeros() -> cons(0(),zeros()) a__U11(tt(),L) -> s(a__length(mark(L))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(length(V1)) -> a__isNatList(V1) a__isNat(s(V1)) -> a__isNat(V1) a__isNatIList(V) -> a__isNatList(V) a__isNatIList(zeros()) -> tt() a__isNatIList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatIList(V2)) a__isNatList(nil()) -> tt() a__isNatList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatList(V2)) a__length(nil()) -> 0() a__length(cons(N,L)) -> a__U11(a__and(a__isNatList(L),isNat(N)),L) mark(zeros()) -> a__zeros() mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(isNatList(X)) -> a__isNatList(X) mark(isNatIList(X)) -> a__isNatIList(X) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() a__zeros() -> zeros() a__U11(X1,X2) -> U11(X1,X2) a__length(X) -> length(X) a__and(X1,X2) -> and(X1,X2) a__isNat(X) -> isNat(X) a__isNatList(X) -> isNatList(X) a__isNatIList(X) -> isNatIList(X) Proof: DP Processor: DPs: a__U11#(tt(),L) -> mark#(L) a__U11#(tt(),L) -> a__length#(mark(L)) a__and#(tt(),X) -> mark#(X) a__isNat#(length(V1)) -> a__isNatList#(V1) a__isNat#(s(V1)) -> a__isNat#(V1) a__isNatIList#(V) -> a__isNatList#(V) a__isNatIList#(cons(V1,V2)) -> a__isNat#(V1) a__isNatIList#(cons(V1,V2)) -> a__and#(a__isNat(V1),isNatIList(V2)) a__isNatList#(cons(V1,V2)) -> a__isNat#(V1) a__isNatList#(cons(V1,V2)) -> a__and#(a__isNat(V1),isNatList(V2)) a__length#(cons(N,L)) -> a__isNatList#(L) a__length#(cons(N,L)) -> a__and#(a__isNatList(L),isNat(N)) a__length#(cons(N,L)) -> a__U11#(a__and(a__isNatList(L),isNat(N)),L) mark#(zeros()) -> a__zeros#() mark#(U11(X1,X2)) -> mark#(X1) mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) mark#(length(X)) -> mark#(X) mark#(length(X)) -> a__length#(mark(X)) mark#(and(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(isNat(X)) -> a__isNat#(X) mark#(isNatList(X)) -> a__isNatList#(X) mark#(isNatIList(X)) -> a__isNatIList#(X) mark#(cons(X1,X2)) -> mark#(X1) mark#(s(X)) -> mark#(X) TRS: a__zeros() -> cons(0(),zeros()) a__U11(tt(),L) -> s(a__length(mark(L))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(length(V1)) -> a__isNatList(V1) a__isNat(s(V1)) -> a__isNat(V1) a__isNatIList(V) -> a__isNatList(V) a__isNatIList(zeros()) -> tt() a__isNatIList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatIList(V2)) a__isNatList(nil()) -> tt() a__isNatList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatList(V2)) a__length(nil()) -> 0() a__length(cons(N,L)) -> a__U11(a__and(a__isNatList(L),isNat(N)),L) mark(zeros()) -> a__zeros() mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(isNatList(X)) -> a__isNatList(X) mark(isNatIList(X)) -> a__isNatIList(X) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() a__zeros() -> zeros() a__U11(X1,X2) -> U11(X1,X2) a__length(X) -> length(X) a__and(X1,X2) -> and(X1,X2) a__isNat(X) -> isNat(X) a__isNatList(X) -> isNatList(X) a__isNatIList(X) -> isNatIList(X) EDG Processor: DPs: a__U11#(tt(),L) -> mark#(L) a__U11#(tt(),L) -> a__length#(mark(L)) a__and#(tt(),X) -> mark#(X) a__isNat#(length(V1)) -> a__isNatList#(V1) a__isNat#(s(V1)) -> a__isNat#(V1) a__isNatIList#(V) -> a__isNatList#(V) a__isNatIList#(cons(V1,V2)) -> a__isNat#(V1) a__isNatIList#(cons(V1,V2)) -> a__and#(a__isNat(V1),isNatIList(V2)) a__isNatList#(cons(V1,V2)) -> a__isNat#(V1) a__isNatList#(cons(V1,V2)) -> a__and#(a__isNat(V1),isNatList(V2)) a__length#(cons(N,L)) -> a__isNatList#(L) a__length#(cons(N,L)) -> a__and#(a__isNatList(L),isNat(N)) a__length#(cons(N,L)) -> a__U11#(a__and(a__isNatList(L),isNat(N)),L) mark#(zeros()) -> a__zeros#() mark#(U11(X1,X2)) -> mark#(X1) mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) mark#(length(X)) -> mark#(X) mark#(length(X)) -> a__length#(mark(X)) mark#(and(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(isNat(X)) -> a__isNat#(X) mark#(isNatList(X)) -> a__isNatList#(X) mark#(isNatIList(X)) -> a__isNatIList#(X) mark#(cons(X1,X2)) -> mark#(X1) mark#(s(X)) -> mark#(X) TRS: a__zeros() -> cons(0(),zeros()) a__U11(tt(),L) -> s(a__length(mark(L))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(length(V1)) -> a__isNatList(V1) a__isNat(s(V1)) -> a__isNat(V1) a__isNatIList(V) -> a__isNatList(V) a__isNatIList(zeros()) -> tt() a__isNatIList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatIList(V2)) a__isNatList(nil()) -> tt() a__isNatList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatList(V2)) a__length(nil()) -> 0() a__length(cons(N,L)) -> a__U11(a__and(a__isNatList(L),isNat(N)),L) mark(zeros()) -> a__zeros() mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(isNatList(X)) -> a__isNatList(X) mark(isNatIList(X)) -> a__isNatIList(X) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() a__zeros() -> zeros() a__U11(X1,X2) -> U11(X1,X2) a__length(X) -> length(X) a__and(X1,X2) -> and(X1,X2) a__isNat(X) -> isNat(X) a__isNatList(X) -> isNatList(X) a__isNatIList(X) -> isNatIList(X) graph: a__isNatIList#(cons(V1,V2)) -> a__isNat#(V1) -> a__isNat#(length(V1)) -> a__isNatList#(V1) a__isNatIList#(cons(V1,V2)) -> a__isNat#(V1) -> a__isNat#(s(V1)) -> a__isNat#(V1) a__isNatIList#(cons(V1,V2)) -> a__and#(a__isNat(V1),isNatIList(V2)) -> a__and#(tt(),X) -> mark#(X) a__isNatIList#(V) -> a__isNatList#(V) -> a__isNatList#(cons(V1,V2)) -> a__isNat#(V1) a__isNatIList#(V) -> a__isNatList#(V) -> a__isNatList#(cons(V1,V2)) -> a__and#(a__isNat(V1),isNatList(V2)) a__isNatList#(cons(V1,V2)) -> a__isNat#(V1) -> a__isNat#(length(V1)) -> a__isNatList#(V1) a__isNatList#(cons(V1,V2)) -> a__isNat#(V1) -> a__isNat#(s(V1)) -> a__isNat#(V1) a__isNatList#(cons(V1,V2)) -> a__and#(a__isNat(V1),isNatList(V2)) -> a__and#(tt(),X) -> mark#(X) a__isNat#(length(V1)) -> a__isNatList#(V1) -> a__isNatList#(cons(V1,V2)) -> a__isNat#(V1) a__isNat#(length(V1)) -> a__isNatList#(V1) -> a__isNatList#(cons(V1,V2)) -> a__and#(a__isNat(V1),isNatList(V2)) a__isNat#(s(V1)) -> a__isNat#(V1) -> a__isNat#(length(V1)) -> a__isNatList#(V1) a__isNat#(s(V1)) -> a__isNat#(V1) -> a__isNat#(s(V1)) -> a__isNat#(V1) a__and#(tt(),X) -> mark#(X) -> mark#(zeros()) -> a__zeros#() a__and#(tt(),X) -> mark#(X) -> mark#(U11(X1,X2)) -> mark#(X1) a__and#(tt(),X) -> mark#(X) -> mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) a__and#(tt(),X) -> mark#(X) -> mark#(length(X)) -> mark#(X) a__and#(tt(),X) -> mark#(X) -> mark#(length(X)) -> a__length#(mark(X)) 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#(isNat(X)) -> a__isNat#(X) a__and#(tt(),X) -> mark#(X) -> mark#(isNatList(X)) -> a__isNatList#(X) a__and#(tt(),X) -> mark#(X) -> mark#(isNatIList(X)) -> a__isNatIList#(X) a__and#(tt(),X) -> mark#(X) -> mark#(cons(X1,X2)) -> mark#(X1) a__and#(tt(),X) -> mark#(X) -> mark#(s(X)) -> mark#(X) a__length#(cons(N,L)) -> a__isNatList#(L) -> a__isNatList#(cons(V1,V2)) -> a__isNat#(V1) a__length#(cons(N,L)) -> a__isNatList#(L) -> a__isNatList#(cons(V1,V2)) -> a__and#(a__isNat(V1),isNatList(V2)) a__length#(cons(N,L)) -> a__and#(a__isNatList(L),isNat(N)) -> a__and#(tt(),X) -> mark#(X) a__length#(cons(N,L)) -> a__U11#(a__and(a__isNatList(L),isNat(N)),L) -> a__U11#(tt(),L) -> mark#(L) a__length#(cons(N,L)) -> a__U11#(a__and(a__isNatList(L),isNat(N)),L) -> a__U11#(tt(),L) -> a__length#(mark(L)) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) -> a__and#(tt(),X) -> mark#(X) mark#(and(X1,X2)) -> mark#(X1) -> mark#(zeros()) -> a__zeros#() mark#(and(X1,X2)) -> mark#(X1) -> mark#(U11(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> mark#(X1) -> mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) -> mark#(length(X)) -> mark#(X) mark#(and(X1,X2)) -> mark#(X1) -> mark#(length(X)) -> a__length#(mark(X)) 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#(isNat(X)) -> a__isNat#(X) mark#(and(X1,X2)) -> mark#(X1) -> mark#(isNatList(X)) -> a__isNatList#(X) mark#(and(X1,X2)) -> mark#(X1) -> mark#(isNatIList(X)) -> a__isNatIList#(X) mark#(and(X1,X2)) -> mark#(X1) -> mark#(cons(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> mark#(X1) -> mark#(s(X)) -> mark#(X) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(zeros()) -> a__zeros#() mark#(U11(X1,X2)) -> mark#(X1) -> mark#(U11(X1,X2)) -> mark#(X1) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(length(X)) -> mark#(X) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(length(X)) -> a__length#(mark(X)) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> mark#(X1) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(isNat(X)) -> a__isNat#(X) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(isNatList(X)) -> a__isNatList#(X) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(isNatIList(X)) -> a__isNatIList#(X) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(cons(X1,X2)) -> mark#(X1) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(s(X)) -> mark#(X) mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) -> a__U11#(tt(),L) -> mark#(L) mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) -> a__U11#(tt(),L) -> a__length#(mark(L)) mark#(isNat(X)) -> a__isNat#(X) -> a__isNat#(length(V1)) -> a__isNatList#(V1) mark#(isNat(X)) -> a__isNat#(X) -> a__isNat#(s(V1)) -> a__isNat#(V1) mark#(isNatList(X)) -> a__isNatList#(X) -> a__isNatList#(cons(V1,V2)) -> a__isNat#(V1) mark#(isNatList(X)) -> a__isNatList#(X) -> a__isNatList#(cons(V1,V2)) -> a__and#(a__isNat(V1),isNatList(V2)) mark#(isNatIList(X)) -> a__isNatIList#(X) -> a__isNatIList#(V) -> a__isNatList#(V) mark#(isNatIList(X)) -> a__isNatIList#(X) -> a__isNatIList#(cons(V1,V2)) -> a__isNat#(V1) mark#(isNatIList(X)) -> a__isNatIList#(X) -> a__isNatIList#(cons(V1,V2)) -> a__and#(a__isNat(V1),isNatIList(V2)) mark#(length(X)) -> a__length#(mark(X)) -> a__length#(cons(N,L)) -> a__isNatList#(L) mark#(length(X)) -> a__length#(mark(X)) -> a__length#(cons(N,L)) -> a__and#(a__isNatList(L),isNat(N)) mark#(length(X)) -> a__length#(mark(X)) -> a__length#(cons(N,L)) -> a__U11#(a__and(a__isNatList(L),isNat(N)),L) mark#(length(X)) -> mark#(X) -> mark#(zeros()) -> a__zeros#() mark#(length(X)) -> mark#(X) -> mark#(U11(X1,X2)) -> mark#(X1) mark#(length(X)) -> mark#(X) -> mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) mark#(length(X)) -> mark#(X) -> mark#(length(X)) -> mark#(X) mark#(length(X)) -> mark#(X) -> mark#(length(X)) -> a__length#(mark(X)) mark#(length(X)) -> mark#(X) -> mark#(and(X1,X2)) -> mark#(X1) mark#(length(X)) -> mark#(X) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(length(X)) -> mark#(X) -> mark#(isNat(X)) -> a__isNat#(X) mark#(length(X)) -> mark#(X) -> mark#(isNatList(X)) -> a__isNatList#(X) mark#(length(X)) -> mark#(X) -> mark#(isNatIList(X)) -> a__isNatIList#(X) mark#(length(X)) -> mark#(X) -> mark#(cons(X1,X2)) -> mark#(X1) mark#(length(X)) -> mark#(X) -> mark#(s(X)) -> mark#(X) mark#(s(X)) -> mark#(X) -> mark#(zeros()) -> a__zeros#() mark#(s(X)) -> mark#(X) -> mark#(U11(X1,X2)) -> mark#(X1) mark#(s(X)) -> mark#(X) -> mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) mark#(s(X)) -> mark#(X) -> mark#(length(X)) -> mark#(X) mark#(s(X)) -> mark#(X) -> mark#(length(X)) -> a__length#(mark(X)) 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#(isNat(X)) -> a__isNat#(X) mark#(s(X)) -> mark#(X) -> mark#(isNatList(X)) -> a__isNatList#(X) mark#(s(X)) -> mark#(X) -> mark#(isNatIList(X)) -> a__isNatIList#(X) mark#(s(X)) -> mark#(X) -> mark#(cons(X1,X2)) -> mark#(X1) mark#(s(X)) -> mark#(X) -> mark#(s(X)) -> mark#(X) mark#(cons(X1,X2)) -> mark#(X1) -> mark#(zeros()) -> a__zeros#() mark#(cons(X1,X2)) -> mark#(X1) -> mark#(U11(X1,X2)) -> mark#(X1) mark#(cons(X1,X2)) -> mark#(X1) -> mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) mark#(cons(X1,X2)) -> mark#(X1) -> mark#(length(X)) -> mark#(X) mark#(cons(X1,X2)) -> mark#(X1) -> mark#(length(X)) -> a__length#(mark(X)) mark#(cons(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> mark#(X1) mark#(cons(X1,X2)) -> mark#(X1) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(cons(X1,X2)) -> mark#(X1) -> mark#(isNat(X)) -> a__isNat#(X) mark#(cons(X1,X2)) -> mark#(X1) -> mark#(isNatList(X)) -> a__isNatList#(X) mark#(cons(X1,X2)) -> mark#(X1) -> mark#(isNatIList(X)) -> a__isNatIList#(X) mark#(cons(X1,X2)) -> mark#(X1) -> mark#(cons(X1,X2)) -> mark#(X1) mark#(cons(X1,X2)) -> mark#(X1) -> mark#(s(X)) -> mark#(X) a__U11#(tt(),L) -> a__length#(mark(L)) -> a__length#(cons(N,L)) -> a__isNatList#(L) a__U11#(tt(),L) -> a__length#(mark(L)) -> a__length#(cons(N,L)) -> a__and#(a__isNatList(L),isNat(N)) a__U11#(tt(),L) -> a__length#(mark(L)) -> a__length#(cons(N,L)) -> a__U11#(a__and(a__isNatList(L),isNat(N)),L) a__U11#(tt(),L) -> mark#(L) -> mark#(zeros()) -> a__zeros#() a__U11#(tt(),L) -> mark#(L) -> mark#(U11(X1,X2)) -> mark#(X1) a__U11#(tt(),L) -> mark#(L) -> mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) a__U11#(tt(),L) -> mark#(L) -> mark#(length(X)) -> mark#(X) a__U11#(tt(),L) -> mark#(L) -> mark#(length(X)) -> a__length#(mark(X)) a__U11#(tt(),L) -> mark#(L) -> mark#(and(X1,X2)) -> mark#(X1) a__U11#(tt(),L) -> mark#(L) -> mark#(and(X1,X2)) -> a__and#(mark(X1),X2) a__U11#(tt(),L) -> mark#(L) -> mark#(isNat(X)) -> a__isNat#(X) a__U11#(tt(),L) -> mark#(L) -> mark#(isNatList(X)) -> a__isNatList#(X) a__U11#(tt(),L) -> mark#(L) -> mark#(isNatIList(X)) -> a__isNatIList#(X) a__U11#(tt(),L) -> mark#(L) -> mark#(cons(X1,X2)) -> mark#(X1) a__U11#(tt(),L) -> mark#(L) -> mark#(s(X)) -> mark#(X) SCC Processor: #sccs: 1 #rules: 24 #arcs: 117/625 DPs: a__isNatIList#(cons(V1,V2)) -> a__isNat#(V1) a__isNat#(s(V1)) -> a__isNat#(V1) a__isNat#(length(V1)) -> a__isNatList#(V1) a__isNatList#(cons(V1,V2)) -> a__and#(a__isNat(V1),isNatList(V2)) a__and#(tt(),X) -> mark#(X) mark#(s(X)) -> mark#(X) mark#(cons(X1,X2)) -> mark#(X1) mark#(isNatIList(X)) -> a__isNatIList#(X) a__isNatIList#(cons(V1,V2)) -> a__and#(a__isNat(V1),isNatIList(V2)) a__isNatIList#(V) -> a__isNatList#(V) a__isNatList#(cons(V1,V2)) -> a__isNat#(V1) mark#(isNatList(X)) -> a__isNatList#(X) mark#(isNat(X)) -> a__isNat#(X) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) mark#(length(X)) -> a__length#(mark(X)) a__length#(cons(N,L)) -> a__U11#(a__and(a__isNatList(L),isNat(N)),L) a__U11#(tt(),L) -> a__length#(mark(L)) a__length#(cons(N,L)) -> a__and#(a__isNatList(L),isNat(N)) a__length#(cons(N,L)) -> a__isNatList#(L) a__U11#(tt(),L) -> mark#(L) mark#(length(X)) -> mark#(X) mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) mark#(U11(X1,X2)) -> mark#(X1) TRS: a__zeros() -> cons(0(),zeros()) a__U11(tt(),L) -> s(a__length(mark(L))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(length(V1)) -> a__isNatList(V1) a__isNat(s(V1)) -> a__isNat(V1) a__isNatIList(V) -> a__isNatList(V) a__isNatIList(zeros()) -> tt() a__isNatIList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatIList(V2)) a__isNatList(nil()) -> tt() a__isNatList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatList(V2)) a__length(nil()) -> 0() a__length(cons(N,L)) -> a__U11(a__and(a__isNatList(L),isNat(N)),L) mark(zeros()) -> a__zeros() mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(isNatList(X)) -> a__isNatList(X) mark(isNatIList(X)) -> a__isNatIList(X) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() a__zeros() -> zeros() a__U11(X1,X2) -> U11(X1,X2) a__length(X) -> length(X) a__and(X1,X2) -> and(X1,X2) a__isNat(X) -> isNat(X) a__isNatList(X) -> isNatList(X) a__isNatIList(X) -> isNatIList(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatIList#](x0) = 0, [a__isNatList#](x0) = 0, [a__isNat#](x0) = 0, [a__and#](x0, x1) = x1, [a__length#](x0) = x0, [mark#](x0) = x0, [a__U11#](x0, x1) = x1, [and](x0, x1) = x0 + x1, [U11](x0, x1) = x0 + x1 + 1, [isNat](x0) = 0, [isNatList](x0) = 0, [nil] = 0, [isNatIList](x0) = 0, [a__isNatIList](x0) = 0, [a__isNatList](x0) = 0, [length](x0) = x0 + 1, [a__isNat](x0) = 0, [a__and](x0, x1) = x0 + x1, [s](x0) = x0, [a__length](x0) = x0 + 1, [mark](x0) = x0, [a__U11](x0, x1) = x0 + x1 + 1, [tt] = 0, [cons](x0, x1) = x0 + x1, [zeros] = 0, [0] = 0, [a__zeros] = 0 orientation: a__isNatIList#(cons(V1,V2)) = 0 >= 0 = a__isNat#(V1) a__isNat#(s(V1)) = 0 >= 0 = a__isNat#(V1) a__isNat#(length(V1)) = 0 >= 0 = a__isNatList#(V1) a__isNatList#(cons(V1,V2)) = 0 >= 0 = a__and#(a__isNat(V1),isNatList(V2)) a__and#(tt(),X) = X >= X = mark#(X) mark#(s(X)) = X >= X = mark#(X) mark#(cons(X1,X2)) = X1 + X2 >= X1 = mark#(X1) mark#(isNatIList(X)) = 0 >= 0 = a__isNatIList#(X) a__isNatIList#(cons(V1,V2)) = 0 >= 0 = a__and#(a__isNat(V1),isNatIList(V2)) a__isNatIList#(V) = 0 >= 0 = a__isNatList#(V) a__isNatList#(cons(V1,V2)) = 0 >= 0 = a__isNat#(V1) mark#(isNatList(X)) = 0 >= 0 = a__isNatList#(X) mark#(isNat(X)) = 0 >= 0 = a__isNat#(X) mark#(and(X1,X2)) = X1 + X2 >= X2 = a__and#(mark(X1),X2) mark#(and(X1,X2)) = X1 + X2 >= X1 = mark#(X1) mark#(length(X)) = X + 1 >= X = a__length#(mark(X)) a__length#(cons(N,L)) = L + N >= L = a__U11#(a__and(a__isNatList(L),isNat(N)),L) a__U11#(tt(),L) = L >= L = a__length#(mark(L)) a__length#(cons(N,L)) = L + N >= 0 = a__and#(a__isNatList(L),isNat(N)) a__length#(cons(N,L)) = L + N >= 0 = a__isNatList#(L) a__U11#(tt(),L) = L >= L = mark#(L) mark#(length(X)) = X + 1 >= X = mark#(X) mark#(U11(X1,X2)) = X1 + X2 + 1 >= X2 = a__U11#(mark(X1),X2) mark#(U11(X1,X2)) = X1 + X2 + 1 >= X1 = mark#(X1) a__zeros() = 0 >= 0 = cons(0(),zeros()) a__U11(tt(),L) = L + 1 >= L + 1 = s(a__length(mark(L))) a__and(tt(),X) = X >= X = mark(X) a__isNat(0()) = 0 >= 0 = tt() a__isNat(length(V1)) = 0 >= 0 = a__isNatList(V1) a__isNat(s(V1)) = 0 >= 0 = a__isNat(V1) a__isNatIList(V) = 0 >= 0 = a__isNatList(V) a__isNatIList(zeros()) = 0 >= 0 = tt() a__isNatIList(cons(V1,V2)) = 0 >= 0 = a__and(a__isNat(V1),isNatIList(V2)) a__isNatList(nil()) = 0 >= 0 = tt() a__isNatList(cons(V1,V2)) = 0 >= 0 = a__and(a__isNat(V1),isNatList(V2)) a__length(nil()) = 1 >= 0 = 0() a__length(cons(N,L)) = L + N + 1 >= L + 1 = a__U11(a__and(a__isNatList(L),isNat(N)),L) mark(zeros()) = 0 >= 0 = a__zeros() mark(U11(X1,X2)) = X1 + X2 + 1 >= X1 + X2 + 1 = a__U11(mark(X1),X2) mark(length(X)) = X + 1 >= X + 1 = a__length(mark(X)) mark(and(X1,X2)) = X1 + X2 >= X1 + X2 = a__and(mark(X1),X2) mark(isNat(X)) = 0 >= 0 = a__isNat(X) mark(isNatList(X)) = 0 >= 0 = a__isNatList(X) mark(isNatIList(X)) = 0 >= 0 = a__isNatIList(X) mark(cons(X1,X2)) = X1 + X2 >= X1 + X2 = cons(mark(X1),X2) mark(0()) = 0 >= 0 = 0() mark(tt()) = 0 >= 0 = tt() mark(s(X)) = X >= X = s(mark(X)) mark(nil()) = 0 >= 0 = nil() a__zeros() = 0 >= 0 = zeros() a__U11(X1,X2) = X1 + X2 + 1 >= X1 + X2 + 1 = U11(X1,X2) a__length(X) = X + 1 >= X + 1 = length(X) a__and(X1,X2) = X1 + X2 >= X1 + X2 = and(X1,X2) a__isNat(X) = 0 >= 0 = isNat(X) a__isNatList(X) = 0 >= 0 = isNatList(X) a__isNatIList(X) = 0 >= 0 = isNatIList(X) problem: DPs: a__isNatIList#(cons(V1,V2)) -> a__isNat#(V1) a__isNat#(s(V1)) -> a__isNat#(V1) a__isNat#(length(V1)) -> a__isNatList#(V1) a__isNatList#(cons(V1,V2)) -> a__and#(a__isNat(V1),isNatList(V2)) a__and#(tt(),X) -> mark#(X) mark#(s(X)) -> mark#(X) mark#(cons(X1,X2)) -> mark#(X1) mark#(isNatIList(X)) -> a__isNatIList#(X) a__isNatIList#(cons(V1,V2)) -> a__and#(a__isNat(V1),isNatIList(V2)) a__isNatIList#(V) -> a__isNatList#(V) a__isNatList#(cons(V1,V2)) -> a__isNat#(V1) mark#(isNatList(X)) -> a__isNatList#(X) mark#(isNat(X)) -> a__isNat#(X) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) a__length#(cons(N,L)) -> a__U11#(a__and(a__isNatList(L),isNat(N)),L) a__U11#(tt(),L) -> a__length#(mark(L)) a__length#(cons(N,L)) -> a__and#(a__isNatList(L),isNat(N)) a__length#(cons(N,L)) -> a__isNatList#(L) a__U11#(tt(),L) -> mark#(L) TRS: a__zeros() -> cons(0(),zeros()) a__U11(tt(),L) -> s(a__length(mark(L))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(length(V1)) -> a__isNatList(V1) a__isNat(s(V1)) -> a__isNat(V1) a__isNatIList(V) -> a__isNatList(V) a__isNatIList(zeros()) -> tt() a__isNatIList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatIList(V2)) a__isNatList(nil()) -> tt() a__isNatList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatList(V2)) a__length(nil()) -> 0() a__length(cons(N,L)) -> a__U11(a__and(a__isNatList(L),isNat(N)),L) mark(zeros()) -> a__zeros() mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(isNatList(X)) -> a__isNatList(X) mark(isNatIList(X)) -> a__isNatIList(X) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() a__zeros() -> zeros() a__U11(X1,X2) -> U11(X1,X2) a__length(X) -> length(X) a__and(X1,X2) -> and(X1,X2) a__isNat(X) -> isNat(X) a__isNatList(X) -> isNatList(X) a__isNatIList(X) -> isNatIList(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatIList#](x0) = 0, [a__isNatList#](x0) = 0, [a__isNat#](x0) = 0, [a__and#](x0, x1) = 0, [a__length#](x0) = 1, [mark#](x0) = 0, [a__U11#](x0, x1) = 1, [and](x0, x1) = x1, [U11](x0, x1) = 0, [isNat](x0) = 0, [isNatList](x0) = 0, [nil] = 0, [isNatIList](x0) = 0, [a__isNatIList](x0) = 0, [a__isNatList](x0) = 0, [length](x0) = 0, [a__isNat](x0) = 0, [a__and](x0, x1) = x1, [s](x0) = 0, [a__length](x0) = 0, [mark](x0) = x0, [a__U11](x0, x1) = 0, [tt] = 0, [cons](x0, x1) = 0, [zeros] = 1, [0] = 0, [a__zeros] = 1 orientation: a__isNatIList#(cons(V1,V2)) = 0 >= 0 = a__isNat#(V1) a__isNat#(s(V1)) = 0 >= 0 = a__isNat#(V1) a__isNat#(length(V1)) = 0 >= 0 = a__isNatList#(V1) a__isNatList#(cons(V1,V2)) = 0 >= 0 = a__and#(a__isNat(V1),isNatList(V2)) a__and#(tt(),X) = 0 >= 0 = mark#(X) mark#(s(X)) = 0 >= 0 = mark#(X) mark#(cons(X1,X2)) = 0 >= 0 = mark#(X1) mark#(isNatIList(X)) = 0 >= 0 = a__isNatIList#(X) a__isNatIList#(cons(V1,V2)) = 0 >= 0 = a__and#(a__isNat(V1),isNatIList(V2)) a__isNatIList#(V) = 0 >= 0 = a__isNatList#(V) a__isNatList#(cons(V1,V2)) = 0 >= 0 = a__isNat#(V1) mark#(isNatList(X)) = 0 >= 0 = a__isNatList#(X) mark#(isNat(X)) = 0 >= 0 = a__isNat#(X) mark#(and(X1,X2)) = 0 >= 0 = a__and#(mark(X1),X2) mark#(and(X1,X2)) = 0 >= 0 = mark#(X1) a__length#(cons(N,L)) = 1 >= 1 = a__U11#(a__and(a__isNatList(L),isNat(N)),L) a__U11#(tt(),L) = 1 >= 1 = a__length#(mark(L)) a__length#(cons(N,L)) = 1 >= 0 = a__and#(a__isNatList(L),isNat(N)) a__length#(cons(N,L)) = 1 >= 0 = a__isNatList#(L) a__U11#(tt(),L) = 1 >= 0 = mark#(L) a__zeros() = 1 >= 0 = cons(0(),zeros()) a__U11(tt(),L) = 0 >= 0 = s(a__length(mark(L))) a__and(tt(),X) = X >= X = mark(X) a__isNat(0()) = 0 >= 0 = tt() a__isNat(length(V1)) = 0 >= 0 = a__isNatList(V1) a__isNat(s(V1)) = 0 >= 0 = a__isNat(V1) a__isNatIList(V) = 0 >= 0 = a__isNatList(V) a__isNatIList(zeros()) = 0 >= 0 = tt() a__isNatIList(cons(V1,V2)) = 0 >= 0 = a__and(a__isNat(V1),isNatIList(V2)) a__isNatList(nil()) = 0 >= 0 = tt() a__isNatList(cons(V1,V2)) = 0 >= 0 = a__and(a__isNat(V1),isNatList(V2)) a__length(nil()) = 0 >= 0 = 0() a__length(cons(N,L)) = 0 >= 0 = a__U11(a__and(a__isNatList(L),isNat(N)),L) mark(zeros()) = 1 >= 1 = a__zeros() mark(U11(X1,X2)) = 0 >= 0 = a__U11(mark(X1),X2) mark(length(X)) = 0 >= 0 = a__length(mark(X)) mark(and(X1,X2)) = X2 >= X2 = a__and(mark(X1),X2) mark(isNat(X)) = 0 >= 0 = a__isNat(X) mark(isNatList(X)) = 0 >= 0 = a__isNatList(X) mark(isNatIList(X)) = 0 >= 0 = a__isNatIList(X) mark(cons(X1,X2)) = 0 >= 0 = cons(mark(X1),X2) mark(0()) = 0 >= 0 = 0() mark(tt()) = 0 >= 0 = tt() mark(s(X)) = 0 >= 0 = s(mark(X)) mark(nil()) = 0 >= 0 = nil() a__zeros() = 1 >= 1 = zeros() a__U11(X1,X2) = 0 >= 0 = U11(X1,X2) a__length(X) = 0 >= 0 = length(X) a__and(X1,X2) = X2 >= X2 = and(X1,X2) a__isNat(X) = 0 >= 0 = isNat(X) a__isNatList(X) = 0 >= 0 = isNatList(X) a__isNatIList(X) = 0 >= 0 = isNatIList(X) problem: DPs: a__isNatIList#(cons(V1,V2)) -> a__isNat#(V1) a__isNat#(s(V1)) -> a__isNat#(V1) a__isNat#(length(V1)) -> a__isNatList#(V1) a__isNatList#(cons(V1,V2)) -> a__and#(a__isNat(V1),isNatList(V2)) a__and#(tt(),X) -> mark#(X) mark#(s(X)) -> mark#(X) mark#(cons(X1,X2)) -> mark#(X1) mark#(isNatIList(X)) -> a__isNatIList#(X) a__isNatIList#(cons(V1,V2)) -> a__and#(a__isNat(V1),isNatIList(V2)) a__isNatIList#(V) -> a__isNatList#(V) a__isNatList#(cons(V1,V2)) -> a__isNat#(V1) mark#(isNatList(X)) -> a__isNatList#(X) mark#(isNat(X)) -> a__isNat#(X) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) a__length#(cons(N,L)) -> a__U11#(a__and(a__isNatList(L),isNat(N)),L) a__U11#(tt(),L) -> a__length#(mark(L)) TRS: a__zeros() -> cons(0(),zeros()) a__U11(tt(),L) -> s(a__length(mark(L))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(length(V1)) -> a__isNatList(V1) a__isNat(s(V1)) -> a__isNat(V1) a__isNatIList(V) -> a__isNatList(V) a__isNatIList(zeros()) -> tt() a__isNatIList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatIList(V2)) a__isNatList(nil()) -> tt() a__isNatList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatList(V2)) a__length(nil()) -> 0() a__length(cons(N,L)) -> a__U11(a__and(a__isNatList(L),isNat(N)),L) mark(zeros()) -> a__zeros() mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(isNatList(X)) -> a__isNatList(X) mark(isNatIList(X)) -> a__isNatIList(X) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() a__zeros() -> zeros() a__U11(X1,X2) -> U11(X1,X2) a__length(X) -> length(X) a__and(X1,X2) -> and(X1,X2) a__isNat(X) -> isNat(X) a__isNatList(X) -> isNatList(X) a__isNatIList(X) -> isNatIList(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatIList#](x0) = 1, [a__isNatList#](x0) = 0, [a__isNat#](x0) = 0, [a__and#](x0, x1) = x1, [a__length#](x0) = 0, [mark#](x0) = x0, [a__U11#](x0, x1) = 0, [and](x0, x1) = x0 + x1, [U11](x0, x1) = 0, [isNat](x0) = 0, [isNatList](x0) = 0, [nil] = 1, [isNatIList](x0) = 1, [a__isNatIList](x0) = 1, [a__isNatList](x0) = 0, [length](x0) = 0, [a__isNat](x0) = 0, [a__and](x0, x1) = x0 + x1, [s](x0) = x0, [a__length](x0) = 0, [mark](x0) = x0, [a__U11](x0, x1) = 0, [tt] = 0, [cons](x0, x1) = x0, [zeros] = 0, [0] = 0, [a__zeros] = 0 orientation: a__isNatIList#(cons(V1,V2)) = 1 >= 0 = a__isNat#(V1) a__isNat#(s(V1)) = 0 >= 0 = a__isNat#(V1) a__isNat#(length(V1)) = 0 >= 0 = a__isNatList#(V1) a__isNatList#(cons(V1,V2)) = 0 >= 0 = a__and#(a__isNat(V1),isNatList(V2)) a__and#(tt(),X) = X >= X = mark#(X) mark#(s(X)) = X >= X = mark#(X) mark#(cons(X1,X2)) = X1 >= X1 = mark#(X1) mark#(isNatIList(X)) = 1 >= 1 = a__isNatIList#(X) a__isNatIList#(cons(V1,V2)) = 1 >= 1 = a__and#(a__isNat(V1),isNatIList(V2)) a__isNatIList#(V) = 1 >= 0 = a__isNatList#(V) a__isNatList#(cons(V1,V2)) = 0 >= 0 = a__isNat#(V1) mark#(isNatList(X)) = 0 >= 0 = a__isNatList#(X) mark#(isNat(X)) = 0 >= 0 = a__isNat#(X) mark#(and(X1,X2)) = X1 + X2 >= X2 = a__and#(mark(X1),X2) mark#(and(X1,X2)) = X1 + X2 >= X1 = mark#(X1) a__length#(cons(N,L)) = 0 >= 0 = a__U11#(a__and(a__isNatList(L),isNat(N)),L) a__U11#(tt(),L) = 0 >= 0 = a__length#(mark(L)) a__zeros() = 0 >= 0 = cons(0(),zeros()) a__U11(tt(),L) = 0 >= 0 = s(a__length(mark(L))) a__and(tt(),X) = X >= X = mark(X) a__isNat(0()) = 0 >= 0 = tt() a__isNat(length(V1)) = 0 >= 0 = a__isNatList(V1) a__isNat(s(V1)) = 0 >= 0 = a__isNat(V1) a__isNatIList(V) = 1 >= 0 = a__isNatList(V) a__isNatIList(zeros()) = 1 >= 0 = tt() a__isNatIList(cons(V1,V2)) = 1 >= 1 = a__and(a__isNat(V1),isNatIList(V2)) a__isNatList(nil()) = 0 >= 0 = tt() a__isNatList(cons(V1,V2)) = 0 >= 0 = a__and(a__isNat(V1),isNatList(V2)) a__length(nil()) = 0 >= 0 = 0() a__length(cons(N,L)) = 0 >= 0 = a__U11(a__and(a__isNatList(L),isNat(N)),L) mark(zeros()) = 0 >= 0 = a__zeros() mark(U11(X1,X2)) = 0 >= 0 = a__U11(mark(X1),X2) mark(length(X)) = 0 >= 0 = a__length(mark(X)) mark(and(X1,X2)) = X1 + X2 >= X1 + X2 = a__and(mark(X1),X2) mark(isNat(X)) = 0 >= 0 = a__isNat(X) mark(isNatList(X)) = 0 >= 0 = a__isNatList(X) mark(isNatIList(X)) = 1 >= 1 = a__isNatIList(X) mark(cons(X1,X2)) = X1 >= X1 = cons(mark(X1),X2) mark(0()) = 0 >= 0 = 0() mark(tt()) = 0 >= 0 = tt() mark(s(X)) = X >= X = s(mark(X)) mark(nil()) = 1 >= 1 = nil() a__zeros() = 0 >= 0 = zeros() a__U11(X1,X2) = 0 >= 0 = U11(X1,X2) a__length(X) = 0 >= 0 = length(X) a__and(X1,X2) = X1 + X2 >= X1 + X2 = and(X1,X2) a__isNat(X) = 0 >= 0 = isNat(X) a__isNatList(X) = 0 >= 0 = isNatList(X) a__isNatIList(X) = 1 >= 1 = isNatIList(X) problem: DPs: a__isNat#(s(V1)) -> a__isNat#(V1) a__isNat#(length(V1)) -> a__isNatList#(V1) a__isNatList#(cons(V1,V2)) -> a__and#(a__isNat(V1),isNatList(V2)) a__and#(tt(),X) -> mark#(X) mark#(s(X)) -> mark#(X) mark#(cons(X1,X2)) -> mark#(X1) mark#(isNatIList(X)) -> a__isNatIList#(X) a__isNatIList#(cons(V1,V2)) -> a__and#(a__isNat(V1),isNatIList(V2)) a__isNatList#(cons(V1,V2)) -> a__isNat#(V1) mark#(isNatList(X)) -> a__isNatList#(X) mark#(isNat(X)) -> a__isNat#(X) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) a__length#(cons(N,L)) -> a__U11#(a__and(a__isNatList(L),isNat(N)),L) a__U11#(tt(),L) -> a__length#(mark(L)) TRS: a__zeros() -> cons(0(),zeros()) a__U11(tt(),L) -> s(a__length(mark(L))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(length(V1)) -> a__isNatList(V1) a__isNat(s(V1)) -> a__isNat(V1) a__isNatIList(V) -> a__isNatList(V) a__isNatIList(zeros()) -> tt() a__isNatIList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatIList(V2)) a__isNatList(nil()) -> tt() a__isNatList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatList(V2)) a__length(nil()) -> 0() a__length(cons(N,L)) -> a__U11(a__and(a__isNatList(L),isNat(N)),L) mark(zeros()) -> a__zeros() mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(isNatList(X)) -> a__isNatList(X) mark(isNatIList(X)) -> a__isNatIList(X) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() a__zeros() -> zeros() a__U11(X1,X2) -> U11(X1,X2) a__length(X) -> length(X) a__and(X1,X2) -> and(X1,X2) a__isNat(X) -> isNat(X) a__isNatList(X) -> isNatList(X) a__isNatIList(X) -> isNatIList(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatIList#](x0) = x0 + 1, [a__isNatList#](x0) = x0 + 1, [a__isNat#](x0) = x0, [a__and#](x0, x1) = x1 + 1, [a__length#](x0) = x0, [mark#](x0) = x0 + 1, [a__U11#](x0, x1) = x1, [and](x0, x1) = x0 + x1, [U11](x0, x1) = x1 + 1, [isNat](x0) = x0, [isNatList](x0) = x0, [nil] = 0, [isNatIList](x0) = x0, [a__isNatIList](x0) = x0, [a__isNatList](x0) = x0, [length](x0) = x0 + 1, [a__isNat](x0) = x0, [a__and](x0, x1) = x0 + x1, [s](x0) = x0, [a__length](x0) = x0 + 1, [mark](x0) = x0, [a__U11](x0, x1) = x1 + 1, [tt] = 0, [cons](x0, x1) = x0 + x1, [zeros] = 0, [0] = 0, [a__zeros] = 0 orientation: a__isNat#(s(V1)) = V1 >= V1 = a__isNat#(V1) a__isNat#(length(V1)) = V1 + 1 >= V1 + 1 = a__isNatList#(V1) a__isNatList#(cons(V1,V2)) = V1 + V2 + 1 >= V2 + 1 = a__and#(a__isNat(V1),isNatList(V2)) a__and#(tt(),X) = X + 1 >= X + 1 = mark#(X) mark#(s(X)) = X + 1 >= X + 1 = mark#(X) mark#(cons(X1,X2)) = X1 + X2 + 1 >= X1 + 1 = mark#(X1) mark#(isNatIList(X)) = X + 1 >= X + 1 = a__isNatIList#(X) a__isNatIList#(cons(V1,V2)) = V1 + V2 + 1 >= V2 + 1 = a__and#(a__isNat(V1),isNatIList(V2)) a__isNatList#(cons(V1,V2)) = V1 + V2 + 1 >= V1 = a__isNat#(V1) mark#(isNatList(X)) = X + 1 >= X + 1 = a__isNatList#(X) mark#(isNat(X)) = X + 1 >= X = a__isNat#(X) mark#(and(X1,X2)) = X1 + X2 + 1 >= X2 + 1 = a__and#(mark(X1),X2) mark#(and(X1,X2)) = X1 + X2 + 1 >= X1 + 1 = mark#(X1) a__length#(cons(N,L)) = L + N >= L = a__U11#(a__and(a__isNatList(L),isNat(N)),L) a__U11#(tt(),L) = L >= L = a__length#(mark(L)) a__zeros() = 0 >= 0 = cons(0(),zeros()) a__U11(tt(),L) = L + 1 >= L + 1 = s(a__length(mark(L))) a__and(tt(),X) = X >= X = mark(X) a__isNat(0()) = 0 >= 0 = tt() a__isNat(length(V1)) = V1 + 1 >= V1 = a__isNatList(V1) a__isNat(s(V1)) = V1 >= V1 = a__isNat(V1) a__isNatIList(V) = V >= V = a__isNatList(V) a__isNatIList(zeros()) = 0 >= 0 = tt() a__isNatIList(cons(V1,V2)) = V1 + V2 >= V1 + V2 = a__and(a__isNat(V1),isNatIList(V2)) a__isNatList(nil()) = 0 >= 0 = tt() a__isNatList(cons(V1,V2)) = V1 + V2 >= V1 + V2 = a__and(a__isNat(V1),isNatList(V2)) a__length(nil()) = 1 >= 0 = 0() a__length(cons(N,L)) = L + N + 1 >= L + 1 = a__U11(a__and(a__isNatList(L),isNat(N)),L) mark(zeros()) = 0 >= 0 = a__zeros() mark(U11(X1,X2)) = X2 + 1 >= X2 + 1 = a__U11(mark(X1),X2) mark(length(X)) = X + 1 >= X + 1 = a__length(mark(X)) mark(and(X1,X2)) = X1 + X2 >= X1 + X2 = a__and(mark(X1),X2) mark(isNat(X)) = X >= X = a__isNat(X) mark(isNatList(X)) = X >= X = a__isNatList(X) mark(isNatIList(X)) = X >= X = a__isNatIList(X) mark(cons(X1,X2)) = X1 + X2 >= X1 + X2 = cons(mark(X1),X2) mark(0()) = 0 >= 0 = 0() mark(tt()) = 0 >= 0 = tt() mark(s(X)) = X >= X = s(mark(X)) mark(nil()) = 0 >= 0 = nil() a__zeros() = 0 >= 0 = zeros() a__U11(X1,X2) = X2 + 1 >= X2 + 1 = U11(X1,X2) a__length(X) = X + 1 >= X + 1 = length(X) a__and(X1,X2) = X1 + X2 >= X1 + X2 = and(X1,X2) a__isNat(X) = X >= X = isNat(X) a__isNatList(X) = X >= X = isNatList(X) a__isNatIList(X) = X >= X = isNatIList(X) problem: DPs: a__isNat#(s(V1)) -> a__isNat#(V1) a__isNat#(length(V1)) -> a__isNatList#(V1) a__isNatList#(cons(V1,V2)) -> a__and#(a__isNat(V1),isNatList(V2)) a__and#(tt(),X) -> mark#(X) mark#(s(X)) -> mark#(X) mark#(cons(X1,X2)) -> mark#(X1) mark#(isNatIList(X)) -> a__isNatIList#(X) a__isNatIList#(cons(V1,V2)) -> a__and#(a__isNat(V1),isNatIList(V2)) mark#(isNatList(X)) -> a__isNatList#(X) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) a__length#(cons(N,L)) -> a__U11#(a__and(a__isNatList(L),isNat(N)),L) a__U11#(tt(),L) -> a__length#(mark(L)) TRS: a__zeros() -> cons(0(),zeros()) a__U11(tt(),L) -> s(a__length(mark(L))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(length(V1)) -> a__isNatList(V1) a__isNat(s(V1)) -> a__isNat(V1) a__isNatIList(V) -> a__isNatList(V) a__isNatIList(zeros()) -> tt() a__isNatIList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatIList(V2)) a__isNatList(nil()) -> tt() a__isNatList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatList(V2)) a__length(nil()) -> 0() a__length(cons(N,L)) -> a__U11(a__and(a__isNatList(L),isNat(N)),L) mark(zeros()) -> a__zeros() mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(isNatList(X)) -> a__isNatList(X) mark(isNatIList(X)) -> a__isNatIList(X) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() a__zeros() -> zeros() a__U11(X1,X2) -> U11(X1,X2) a__length(X) -> length(X) a__and(X1,X2) -> and(X1,X2) a__isNat(X) -> isNat(X) a__isNatList(X) -> isNatList(X) a__isNatIList(X) -> isNatIList(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatIList#](x0) = 0, [a__isNatList#](x0) = 0, [a__isNat#](x0) = 1, [a__and#](x0, x1) = 0, [a__length#](x0) = 0, [mark#](x0) = 0, [a__U11#](x0, x1) = 0, [and](x0, x1) = x1, [U11](x0, x1) = 0, [isNat](x0) = 0, [isNatList](x0) = 0, [nil] = 1, [isNatIList](x0) = 0, [a__isNatIList](x0) = 0, [a__isNatList](x0) = 0, [length](x0) = 1, [a__isNat](x0) = 0, [a__and](x0, x1) = x1, [s](x0) = 0, [a__length](x0) = 1, [mark](x0) = x0, [a__U11](x0, x1) = 0, [tt] = 0, [cons](x0, x1) = 0, [zeros] = 0, [0] = 1, [a__zeros] = 0 orientation: a__isNat#(s(V1)) = 1 >= 1 = a__isNat#(V1) a__isNat#(length(V1)) = 1 >= 0 = a__isNatList#(V1) a__isNatList#(cons(V1,V2)) = 0 >= 0 = a__and#(a__isNat(V1),isNatList(V2)) a__and#(tt(),X) = 0 >= 0 = mark#(X) mark#(s(X)) = 0 >= 0 = mark#(X) mark#(cons(X1,X2)) = 0 >= 0 = mark#(X1) mark#(isNatIList(X)) = 0 >= 0 = a__isNatIList#(X) a__isNatIList#(cons(V1,V2)) = 0 >= 0 = a__and#(a__isNat(V1),isNatIList(V2)) mark#(isNatList(X)) = 0 >= 0 = a__isNatList#(X) mark#(and(X1,X2)) = 0 >= 0 = a__and#(mark(X1),X2) mark#(and(X1,X2)) = 0 >= 0 = mark#(X1) a__length#(cons(N,L)) = 0 >= 0 = a__U11#(a__and(a__isNatList(L),isNat(N)),L) a__U11#(tt(),L) = 0 >= 0 = a__length#(mark(L)) a__zeros() = 0 >= 0 = cons(0(),zeros()) a__U11(tt(),L) = 0 >= 0 = s(a__length(mark(L))) a__and(tt(),X) = X >= X = mark(X) a__isNat(0()) = 0 >= 0 = tt() a__isNat(length(V1)) = 0 >= 0 = a__isNatList(V1) a__isNat(s(V1)) = 0 >= 0 = a__isNat(V1) a__isNatIList(V) = 0 >= 0 = a__isNatList(V) a__isNatIList(zeros()) = 0 >= 0 = tt() a__isNatIList(cons(V1,V2)) = 0 >= 0 = a__and(a__isNat(V1),isNatIList(V2)) a__isNatList(nil()) = 0 >= 0 = tt() a__isNatList(cons(V1,V2)) = 0 >= 0 = a__and(a__isNat(V1),isNatList(V2)) a__length(nil()) = 1 >= 1 = 0() a__length(cons(N,L)) = 1 >= 0 = a__U11(a__and(a__isNatList(L),isNat(N)),L) mark(zeros()) = 0 >= 0 = a__zeros() mark(U11(X1,X2)) = 0 >= 0 = a__U11(mark(X1),X2) mark(length(X)) = 1 >= 1 = a__length(mark(X)) mark(and(X1,X2)) = X2 >= X2 = a__and(mark(X1),X2) mark(isNat(X)) = 0 >= 0 = a__isNat(X) mark(isNatList(X)) = 0 >= 0 = a__isNatList(X) mark(isNatIList(X)) = 0 >= 0 = a__isNatIList(X) mark(cons(X1,X2)) = 0 >= 0 = cons(mark(X1),X2) mark(0()) = 1 >= 1 = 0() mark(tt()) = 0 >= 0 = tt() mark(s(X)) = 0 >= 0 = s(mark(X)) mark(nil()) = 1 >= 1 = nil() a__zeros() = 0 >= 0 = zeros() a__U11(X1,X2) = 0 >= 0 = U11(X1,X2) a__length(X) = 1 >= 1 = length(X) a__and(X1,X2) = X2 >= X2 = and(X1,X2) a__isNat(X) = 0 >= 0 = isNat(X) a__isNatList(X) = 0 >= 0 = isNatList(X) a__isNatIList(X) = 0 >= 0 = isNatIList(X) problem: DPs: a__isNat#(s(V1)) -> a__isNat#(V1) a__isNatList#(cons(V1,V2)) -> a__and#(a__isNat(V1),isNatList(V2)) a__and#(tt(),X) -> mark#(X) mark#(s(X)) -> mark#(X) mark#(cons(X1,X2)) -> mark#(X1) mark#(isNatIList(X)) -> a__isNatIList#(X) a__isNatIList#(cons(V1,V2)) -> a__and#(a__isNat(V1),isNatIList(V2)) mark#(isNatList(X)) -> a__isNatList#(X) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) a__length#(cons(N,L)) -> a__U11#(a__and(a__isNatList(L),isNat(N)),L) a__U11#(tt(),L) -> a__length#(mark(L)) TRS: a__zeros() -> cons(0(),zeros()) a__U11(tt(),L) -> s(a__length(mark(L))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(length(V1)) -> a__isNatList(V1) a__isNat(s(V1)) -> a__isNat(V1) a__isNatIList(V) -> a__isNatList(V) a__isNatIList(zeros()) -> tt() a__isNatIList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatIList(V2)) a__isNatList(nil()) -> tt() a__isNatList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatList(V2)) a__length(nil()) -> 0() a__length(cons(N,L)) -> a__U11(a__and(a__isNatList(L),isNat(N)),L) mark(zeros()) -> a__zeros() mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(isNatList(X)) -> a__isNatList(X) mark(isNatIList(X)) -> a__isNatIList(X) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() a__zeros() -> zeros() a__U11(X1,X2) -> U11(X1,X2) a__length(X) -> length(X) a__and(X1,X2) -> and(X1,X2) a__isNat(X) -> isNat(X) a__isNatList(X) -> isNatList(X) a__isNatIList(X) -> isNatIList(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatIList#](x0) = 0, [a__isNatList#](x0) = 0, [a__isNat#](x0) = 0, [a__and#](x0, x1) = x1, [a__length#](x0) = 0, [mark#](x0) = x0, [a__U11#](x0, x1) = 0, [and](x0, x1) = x0 + x1, [U11](x0, x1) = 0, [isNat](x0) = 0, [isNatList](x0) = 0, [nil] = 0, [isNatIList](x0) = 0, [a__isNatIList](x0) = 0, [a__isNatList](x0) = 0, [length](x0) = 0, [a__isNat](x0) = 0, [a__and](x0, x1) = x0 + x1, [s](x0) = x0, [a__length](x0) = 0, [mark](x0) = x0, [a__U11](x0, x1) = 0, [tt] = 0, [cons](x0, x1) = x0 + 1, [zeros] = 1, [0] = 0, [a__zeros] = 1 orientation: a__isNat#(s(V1)) = 0 >= 0 = a__isNat#(V1) a__isNatList#(cons(V1,V2)) = 0 >= 0 = a__and#(a__isNat(V1),isNatList(V2)) a__and#(tt(),X) = X >= X = mark#(X) mark#(s(X)) = X >= X = mark#(X) mark#(cons(X1,X2)) = X1 + 1 >= X1 = mark#(X1) mark#(isNatIList(X)) = 0 >= 0 = a__isNatIList#(X) a__isNatIList#(cons(V1,V2)) = 0 >= 0 = a__and#(a__isNat(V1),isNatIList(V2)) mark#(isNatList(X)) = 0 >= 0 = a__isNatList#(X) mark#(and(X1,X2)) = X1 + X2 >= X2 = a__and#(mark(X1),X2) mark#(and(X1,X2)) = X1 + X2 >= X1 = mark#(X1) a__length#(cons(N,L)) = 0 >= 0 = a__U11#(a__and(a__isNatList(L),isNat(N)),L) a__U11#(tt(),L) = 0 >= 0 = a__length#(mark(L)) a__zeros() = 1 >= 1 = cons(0(),zeros()) a__U11(tt(),L) = 0 >= 0 = s(a__length(mark(L))) a__and(tt(),X) = X >= X = mark(X) a__isNat(0()) = 0 >= 0 = tt() a__isNat(length(V1)) = 0 >= 0 = a__isNatList(V1) a__isNat(s(V1)) = 0 >= 0 = a__isNat(V1) a__isNatIList(V) = 0 >= 0 = a__isNatList(V) a__isNatIList(zeros()) = 0 >= 0 = tt() a__isNatIList(cons(V1,V2)) = 0 >= 0 = a__and(a__isNat(V1),isNatIList(V2)) a__isNatList(nil()) = 0 >= 0 = tt() a__isNatList(cons(V1,V2)) = 0 >= 0 = a__and(a__isNat(V1),isNatList(V2)) a__length(nil()) = 0 >= 0 = 0() a__length(cons(N,L)) = 0 >= 0 = a__U11(a__and(a__isNatList(L),isNat(N)),L) mark(zeros()) = 1 >= 1 = a__zeros() mark(U11(X1,X2)) = 0 >= 0 = a__U11(mark(X1),X2) mark(length(X)) = 0 >= 0 = a__length(mark(X)) mark(and(X1,X2)) = X1 + X2 >= X1 + X2 = a__and(mark(X1),X2) mark(isNat(X)) = 0 >= 0 = a__isNat(X) mark(isNatList(X)) = 0 >= 0 = a__isNatList(X) mark(isNatIList(X)) = 0 >= 0 = a__isNatIList(X) mark(cons(X1,X2)) = X1 + 1 >= X1 + 1 = cons(mark(X1),X2) mark(0()) = 0 >= 0 = 0() mark(tt()) = 0 >= 0 = tt() mark(s(X)) = X >= X = s(mark(X)) mark(nil()) = 0 >= 0 = nil() a__zeros() = 1 >= 1 = zeros() a__U11(X1,X2) = 0 >= 0 = U11(X1,X2) a__length(X) = 0 >= 0 = length(X) a__and(X1,X2) = X1 + X2 >= X1 + X2 = and(X1,X2) a__isNat(X) = 0 >= 0 = isNat(X) a__isNatList(X) = 0 >= 0 = isNatList(X) a__isNatIList(X) = 0 >= 0 = isNatIList(X) problem: DPs: a__isNat#(s(V1)) -> a__isNat#(V1) a__isNatList#(cons(V1,V2)) -> a__and#(a__isNat(V1),isNatList(V2)) a__and#(tt(),X) -> mark#(X) mark#(s(X)) -> mark#(X) mark#(isNatIList(X)) -> a__isNatIList#(X) a__isNatIList#(cons(V1,V2)) -> a__and#(a__isNat(V1),isNatIList(V2)) mark#(isNatList(X)) -> a__isNatList#(X) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) a__length#(cons(N,L)) -> a__U11#(a__and(a__isNatList(L),isNat(N)),L) a__U11#(tt(),L) -> a__length#(mark(L)) TRS: a__zeros() -> cons(0(),zeros()) a__U11(tt(),L) -> s(a__length(mark(L))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(length(V1)) -> a__isNatList(V1) a__isNat(s(V1)) -> a__isNat(V1) a__isNatIList(V) -> a__isNatList(V) a__isNatIList(zeros()) -> tt() a__isNatIList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatIList(V2)) a__isNatList(nil()) -> tt() a__isNatList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatList(V2)) a__length(nil()) -> 0() a__length(cons(N,L)) -> a__U11(a__and(a__isNatList(L),isNat(N)),L) mark(zeros()) -> a__zeros() mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(isNatList(X)) -> a__isNatList(X) mark(isNatIList(X)) -> a__isNatIList(X) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() a__zeros() -> zeros() a__U11(X1,X2) -> U11(X1,X2) a__length(X) -> length(X) a__and(X1,X2) -> and(X1,X2) a__isNat(X) -> isNat(X) a__isNatList(X) -> isNatList(X) a__isNatIList(X) -> isNatIList(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatIList#](x0) = x0 + 1, [a__isNatList#](x0) = 0, [a__isNat#](x0) = 0, [a__and#](x0, x1) = x1, [a__length#](x0) = 0, [mark#](x0) = x0, [a__U11#](x0, x1) = 0, [and](x0, x1) = x0 + x1, [U11](x0, x1) = 0, [isNat](x0) = 0, [isNatList](x0) = 0, [nil] = 1, [isNatIList](x0) = x0 + 1, [a__isNatIList](x0) = x0 + 1, [a__isNatList](x0) = 1, [length](x0) = 0, [a__isNat](x0) = 1, [a__and](x0, x1) = x0 + x1, [s](x0) = x0, [a__length](x0) = 0, [mark](x0) = x0 + 1, [a__U11](x0, x1) = 0, [tt] = 1, [cons](x0, x1) = x1 + 1, [zeros] = 0, [0] = 0, [a__zeros] = 1 orientation: a__isNat#(s(V1)) = 0 >= 0 = a__isNat#(V1) a__isNatList#(cons(V1,V2)) = 0 >= 0 = a__and#(a__isNat(V1),isNatList(V2)) a__and#(tt(),X) = X >= X = mark#(X) mark#(s(X)) = X >= X = mark#(X) mark#(isNatIList(X)) = X + 1 >= X + 1 = a__isNatIList#(X) a__isNatIList#(cons(V1,V2)) = V2 + 2 >= V2 + 1 = a__and#(a__isNat(V1),isNatIList(V2)) mark#(isNatList(X)) = 0 >= 0 = a__isNatList#(X) mark#(and(X1,X2)) = X1 + X2 >= X2 = a__and#(mark(X1),X2) mark#(and(X1,X2)) = X1 + X2 >= X1 = mark#(X1) a__length#(cons(N,L)) = 0 >= 0 = a__U11#(a__and(a__isNatList(L),isNat(N)),L) a__U11#(tt(),L) = 0 >= 0 = a__length#(mark(L)) a__zeros() = 1 >= 1 = cons(0(),zeros()) a__U11(tt(),L) = 0 >= 0 = s(a__length(mark(L))) a__and(tt(),X) = X + 1 >= X + 1 = mark(X) a__isNat(0()) = 1 >= 1 = tt() a__isNat(length(V1)) = 1 >= 1 = a__isNatList(V1) a__isNat(s(V1)) = 1 >= 1 = a__isNat(V1) a__isNatIList(V) = V + 1 >= 1 = a__isNatList(V) a__isNatIList(zeros()) = 1 >= 1 = tt() a__isNatIList(cons(V1,V2)) = V2 + 2 >= V2 + 2 = a__and(a__isNat(V1),isNatIList(V2)) a__isNatList(nil()) = 1 >= 1 = tt() a__isNatList(cons(V1,V2)) = 1 >= 1 = a__and(a__isNat(V1),isNatList(V2)) a__length(nil()) = 0 >= 0 = 0() a__length(cons(N,L)) = 0 >= 0 = a__U11(a__and(a__isNatList(L),isNat(N)),L) mark(zeros()) = 1 >= 1 = a__zeros() mark(U11(X1,X2)) = 1 >= 0 = a__U11(mark(X1),X2) mark(length(X)) = 1 >= 0 = a__length(mark(X)) mark(and(X1,X2)) = X1 + X2 + 1 >= X1 + X2 + 1 = a__and(mark(X1),X2) mark(isNat(X)) = 1 >= 1 = a__isNat(X) mark(isNatList(X)) = 1 >= 1 = a__isNatList(X) mark(isNatIList(X)) = X + 2 >= X + 1 = a__isNatIList(X) mark(cons(X1,X2)) = X2 + 2 >= X2 + 1 = cons(mark(X1),X2) mark(0()) = 1 >= 0 = 0() mark(tt()) = 2 >= 1 = tt() mark(s(X)) = X + 1 >= X + 1 = s(mark(X)) mark(nil()) = 2 >= 1 = nil() a__zeros() = 1 >= 0 = zeros() a__U11(X1,X2) = 0 >= 0 = U11(X1,X2) a__length(X) = 0 >= 0 = length(X) a__and(X1,X2) = X1 + X2 >= X1 + X2 = and(X1,X2) a__isNat(X) = 1 >= 0 = isNat(X) a__isNatList(X) = 1 >= 0 = isNatList(X) a__isNatIList(X) = X + 1 >= X + 1 = isNatIList(X) problem: DPs: a__isNat#(s(V1)) -> a__isNat#(V1) a__isNatList#(cons(V1,V2)) -> a__and#(a__isNat(V1),isNatList(V2)) a__and#(tt(),X) -> mark#(X) mark#(s(X)) -> mark#(X) mark#(isNatIList(X)) -> a__isNatIList#(X) mark#(isNatList(X)) -> a__isNatList#(X) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) a__length#(cons(N,L)) -> a__U11#(a__and(a__isNatList(L),isNat(N)),L) a__U11#(tt(),L) -> a__length#(mark(L)) TRS: a__zeros() -> cons(0(),zeros()) a__U11(tt(),L) -> s(a__length(mark(L))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(length(V1)) -> a__isNatList(V1) a__isNat(s(V1)) -> a__isNat(V1) a__isNatIList(V) -> a__isNatList(V) a__isNatIList(zeros()) -> tt() a__isNatIList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatIList(V2)) a__isNatList(nil()) -> tt() a__isNatList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatList(V2)) a__length(nil()) -> 0() a__length(cons(N,L)) -> a__U11(a__and(a__isNatList(L),isNat(N)),L) mark(zeros()) -> a__zeros() mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(isNatList(X)) -> a__isNatList(X) mark(isNatIList(X)) -> a__isNatIList(X) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() a__zeros() -> zeros() a__U11(X1,X2) -> U11(X1,X2) a__length(X) -> length(X) a__and(X1,X2) -> and(X1,X2) a__isNat(X) -> isNat(X) a__isNatList(X) -> isNatList(X) a__isNatIList(X) -> isNatIList(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatIList#](x0) = 0, [a__isNatList#](x0) = 1, [a__isNat#](x0) = 0, [a__and#](x0, x1) = 1, [a__length#](x0) = 0, [mark#](x0) = 1, [a__U11#](x0, x1) = 0, [and](x0, x1) = x1, [U11](x0, x1) = 0, [isNat](x0) = 0, [isNatList](x0) = 0, [nil] = 0, [isNatIList](x0) = 1, [a__isNatIList](x0) = 1, [a__isNatList](x0) = 0, [length](x0) = 0, [a__isNat](x0) = 0, [a__and](x0, x1) = x1, [s](x0) = 0, [a__length](x0) = 0, [mark](x0) = x0, [a__U11](x0, x1) = 0, [tt] = 0, [cons](x0, x1) = 0, [zeros] = 1, [0] = 0, [a__zeros] = 1 orientation: a__isNat#(s(V1)) = 0 >= 0 = a__isNat#(V1) a__isNatList#(cons(V1,V2)) = 1 >= 1 = a__and#(a__isNat(V1),isNatList(V2)) a__and#(tt(),X) = 1 >= 1 = mark#(X) mark#(s(X)) = 1 >= 1 = mark#(X) mark#(isNatIList(X)) = 1 >= 0 = a__isNatIList#(X) mark#(isNatList(X)) = 1 >= 1 = a__isNatList#(X) mark#(and(X1,X2)) = 1 >= 1 = a__and#(mark(X1),X2) mark#(and(X1,X2)) = 1 >= 1 = mark#(X1) a__length#(cons(N,L)) = 0 >= 0 = a__U11#(a__and(a__isNatList(L),isNat(N)),L) a__U11#(tt(),L) = 0 >= 0 = a__length#(mark(L)) a__zeros() = 1 >= 0 = cons(0(),zeros()) a__U11(tt(),L) = 0 >= 0 = s(a__length(mark(L))) a__and(tt(),X) = X >= X = mark(X) a__isNat(0()) = 0 >= 0 = tt() a__isNat(length(V1)) = 0 >= 0 = a__isNatList(V1) a__isNat(s(V1)) = 0 >= 0 = a__isNat(V1) a__isNatIList(V) = 1 >= 0 = a__isNatList(V) a__isNatIList(zeros()) = 1 >= 0 = tt() a__isNatIList(cons(V1,V2)) = 1 >= 1 = a__and(a__isNat(V1),isNatIList(V2)) a__isNatList(nil()) = 0 >= 0 = tt() a__isNatList(cons(V1,V2)) = 0 >= 0 = a__and(a__isNat(V1),isNatList(V2)) a__length(nil()) = 0 >= 0 = 0() a__length(cons(N,L)) = 0 >= 0 = a__U11(a__and(a__isNatList(L),isNat(N)),L) mark(zeros()) = 1 >= 1 = a__zeros() mark(U11(X1,X2)) = 0 >= 0 = a__U11(mark(X1),X2) mark(length(X)) = 0 >= 0 = a__length(mark(X)) mark(and(X1,X2)) = X2 >= X2 = a__and(mark(X1),X2) mark(isNat(X)) = 0 >= 0 = a__isNat(X) mark(isNatList(X)) = 0 >= 0 = a__isNatList(X) mark(isNatIList(X)) = 1 >= 1 = a__isNatIList(X) mark(cons(X1,X2)) = 0 >= 0 = cons(mark(X1),X2) mark(0()) = 0 >= 0 = 0() mark(tt()) = 0 >= 0 = tt() mark(s(X)) = 0 >= 0 = s(mark(X)) mark(nil()) = 0 >= 0 = nil() a__zeros() = 1 >= 1 = zeros() a__U11(X1,X2) = 0 >= 0 = U11(X1,X2) a__length(X) = 0 >= 0 = length(X) a__and(X1,X2) = X2 >= X2 = and(X1,X2) a__isNat(X) = 0 >= 0 = isNat(X) a__isNatList(X) = 0 >= 0 = isNatList(X) a__isNatIList(X) = 1 >= 1 = isNatIList(X) problem: DPs: a__isNat#(s(V1)) -> a__isNat#(V1) a__isNatList#(cons(V1,V2)) -> a__and#(a__isNat(V1),isNatList(V2)) a__and#(tt(),X) -> mark#(X) mark#(s(X)) -> mark#(X) mark#(isNatList(X)) -> a__isNatList#(X) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) a__length#(cons(N,L)) -> a__U11#(a__and(a__isNatList(L),isNat(N)),L) a__U11#(tt(),L) -> a__length#(mark(L)) TRS: a__zeros() -> cons(0(),zeros()) a__U11(tt(),L) -> s(a__length(mark(L))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(length(V1)) -> a__isNatList(V1) a__isNat(s(V1)) -> a__isNat(V1) a__isNatIList(V) -> a__isNatList(V) a__isNatIList(zeros()) -> tt() a__isNatIList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatIList(V2)) a__isNatList(nil()) -> tt() a__isNatList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatList(V2)) a__length(nil()) -> 0() a__length(cons(N,L)) -> a__U11(a__and(a__isNatList(L),isNat(N)),L) mark(zeros()) -> a__zeros() mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(isNatList(X)) -> a__isNatList(X) mark(isNatIList(X)) -> a__isNatIList(X) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() a__zeros() -> zeros() a__U11(X1,X2) -> U11(X1,X2) a__length(X) -> length(X) a__and(X1,X2) -> and(X1,X2) a__isNat(X) -> isNat(X) a__isNatList(X) -> isNatList(X) a__isNatIList(X) -> isNatIList(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatList#](x0) = x0, [a__isNat#](x0) = 1, [a__and#](x0, x1) = x1 + 1, [a__length#](x0) = 0, [mark#](x0) = x0 + 1, [a__U11#](x0, x1) = 0, [and](x0, x1) = x0 + x1, [U11](x0, x1) = x1, [isNat](x0) = x0 + 1, [isNatList](x0) = x0, [nil] = 1, [isNatIList](x0) = x0 + 1, [a__isNatIList](x0) = x0 + 1, [a__isNatList](x0) = x0, [length](x0) = x0, [a__isNat](x0) = x0 + 1, [a__and](x0, x1) = x0 + x1, [s](x0) = x0, [a__length](x0) = x0, [mark](x0) = x0 + 1, [a__U11](x0, x1) = x1 + 1, [tt] = 1, [cons](x0, x1) = x0 + x1 + 1, [zeros] = 0, [0] = 0, [a__zeros] = 1 orientation: a__isNat#(s(V1)) = 1 >= 1 = a__isNat#(V1) a__isNatList#(cons(V1,V2)) = V1 + V2 + 1 >= V2 + 1 = a__and#(a__isNat(V1),isNatList(V2)) a__and#(tt(),X) = X + 1 >= X + 1 = mark#(X) mark#(s(X)) = X + 1 >= X + 1 = mark#(X) mark#(isNatList(X)) = X + 1 >= X = a__isNatList#(X) mark#(and(X1,X2)) = X1 + X2 + 1 >= X2 + 1 = a__and#(mark(X1),X2) mark#(and(X1,X2)) = X1 + X2 + 1 >= X1 + 1 = mark#(X1) a__length#(cons(N,L)) = 0 >= 0 = a__U11#(a__and(a__isNatList(L),isNat(N)),L) a__U11#(tt(),L) = 0 >= 0 = a__length#(mark(L)) a__zeros() = 1 >= 1 = cons(0(),zeros()) a__U11(tt(),L) = L + 1 >= L + 1 = s(a__length(mark(L))) a__and(tt(),X) = X + 1 >= X + 1 = mark(X) a__isNat(0()) = 1 >= 1 = tt() a__isNat(length(V1)) = V1 + 1 >= V1 = a__isNatList(V1) a__isNat(s(V1)) = V1 + 1 >= V1 + 1 = a__isNat(V1) a__isNatIList(V) = V + 1 >= V = a__isNatList(V) a__isNatIList(zeros()) = 1 >= 1 = tt() a__isNatIList(cons(V1,V2)) = V1 + V2 + 2 >= V1 + V2 + 2 = a__and(a__isNat(V1),isNatIList(V2)) a__isNatList(nil()) = 1 >= 1 = tt() a__isNatList(cons(V1,V2)) = V1 + V2 + 1 >= V1 + V2 + 1 = a__and(a__isNat(V1),isNatList(V2)) a__length(nil()) = 1 >= 0 = 0() a__length(cons(N,L)) = L + N + 1 >= L + 1 = a__U11(a__and(a__isNatList(L),isNat(N)),L) mark(zeros()) = 1 >= 1 = a__zeros() mark(U11(X1,X2)) = X2 + 1 >= X2 + 1 = a__U11(mark(X1),X2) mark(length(X)) = X + 1 >= X + 1 = a__length(mark(X)) mark(and(X1,X2)) = X1 + X2 + 1 >= X1 + X2 + 1 = a__and(mark(X1),X2) mark(isNat(X)) = X + 2 >= X + 1 = a__isNat(X) mark(isNatList(X)) = X + 1 >= X = a__isNatList(X) mark(isNatIList(X)) = X + 2 >= X + 1 = a__isNatIList(X) mark(cons(X1,X2)) = X1 + X2 + 2 >= X1 + X2 + 2 = cons(mark(X1),X2) mark(0()) = 1 >= 0 = 0() mark(tt()) = 2 >= 1 = tt() mark(s(X)) = X + 1 >= X + 1 = s(mark(X)) mark(nil()) = 2 >= 1 = nil() a__zeros() = 1 >= 0 = zeros() a__U11(X1,X2) = X2 + 1 >= X2 = U11(X1,X2) a__length(X) = X >= X = length(X) a__and(X1,X2) = X1 + X2 >= X1 + X2 = and(X1,X2) a__isNat(X) = X + 1 >= X + 1 = isNat(X) a__isNatList(X) = X >= X = isNatList(X) a__isNatIList(X) = X + 1 >= X + 1 = isNatIList(X) problem: DPs: a__isNat#(s(V1)) -> a__isNat#(V1) a__isNatList#(cons(V1,V2)) -> a__and#(a__isNat(V1),isNatList(V2)) a__and#(tt(),X) -> mark#(X) mark#(s(X)) -> mark#(X) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) a__length#(cons(N,L)) -> a__U11#(a__and(a__isNatList(L),isNat(N)),L) a__U11#(tt(),L) -> a__length#(mark(L)) TRS: a__zeros() -> cons(0(),zeros()) a__U11(tt(),L) -> s(a__length(mark(L))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(length(V1)) -> a__isNatList(V1) a__isNat(s(V1)) -> a__isNat(V1) a__isNatIList(V) -> a__isNatList(V) a__isNatIList(zeros()) -> tt() a__isNatIList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatIList(V2)) a__isNatList(nil()) -> tt() a__isNatList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatList(V2)) a__length(nil()) -> 0() a__length(cons(N,L)) -> a__U11(a__and(a__isNatList(L),isNat(N)),L) mark(zeros()) -> a__zeros() mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(isNatList(X)) -> a__isNatList(X) mark(isNatIList(X)) -> a__isNatIList(X) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() a__zeros() -> zeros() a__U11(X1,X2) -> U11(X1,X2) a__length(X) -> length(X) a__and(X1,X2) -> and(X1,X2) a__isNat(X) -> isNat(X) a__isNatList(X) -> isNatList(X) a__isNatIList(X) -> isNatIList(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNatList#](x0) = 1, [a__isNat#](x0) = 0, [a__and#](x0, x1) = 0, [a__length#](x0) = 0, [mark#](x0) = 0, [a__U11#](x0, x1) = 0, [and](x0, x1) = x1, [U11](x0, x1) = 0, [isNat](x0) = 1, [isNatList](x0) = 0, [nil] = 0, [isNatIList](x0) = 0, [a__isNatIList](x0) = 0, [a__isNatList](x0) = 0, [length](x0) = 0, [a__isNat](x0) = 1, [a__and](x0, x1) = x1, [s](x0) = 0, [a__length](x0) = 0, [mark](x0) = x0, [a__U11](x0, x1) = 0, [tt] = 0, [cons](x0, x1) = 0, [zeros] = 0, [0] = 0, [a__zeros] = 0 orientation: a__isNat#(s(V1)) = 0 >= 0 = a__isNat#(V1) a__isNatList#(cons(V1,V2)) = 1 >= 0 = a__and#(a__isNat(V1),isNatList(V2)) a__and#(tt(),X) = 0 >= 0 = mark#(X) mark#(s(X)) = 0 >= 0 = mark#(X) mark#(and(X1,X2)) = 0 >= 0 = a__and#(mark(X1),X2) mark#(and(X1,X2)) = 0 >= 0 = mark#(X1) a__length#(cons(N,L)) = 0 >= 0 = a__U11#(a__and(a__isNatList(L),isNat(N)),L) a__U11#(tt(),L) = 0 >= 0 = a__length#(mark(L)) a__zeros() = 0 >= 0 = cons(0(),zeros()) a__U11(tt(),L) = 0 >= 0 = s(a__length(mark(L))) a__and(tt(),X) = X >= X = mark(X) a__isNat(0()) = 1 >= 0 = tt() a__isNat(length(V1)) = 1 >= 0 = a__isNatList(V1) a__isNat(s(V1)) = 1 >= 1 = a__isNat(V1) a__isNatIList(V) = 0 >= 0 = a__isNatList(V) a__isNatIList(zeros()) = 0 >= 0 = tt() a__isNatIList(cons(V1,V2)) = 0 >= 0 = a__and(a__isNat(V1),isNatIList(V2)) a__isNatList(nil()) = 0 >= 0 = tt() a__isNatList(cons(V1,V2)) = 0 >= 0 = a__and(a__isNat(V1),isNatList(V2)) a__length(nil()) = 0 >= 0 = 0() a__length(cons(N,L)) = 0 >= 0 = a__U11(a__and(a__isNatList(L),isNat(N)),L) mark(zeros()) = 0 >= 0 = a__zeros() mark(U11(X1,X2)) = 0 >= 0 = a__U11(mark(X1),X2) mark(length(X)) = 0 >= 0 = a__length(mark(X)) mark(and(X1,X2)) = X2 >= X2 = a__and(mark(X1),X2) mark(isNat(X)) = 1 >= 1 = a__isNat(X) mark(isNatList(X)) = 0 >= 0 = a__isNatList(X) mark(isNatIList(X)) = 0 >= 0 = a__isNatIList(X) mark(cons(X1,X2)) = 0 >= 0 = cons(mark(X1),X2) mark(0()) = 0 >= 0 = 0() mark(tt()) = 0 >= 0 = tt() mark(s(X)) = 0 >= 0 = s(mark(X)) mark(nil()) = 0 >= 0 = nil() a__zeros() = 0 >= 0 = zeros() a__U11(X1,X2) = 0 >= 0 = U11(X1,X2) a__length(X) = 0 >= 0 = length(X) a__and(X1,X2) = X2 >= X2 = and(X1,X2) a__isNat(X) = 1 >= 1 = isNat(X) a__isNatList(X) = 0 >= 0 = isNatList(X) a__isNatIList(X) = 0 >= 0 = isNatIList(X) problem: DPs: a__isNat#(s(V1)) -> a__isNat#(V1) a__and#(tt(),X) -> mark#(X) mark#(s(X)) -> mark#(X) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(and(X1,X2)) -> mark#(X1) a__length#(cons(N,L)) -> a__U11#(a__and(a__isNatList(L),isNat(N)),L) a__U11#(tt(),L) -> a__length#(mark(L)) TRS: a__zeros() -> cons(0(),zeros()) a__U11(tt(),L) -> s(a__length(mark(L))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(length(V1)) -> a__isNatList(V1) a__isNat(s(V1)) -> a__isNat(V1) a__isNatIList(V) -> a__isNatList(V) a__isNatIList(zeros()) -> tt() a__isNatIList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatIList(V2)) a__isNatList(nil()) -> tt() a__isNatList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatList(V2)) a__length(nil()) -> 0() a__length(cons(N,L)) -> a__U11(a__and(a__isNatList(L),isNat(N)),L) mark(zeros()) -> a__zeros() mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(isNatList(X)) -> a__isNatList(X) mark(isNatIList(X)) -> a__isNatIList(X) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() a__zeros() -> zeros() a__U11(X1,X2) -> U11(X1,X2) a__length(X) -> length(X) a__and(X1,X2) -> and(X1,X2) a__isNat(X) -> isNat(X) a__isNatList(X) -> isNatList(X) a__isNatIList(X) -> isNatIList(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNat#](x0) = 0, [a__and#](x0, x1) = x1, [a__length#](x0) = 0, [mark#](x0) = x0, [a__U11#](x0, x1) = 0, [and](x0, x1) = x0 + x1 + 1, [U11](x0, x1) = x1, [isNat](x0) = x0 + 1, [isNatList](x0) = x0, [nil] = 0, [isNatIList](x0) = x0, [a__isNatIList](x0) = x0 + 1, [a__isNatList](x0) = x0 + 1, [length](x0) = x0, [a__isNat](x0) = x0 + 1, [a__and](x0, x1) = x0 + x1 + 1, [s](x0) = x0, [a__length](x0) = x0, [mark](x0) = x0 + 1, [a__U11](x0, x1) = x1 + 1, [tt] = 0, [cons](x0, x1) = x0 + x1 + 1, [zeros] = 0, [0] = 0, [a__zeros] = 1 orientation: a__isNat#(s(V1)) = 0 >= 0 = a__isNat#(V1) a__and#(tt(),X) = X >= X = mark#(X) mark#(s(X)) = X >= X = mark#(X) mark#(and(X1,X2)) = X1 + X2 + 1 >= X2 = a__and#(mark(X1),X2) mark#(and(X1,X2)) = X1 + X2 + 1 >= X1 = mark#(X1) a__length#(cons(N,L)) = 0 >= 0 = a__U11#(a__and(a__isNatList(L),isNat(N)),L) a__U11#(tt(),L) = 0 >= 0 = a__length#(mark(L)) a__zeros() = 1 >= 1 = cons(0(),zeros()) a__U11(tt(),L) = L + 1 >= L + 1 = s(a__length(mark(L))) a__and(tt(),X) = X + 1 >= X + 1 = mark(X) a__isNat(0()) = 1 >= 0 = tt() a__isNat(length(V1)) = V1 + 1 >= V1 + 1 = a__isNatList(V1) a__isNat(s(V1)) = V1 + 1 >= V1 + 1 = a__isNat(V1) a__isNatIList(V) = V + 1 >= V + 1 = a__isNatList(V) a__isNatIList(zeros()) = 1 >= 0 = tt() a__isNatIList(cons(V1,V2)) = V1 + V2 + 2 >= V1 + V2 + 2 = a__and(a__isNat(V1),isNatIList(V2)) a__isNatList(nil()) = 1 >= 0 = tt() a__isNatList(cons(V1,V2)) = V1 + V2 + 2 >= V1 + V2 + 2 = a__and(a__isNat(V1),isNatList(V2)) a__length(nil()) = 0 >= 0 = 0() a__length(cons(N,L)) = L + N + 1 >= L + 1 = a__U11(a__and(a__isNatList(L),isNat(N)),L) mark(zeros()) = 1 >= 1 = a__zeros() mark(U11(X1,X2)) = X2 + 1 >= X2 + 1 = a__U11(mark(X1),X2) mark(length(X)) = X + 1 >= X + 1 = a__length(mark(X)) mark(and(X1,X2)) = X1 + X2 + 2 >= X1 + X2 + 2 = a__and(mark(X1),X2) mark(isNat(X)) = X + 2 >= X + 1 = a__isNat(X) mark(isNatList(X)) = X + 1 >= X + 1 = a__isNatList(X) mark(isNatIList(X)) = X + 1 >= X + 1 = a__isNatIList(X) mark(cons(X1,X2)) = X1 + X2 + 2 >= X1 + X2 + 2 = cons(mark(X1),X2) mark(0()) = 1 >= 0 = 0() mark(tt()) = 1 >= 0 = tt() mark(s(X)) = X + 1 >= X + 1 = s(mark(X)) mark(nil()) = 1 >= 0 = nil() a__zeros() = 1 >= 0 = zeros() a__U11(X1,X2) = X2 + 1 >= X2 = U11(X1,X2) a__length(X) = X >= X = length(X) a__and(X1,X2) = X1 + X2 + 1 >= X1 + X2 + 1 = and(X1,X2) a__isNat(X) = X + 1 >= X + 1 = isNat(X) a__isNatList(X) = X + 1 >= X = isNatList(X) a__isNatIList(X) = X + 1 >= X = isNatIList(X) problem: DPs: a__isNat#(s(V1)) -> a__isNat#(V1) a__and#(tt(),X) -> mark#(X) mark#(s(X)) -> mark#(X) a__length#(cons(N,L)) -> a__U11#(a__and(a__isNatList(L),isNat(N)),L) a__U11#(tt(),L) -> a__length#(mark(L)) TRS: a__zeros() -> cons(0(),zeros()) a__U11(tt(),L) -> s(a__length(mark(L))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(length(V1)) -> a__isNatList(V1) a__isNat(s(V1)) -> a__isNat(V1) a__isNatIList(V) -> a__isNatList(V) a__isNatIList(zeros()) -> tt() a__isNatIList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatIList(V2)) a__isNatList(nil()) -> tt() a__isNatList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatList(V2)) a__length(nil()) -> 0() a__length(cons(N,L)) -> a__U11(a__and(a__isNatList(L),isNat(N)),L) mark(zeros()) -> a__zeros() mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(isNatList(X)) -> a__isNatList(X) mark(isNatIList(X)) -> a__isNatIList(X) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() a__zeros() -> zeros() a__U11(X1,X2) -> U11(X1,X2) a__length(X) -> length(X) a__and(X1,X2) -> and(X1,X2) a__isNat(X) -> isNat(X) a__isNatList(X) -> isNatList(X) a__isNatIList(X) -> isNatIList(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__isNat#](x0) = 0, [a__and#](x0, x1) = 1, [a__length#](x0) = 1, [mark#](x0) = 0, [a__U11#](x0, x1) = 1, [and](x0, x1) = x1, [U11](x0, x1) = 0, [isNat](x0) = 0, [isNatList](x0) = 0, [nil] = 0, [isNatIList](x0) = 0, [a__isNatIList](x0) = 0, [a__isNatList](x0) = 0, [length](x0) = 0, [a__isNat](x0) = 0, [a__and](x0, x1) = x1, [s](x0) = 0, [a__length](x0) = 0, [mark](x0) = x0, [a__U11](x0, x1) = 0, [tt] = 0, [cons](x0, x1) = 0, [zeros] = 1, [0] = 0, [a__zeros] = 1 orientation: a__isNat#(s(V1)) = 0 >= 0 = a__isNat#(V1) a__and#(tt(),X) = 1 >= 0 = mark#(X) mark#(s(X)) = 0 >= 0 = mark#(X) a__length#(cons(N,L)) = 1 >= 1 = a__U11#(a__and(a__isNatList(L),isNat(N)),L) a__U11#(tt(),L) = 1 >= 1 = a__length#(mark(L)) a__zeros() = 1 >= 0 = cons(0(),zeros()) a__U11(tt(),L) = 0 >= 0 = s(a__length(mark(L))) a__and(tt(),X) = X >= X = mark(X) a__isNat(0()) = 0 >= 0 = tt() a__isNat(length(V1)) = 0 >= 0 = a__isNatList(V1) a__isNat(s(V1)) = 0 >= 0 = a__isNat(V1) a__isNatIList(V) = 0 >= 0 = a__isNatList(V) a__isNatIList(zeros()) = 0 >= 0 = tt() a__isNatIList(cons(V1,V2)) = 0 >= 0 = a__and(a__isNat(V1),isNatIList(V2)) a__isNatList(nil()) = 0 >= 0 = tt() a__isNatList(cons(V1,V2)) = 0 >= 0 = a__and(a__isNat(V1),isNatList(V2)) a__length(nil()) = 0 >= 0 = 0() a__length(cons(N,L)) = 0 >= 0 = a__U11(a__and(a__isNatList(L),isNat(N)),L) mark(zeros()) = 1 >= 1 = a__zeros() mark(U11(X1,X2)) = 0 >= 0 = a__U11(mark(X1),X2) mark(length(X)) = 0 >= 0 = a__length(mark(X)) mark(and(X1,X2)) = X2 >= X2 = a__and(mark(X1),X2) mark(isNat(X)) = 0 >= 0 = a__isNat(X) mark(isNatList(X)) = 0 >= 0 = a__isNatList(X) mark(isNatIList(X)) = 0 >= 0 = a__isNatIList(X) mark(cons(X1,X2)) = 0 >= 0 = cons(mark(X1),X2) mark(0()) = 0 >= 0 = 0() mark(tt()) = 0 >= 0 = tt() mark(s(X)) = 0 >= 0 = s(mark(X)) mark(nil()) = 0 >= 0 = nil() a__zeros() = 1 >= 1 = zeros() a__U11(X1,X2) = 0 >= 0 = U11(X1,X2) a__length(X) = 0 >= 0 = length(X) a__and(X1,X2) = X2 >= X2 = and(X1,X2) a__isNat(X) = 0 >= 0 = isNat(X) a__isNatList(X) = 0 >= 0 = isNatList(X) a__isNatIList(X) = 0 >= 0 = isNatIList(X) problem: DPs: a__isNat#(s(V1)) -> a__isNat#(V1) mark#(s(X)) -> mark#(X) a__length#(cons(N,L)) -> a__U11#(a__and(a__isNatList(L),isNat(N)),L) a__U11#(tt(),L) -> a__length#(mark(L)) TRS: a__zeros() -> cons(0(),zeros()) a__U11(tt(),L) -> s(a__length(mark(L))) a__and(tt(),X) -> mark(X) a__isNat(0()) -> tt() a__isNat(length(V1)) -> a__isNatList(V1) a__isNat(s(V1)) -> a__isNat(V1) a__isNatIList(V) -> a__isNatList(V) a__isNatIList(zeros()) -> tt() a__isNatIList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatIList(V2)) a__isNatList(nil()) -> tt() a__isNatList(cons(V1,V2)) -> a__and(a__isNat(V1),isNatList(V2)) a__length(nil()) -> 0() a__length(cons(N,L)) -> a__U11(a__and(a__isNatList(L),isNat(N)),L) mark(zeros()) -> a__zeros() mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNat(X)) -> a__isNat(X) mark(isNatList(X)) -> a__isNatList(X) mark(isNatIList(X)) -> a__isNatIList(X) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() a__zeros() -> zeros() a__U11(X1,X2) -> U11(X1,X2) a__length(X) -> length(X) a__and(X1,X2) -> and(X1,X2) a__isNat(X) -> isNat(X) a__isNatList(X) -> isNatList(X) a__isNatIList(X) -> isNatIList(X) Open