MAYBE
62.58/17.49	MAYBE
62.58/17.49	
62.58/17.49	Problem:
62.58/17.49	 __(__(X,Y),Z) -> __(X,__(Y,Z))
62.58/17.49	 __(X,nil()) -> X
62.58/17.49	 __(nil(),X) -> X
62.58/17.49	 and(tt(),X) -> activate(X)
62.58/17.49	 isList(V) -> isNeList(activate(V))
62.58/17.49	 isList(n__nil()) -> tt()
62.58/17.49	 isList(n____(V1,V2)) -> and(isList(activate(V1)),n__isList(activate(V2)))
62.58/17.49	 isNeList(V) -> isQid(activate(V))
62.58/17.49	 isNeList(n____(V1,V2)) -> and(isList(activate(V1)),n__isNeList(activate(V2)))
62.58/17.49	 isNeList(n____(V1,V2)) -> and(isNeList(activate(V1)),n__isList(activate(V2)))
62.58/17.49	 isNePal(V) -> isQid(activate(V))
62.58/17.49	 isNePal(n____(I,n____(P,I))) -> and(isQid(activate(I)),n__isPal(activate(P)))
62.58/17.49	 isPal(V) -> isNePal(activate(V))
62.58/17.49	 isPal(n__nil()) -> tt()
62.58/17.49	 isQid(n__a()) -> tt()
62.58/17.49	 isQid(n__e()) -> tt()
62.58/17.49	 isQid(n__i()) -> tt()
62.58/17.49	 isQid(n__o()) -> tt()
62.58/17.49	 isQid(n__u()) -> tt()
62.58/17.49	 nil() -> n__nil()
62.58/17.49	 __(X1,X2) -> n____(X1,X2)
62.58/17.49	 isList(X) -> n__isList(X)
62.58/17.49	 isNeList(X) -> n__isNeList(X)
62.58/17.49	 isPal(X) -> n__isPal(X)
62.58/17.49	 a() -> n__a()
62.58/17.49	 e() -> n__e()
62.58/17.49	 i() -> n__i()
62.58/17.49	 o() -> n__o()
62.58/17.49	 u() -> n__u()
62.58/17.49	 activate(n__nil()) -> nil()
62.58/17.49	 activate(n____(X1,X2)) -> __(activate(X1),activate(X2))
62.58/17.49	 activate(n__isList(X)) -> isList(X)
62.58/17.49	 activate(n__isNeList(X)) -> isNeList(X)
62.58/17.49	 activate(n__isPal(X)) -> isPal(X)
62.58/17.49	 activate(n__a()) -> a()
62.58/17.49	 activate(n__e()) -> e()
62.58/17.49	 activate(n__i()) -> i()
62.58/17.49	 activate(n__o()) -> o()
62.58/17.49	 activate(n__u()) -> u()
62.58/17.49	 activate(X) -> X
62.58/17.49	
62.58/17.49	Proof:
62.58/17.49	 Open
62.58/17.50	EOF