MAYBE 1080.90/297.04 MAYBE 1080.90/297.04 1080.90/297.04 We are left with following problem, upon which TcT provides the 1080.90/297.04 certificate MAYBE. 1080.90/297.04 1080.90/297.04 Strict Trs: 1080.90/297.04 { __(X1, X2) -> n____(X1, X2) 1080.90/297.04 , __(X, nil()) -> X 1080.90/297.04 , __(__(X, Y), Z) -> __(X, __(Y, Z)) 1080.90/297.04 , __(nil(), X) -> X 1080.90/297.04 , nil() -> n__nil() 1080.90/297.04 , U11(tt(), V) -> U12(isNeList(activate(V))) 1080.90/297.04 , U12(tt()) -> tt() 1080.90/297.04 , isNeList(V) -> U31(isPalListKind(activate(V)), activate(V)) 1080.90/297.04 , isNeList(n____(V1, V2)) -> 1080.90/297.04 U41(and(isPalListKind(activate(V1)), 1080.90/297.04 n__isPalListKind(activate(V2))), 1080.90/297.04 activate(V1), 1080.90/297.04 activate(V2)) 1080.90/297.04 , isNeList(n____(V1, V2)) -> 1080.90/297.04 U51(and(isPalListKind(activate(V1)), 1080.90/297.04 n__isPalListKind(activate(V2))), 1080.90/297.04 activate(V1), 1080.90/297.04 activate(V2)) 1080.90/297.04 , activate(X) -> X 1080.90/297.04 , activate(n__nil()) -> nil() 1080.90/297.04 , activate(n____(X1, X2)) -> __(activate(X1), activate(X2)) 1080.90/297.04 , activate(n__isPalListKind(X)) -> isPalListKind(X) 1080.90/297.04 , activate(n__and(X1, X2)) -> and(activate(X1), X2) 1080.90/297.04 , activate(n__isPal(X)) -> isPal(X) 1080.90/297.04 , activate(n__a()) -> a() 1080.90/297.04 , activate(n__e()) -> e() 1080.90/297.04 , activate(n__i()) -> i() 1080.90/297.04 , activate(n__o()) -> o() 1080.90/297.04 , activate(n__u()) -> u() 1080.90/297.04 , U21(tt(), V1, V2) -> U22(isList(activate(V1)), activate(V2)) 1080.90/297.04 , U22(tt(), V2) -> U23(isList(activate(V2))) 1080.90/297.04 , isList(V) -> U11(isPalListKind(activate(V)), activate(V)) 1080.90/297.04 , isList(n__nil()) -> tt() 1080.90/297.04 , isList(n____(V1, V2)) -> 1080.90/297.04 U21(and(isPalListKind(activate(V1)), 1080.90/297.04 n__isPalListKind(activate(V2))), 1080.90/297.04 activate(V1), 1080.90/297.04 activate(V2)) 1080.90/297.04 , U23(tt()) -> tt() 1080.90/297.04 , U31(tt(), V) -> U32(isQid(activate(V))) 1080.90/297.04 , U32(tt()) -> tt() 1080.90/297.04 , isQid(n__a()) -> tt() 1080.90/297.04 , isQid(n__e()) -> tt() 1080.90/297.04 , isQid(n__i()) -> tt() 1080.90/297.04 , isQid(n__o()) -> tt() 1080.90/297.04 , isQid(n__u()) -> tt() 1080.90/297.04 , U41(tt(), V1, V2) -> U42(isList(activate(V1)), activate(V2)) 1080.90/297.04 , U42(tt(), V2) -> U43(isNeList(activate(V2))) 1080.90/297.04 , U43(tt()) -> tt() 1080.90/297.04 , U51(tt(), V1, V2) -> U52(isNeList(activate(V1)), activate(V2)) 1080.90/297.04 , U52(tt(), V2) -> U53(isList(activate(V2))) 1080.90/297.04 , U53(tt()) -> tt() 1080.90/297.04 , U61(tt(), V) -> U62(isQid(activate(V))) 1080.90/297.04 , U62(tt()) -> tt() 1080.90/297.04 , U71(tt(), V) -> U72(isNePal(activate(V))) 1080.90/297.04 , U72(tt()) -> tt() 1080.90/297.04 , isNePal(V) -> U61(isPalListKind(activate(V)), activate(V)) 1080.90/297.04 , isNePal(n____(I, n____(P, I))) -> 1080.90/297.04 and(and(isQid(activate(I)), n__isPalListKind(activate(I))), 1080.90/297.04 n__and(n__isPal(activate(P)), n__isPalListKind(activate(P)))) 1080.90/297.04 , and(X1, X2) -> n__and(X1, X2) 1080.90/297.04 , and(tt(), X) -> activate(X) 1080.90/297.04 , isPalListKind(X) -> n__isPalListKind(X) 1080.90/297.04 , isPalListKind(n__nil()) -> tt() 1080.90/297.04 , isPalListKind(n____(V1, V2)) -> 1080.90/297.04 and(isPalListKind(activate(V1)), n__isPalListKind(activate(V2))) 1080.90/297.04 , isPalListKind(n__a()) -> tt() 1080.90/297.04 , isPalListKind(n__e()) -> tt() 1080.90/297.04 , isPalListKind(n__i()) -> tt() 1080.90/297.04 , isPalListKind(n__o()) -> tt() 1080.90/297.04 , isPalListKind(n__u()) -> tt() 1080.90/297.04 , isPal(V) -> U71(isPalListKind(activate(V)), activate(V)) 1080.90/297.04 , isPal(X) -> n__isPal(X) 1080.90/297.04 , isPal(n__nil()) -> tt() 1080.90/297.04 , a() -> n__a() 1080.90/297.04 , e() -> n__e() 1080.90/297.04 , i() -> n__i() 1080.90/297.04 , o() -> n__o() 1080.90/297.04 , u() -> n__u() } 1080.90/297.04 Obligation: 1080.90/297.04 innermost runtime complexity 1080.90/297.04 Answer: 1080.90/297.04 MAYBE 1080.90/297.04 1080.90/297.04 Arguments of following rules are not normal-forms: 1080.90/297.04 1080.90/297.04 { __(X, nil()) -> X 1080.90/297.04 , __(__(X, Y), Z) -> __(X, __(Y, Z)) 1080.90/297.04 , __(nil(), X) -> X } 1080.90/297.04 1080.90/297.04 All above mentioned rules can be savely removed. 1080.90/297.04 1080.90/297.04 We are left with following problem, upon which TcT provides the 1080.90/297.04 certificate MAYBE. 1080.90/297.04 1080.90/297.04 Strict Trs: 1080.90/297.04 { __(X1, X2) -> n____(X1, X2) 1080.90/297.04 , nil() -> n__nil() 1080.90/297.04 , U11(tt(), V) -> U12(isNeList(activate(V))) 1080.90/297.04 , U12(tt()) -> tt() 1080.90/297.04 , isNeList(V) -> U31(isPalListKind(activate(V)), activate(V)) 1080.90/297.04 , isNeList(n____(V1, V2)) -> 1080.90/297.04 U41(and(isPalListKind(activate(V1)), 1080.90/297.04 n__isPalListKind(activate(V2))), 1080.90/297.04 activate(V1), 1080.90/297.04 activate(V2)) 1080.90/297.04 , isNeList(n____(V1, V2)) -> 1080.90/297.04 U51(and(isPalListKind(activate(V1)), 1080.90/297.04 n__isPalListKind(activate(V2))), 1080.90/297.04 activate(V1), 1080.90/297.04 activate(V2)) 1080.90/297.04 , activate(X) -> X 1080.90/297.04 , activate(n__nil()) -> nil() 1080.90/297.04 , activate(n____(X1, X2)) -> __(activate(X1), activate(X2)) 1080.90/297.04 , activate(n__isPalListKind(X)) -> isPalListKind(X) 1080.90/297.04 , activate(n__and(X1, X2)) -> and(activate(X1), X2) 1080.90/297.04 , activate(n__isPal(X)) -> isPal(X) 1080.90/297.04 , activate(n__a()) -> a() 1080.90/297.04 , activate(n__e()) -> e() 1080.90/297.04 , activate(n__i()) -> i() 1080.90/297.04 , activate(n__o()) -> o() 1080.90/297.04 , activate(n__u()) -> u() 1080.90/297.04 , U21(tt(), V1, V2) -> U22(isList(activate(V1)), activate(V2)) 1080.90/297.04 , U22(tt(), V2) -> U23(isList(activate(V2))) 1080.90/297.04 , isList(V) -> U11(isPalListKind(activate(V)), activate(V)) 1080.90/297.04 , isList(n__nil()) -> tt() 1080.90/297.04 , isList(n____(V1, V2)) -> 1080.90/297.04 U21(and(isPalListKind(activate(V1)), 1080.90/297.04 n__isPalListKind(activate(V2))), 1080.90/297.04 activate(V1), 1080.90/297.04 activate(V2)) 1080.90/297.04 , U23(tt()) -> tt() 1080.90/297.04 , U31(tt(), V) -> U32(isQid(activate(V))) 1080.90/297.04 , U32(tt()) -> tt() 1080.90/297.04 , isQid(n__a()) -> tt() 1080.90/297.04 , isQid(n__e()) -> tt() 1080.90/297.04 , isQid(n__i()) -> tt() 1080.90/297.04 , isQid(n__o()) -> tt() 1080.90/297.04 , isQid(n__u()) -> tt() 1080.90/297.04 , U41(tt(), V1, V2) -> U42(isList(activate(V1)), activate(V2)) 1080.90/297.04 , U42(tt(), V2) -> U43(isNeList(activate(V2))) 1080.90/297.04 , U43(tt()) -> tt() 1080.90/297.04 , U51(tt(), V1, V2) -> U52(isNeList(activate(V1)), activate(V2)) 1080.90/297.04 , U52(tt(), V2) -> U53(isList(activate(V2))) 1080.90/297.04 , U53(tt()) -> tt() 1080.90/297.04 , U61(tt(), V) -> U62(isQid(activate(V))) 1080.90/297.04 , U62(tt()) -> tt() 1080.90/297.04 , U71(tt(), V) -> U72(isNePal(activate(V))) 1080.90/297.04 , U72(tt()) -> tt() 1080.90/297.04 , isNePal(V) -> U61(isPalListKind(activate(V)), activate(V)) 1080.90/297.04 , isNePal(n____(I, n____(P, I))) -> 1080.90/297.04 and(and(isQid(activate(I)), n__isPalListKind(activate(I))), 1080.90/297.04 n__and(n__isPal(activate(P)), n__isPalListKind(activate(P)))) 1080.90/297.04 , and(X1, X2) -> n__and(X1, X2) 1080.90/297.04 , and(tt(), X) -> activate(X) 1080.90/297.04 , isPalListKind(X) -> n__isPalListKind(X) 1080.90/297.04 , isPalListKind(n__nil()) -> tt() 1080.90/297.04 , isPalListKind(n____(V1, V2)) -> 1080.90/297.04 and(isPalListKind(activate(V1)), n__isPalListKind(activate(V2))) 1080.90/297.04 , isPalListKind(n__a()) -> tt() 1080.90/297.04 , isPalListKind(n__e()) -> tt() 1080.90/297.04 , isPalListKind(n__i()) -> tt() 1080.90/297.04 , isPalListKind(n__o()) -> tt() 1080.90/297.04 , isPalListKind(n__u()) -> tt() 1080.90/297.04 , isPal(V) -> U71(isPalListKind(activate(V)), activate(V)) 1080.90/297.04 , isPal(X) -> n__isPal(X) 1080.90/297.04 , isPal(n__nil()) -> tt() 1080.90/297.04 , a() -> n__a() 1080.90/297.04 , e() -> n__e() 1080.90/297.04 , i() -> n__i() 1080.90/297.04 , o() -> n__o() 1080.90/297.04 , u() -> n__u() } 1080.90/297.04 Obligation: 1080.90/297.04 innermost runtime complexity 1080.90/297.04 Answer: 1080.90/297.04 MAYBE 1080.90/297.04 1080.90/297.04 None of the processors succeeded. 1080.90/297.04 1080.90/297.04 Details of failed attempt(s): 1080.90/297.04 ----------------------------- 1080.90/297.04 1) 'empty' failed due to the following reason: 1080.90/297.04 1080.90/297.04 Empty strict component of the problem is NOT empty. 1080.90/297.04 1080.90/297.04 2) 'Best' failed due to the following reason: 1080.90/297.04 1080.90/297.04 None of the processors succeeded. 1080.90/297.04 1080.90/297.04 Details of failed attempt(s): 1080.90/297.04 ----------------------------- 1080.90/297.04 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 1080.90/297.04 following reason: 1080.90/297.04 1080.90/297.04 Computation stopped due to timeout after 297.0 seconds. 1080.90/297.04 1080.90/297.04 2) 'Best' failed due to the following reason: 1080.90/297.04 1080.90/297.04 None of the processors succeeded. 1080.90/297.04 1080.90/297.04 Details of failed attempt(s): 1080.90/297.04 ----------------------------- 1080.90/297.04 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 1080.90/297.04 seconds)' failed due to the following reason: 1080.90/297.04 1080.90/297.04 Computation stopped due to timeout after 148.0 seconds. 1080.90/297.04 1080.90/297.04 2) 'Best' failed due to the following reason: 1080.90/297.04 1080.90/297.04 None of the processors succeeded. 1080.90/297.04 1080.90/297.04 Details of failed attempt(s): 1080.90/297.04 ----------------------------- 1080.90/297.04 1) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 1080.90/297.04 to the following reason: 1080.90/297.04 1080.90/297.04 The input cannot be shown compatible 1080.90/297.04 1080.90/297.04 2) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 1080.90/297.04 following reason: 1080.90/297.04 1080.90/297.04 The input cannot be shown compatible 1080.90/297.04 1080.90/297.04 1080.90/297.04 3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 1080.90/297.04 failed due to the following reason: 1080.90/297.04 1080.90/297.04 None of the processors succeeded. 1080.90/297.04 1080.90/297.04 Details of failed attempt(s): 1080.90/297.04 ----------------------------- 1080.90/297.04 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 1080.90/297.04 failed due to the following reason: 1080.90/297.04 1080.90/297.04 match-boundness of the problem could not be verified. 1080.90/297.04 1080.90/297.04 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 1080.90/297.04 failed due to the following reason: 1080.90/297.04 1080.90/297.04 match-boundness of the problem could not be verified. 1080.90/297.04 1080.90/297.04 1080.90/297.04 1080.90/297.04 1080.90/297.04 1080.90/297.04 Arrrr.. 1081.20/297.22 EOF