MAYBE 0.18/0.20 MAYBE 0.18/0.20 0.18/0.20 Problem: 0.18/0.20 zeros() -> cons(0(),n__zeros()) 0.18/0.20 U11(tt(),V1) -> U12(isNatList(activate(V1))) 0.18/0.20 U12(tt()) -> tt() 0.18/0.20 U21(tt(),V1) -> U22(isNat(activate(V1))) 0.18/0.20 U22(tt()) -> tt() 0.18/0.20 U31(tt(),V) -> U32(isNatList(activate(V))) 0.18/0.20 U32(tt()) -> tt() 0.18/0.20 U41(tt(),V1,V2) -> U42(isNat(activate(V1)),activate(V2)) 0.18/0.20 U42(tt(),V2) -> U43(isNatIList(activate(V2))) 0.18/0.20 U43(tt()) -> tt() 0.18/0.20 U51(tt(),V1,V2) -> U52(isNat(activate(V1)),activate(V2)) 0.18/0.20 U52(tt(),V2) -> U53(isNatList(activate(V2))) 0.18/0.20 U53(tt()) -> tt() 0.18/0.20 U61(tt(),L) -> s(length(activate(L))) 0.18/0.20 and(tt(),X) -> activate(X) 0.18/0.20 isNat(n__0()) -> tt() 0.18/0.20 isNat(n__length(V1)) -> U11(isNatIListKind(activate(V1)),activate(V1)) 0.18/0.20 isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) 0.18/0.20 isNatIList(V) -> U31(isNatIListKind(activate(V)),activate(V)) 0.18/0.20 isNatIList(n__zeros()) -> tt() 0.18/0.20 isNatIList(n__cons(V1,V2)) -> 0.18/0.20 U41(and(isNatKind(activate(V1)),n__isNatIListKind(activate(V2))),activate(V1),activate(V2)) 0.18/0.20 isNatIListKind(n__nil()) -> tt() 0.18/0.20 isNatIListKind(n__zeros()) -> tt() 0.18/0.20 isNatIListKind(n__cons(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatIListKind(activate(V2))) 0.18/0.20 isNatKind(n__0()) -> tt() 0.18/0.20 isNatKind(n__length(V1)) -> isNatIListKind(activate(V1)) 0.18/0.20 isNatKind(n__s(V1)) -> isNatKind(activate(V1)) 0.18/0.20 isNatList(n__nil()) -> tt() 0.18/0.20 isNatList(n__cons(V1,V2)) -> 0.18/0.20 U51(and(isNatKind(activate(V1)),n__isNatIListKind(activate(V2))),activate(V1),activate(V2)) 0.18/0.20 length(nil()) -> 0() 0.18/0.20 length(cons(N,L)) -> 0.18/0.20 U61(and(and(isNatList(activate(L)),n__isNatIListKind(activate(L))),n__and 0.18/0.20 ( 0.18/0.20 n__isNat(N),n__isNatKind(N))), 0.18/0.20 activate(L)) 0.18/0.20 zeros() -> n__zeros() 0.18/0.20 0() -> n__0() 0.18/0.20 length(X) -> n__length(X) 0.18/0.20 s(X) -> n__s(X) 0.18/0.20 cons(X1,X2) -> n__cons(X1,X2) 0.18/0.20 isNatIListKind(X) -> n__isNatIListKind(X) 0.18/0.20 nil() -> n__nil() 0.18/0.20 and(X1,X2) -> n__and(X1,X2) 0.18/0.20 isNat(X) -> n__isNat(X) 0.18/0.20 isNatKind(X) -> n__isNatKind(X) 0.18/0.20 activate(n__zeros()) -> zeros() 0.18/0.20 activate(n__0()) -> 0() 0.18/0.20 activate(n__length(X)) -> length(activate(X)) 0.18/0.20 activate(n__s(X)) -> s(activate(X)) 0.18/0.20 activate(n__cons(X1,X2)) -> cons(activate(X1),X2) 0.18/0.20 activate(n__isNatIListKind(X)) -> isNatIListKind(X) 0.18/0.20 activate(n__nil()) -> nil() 0.18/0.20 activate(n__and(X1,X2)) -> and(activate(X1),X2) 0.18/0.20 activate(n__isNat(X)) -> isNat(X) 0.18/0.20 activate(n__isNatKind(X)) -> isNatKind(X) 0.18/0.20 activate(X) -> X 0.18/0.20 0.18/0.20 Proof: 0.18/0.20 Open 0.18/0.21 EOF