MAYBE
0.09/0.18	MAYBE
0.09/0.19	
0.09/0.19	Problem:
0.09/0.19	 U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2))
0.09/0.19	 U12(tt(),V2) -> U13(isNat(activate(V2)))
0.09/0.19	 U13(tt()) -> tt()
0.09/0.19	 U21(tt(),V1) -> U22(isNat(activate(V1)))
0.09/0.19	 U22(tt()) -> tt()
0.09/0.19	 U31(tt(),N) -> activate(N)
0.09/0.19	 U41(tt(),M,N) -> s(plus(activate(N),activate(M)))
0.09/0.19	 and(tt(),X) -> activate(X)
0.09/0.19	 isNat(n__0()) -> tt()
0.09/0.19	 isNat(n__plus(V1,V2)) ->
0.09/0.19	 U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2))
0.09/0.19	 isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1))
0.09/0.19	 isNatKind(n__0()) -> tt()
0.09/0.19	 isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2)))
0.09/0.19	 isNatKind(n__s(V1)) -> isNatKind(activate(V1))
0.09/0.19	 plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N)
0.09/0.19	 plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N)
0.09/0.19	 0() -> n__0()
0.09/0.19	 plus(X1,X2) -> n__plus(X1,X2)
0.09/0.19	 isNatKind(X) -> n__isNatKind(X)
0.09/0.19	 s(X) -> n__s(X)
0.09/0.19	 and(X1,X2) -> n__and(X1,X2)
0.09/0.19	 activate(n__0()) -> 0()
0.09/0.19	 activate(n__plus(X1,X2)) -> plus(X1,X2)
0.09/0.19	 activate(n__isNatKind(X)) -> isNatKind(X)
0.09/0.19	 activate(n__s(X)) -> s(X)
0.09/0.19	 activate(n__and(X1,X2)) -> and(X1,X2)
0.09/0.19	 activate(X) -> X
0.09/0.19	
0.09/0.19	Proof:
0.09/0.19	 Open
0.09/0.19	EOF