MAYBE Time: 0.069479 TRS: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), active cons(X1, X2) -> cons(active X1, X2), active zeros() -> mark cons(0(), zeros()), active s X -> s active X, active length X -> length active X, active length cons(N, L) -> mark U11(and(isNatList L, isNat N), L), active length nil() -> mark 0(), active U11(X1, X2) -> U11(active X1, X2), active U11(tt(), L) -> mark s length L, active and(X1, X2) -> and(active X1, X2), active and(tt(), X) -> mark X, active isNat 0() -> mark tt(), active isNat s V1 -> mark isNat V1, active isNat length V1 -> mark isNatList V1, active isNatList cons(V1, V2) -> mark and(isNat V1, isNatList V2), active isNatList nil() -> mark tt(), active isNatIList V -> mark isNatList V, active isNatIList cons(V1, V2) -> mark and(isNat V1, isNatIList V2), active isNatIList zeros() -> mark tt(), s mark X -> mark s X, s ok X -> ok s X, length mark X -> mark length X, length ok X -> ok length X, U11(mark X1, X2) -> mark U11(X1, X2), U11(ok X1, ok X2) -> ok U11(X1, X2), and(mark X1, X2) -> mark and(X1, X2), and(ok X1, ok X2) -> ok and(X1, X2), isNat ok X -> ok isNat X, isNatList ok X -> ok isNatList X, isNatIList ok X -> ok isNatIList X, proper cons(X1, X2) -> cons(proper X1, proper X2), proper 0() -> ok 0(), proper zeros() -> ok zeros(), proper s X -> s proper X, proper length X -> length proper X, proper U11(X1, X2) -> U11(proper X1, proper X2), proper tt() -> ok tt(), proper and(X1, X2) -> and(proper X1, proper X2), proper isNat X -> isNat proper X, proper isNatList X -> isNatList proper X, proper isNatIList X -> isNatIList proper X, proper nil() -> ok nil(), top mark X -> top proper X, top ok X -> top active X} DP: DP: { cons#(mark X1, X2) -> cons#(X1, X2), cons#(ok X1, ok X2) -> cons#(X1, X2), active# cons(X1, X2) -> cons#(active X1, X2), active# cons(X1, X2) -> active# X1, active# zeros() -> cons#(0(), zeros()), active# s X -> active# X, active# s X -> s# active X, active# length X -> active# X, active# length X -> length# active X, active# length cons(N, L) -> U11#(and(isNatList L, isNat N), L), active# length cons(N, L) -> and#(isNatList L, isNat N), active# length cons(N, L) -> isNat# N, active# length cons(N, L) -> isNatList# L, active# U11(X1, X2) -> active# X1, active# U11(X1, X2) -> U11#(active X1, X2), active# U11(tt(), L) -> s# length L, active# U11(tt(), L) -> length# L, active# and(X1, X2) -> active# X1, active# and(X1, X2) -> and#(active X1, X2), active# isNat s V1 -> isNat# V1, active# isNat length V1 -> isNatList# V1, active# isNatList cons(V1, V2) -> and#(isNat V1, isNatList V2), active# isNatList cons(V1, V2) -> isNat# V1, active# isNatList cons(V1, V2) -> isNatList# V2, active# isNatIList V -> isNatList# V, active# isNatIList cons(V1, V2) -> and#(isNat V1, isNatIList V2), active# isNatIList cons(V1, V2) -> isNat# V1, active# isNatIList cons(V1, V2) -> isNatIList# V2, s# mark X -> s# X, s# ok X -> s# X, length# mark X -> length# X, length# ok X -> length# X, U11#(mark X1, X2) -> U11#(X1, X2), U11#(ok X1, ok X2) -> U11#(X1, X2), and#(mark X1, X2) -> and#(X1, X2), and#(ok X1, ok X2) -> and#(X1, X2), isNat# ok X -> isNat# X, isNatList# ok X -> isNatList# X, isNatIList# ok X -> isNatIList# X, proper# cons(X1, X2) -> cons#(proper X1, proper X2), proper# cons(X1, X2) -> proper# X1, proper# cons(X1, X2) -> proper# X2, proper# s X -> s# proper X, proper# s X -> proper# X, proper# length X -> length# proper X, proper# length X -> proper# X, proper# U11(X1, X2) -> U11#(proper X1, proper X2), proper# U11(X1, X2) -> proper# X1, proper# U11(X1, X2) -> proper# X2, proper# and(X1, X2) -> and#(proper X1, proper X2), proper# and(X1, X2) -> proper# X1, proper# and(X1, X2) -> proper# X2, proper# isNat X -> isNat# proper X, proper# isNat X -> proper# X, proper# isNatList X -> isNatList# proper X, proper# isNatList X -> proper# X, proper# isNatIList X -> isNatIList# proper X, proper# isNatIList X -> proper# X, top# mark X -> proper# X, top# mark X -> top# proper X, top# ok X -> active# X, top# ok X -> top# active X} TRS: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), active cons(X1, X2) -> cons(active X1, X2), active zeros() -> mark cons(0(), zeros()), active s X -> s active X, active length X -> length active X, active length cons(N, L) -> mark U11(and(isNatList L, isNat N), L), active length nil() -> mark 0(), active U11(X1, X2) -> U11(active X1, X2), active U11(tt(), L) -> mark s length L, active and(X1, X2) -> and(active X1, X2), active and(tt(), X) -> mark X, active isNat 0() -> mark tt(), active isNat s V1 -> mark isNat V1, active isNat length V1 -> mark isNatList V1, active isNatList cons(V1, V2) -> mark and(isNat V1, isNatList V2), active isNatList nil() -> mark tt(), active isNatIList V -> mark isNatList V, active isNatIList cons(V1, V2) -> mark and(isNat V1, isNatIList V2), active isNatIList zeros() -> mark tt(), s mark X -> mark s X, s ok X -> ok s X, length mark X -> mark length X, length ok X -> ok length X, U11(mark X1, X2) -> mark U11(X1, X2), U11(ok X1, ok X2) -> ok U11(X1, X2), and(mark X1, X2) -> mark and(X1, X2), and(ok X1, ok X2) -> ok and(X1, X2), isNat ok X -> ok isNat X, isNatList ok X -> ok isNatList X, isNatIList ok X -> ok isNatIList X, proper cons(X1, X2) -> cons(proper X1, proper X2), proper 0() -> ok 0(), proper zeros() -> ok zeros(), proper s X -> s proper X, proper length X -> length proper X, proper U11(X1, X2) -> U11(proper X1, proper X2), proper tt() -> ok tt(), proper and(X1, X2) -> and(proper X1, proper X2), proper isNat X -> isNat proper X, proper isNatList X -> isNatList proper X, proper isNatIList X -> isNatIList proper X, proper nil() -> ok nil(), top mark X -> top proper X, top ok X -> top active X} EDG: { (active# isNatList cons(V1, V2) -> and#(isNat V1, isNatList V2), and#(ok X1, ok X2) -> and#(X1, X2)) (proper# cons(X1, X2) -> cons#(proper X1, proper X2), cons#(ok X1, ok X2) -> cons#(X1, X2)) (proper# cons(X1, X2) -> cons#(proper X1, proper X2), cons#(mark X1, X2) -> cons#(X1, X2)) (proper# and(X1, X2) -> and#(proper X1, proper X2), and#(ok X1, ok X2) -> and#(X1, X2)) (proper# and(X1, X2) -> and#(proper X1, proper X2), and#(mark X1, X2) -> and#(X1, X2)) (active# U11(X1, X2) -> active# X1, active# isNatIList cons(V1, V2) -> isNatIList# V2) (active# U11(X1, X2) -> active# X1, active# isNatIList cons(V1, V2) -> isNat# V1) (active# U11(X1, X2) -> active# X1, active# isNatIList cons(V1, V2) -> and#(isNat V1, isNatIList V2)) (active# U11(X1, X2) -> active# X1, active# isNatIList V -> isNatList# V) (active# U11(X1, X2) -> active# X1, active# isNatList cons(V1, V2) -> isNatList# V2) (active# U11(X1, X2) -> active# X1, active# isNatList cons(V1, V2) -> isNat# V1) (active# U11(X1, X2) -> active# X1, active# isNatList cons(V1, V2) -> and#(isNat V1, isNatList V2)) (active# U11(X1, X2) -> active# X1, active# isNat length V1 -> isNatList# V1) (active# U11(X1, X2) -> active# X1, active# isNat s V1 -> isNat# V1) (active# U11(X1, X2) -> active# X1, active# and(X1, X2) -> and#(active X1, X2)) (active# U11(X1, X2) -> active# X1, active# and(X1, X2) -> active# X1) (active# U11(X1, X2) -> active# X1, active# U11(tt(), L) -> length# L) (active# U11(X1, X2) -> active# X1, active# U11(tt(), L) -> s# length L) (active# U11(X1, X2) -> active# X1, active# U11(X1, X2) -> U11#(active X1, X2)) (active# U11(X1, X2) -> active# X1, active# U11(X1, X2) -> active# X1) (active# U11(X1, X2) -> active# X1, active# length cons(N, L) -> isNatList# L) (active# U11(X1, X2) -> active# X1, active# length cons(N, L) -> isNat# N) (active# U11(X1, X2) -> active# X1, active# length cons(N, L) -> and#(isNatList L, isNat N)) (active# U11(X1, X2) -> active# X1, active# length cons(N, L) -> U11#(and(isNatList L, isNat N), L)) (active# U11(X1, X2) -> active# X1, active# length X -> length# active X) (active# U11(X1, X2) -> active# X1, active# length X -> active# X) (active# U11(X1, X2) -> active# X1, active# s X -> s# active X) (active# U11(X1, X2) -> active# X1, active# s X -> active# X) (active# U11(X1, X2) -> active# X1, active# zeros() -> cons#(0(), zeros())) (active# U11(X1, X2) -> active# X1, active# cons(X1, X2) -> active# X1) (active# U11(X1, X2) -> active# X1, active# cons(X1, X2) -> cons#(active X1, X2)) (proper# cons(X1, X2) -> proper# X1, proper# isNatIList X -> proper# X) (proper# cons(X1, X2) -> proper# X1, proper# isNatIList X -> isNatIList# proper X) (proper# cons(X1, X2) -> proper# X1, proper# isNatList X -> proper# X) (proper# cons(X1, X2) -> proper# X1, proper# isNatList X -> isNatList# proper X) (proper# cons(X1, X2) -> proper# X1, proper# isNat X -> proper# X) (proper# cons(X1, X2) -> proper# X1, proper# isNat X -> isNat# proper X) (proper# cons(X1, X2) -> proper# X1, proper# and(X1, X2) -> proper# X2) (proper# cons(X1, X2) -> proper# X1, proper# and(X1, X2) -> proper# X1) (proper# cons(X1, X2) -> proper# X1, proper# and(X1, X2) -> and#(proper X1, proper X2)) (proper# cons(X1, X2) -> proper# X1, proper# U11(X1, X2) -> proper# X2) (proper# cons(X1, X2) -> proper# X1, proper# U11(X1, X2) -> proper# X1) (proper# cons(X1, X2) -> proper# X1, proper# U11(X1, X2) -> U11#(proper X1, proper X2)) (proper# cons(X1, X2) -> proper# X1, proper# length X -> proper# X) (proper# cons(X1, X2) -> proper# X1, proper# length X -> length# proper X) (proper# cons(X1, X2) -> proper# X1, proper# s X -> proper# X) (proper# cons(X1, X2) -> proper# X1, proper# s X -> s# proper X) (proper# cons(X1, X2) -> proper# X1, proper# cons(X1, X2) -> proper# X2) (proper# cons(X1, X2) -> proper# X1, proper# cons(X1, X2) -> proper# X1) (proper# cons(X1, X2) -> proper# X1, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (proper# and(X1, X2) -> proper# X1, proper# isNatIList X -> proper# X) (proper# and(X1, X2) -> proper# X1, proper# isNatIList X -> isNatIList# proper X) (proper# and(X1, X2) -> proper# X1, proper# isNatList X -> proper# X) (proper# and(X1, X2) -> proper# X1, proper# isNatList X -> isNatList# proper X) (proper# and(X1, X2) -> proper# X1, proper# isNat X -> proper# X) (proper# and(X1, X2) -> proper# X1, proper# isNat X -> isNat# proper X) (proper# and(X1, X2) -> proper# X1, proper# and(X1, X2) -> proper# X2) (proper# and(X1, X2) -> proper# X1, proper# and(X1, X2) -> proper# X1) (proper# and(X1, X2) -> proper# X1, proper# and(X1, X2) -> and#(proper X1, proper X2)) (proper# and(X1, X2) -> proper# X1, proper# U11(X1, X2) -> proper# X2) (proper# and(X1, X2) -> proper# X1, proper# U11(X1, X2) -> proper# X1) (proper# and(X1, X2) -> proper# X1, proper# U11(X1, X2) -> U11#(proper X1, proper X2)) (proper# and(X1, X2) -> proper# X1, proper# length X -> proper# X) (proper# and(X1, X2) -> proper# X1, proper# length X -> length# proper X) (proper# and(X1, X2) -> proper# X1, proper# s X -> proper# X) (proper# and(X1, X2) -> proper# X1, proper# s X -> s# proper X) (proper# and(X1, X2) -> proper# X1, proper# cons(X1, X2) -> proper# X2) (proper# and(X1, X2) -> proper# X1, proper# cons(X1, X2) -> proper# X1) (proper# and(X1, X2) -> proper# X1, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (active# isNatIList V -> isNatList# V, isNatList# ok X -> isNatList# X) (proper# U11(X1, X2) -> proper# X2, proper# isNatIList X -> proper# X) (proper# U11(X1, X2) -> proper# X2, proper# isNatIList X -> isNatIList# proper X) (proper# U11(X1, X2) -> proper# X2, proper# isNatList X -> proper# X) (proper# U11(X1, X2) -> proper# X2, proper# isNatList X -> isNatList# proper X) (proper# U11(X1, X2) -> proper# X2, proper# isNat X -> proper# X) (proper# U11(X1, X2) -> proper# X2, proper# isNat X -> isNat# proper X) (proper# U11(X1, X2) -> proper# X2, proper# and(X1, X2) -> proper# X2) (proper# U11(X1, X2) -> proper# X2, proper# and(X1, X2) -> proper# X1) (proper# U11(X1, X2) -> proper# X2, proper# and(X1, X2) -> and#(proper X1, proper X2)) (proper# U11(X1, X2) -> proper# X2, proper# U11(X1, X2) -> proper# X2) (proper# U11(X1, X2) -> proper# X2, proper# U11(X1, X2) -> proper# X1) (proper# U11(X1, X2) -> proper# X2, proper# U11(X1, X2) -> U11#(proper X1, proper X2)) (proper# U11(X1, X2) -> proper# X2, proper# length X -> proper# X) (proper# U11(X1, X2) -> proper# X2, proper# length X -> length# proper X) (proper# U11(X1, X2) -> proper# X2, proper# s X -> proper# X) (proper# U11(X1, X2) -> proper# X2, proper# s X -> s# proper X) (proper# U11(X1, X2) -> proper# X2, proper# cons(X1, X2) -> proper# X2) (proper# U11(X1, X2) -> proper# X2, proper# cons(X1, X2) -> proper# X1) (proper# U11(X1, X2) -> proper# X2, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (active# length cons(N, L) -> isNatList# L, isNatList# ok X -> isNatList# X) (active# isNatList cons(V1, V2) -> isNatList# V2, isNatList# ok X -> isNatList# X) (active# length X -> active# X, active# isNatIList cons(V1, V2) -> isNatIList# V2) (active# length X -> active# X, active# isNatIList cons(V1, V2) -> isNat# V1) (active# length X -> active# X, active# isNatIList cons(V1, V2) -> and#(isNat V1, isNatIList V2)) (active# length X -> active# X, active# isNatIList V -> isNatList# V) (active# length X -> active# X, active# isNatList cons(V1, V2) -> isNatList# V2) (active# length X -> active# X, active# isNatList cons(V1, V2) -> isNat# V1) (active# length X -> active# X, active# isNatList cons(V1, V2) -> and#(isNat V1, isNatList V2)) (active# length X -> active# X, active# isNat length V1 -> isNatList# V1) (active# length X -> active# X, active# isNat s V1 -> isNat# V1) (active# length X -> active# X, active# and(X1, X2) -> and#(active X1, X2)) (active# length X -> active# X, active# and(X1, X2) -> active# X1) (active# length X -> active# X, active# U11(tt(), L) -> length# L) (active# length X -> active# X, active# U11(tt(), L) -> s# length L) (active# length X -> active# X, active# U11(X1, X2) -> U11#(active X1, X2)) (active# length X -> active# X, active# U11(X1, X2) -> active# X1) (active# length X -> active# X, active# length cons(N, L) -> isNatList# L) (active# length X -> active# X, active# length cons(N, L) -> isNat# N) (active# length X -> active# X, active# length cons(N, L) -> and#(isNatList L, isNat N)) (active# length X -> active# X, active# length cons(N, L) -> U11#(and(isNatList L, isNat N), L)) (active# length X -> active# X, active# length X -> length# active X) (active# length X -> active# X, active# length X -> active# X) (active# length X -> active# X, active# s X -> s# active X) (active# length X -> active# X, active# s X -> active# X) (active# length X -> active# X, active# zeros() -> cons#(0(), zeros())) (active# length X -> active# X, active# cons(X1, X2) -> active# X1) (active# length X -> active# X, active# cons(X1, X2) -> cons#(active X1, X2)) (s# ok X -> s# X, s# ok X -> s# X) (s# ok X -> s# X, s# mark X -> s# X) (length# ok X -> length# X, length# ok X -> length# X) (length# ok X -> length# X, length# mark X -> length# X) (isNatList# ok X -> isNatList# X, isNatList# ok X -> isNatList# X) (proper# s X -> proper# X, proper# isNatIList X -> proper# X) (proper# s X -> proper# X, proper# isNatIList X -> isNatIList# proper X) (proper# s X -> proper# X, proper# isNatList X -> proper# X) (proper# s X -> proper# X, proper# isNatList X -> isNatList# proper X) (proper# s X -> proper# X, proper# isNat X -> proper# X) (proper# s X -> proper# X, proper# isNat X -> isNat# proper X) (proper# s X -> proper# X, proper# and(X1, X2) -> proper# X2) (proper# s X -> proper# X, proper# and(X1, X2) -> proper# X1) (proper# s X -> proper# X, proper# and(X1, X2) -> and#(proper X1, proper X2)) (proper# s X -> proper# X, proper# U11(X1, X2) -> proper# X2) (proper# s X -> proper# X, proper# U11(X1, X2) -> proper# X1) (proper# s X -> proper# X, proper# U11(X1, X2) -> U11#(proper X1, proper X2)) (proper# s X -> proper# X, proper# length X -> proper# X) (proper# s X -> proper# X, proper# length X -> length# proper X) (proper# s X -> proper# X, proper# s X -> proper# X) (proper# s X -> proper# X, proper# s X -> s# proper X) (proper# s X -> proper# X, proper# cons(X1, X2) -> proper# X2) (proper# s X -> proper# X, proper# cons(X1, X2) -> proper# X1) (proper# s X -> proper# X, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (proper# isNat X -> proper# X, proper# isNatIList X -> proper# X) (proper# isNat X -> proper# X, proper# isNatIList X -> isNatIList# proper X) (proper# isNat X -> proper# X, proper# isNatList X -> proper# X) (proper# isNat X -> proper# X, proper# isNatList X -> isNatList# proper X) (proper# isNat X -> proper# X, proper# isNat X -> proper# X) (proper# isNat X -> proper# X, proper# isNat X -> isNat# proper X) (proper# isNat X -> proper# X, proper# and(X1, X2) -> proper# X2) (proper# isNat X -> proper# X, proper# and(X1, X2) -> proper# X1) (proper# isNat X -> proper# X, proper# and(X1, X2) -> and#(proper X1, proper X2)) (proper# isNat X -> proper# X, proper# U11(X1, X2) -> proper# X2) (proper# isNat X -> proper# X, proper# U11(X1, X2) -> proper# X1) (proper# isNat X -> proper# X, proper# U11(X1, X2) -> U11#(proper X1, proper X2)) (proper# isNat X -> proper# X, proper# length X -> proper# X) (proper# isNat X -> proper# X, proper# length X -> length# proper X) (proper# isNat X -> proper# X, proper# s X -> proper# X) (proper# isNat X -> proper# X, proper# s X -> s# proper X) (proper# isNat X -> proper# X, proper# cons(X1, X2) -> proper# X2) (proper# isNat X -> proper# X, proper# cons(X1, X2) -> proper# X1) (proper# isNat X -> proper# X, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (proper# isNatIList X -> proper# X, proper# isNatIList X -> proper# X) (proper# isNatIList X -> proper# X, proper# isNatIList X -> isNatIList# proper X) (proper# isNatIList X -> proper# X, proper# isNatList X -> proper# X) (proper# isNatIList X -> proper# X, proper# isNatList X -> isNatList# proper X) (proper# isNatIList X -> proper# X, proper# isNat X -> proper# X) (proper# isNatIList X -> proper# X, proper# isNat X -> isNat# proper X) (proper# isNatIList X -> proper# X, proper# and(X1, X2) -> proper# X2) (proper# isNatIList X -> proper# X, proper# and(X1, X2) -> proper# X1) (proper# isNatIList X -> proper# X, proper# and(X1, X2) -> and#(proper X1, proper X2)) (proper# isNatIList X -> proper# X, proper# U11(X1, X2) -> proper# X2) (proper# isNatIList X -> proper# X, proper# U11(X1, X2) -> proper# X1) (proper# isNatIList X -> proper# X, proper# U11(X1, X2) -> U11#(proper X1, proper X2)) (proper# isNatIList X -> proper# X, proper# length X -> proper# X) (proper# isNatIList X -> proper# X, proper# length X -> length# proper X) (proper# isNatIList X -> proper# X, proper# s X -> proper# X) (proper# isNatIList X -> proper# X, proper# s X -> s# proper X) (proper# isNatIList X -> proper# X, proper# cons(X1, X2) -> proper# X2) (proper# isNatIList X -> proper# X, proper# cons(X1, X2) -> proper# X1) (proper# isNatIList X -> proper# X, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (top# ok X -> active# X, active# isNatIList cons(V1, V2) -> isNatIList# V2) (top# ok X -> active# X, active# isNatIList cons(V1, V2) -> isNat# V1) (top# ok X -> active# X, active# isNatIList cons(V1, V2) -> and#(isNat V1, isNatIList V2)) (top# ok X -> active# X, active# isNatIList V -> isNatList# V) (top# ok X -> active# X, active# isNatList cons(V1, V2) -> isNatList# V2) (top# ok X -> active# X, active# isNatList cons(V1, V2) -> isNat# V1) (top# ok X -> active# X, active# isNatList cons(V1, V2) -> and#(isNat V1, isNatList V2)) (top# ok X -> active# X, active# isNat length V1 -> isNatList# V1) (top# ok X -> active# X, active# isNat s V1 -> isNat# V1) (top# ok X -> active# X, active# and(X1, X2) -> and#(active X1, X2)) (top# ok X -> active# X, active# and(X1, X2) -> active# X1) (top# ok X -> active# X, active# U11(tt(), L) -> length# L) (top# ok X -> active# X, active# U11(tt(), L) -> s# length L) (top# ok X -> active# X, active# U11(X1, X2) -> U11#(active X1, X2)) (top# ok X -> active# X, active# U11(X1, X2) -> active# X1) (top# ok X -> active# X, active# length cons(N, L) -> isNatList# L) (top# ok X -> active# X, active# length cons(N, L) -> isNat# N) (top# ok X -> active# X, active# length cons(N, L) -> and#(isNatList L, isNat N)) (top# ok X -> active# X, active# length cons(N, L) -> U11#(and(isNatList L, isNat N), L)) (top# ok X -> active# X, active# length X -> length# active X) (top# ok X -> active# X, active# length X -> active# X) (top# ok X -> active# X, active# s X -> s# active X) (top# ok X -> active# X, active# s X -> active# X) (top# ok X -> active# X, active# zeros() -> cons#(0(), zeros())) (top# ok X -> active# X, active# cons(X1, X2) -> active# X1) (top# ok X -> active# X, active# cons(X1, X2) -> cons#(active X1, X2)) (active# U11(X1, X2) -> U11#(active X1, X2), U11#(ok X1, ok X2) -> U11#(X1, X2)) (active# U11(X1, X2) -> U11#(active X1, X2), U11#(mark X1, X2) -> U11#(X1, X2)) (active# length cons(N, L) -> isNat# N, isNat# ok X -> isNat# X) (cons#(ok X1, ok X2) -> cons#(X1, X2), cons#(ok X1, ok X2) -> cons#(X1, X2)) (cons#(ok X1, ok X2) -> cons#(X1, X2), cons#(mark X1, X2) -> cons#(X1, X2)) (U11#(ok X1, ok X2) -> U11#(X1, X2), U11#(ok X1, ok X2) -> U11#(X1, X2)) (U11#(ok X1, ok X2) -> U11#(X1, X2), U11#(mark X1, X2) -> U11#(X1, X2)) (and#(ok X1, ok X2) -> and#(X1, X2), and#(ok X1, ok X2) -> and#(X1, X2)) (and#(ok X1, ok X2) -> and#(X1, X2), and#(mark X1, X2) -> and#(X1, X2)) (active# length X -> length# active X, length# ok X -> length# X) (active# length X -> length# active X, length# mark X -> length# X) (proper# length X -> length# proper X, length# ok X -> length# X) (proper# length X -> length# proper X, length# mark X -> length# X) (proper# isNatList X -> isNatList# proper X, isNatList# ok X -> isNatList# X) (top# mark X -> top# proper X, top# ok X -> top# active X) (top# mark X -> top# proper X, top# ok X -> active# X) (top# mark X -> top# proper X, top# mark X -> top# proper X) (top# mark X -> top# proper X, top# mark X -> proper# X) (active# U11(tt(), L) -> s# length L, s# ok X -> s# X) (active# U11(tt(), L) -> s# length L, s# mark X -> s# X) (active# isNat length V1 -> isNatList# V1, isNatList# ok X -> isNatList# X) (active# isNatIList cons(V1, V2) -> isNat# V1, isNat# ok X -> isNat# X) (active# isNatList cons(V1, V2) -> isNat# V1, isNat# ok X -> isNat# X) (active# isNat s V1 -> isNat# V1, isNat# ok X -> isNat# X) (top# ok X -> top# active X, top# mark X -> proper# X) (top# ok X -> top# active X, top# mark X -> top# proper X) (top# ok X -> top# active X, top# ok X -> active# X) (top# ok X -> top# active X, top# ok X -> top# active X) (proper# isNatIList X -> isNatIList# proper X, isNatIList# ok X -> isNatIList# X) (proper# isNat X -> isNat# proper X, isNat# ok X -> isNat# X) (proper# s X -> s# proper X, s# mark X -> s# X) (proper# s X -> s# proper X, s# ok X -> s# X) (active# s X -> s# active X, s# mark X -> s# X) (active# s X -> s# active X, s# ok X -> s# X) (and#(mark X1, X2) -> and#(X1, X2), and#(mark X1, X2) -> and#(X1, X2)) (and#(mark X1, X2) -> and#(X1, X2), and#(ok X1, ok X2) -> and#(X1, X2)) (U11#(mark X1, X2) -> U11#(X1, X2), U11#(mark X1, X2) -> U11#(X1, X2)) (U11#(mark X1, X2) -> U11#(X1, X2), U11#(ok X1, ok X2) -> U11#(X1, X2)) (cons#(mark X1, X2) -> cons#(X1, X2), cons#(mark X1, X2) -> cons#(X1, X2)) (cons#(mark X1, X2) -> cons#(X1, X2), cons#(ok X1, ok X2) -> cons#(X1, X2)) (active# and(X1, X2) -> and#(active X1, X2), and#(mark X1, X2) -> and#(X1, X2)) (active# and(X1, X2) -> and#(active X1, X2), and#(ok X1, ok X2) -> and#(X1, X2)) (active# cons(X1, X2) -> cons#(active X1, X2), cons#(mark X1, X2) -> cons#(X1, X2)) (active# cons(X1, X2) -> cons#(active X1, X2), cons#(ok X1, ok X2) -> cons#(X1, X2)) (top# mark X -> proper# X, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (top# mark X -> proper# X, proper# cons(X1, X2) -> proper# X1) (top# mark X -> proper# X, proper# cons(X1, X2) -> proper# X2) (top# mark X -> proper# X, proper# s X -> s# proper X) (top# mark X -> proper# X, proper# s X -> proper# X) (top# mark X -> proper# X, proper# length X -> length# proper X) (top# mark X -> proper# X, proper# length X -> proper# X) (top# mark X -> proper# X, proper# U11(X1, X2) -> U11#(proper X1, proper X2)) (top# mark X -> proper# X, proper# U11(X1, X2) -> proper# X1) (top# mark X -> proper# X, proper# U11(X1, X2) -> proper# X2) (top# mark X -> proper# X, proper# and(X1, X2) -> and#(proper X1, proper X2)) (top# mark X -> proper# X, proper# and(X1, X2) -> proper# X1) (top# mark X -> proper# X, proper# and(X1, X2) -> proper# X2) (top# mark X -> proper# X, proper# isNat X -> isNat# proper X) (top# mark X -> proper# X, proper# isNat X -> proper# X) (top# mark X -> proper# X, proper# isNatList X -> isNatList# proper X) (top# mark X -> proper# X, proper# isNatList X -> proper# X) (top# mark X -> proper# X, proper# isNatIList X -> isNatIList# proper X) (top# mark X -> proper# X, proper# isNatIList X -> proper# X) (proper# isNatList X -> proper# X, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (proper# isNatList X -> proper# X, proper# cons(X1, X2) -> proper# X1) (proper# isNatList X -> proper# X, proper# cons(X1, X2) -> proper# X2) (proper# isNatList X -> proper# X, proper# s X -> s# proper X) (proper# isNatList X -> proper# X, proper# s X -> proper# X) (proper# isNatList X -> proper# X, proper# length X -> length# proper X) (proper# isNatList X -> proper# X, proper# length X -> proper# X) (proper# isNatList X -> proper# X, proper# U11(X1, X2) -> U11#(proper X1, proper X2)) (proper# isNatList X -> proper# X, proper# U11(X1, X2) -> proper# X1) (proper# isNatList X -> proper# X, proper# U11(X1, X2) -> proper# X2) (proper# isNatList X -> proper# X, proper# and(X1, X2) -> and#(proper X1, proper X2)) (proper# isNatList X -> proper# X, proper# and(X1, X2) -> proper# X1) (proper# isNatList X -> proper# X, proper# and(X1, X2) -> proper# X2) (proper# isNatList X -> proper# X, proper# isNat X -> isNat# proper X) (proper# isNatList X -> proper# X, proper# isNat X -> proper# X) (proper# isNatList X -> proper# X, proper# isNatList X -> isNatList# proper X) (proper# isNatList X -> proper# X, proper# isNatList X -> proper# X) (proper# isNatList X -> proper# X, proper# isNatIList X -> isNatIList# proper X) (proper# isNatList X -> proper# X, proper# isNatIList X -> proper# X) (proper# length X -> proper# X, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (proper# length X -> proper# X, proper# cons(X1, X2) -> proper# X1) (proper# length X -> proper# X, proper# cons(X1, X2) -> proper# X2) (proper# length X -> proper# X, proper# s X -> s# proper X) (proper# length X -> proper# X, proper# s X -> proper# X) (proper# length X -> proper# X, proper# length X -> length# proper X) (proper# length X -> proper# X, proper# length X -> proper# X) (proper# length X -> proper# X, proper# U11(X1, X2) -> U11#(proper X1, proper X2)) (proper# length X -> proper# X, proper# U11(X1, X2) -> proper# X1) (proper# length X -> proper# X, proper# U11(X1, X2) -> proper# X2) (proper# length X -> proper# X, proper# and(X1, X2) -> and#(proper X1, proper X2)) (proper# length X -> proper# X, proper# and(X1, X2) -> proper# X1) (proper# length X -> proper# X, proper# and(X1, X2) -> proper# X2) (proper# length X -> proper# X, proper# isNat X -> isNat# proper X) (proper# length X -> proper# X, proper# isNat X -> proper# X) (proper# length X -> proper# X, proper# isNatList X -> isNatList# proper X) (proper# length X -> proper# X, proper# isNatList X -> proper# X) (proper# length X -> proper# X, proper# isNatIList X -> isNatIList# proper X) (proper# length X -> proper# X, proper# isNatIList X -> proper# X) (isNatIList# ok X -> isNatIList# X, isNatIList# ok X -> isNatIList# X) (isNat# ok X -> isNat# X, isNat# ok X -> isNat# X) (length# mark X -> length# X, length# mark X -> length# X) (length# mark X -> length# X, length# ok X -> length# X) (s# mark X -> s# X, s# mark X -> s# X) (s# mark X -> s# X, s# ok X -> s# X) (active# s X -> active# X, active# cons(X1, X2) -> cons#(active X1, X2)) (active# s X -> active# X, active# cons(X1, X2) -> active# X1) (active# s X -> active# X, active# zeros() -> cons#(0(), zeros())) (active# s X -> active# X, active# s X -> active# X) (active# s X -> active# X, active# s X -> s# active X) (active# s X -> active# X, active# length X -> active# X) (active# s X -> active# X, active# length X -> length# active X) (active# s X -> active# X, active# length cons(N, L) -> U11#(and(isNatList L, isNat N), L)) (active# s X -> active# X, active# length cons(N, L) -> and#(isNatList L, isNat N)) (active# s X -> active# X, active# length cons(N, L) -> isNat# N) (active# s X -> active# X, active# length cons(N, L) -> isNatList# L) (active# s X -> active# X, active# U11(X1, X2) -> active# X1) (active# s X -> active# X, active# U11(X1, X2) -> U11#(active X1, X2)) (active# s X -> active# X, active# U11(tt(), L) -> s# length L) (active# s X -> active# X, active# U11(tt(), L) -> length# L) (active# s X -> active# X, active# and(X1, X2) -> active# X1) (active# s X -> active# X, active# and(X1, X2) -> and#(active X1, X2)) (active# s X -> active# X, active# isNat s V1 -> isNat# V1) (active# s X -> active# X, active# isNat length V1 -> isNatList# V1) (active# s X -> active# X, active# isNatList cons(V1, V2) -> and#(isNat V1, isNatList V2)) (active# s X -> active# X, active# isNatList cons(V1, V2) -> isNat# V1) (active# s X -> active# X, active# isNatList cons(V1, V2) -> isNatList# V2) (active# s X -> active# X, active# isNatIList V -> isNatList# V) (active# s X -> active# X, active# isNatIList cons(V1, V2) -> and#(isNat V1, isNatIList V2)) (active# s X -> active# X, active# isNatIList cons(V1, V2) -> isNat# V1) (active# s X -> active# X, active# isNatIList cons(V1, V2) -> isNatIList# V2) (active# isNatIList cons(V1, V2) -> isNatIList# V2, isNatIList# ok X -> isNatIList# X) (active# U11(tt(), L) -> length# L, length# mark X -> length# X) (active# U11(tt(), L) -> length# L, length# ok X -> length# X) (proper# and(X1, X2) -> proper# X2, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (proper# and(X1, X2) -> proper# X2, proper# cons(X1, X2) -> proper# X1) (proper# and(X1, X2) -> proper# X2, proper# cons(X1, X2) -> proper# X2) (proper# and(X1, X2) -> proper# X2, proper# s X -> s# proper X) (proper# and(X1, X2) -> proper# X2, proper# s X -> proper# X) (proper# and(X1, X2) -> proper# X2, proper# length X -> length# proper X) (proper# and(X1, X2) -> proper# X2, proper# length X -> proper# X) (proper# and(X1, X2) -> proper# X2, proper# U11(X1, X2) -> U11#(proper X1, proper X2)) (proper# and(X1, X2) -> proper# X2, proper# U11(X1, X2) -> proper# X1) (proper# and(X1, X2) -> proper# X2, proper# U11(X1, X2) -> proper# X2) (proper# and(X1, X2) -> proper# X2, proper# and(X1, X2) -> and#(proper X1, proper X2)) (proper# and(X1, X2) -> proper# X2, proper# and(X1, X2) -> proper# X1) (proper# and(X1, X2) -> proper# X2, proper# and(X1, X2) -> proper# X2) (proper# and(X1, X2) -> proper# X2, proper# isNat X -> isNat# proper X) (proper# and(X1, X2) -> proper# X2, proper# isNat X -> proper# X) (proper# and(X1, X2) -> proper# X2, proper# isNatList X -> isNatList# proper X) (proper# and(X1, X2) -> proper# X2, proper# isNatList X -> proper# X) (proper# and(X1, X2) -> proper# X2, proper# isNatIList X -> isNatIList# proper X) (proper# and(X1, X2) -> proper# X2, proper# isNatIList X -> proper# X) (proper# cons(X1, X2) -> proper# X2, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (proper# cons(X1, X2) -> proper# X2, proper# cons(X1, X2) -> proper# X1) (proper# cons(X1, X2) -> proper# X2, proper# cons(X1, X2) -> proper# X2) (proper# cons(X1, X2) -> proper# X2, proper# s X -> s# proper X) (proper# cons(X1, X2) -> proper# X2, proper# s X -> proper# X) (proper# cons(X1, X2) -> proper# X2, proper# length X -> length# proper X) (proper# cons(X1, X2) -> proper# X2, proper# length X -> proper# X) (proper# cons(X1, X2) -> proper# X2, proper# U11(X1, X2) -> U11#(proper X1, proper X2)) (proper# cons(X1, X2) -> proper# X2, proper# U11(X1, X2) -> proper# X1) (proper# cons(X1, X2) -> proper# X2, proper# U11(X1, X2) -> proper# X2) (proper# cons(X1, X2) -> proper# X2, proper# and(X1, X2) -> and#(proper X1, proper X2)) (proper# cons(X1, X2) -> proper# X2, proper# and(X1, X2) -> proper# X1) (proper# cons(X1, X2) -> proper# X2, proper# and(X1, X2) -> proper# X2) (proper# cons(X1, X2) -> proper# X2, proper# isNat X -> isNat# proper X) (proper# cons(X1, X2) -> proper# X2, proper# isNat X -> proper# X) (proper# cons(X1, X2) -> proper# X2, proper# isNatList X -> isNatList# proper X) (proper# cons(X1, X2) -> proper# X2, proper# isNatList X -> proper# X) (proper# cons(X1, X2) -> proper# X2, proper# isNatIList X -> isNatIList# proper X) (proper# cons(X1, X2) -> proper# X2, proper# isNatIList X -> proper# X) (active# length cons(N, L) -> U11#(and(isNatList L, isNat N), L), U11#(ok X1, ok X2) -> U11#(X1, X2)) (proper# U11(X1, X2) -> proper# X1, proper# cons(X1, X2) -> cons#(proper X1, proper X2)) (proper# U11(X1, X2) -> proper# X1, proper# cons(X1, X2) -> proper# X1) (proper# U11(X1, X2) -> proper# X1, proper# cons(X1, X2) -> proper# X2) (proper# U11(X1, X2) -> proper# X1, proper# s X -> s# proper X) (proper# U11(X1, X2) -> proper# X1, proper# s X -> proper# X) (proper# U11(X1, X2) -> proper# X1, proper# length X -> length# proper X) (proper# U11(X1, X2) -> proper# X1, proper# length X -> proper# X) (proper# U11(X1, X2) -> proper# X1, proper# U11(X1, X2) -> U11#(proper X1, proper X2)) (proper# U11(X1, X2) -> proper# X1, proper# U11(X1, X2) -> proper# X1) (proper# U11(X1, X2) -> proper# X1, proper# U11(X1, X2) -> proper# X2) (proper# U11(X1, X2) -> proper# X1, proper# and(X1, X2) -> and#(proper X1, proper X2)) (proper# U11(X1, X2) -> proper# X1, proper# and(X1, X2) -> proper# X1) (proper# U11(X1, X2) -> proper# X1, proper# and(X1, X2) -> proper# X2) (proper# U11(X1, X2) -> proper# X1, proper# isNat X -> isNat# proper X) (proper# U11(X1, X2) -> proper# X1, proper# isNat X -> proper# X) (proper# U11(X1, X2) -> proper# X1, proper# isNatList X -> isNatList# proper X) (proper# U11(X1, X2) -> proper# X1, proper# isNatList X -> proper# X) (proper# U11(X1, X2) -> proper# X1, proper# isNatIList X -> isNatIList# proper X) (proper# U11(X1, X2) -> proper# X1, proper# isNatIList X -> proper# X) (active# and(X1, X2) -> active# X1, active# cons(X1, X2) -> cons#(active X1, X2)) (active# and(X1, X2) -> active# X1, active# cons(X1, X2) -> active# X1) (active# and(X1, X2) -> active# X1, active# zeros() -> cons#(0(), zeros())) (active# and(X1, X2) -> active# X1, active# s X -> active# X) (active# and(X1, X2) -> active# X1, active# s X -> s# active X) (active# and(X1, X2) -> active# X1, active# length X -> active# X) (active# and(X1, X2) -> active# X1, active# length X -> length# active X) (active# and(X1, X2) -> active# X1, active# length cons(N, L) -> U11#(and(isNatList L, isNat N), L)) (active# and(X1, X2) -> active# X1, active# length cons(N, L) -> and#(isNatList L, isNat N)) (active# and(X1, X2) -> active# X1, active# length cons(N, L) -> isNat# N) (active# and(X1, X2) -> active# X1, active# length cons(N, L) -> isNatList# L) (active# and(X1, X2) -> active# X1, active# U11(X1, X2) -> active# X1) (active# and(X1, X2) -> active# X1, active# U11(X1, X2) -> U11#(active X1, X2)) (active# and(X1, X2) -> active# X1, active# U11(tt(), L) -> s# length L) (active# and(X1, X2) -> active# X1, active# U11(tt(), L) -> length# L) (active# and(X1, X2) -> active# X1, active# and(X1, X2) -> active# X1) (active# and(X1, X2) -> active# X1, active# and(X1, X2) -> and#(active X1, X2)) (active# and(X1, X2) -> active# X1, active# isNat s V1 -> isNat# V1) (active# and(X1, X2) -> active# X1, active# isNat length V1 -> isNatList# V1) (active# and(X1, X2) -> active# X1, active# isNatList cons(V1, V2) -> and#(isNat V1, isNatList V2)) (active# and(X1, X2) -> active# X1, active# isNatList cons(V1, V2) -> isNat# V1) (active# and(X1, X2) -> active# X1, active# isNatList cons(V1, V2) -> isNatList# V2) (active# and(X1, X2) -> active# X1, active# isNatIList V -> isNatList# V) (active# and(X1, X2) -> active# X1, active# isNatIList cons(V1, V2) -> and#(isNat V1, isNatIList V2)) (active# and(X1, X2) -> active# X1, active# isNatIList cons(V1, V2) -> isNat# V1) (active# and(X1, X2) -> active# X1, active# isNatIList cons(V1, V2) -> isNatIList# V2) (active# cons(X1, X2) -> active# X1, active# cons(X1, X2) -> cons#(active X1, X2)) (active# cons(X1, X2) -> active# X1, active# cons(X1, X2) -> active# X1) (active# cons(X1, X2) -> active# X1, active# zeros() -> cons#(0(), zeros())) (active# cons(X1, X2) -> active# X1, active# s X -> active# X) (active# cons(X1, X2) -> active# X1, active# s X -> s# active X) (active# cons(X1, X2) -> active# X1, active# length X -> active# X) (active# cons(X1, X2) -> active# X1, active# length X -> length# active X) (active# cons(X1, X2) -> active# X1, active# length cons(N, L) -> U11#(and(isNatList L, isNat N), L)) (active# cons(X1, X2) -> active# X1, active# length cons(N, L) -> and#(isNatList L, isNat N)) (active# cons(X1, X2) -> active# X1, active# length cons(N, L) -> isNat# N) (active# cons(X1, X2) -> active# X1, active# length cons(N, L) -> isNatList# L) (active# cons(X1, X2) -> active# X1, active# U11(X1, X2) -> active# X1) (active# cons(X1, X2) -> active# X1, active# U11(X1, X2) -> U11#(active X1, X2)) (active# cons(X1, X2) -> active# X1, active# U11(tt(), L) -> s# length L) (active# cons(X1, X2) -> active# X1, active# U11(tt(), L) -> length# L) (active# cons(X1, X2) -> active# X1, active# and(X1, X2) -> active# X1) (active# cons(X1, X2) -> active# X1, active# and(X1, X2) -> and#(active X1, X2)) (active# cons(X1, X2) -> active# X1, active# isNat s V1 -> isNat# V1) (active# cons(X1, X2) -> active# X1, active# isNat length V1 -> isNatList# V1) (active# cons(X1, X2) -> active# X1, active# isNatList cons(V1, V2) -> and#(isNat V1, isNatList V2)) (active# cons(X1, X2) -> active# X1, active# isNatList cons(V1, V2) -> isNat# V1) (active# cons(X1, X2) -> active# X1, active# isNatList cons(V1, V2) -> isNatList# V2) (active# cons(X1, X2) -> active# X1, active# isNatIList V -> isNatList# V) (active# cons(X1, X2) -> active# X1, active# isNatIList cons(V1, V2) -> and#(isNat V1, isNatIList V2)) (active# cons(X1, X2) -> active# X1, active# isNatIList cons(V1, V2) -> isNat# V1) (active# cons(X1, X2) -> active# X1, active# isNatIList cons(V1, V2) -> isNatIList# V2) (proper# U11(X1, X2) -> U11#(proper X1, proper X2), U11#(mark X1, X2) -> U11#(X1, X2)) (proper# U11(X1, X2) -> U11#(proper X1, proper X2), U11#(ok X1, ok X2) -> U11#(X1, X2)) (active# isNatIList cons(V1, V2) -> and#(isNat V1, isNatIList V2), and#(ok X1, ok X2) -> and#(X1, X2)) (active# length cons(N, L) -> and#(isNatList L, isNat N), and#(ok X1, ok X2) -> and#(X1, X2)) } STATUS: arrows: 0.881634 SCCS (11): Scc: {top# mark X -> top# proper X, top# ok X -> top# active X} Scc: {proper# cons(X1, X2) -> proper# X1, proper# cons(X1, X2) -> proper# X2, proper# s X -> proper# X, proper# length X -> proper# X, proper# U11(X1, X2) -> proper# X1, proper# U11(X1, X2) -> proper# X2, proper# and(X1, X2) -> proper# X1, proper# and(X1, X2) -> proper# X2, proper# isNat X -> proper# X, proper# isNatList X -> proper# X, proper# isNatIList X -> proper# X} Scc: {active# cons(X1, X2) -> active# X1, active# s X -> active# X, active# length X -> active# X, active# U11(X1, X2) -> active# X1, active# and(X1, X2) -> active# X1} Scc: {isNatIList# ok X -> isNatIList# X} Scc: {isNatList# ok X -> isNatList# X} Scc: {isNat# ok X -> isNat# X} Scc: {length# mark X -> length# X, length# ok X -> length# X} Scc: {s# mark X -> s# X, s# ok X -> s# X} Scc: { U11#(mark X1, X2) -> U11#(X1, X2), U11#(ok X1, ok X2) -> U11#(X1, X2)} Scc: { cons#(mark X1, X2) -> cons#(X1, X2), cons#(ok X1, ok X2) -> cons#(X1, X2)} Scc: { and#(mark X1, X2) -> and#(X1, X2), and#(ok X1, ok X2) -> and#(X1, X2)} SCC (2): Strict: {top# mark X -> top# proper X, top# ok X -> top# active X} Weak: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), active cons(X1, X2) -> cons(active X1, X2), active zeros() -> mark cons(0(), zeros()), active s X -> s active X, active length X -> length active X, active length cons(N, L) -> mark U11(and(isNatList L, isNat N), L), active length nil() -> mark 0(), active U11(X1, X2) -> U11(active X1, X2), active U11(tt(), L) -> mark s length L, active and(X1, X2) -> and(active X1, X2), active and(tt(), X) -> mark X, active isNat 0() -> mark tt(), active isNat s V1 -> mark isNat V1, active isNat length V1 -> mark isNatList V1, active isNatList cons(V1, V2) -> mark and(isNat V1, isNatList V2), active isNatList nil() -> mark tt(), active isNatIList V -> mark isNatList V, active isNatIList cons(V1, V2) -> mark and(isNat V1, isNatIList V2), active isNatIList zeros() -> mark tt(), s mark X -> mark s X, s ok X -> ok s X, length mark X -> mark length X, length ok X -> ok length X, U11(mark X1, X2) -> mark U11(X1, X2), U11(ok X1, ok X2) -> ok U11(X1, X2), and(mark X1, X2) -> mark and(X1, X2), and(ok X1, ok X2) -> ok and(X1, X2), isNat ok X -> ok isNat X, isNatList ok X -> ok isNatList X, isNatIList ok X -> ok isNatIList X, proper cons(X1, X2) -> cons(proper X1, proper X2), proper 0() -> ok 0(), proper zeros() -> ok zeros(), proper s X -> s proper X, proper length X -> length proper X, proper U11(X1, X2) -> U11(proper X1, proper X2), proper tt() -> ok tt(), proper and(X1, X2) -> and(proper X1, proper X2), proper isNat X -> isNat proper X, proper isNatList X -> isNatList proper X, proper isNatIList X -> isNatIList proper X, proper nil() -> ok nil(), top mark X -> top proper X, top ok X -> top active X} Open SCC (11): Strict: {proper# cons(X1, X2) -> proper# X1, proper# cons(X1, X2) -> proper# X2, proper# s X -> proper# X, proper# length X -> proper# X, proper# U11(X1, X2) -> proper# X1, proper# U11(X1, X2) -> proper# X2, proper# and(X1, X2) -> proper# X1, proper# and(X1, X2) -> proper# X2, proper# isNat X -> proper# X, proper# isNatList X -> proper# X, proper# isNatIList X -> proper# X} Weak: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), active cons(X1, X2) -> cons(active X1, X2), active zeros() -> mark cons(0(), zeros()), active s X -> s active X, active length X -> length active X, active length cons(N, L) -> mark U11(and(isNatList L, isNat N), L), active length nil() -> mark 0(), active U11(X1, X2) -> U11(active X1, X2), active U11(tt(), L) -> mark s length L, active and(X1, X2) -> and(active X1, X2), active and(tt(), X) -> mark X, active isNat 0() -> mark tt(), active isNat s V1 -> mark isNat V1, active isNat length V1 -> mark isNatList V1, active isNatList cons(V1, V2) -> mark and(isNat V1, isNatList V2), active isNatList nil() -> mark tt(), active isNatIList V -> mark isNatList V, active isNatIList cons(V1, V2) -> mark and(isNat V1, isNatIList V2), active isNatIList zeros() -> mark tt(), s mark X -> mark s X, s ok X -> ok s X, length mark X -> mark length X, length ok X -> ok length X, U11(mark X1, X2) -> mark U11(X1, X2), U11(ok X1, ok X2) -> ok U11(X1, X2), and(mark X1, X2) -> mark and(X1, X2), and(ok X1, ok X2) -> ok and(X1, X2), isNat ok X -> ok isNat X, isNatList ok X -> ok isNatList X, isNatIList ok X -> ok isNatIList X, proper cons(X1, X2) -> cons(proper X1, proper X2), proper 0() -> ok 0(), proper zeros() -> ok zeros(), proper s X -> s proper X, proper length X -> length proper X, proper U11(X1, X2) -> U11(proper X1, proper X2), proper tt() -> ok tt(), proper and(X1, X2) -> and(proper X1, proper X2), proper isNat X -> isNat proper X, proper isNatList X -> isNatList proper X, proper isNatIList X -> isNatIList proper X, proper nil() -> ok nil(), top mark X -> top proper X, top ok X -> top active X} Open SCC (5): Strict: {active# cons(X1, X2) -> active# X1, active# s X -> active# X, active# length X -> active# X, active# U11(X1, X2) -> active# X1, active# and(X1, X2) -> active# X1} Weak: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), active cons(X1, X2) -> cons(active X1, X2), active zeros() -> mark cons(0(), zeros()), active s X -> s active X, active length X -> length active X, active length cons(N, L) -> mark U11(and(isNatList L, isNat N), L), active length nil() -> mark 0(), active U11(X1, X2) -> U11(active X1, X2), active U11(tt(), L) -> mark s length L, active and(X1, X2) -> and(active X1, X2), active and(tt(), X) -> mark X, active isNat 0() -> mark tt(), active isNat s V1 -> mark isNat V1, active isNat length V1 -> mark isNatList V1, active isNatList cons(V1, V2) -> mark and(isNat V1, isNatList V2), active isNatList nil() -> mark tt(), active isNatIList V -> mark isNatList V, active isNatIList cons(V1, V2) -> mark and(isNat V1, isNatIList V2), active isNatIList zeros() -> mark tt(), s mark X -> mark s X, s ok X -> ok s X, length mark X -> mark length X, length ok X -> ok length X, U11(mark X1, X2) -> mark U11(X1, X2), U11(ok X1, ok X2) -> ok U11(X1, X2), and(mark X1, X2) -> mark and(X1, X2), and(ok X1, ok X2) -> ok and(X1, X2), isNat ok X -> ok isNat X, isNatList ok X -> ok isNatList X, isNatIList ok X -> ok isNatIList X, proper cons(X1, X2) -> cons(proper X1, proper X2), proper 0() -> ok 0(), proper zeros() -> ok zeros(), proper s X -> s proper X, proper length X -> length proper X, proper U11(X1, X2) -> U11(proper X1, proper X2), proper tt() -> ok tt(), proper and(X1, X2) -> and(proper X1, proper X2), proper isNat X -> isNat proper X, proper isNatList X -> isNatList proper X, proper isNatIList X -> isNatIList proper X, proper nil() -> ok nil(), top mark X -> top proper X, top ok X -> top active X} Open SCC (1): Strict: {isNatIList# ok X -> isNatIList# X} Weak: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), active cons(X1, X2) -> cons(active X1, X2), active zeros() -> mark cons(0(), zeros()), active s X -> s active X, active length X -> length active X, active length cons(N, L) -> mark U11(and(isNatList L, isNat N), L), active length nil() -> mark 0(), active U11(X1, X2) -> U11(active X1, X2), active U11(tt(), L) -> mark s length L, active and(X1, X2) -> and(active X1, X2), active and(tt(), X) -> mark X, active isNat 0() -> mark tt(), active isNat s V1 -> mark isNat V1, active isNat length V1 -> mark isNatList V1, active isNatList cons(V1, V2) -> mark and(isNat V1, isNatList V2), active isNatList nil() -> mark tt(), active isNatIList V -> mark isNatList V, active isNatIList cons(V1, V2) -> mark and(isNat V1, isNatIList V2), active isNatIList zeros() -> mark tt(), s mark X -> mark s X, s ok X -> ok s X, length mark X -> mark length X, length ok X -> ok length X, U11(mark X1, X2) -> mark U11(X1, X2), U11(ok X1, ok X2) -> ok U11(X1, X2), and(mark X1, X2) -> mark and(X1, X2), and(ok X1, ok X2) -> ok and(X1, X2), isNat ok X -> ok isNat X, isNatList ok X -> ok isNatList X, isNatIList ok X -> ok isNatIList X, proper cons(X1, X2) -> cons(proper X1, proper X2), proper 0() -> ok 0(), proper zeros() -> ok zeros(), proper s X -> s proper X, proper length X -> length proper X, proper U11(X1, X2) -> U11(proper X1, proper X2), proper tt() -> ok tt(), proper and(X1, X2) -> and(proper X1, proper X2), proper isNat X -> isNat proper X, proper isNatList X -> isNatList proper X, proper isNatIList X -> isNatIList proper X, proper nil() -> ok nil(), top mark X -> top proper X, top ok X -> top active X} Open SCC (1): Strict: {isNatList# ok X -> isNatList# X} Weak: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), active cons(X1, X2) -> cons(active X1, X2), active zeros() -> mark cons(0(), zeros()), active s X -> s active X, active length X -> length active X, active length cons(N, L) -> mark U11(and(isNatList L, isNat N), L), active length nil() -> mark 0(), active U11(X1, X2) -> U11(active X1, X2), active U11(tt(), L) -> mark s length L, active and(X1, X2) -> and(active X1, X2), active and(tt(), X) -> mark X, active isNat 0() -> mark tt(), active isNat s V1 -> mark isNat V1, active isNat length V1 -> mark isNatList V1, active isNatList cons(V1, V2) -> mark and(isNat V1, isNatList V2), active isNatList nil() -> mark tt(), active isNatIList V -> mark isNatList V, active isNatIList cons(V1, V2) -> mark and(isNat V1, isNatIList V2), active isNatIList zeros() -> mark tt(), s mark X -> mark s X, s ok X -> ok s X, length mark X -> mark length X, length ok X -> ok length X, U11(mark X1, X2) -> mark U11(X1, X2), U11(ok X1, ok X2) -> ok U11(X1, X2), and(mark X1, X2) -> mark and(X1, X2), and(ok X1, ok X2) -> ok and(X1, X2), isNat ok X -> ok isNat X, isNatList ok X -> ok isNatList X, isNatIList ok X -> ok isNatIList X, proper cons(X1, X2) -> cons(proper X1, proper X2), proper 0() -> ok 0(), proper zeros() -> ok zeros(), proper s X -> s proper X, proper length X -> length proper X, proper U11(X1, X2) -> U11(proper X1, proper X2), proper tt() -> ok tt(), proper and(X1, X2) -> and(proper X1, proper X2), proper isNat X -> isNat proper X, proper isNatList X -> isNatList proper X, proper isNatIList X -> isNatIList proper X, proper nil() -> ok nil(), top mark X -> top proper X, top ok X -> top active X} Open SCC (1): Strict: {isNat# ok X -> isNat# X} Weak: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), active cons(X1, X2) -> cons(active X1, X2), active zeros() -> mark cons(0(), zeros()), active s X -> s active X, active length X -> length active X, active length cons(N, L) -> mark U11(and(isNatList L, isNat N), L), active length nil() -> mark 0(), active U11(X1, X2) -> U11(active X1, X2), active U11(tt(), L) -> mark s length L, active and(X1, X2) -> and(active X1, X2), active and(tt(), X) -> mark X, active isNat 0() -> mark tt(), active isNat s V1 -> mark isNat V1, active isNat length V1 -> mark isNatList V1, active isNatList cons(V1, V2) -> mark and(isNat V1, isNatList V2), active isNatList nil() -> mark tt(), active isNatIList V -> mark isNatList V, active isNatIList cons(V1, V2) -> mark and(isNat V1, isNatIList V2), active isNatIList zeros() -> mark tt(), s mark X -> mark s X, s ok X -> ok s X, length mark X -> mark length X, length ok X -> ok length X, U11(mark X1, X2) -> mark U11(X1, X2), U11(ok X1, ok X2) -> ok U11(X1, X2), and(mark X1, X2) -> mark and(X1, X2), and(ok X1, ok X2) -> ok and(X1, X2), isNat ok X -> ok isNat X, isNatList ok X -> ok isNatList X, isNatIList ok X -> ok isNatIList X, proper cons(X1, X2) -> cons(proper X1, proper X2), proper 0() -> ok 0(), proper zeros() -> ok zeros(), proper s X -> s proper X, proper length X -> length proper X, proper U11(X1, X2) -> U11(proper X1, proper X2), proper tt() -> ok tt(), proper and(X1, X2) -> and(proper X1, proper X2), proper isNat X -> isNat proper X, proper isNatList X -> isNatList proper X, proper isNatIList X -> isNatIList proper X, proper nil() -> ok nil(), top mark X -> top proper X, top ok X -> top active X} Open SCC (2): Strict: {length# mark X -> length# X, length# ok X -> length# X} Weak: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), active cons(X1, X2) -> cons(active X1, X2), active zeros() -> mark cons(0(), zeros()), active s X -> s active X, active length X -> length active X, active length cons(N, L) -> mark U11(and(isNatList L, isNat N), L), active length nil() -> mark 0(), active U11(X1, X2) -> U11(active X1, X2), active U11(tt(), L) -> mark s length L, active and(X1, X2) -> and(active X1, X2), active and(tt(), X) -> mark X, active isNat 0() -> mark tt(), active isNat s V1 -> mark isNat V1, active isNat length V1 -> mark isNatList V1, active isNatList cons(V1, V2) -> mark and(isNat V1, isNatList V2), active isNatList nil() -> mark tt(), active isNatIList V -> mark isNatList V, active isNatIList cons(V1, V2) -> mark and(isNat V1, isNatIList V2), active isNatIList zeros() -> mark tt(), s mark X -> mark s X, s ok X -> ok s X, length mark X -> mark length X, length ok X -> ok length X, U11(mark X1, X2) -> mark U11(X1, X2), U11(ok X1, ok X2) -> ok U11(X1, X2), and(mark X1, X2) -> mark and(X1, X2), and(ok X1, ok X2) -> ok and(X1, X2), isNat ok X -> ok isNat X, isNatList ok X -> ok isNatList X, isNatIList ok X -> ok isNatIList X, proper cons(X1, X2) -> cons(proper X1, proper X2), proper 0() -> ok 0(), proper zeros() -> ok zeros(), proper s X -> s proper X, proper length X -> length proper X, proper U11(X1, X2) -> U11(proper X1, proper X2), proper tt() -> ok tt(), proper and(X1, X2) -> and(proper X1, proper X2), proper isNat X -> isNat proper X, proper isNatList X -> isNatList proper X, proper isNatIList X -> isNatIList proper X, proper nil() -> ok nil(), top mark X -> top proper X, top ok X -> top active X} Open SCC (2): Strict: {s# mark X -> s# X, s# ok X -> s# X} Weak: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), active cons(X1, X2) -> cons(active X1, X2), active zeros() -> mark cons(0(), zeros()), active s X -> s active X, active length X -> length active X, active length cons(N, L) -> mark U11(and(isNatList L, isNat N), L), active length nil() -> mark 0(), active U11(X1, X2) -> U11(active X1, X2), active U11(tt(), L) -> mark s length L, active and(X1, X2) -> and(active X1, X2), active and(tt(), X) -> mark X, active isNat 0() -> mark tt(), active isNat s V1 -> mark isNat V1, active isNat length V1 -> mark isNatList V1, active isNatList cons(V1, V2) -> mark and(isNat V1, isNatList V2), active isNatList nil() -> mark tt(), active isNatIList V -> mark isNatList V, active isNatIList cons(V1, V2) -> mark and(isNat V1, isNatIList V2), active isNatIList zeros() -> mark tt(), s mark X -> mark s X, s ok X -> ok s X, length mark X -> mark length X, length ok X -> ok length X, U11(mark X1, X2) -> mark U11(X1, X2), U11(ok X1, ok X2) -> ok U11(X1, X2), and(mark X1, X2) -> mark and(X1, X2), and(ok X1, ok X2) -> ok and(X1, X2), isNat ok X -> ok isNat X, isNatList ok X -> ok isNatList X, isNatIList ok X -> ok isNatIList X, proper cons(X1, X2) -> cons(proper X1, proper X2), proper 0() -> ok 0(), proper zeros() -> ok zeros(), proper s X -> s proper X, proper length X -> length proper X, proper U11(X1, X2) -> U11(proper X1, proper X2), proper tt() -> ok tt(), proper and(X1, X2) -> and(proper X1, proper X2), proper isNat X -> isNat proper X, proper isNatList X -> isNatList proper X, proper isNatIList X -> isNatIList proper X, proper nil() -> ok nil(), top mark X -> top proper X, top ok X -> top active X} Open SCC (2): Strict: { U11#(mark X1, X2) -> U11#(X1, X2), U11#(ok X1, ok X2) -> U11#(X1, X2)} Weak: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), active cons(X1, X2) -> cons(active X1, X2), active zeros() -> mark cons(0(), zeros()), active s X -> s active X, active length X -> length active X, active length cons(N, L) -> mark U11(and(isNatList L, isNat N), L), active length nil() -> mark 0(), active U11(X1, X2) -> U11(active X1, X2), active U11(tt(), L) -> mark s length L, active and(X1, X2) -> and(active X1, X2), active and(tt(), X) -> mark X, active isNat 0() -> mark tt(), active isNat s V1 -> mark isNat V1, active isNat length V1 -> mark isNatList V1, active isNatList cons(V1, V2) -> mark and(isNat V1, isNatList V2), active isNatList nil() -> mark tt(), active isNatIList V -> mark isNatList V, active isNatIList cons(V1, V2) -> mark and(isNat V1, isNatIList V2), active isNatIList zeros() -> mark tt(), s mark X -> mark s X, s ok X -> ok s X, length mark X -> mark length X, length ok X -> ok length X, U11(mark X1, X2) -> mark U11(X1, X2), U11(ok X1, ok X2) -> ok U11(X1, X2), and(mark X1, X2) -> mark and(X1, X2), and(ok X1, ok X2) -> ok and(X1, X2), isNat ok X -> ok isNat X, isNatList ok X -> ok isNatList X, isNatIList ok X -> ok isNatIList X, proper cons(X1, X2) -> cons(proper X1, proper X2), proper 0() -> ok 0(), proper zeros() -> ok zeros(), proper s X -> s proper X, proper length X -> length proper X, proper U11(X1, X2) -> U11(proper X1, proper X2), proper tt() -> ok tt(), proper and(X1, X2) -> and(proper X1, proper X2), proper isNat X -> isNat proper X, proper isNatList X -> isNatList proper X, proper isNatIList X -> isNatIList proper X, proper nil() -> ok nil(), top mark X -> top proper X, top ok X -> top active X} Open SCC (2): Strict: { cons#(mark X1, X2) -> cons#(X1, X2), cons#(ok X1, ok X2) -> cons#(X1, X2)} Weak: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), active cons(X1, X2) -> cons(active X1, X2), active zeros() -> mark cons(0(), zeros()), active s X -> s active X, active length X -> length active X, active length cons(N, L) -> mark U11(and(isNatList L, isNat N), L), active length nil() -> mark 0(), active U11(X1, X2) -> U11(active X1, X2), active U11(tt(), L) -> mark s length L, active and(X1, X2) -> and(active X1, X2), active and(tt(), X) -> mark X, active isNat 0() -> mark tt(), active isNat s V1 -> mark isNat V1, active isNat length V1 -> mark isNatList V1, active isNatList cons(V1, V2) -> mark and(isNat V1, isNatList V2), active isNatList nil() -> mark tt(), active isNatIList V -> mark isNatList V, active isNatIList cons(V1, V2) -> mark and(isNat V1, isNatIList V2), active isNatIList zeros() -> mark tt(), s mark X -> mark s X, s ok X -> ok s X, length mark X -> mark length X, length ok X -> ok length X, U11(mark X1, X2) -> mark U11(X1, X2), U11(ok X1, ok X2) -> ok U11(X1, X2), and(mark X1, X2) -> mark and(X1, X2), and(ok X1, ok X2) -> ok and(X1, X2), isNat ok X -> ok isNat X, isNatList ok X -> ok isNatList X, isNatIList ok X -> ok isNatIList X, proper cons(X1, X2) -> cons(proper X1, proper X2), proper 0() -> ok 0(), proper zeros() -> ok zeros(), proper s X -> s proper X, proper length X -> length proper X, proper U11(X1, X2) -> U11(proper X1, proper X2), proper tt() -> ok tt(), proper and(X1, X2) -> and(proper X1, proper X2), proper isNat X -> isNat proper X, proper isNatList X -> isNatList proper X, proper isNatIList X -> isNatIList proper X, proper nil() -> ok nil(), top mark X -> top proper X, top ok X -> top active X} Open SCC (2): Strict: { and#(mark X1, X2) -> and#(X1, X2), and#(ok X1, ok X2) -> and#(X1, X2)} Weak: { cons(mark X1, X2) -> mark cons(X1, X2), cons(ok X1, ok X2) -> ok cons(X1, X2), active cons(X1, X2) -> cons(active X1, X2), active zeros() -> mark cons(0(), zeros()), active s X -> s active X, active length X -> length active X, active length cons(N, L) -> mark U11(and(isNatList L, isNat N), L), active length nil() -> mark 0(), active U11(X1, X2) -> U11(active X1, X2), active U11(tt(), L) -> mark s length L, active and(X1, X2) -> and(active X1, X2), active and(tt(), X) -> mark X, active isNat 0() -> mark tt(), active isNat s V1 -> mark isNat V1, active isNat length V1 -> mark isNatList V1, active isNatList cons(V1, V2) -> mark and(isNat V1, isNatList V2), active isNatList nil() -> mark tt(), active isNatIList V -> mark isNatList V, active isNatIList cons(V1, V2) -> mark and(isNat V1, isNatIList V2), active isNatIList zeros() -> mark tt(), s mark X -> mark s X, s ok X -> ok s X, length mark X -> mark length X, length ok X -> ok length X, U11(mark X1, X2) -> mark U11(X1, X2), U11(ok X1, ok X2) -> ok U11(X1, X2), and(mark X1, X2) -> mark and(X1, X2), and(ok X1, ok X2) -> ok and(X1, X2), isNat ok X -> ok isNat X, isNatList ok X -> ok isNatList X, isNatIList ok X -> ok isNatIList X, proper cons(X1, X2) -> cons(proper X1, proper X2), proper 0() -> ok 0(), proper zeros() -> ok zeros(), proper s X -> s proper X, proper length X -> length proper X, proper U11(X1, X2) -> U11(proper X1, proper X2), proper tt() -> ok tt(), proper and(X1, X2) -> and(proper X1, proper X2), proper isNat X -> isNat proper X, proper isNatList X -> isNatList proper X, proper isNatIList X -> isNatIList proper X, proper nil() -> ok nil(), top mark X -> top proper X, top ok X -> top active X} Open