Problem: active(zeros()) -> mark(cons(0(),zeros())) active(U11(tt(),L)) -> mark(U12(tt(),L)) active(U12(tt(),L)) -> mark(s(length(L))) active(length(nil())) -> mark(0()) active(length(cons(N,L))) -> mark(U11(tt(),L)) mark(zeros()) -> active(zeros()) mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) mark(0()) -> active(0()) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(tt()) -> active(tt()) mark(U12(X1,X2)) -> active(U12(mark(X1),X2)) mark(s(X)) -> active(s(mark(X))) mark(length(X)) -> active(length(mark(X))) mark(nil()) -> active(nil()) cons(mark(X1),X2) -> cons(X1,X2) cons(X1,mark(X2)) -> cons(X1,X2) cons(active(X1),X2) -> cons(X1,X2) cons(X1,active(X2)) -> cons(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U11(active(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U12(mark(X1),X2) -> U12(X1,X2) U12(X1,mark(X2)) -> U12(X1,X2) U12(active(X1),X2) -> U12(X1,X2) U12(X1,active(X2)) -> U12(X1,X2) s(mark(X)) -> s(X) s(active(X)) -> s(X) length(mark(X)) -> length(X) length(active(X)) -> length(X) Proof: Bounds Processor: bound: 4 enrichment: match automaton: final states: {11,10,9,8,7,6,5} transitions: active1(15) -> 6* active1(16) -> 6* nil1() -> 15* tt1() -> 15* 01() -> 16* zeros1() -> 15* mark1(17) -> 5* cons1(16,15) -> 17* active2(27) -> 5* active2(19) -> 26* cons2(19,18) -> 20* cons2(26,15) -> 27* mark2(20) -> 6* mark2(16) -> 26* 02() -> 19* zeros2() -> 18* active0(2) -> 5* active0(4) -> 5* active0(1) -> 5* active0(3) -> 5* cons3(28,18) -> 29* cons3(19,15) -> 27* cons3(16,15) -> 27* zeros0() -> 1* active3(29) -> 6* active3(33) -> 28* mark0(2) -> 6* mark0(4) -> 6* mark0(1) -> 6* mark0(3) -> 6* mark3(19) -> 28* cons0(3,1) -> 7* cons0(3,3) -> 7* cons0(4,2) -> 7* cons0(4,4) -> 7* cons0(1,2) -> 7* cons0(1,4) -> 7* cons0(2,1) -> 7* cons0(2,3) -> 7* cons0(3,2) -> 7* cons0(3,4) -> 7* cons0(4,1) -> 7* cons0(4,3) -> 7* cons0(1,1) -> 7* cons0(1,3) -> 7* cons0(2,2) -> 7* cons0(2,4) -> 7* cons4(19,18) -> 29* cons4(33,18) -> 29* 00() -> 2* 03() -> 33* U110(3,1) -> 8* U110(3,3) -> 8* U110(4,2) -> 8* U110(4,4) -> 8* U110(1,2) -> 8* U110(1,4) -> 8* U110(2,1) -> 8* U110(2,3) -> 8* U110(3,2) -> 8* U110(3,4) -> 8* U110(4,1) -> 8* U110(4,3) -> 8* U110(1,1) -> 8* U110(1,3) -> 8* U110(2,2) -> 8* U110(2,4) -> 8* tt0() -> 3* U120(3,1) -> 9* U120(3,3) -> 9* U120(4,2) -> 9* U120(4,4) -> 9* U120(1,2) -> 9* U120(1,4) -> 9* U120(2,1) -> 9* U120(2,3) -> 9* U120(3,2) -> 9* U120(3,4) -> 9* U120(4,1) -> 9* U120(4,3) -> 9* U120(1,1) -> 9* U120(1,3) -> 9* U120(2,2) -> 9* U120(2,4) -> 9* s0(2) -> 10* s0(4) -> 10* s0(1) -> 10* s0(3) -> 10* length0(2) -> 11* length0(4) -> 11* length0(1) -> 11* length0(3) -> 11* nil0() -> 4* problem: Qed