MAYBE 1024.38/297.06 MAYBE 1024.38/297.06 1024.38/297.06 We are left with following problem, upon which TcT provides the 1024.38/297.06 certificate MAYBE. 1024.38/297.06 1024.38/297.06 Strict Trs: 1024.38/297.06 { a____(X1, X2) -> __(X1, X2) 1024.38/297.06 , a____(X, nil()) -> mark(X) 1024.38/297.06 , a____(__(X, Y), Z) -> a____(mark(X), a____(mark(Y), mark(Z))) 1024.38/297.06 , a____(nil(), X) -> mark(X) 1024.38/297.06 , mark(__(X1, X2)) -> a____(mark(X1), mark(X2)) 1024.38/297.06 , mark(nil()) -> nil() 1024.38/297.06 , mark(tt()) -> tt() 1024.38/297.06 , mark(isPalListKind(X)) -> a__isPalListKind(X) 1024.38/297.06 , mark(and(X1, X2)) -> a__and(mark(X1), X2) 1024.38/297.06 , mark(isPal(X)) -> a__isPal(X) 1024.38/297.06 , mark(a()) -> a() 1024.38/297.06 , mark(e()) -> e() 1024.38/297.06 , mark(i()) -> i() 1024.38/297.06 , mark(o()) -> o() 1024.38/297.06 , mark(u()) -> u() 1024.38/297.06 , mark(U11(X1, X2)) -> a__U11(mark(X1), X2) 1024.38/297.06 , mark(U12(X)) -> a__U12(mark(X)) 1024.38/297.06 , mark(isNeList(X)) -> a__isNeList(X) 1024.38/297.06 , mark(U21(X1, X2, X3)) -> a__U21(mark(X1), X2, X3) 1024.38/297.06 , mark(U22(X1, X2)) -> a__U22(mark(X1), X2) 1024.38/297.06 , mark(isList(X)) -> a__isList(X) 1024.38/297.06 , mark(U23(X)) -> a__U23(mark(X)) 1024.38/297.06 , mark(U31(X1, X2)) -> a__U31(mark(X1), X2) 1024.38/297.06 , mark(U32(X)) -> a__U32(mark(X)) 1024.38/297.06 , mark(isQid(X)) -> a__isQid(X) 1024.38/297.06 , mark(U41(X1, X2, X3)) -> a__U41(mark(X1), X2, X3) 1024.38/297.06 , mark(U42(X1, X2)) -> a__U42(mark(X1), X2) 1024.38/297.06 , mark(U43(X)) -> a__U43(mark(X)) 1024.38/297.06 , mark(U51(X1, X2, X3)) -> a__U51(mark(X1), X2, X3) 1024.38/297.06 , mark(U52(X1, X2)) -> a__U52(mark(X1), X2) 1024.38/297.06 , mark(U53(X)) -> a__U53(mark(X)) 1024.38/297.06 , mark(U61(X1, X2)) -> a__U61(mark(X1), X2) 1024.38/297.06 , mark(U62(X)) -> a__U62(mark(X)) 1024.38/297.06 , mark(U71(X1, X2)) -> a__U71(mark(X1), X2) 1024.38/297.06 , mark(U72(X)) -> a__U72(mark(X)) 1024.38/297.06 , mark(isNePal(X)) -> a__isNePal(X) 1024.38/297.06 , a__U11(X1, X2) -> U11(X1, X2) 1024.38/297.06 , a__U11(tt(), V) -> a__U12(a__isNeList(V)) 1024.38/297.06 , a__U12(X) -> U12(X) 1024.38/297.06 , a__U12(tt()) -> tt() 1024.38/297.06 , a__isNeList(V) -> a__U31(a__isPalListKind(V), V) 1024.38/297.06 , a__isNeList(X) -> isNeList(X) 1024.38/297.06 , a__isNeList(__(V1, V2)) -> 1024.38/297.06 a__U41(a__and(a__isPalListKind(V1), isPalListKind(V2)), V1, V2) 1024.38/297.06 , a__isNeList(__(V1, V2)) -> 1024.38/297.06 a__U51(a__and(a__isPalListKind(V1), isPalListKind(V2)), V1, V2) 1024.38/297.06 , a__U21(X1, X2, X3) -> U21(X1, X2, X3) 1024.38/297.06 , a__U21(tt(), V1, V2) -> a__U22(a__isList(V1), V2) 1024.38/297.06 , a__U22(X1, X2) -> U22(X1, X2) 1024.38/297.06 , a__U22(tt(), V2) -> a__U23(a__isList(V2)) 1024.38/297.06 , a__isList(V) -> a__U11(a__isPalListKind(V), V) 1024.38/297.06 , a__isList(X) -> isList(X) 1024.38/297.06 , a__isList(__(V1, V2)) -> 1024.38/297.06 a__U21(a__and(a__isPalListKind(V1), isPalListKind(V2)), V1, V2) 1024.38/297.06 , a__isList(nil()) -> tt() 1024.38/297.06 , a__U23(X) -> U23(X) 1024.38/297.06 , a__U23(tt()) -> tt() 1024.38/297.06 , a__U31(X1, X2) -> U31(X1, X2) 1024.38/297.06 , a__U31(tt(), V) -> a__U32(a__isQid(V)) 1024.38/297.06 , a__U32(X) -> U32(X) 1024.38/297.06 , a__U32(tt()) -> tt() 1024.38/297.06 , a__isQid(X) -> isQid(X) 1024.38/297.06 , a__isQid(a()) -> tt() 1024.38/297.06 , a__isQid(e()) -> tt() 1024.38/297.06 , a__isQid(i()) -> tt() 1024.38/297.06 , a__isQid(o()) -> tt() 1024.38/297.06 , a__isQid(u()) -> tt() 1024.38/297.06 , a__U41(X1, X2, X3) -> U41(X1, X2, X3) 1024.38/297.06 , a__U41(tt(), V1, V2) -> a__U42(a__isList(V1), V2) 1024.38/297.06 , a__U42(X1, X2) -> U42(X1, X2) 1024.38/297.06 , a__U42(tt(), V2) -> a__U43(a__isNeList(V2)) 1024.38/297.06 , a__U43(X) -> U43(X) 1024.38/297.06 , a__U43(tt()) -> tt() 1024.38/297.06 , a__U51(X1, X2, X3) -> U51(X1, X2, X3) 1024.38/297.06 , a__U51(tt(), V1, V2) -> a__U52(a__isNeList(V1), V2) 1024.38/297.06 , a__U52(X1, X2) -> U52(X1, X2) 1024.38/297.06 , a__U52(tt(), V2) -> a__U53(a__isList(V2)) 1024.38/297.06 , a__U53(X) -> U53(X) 1024.38/297.06 , a__U53(tt()) -> tt() 1024.38/297.06 , a__U61(X1, X2) -> U61(X1, X2) 1024.38/297.06 , a__U61(tt(), V) -> a__U62(a__isQid(V)) 1024.38/297.06 , a__U62(X) -> U62(X) 1024.38/297.06 , a__U62(tt()) -> tt() 1024.38/297.06 , a__U71(X1, X2) -> U71(X1, X2) 1024.38/297.06 , a__U71(tt(), V) -> a__U72(a__isNePal(V)) 1024.38/297.06 , a__U72(X) -> U72(X) 1024.38/297.06 , a__U72(tt()) -> tt() 1024.38/297.06 , a__isNePal(V) -> a__U61(a__isPalListKind(V), V) 1024.38/297.06 , a__isNePal(X) -> isNePal(X) 1024.38/297.06 , a__isNePal(__(I, __(P, I))) -> 1024.38/297.06 a__and(a__and(a__isQid(I), isPalListKind(I)), 1024.38/297.06 and(isPal(P), isPalListKind(P))) 1024.38/297.06 , a__and(X1, X2) -> and(X1, X2) 1024.38/297.06 , a__and(tt(), X) -> mark(X) 1024.38/297.06 , a__isPalListKind(X) -> isPalListKind(X) 1024.38/297.06 , a__isPalListKind(__(V1, V2)) -> 1024.38/297.06 a__and(a__isPalListKind(V1), isPalListKind(V2)) 1024.38/297.06 , a__isPalListKind(nil()) -> tt() 1024.38/297.06 , a__isPalListKind(a()) -> tt() 1024.38/297.06 , a__isPalListKind(e()) -> tt() 1024.38/297.06 , a__isPalListKind(i()) -> tt() 1024.38/297.06 , a__isPalListKind(o()) -> tt() 1024.38/297.06 , a__isPalListKind(u()) -> tt() 1024.38/297.06 , a__isPal(V) -> a__U71(a__isPalListKind(V), V) 1024.38/297.06 , a__isPal(X) -> isPal(X) 1024.38/297.06 , a__isPal(nil()) -> tt() } 1024.38/297.06 Obligation: 1024.38/297.06 innermost runtime complexity 1024.38/297.06 Answer: 1024.38/297.06 MAYBE 1024.38/297.06 1024.38/297.06 None of the processors succeeded. 1024.38/297.06 1024.38/297.06 Details of failed attempt(s): 1024.38/297.06 ----------------------------- 1024.38/297.06 1) 'empty' failed due to the following reason: 1024.38/297.06 1024.38/297.06 Empty strict component of the problem is NOT empty. 1024.38/297.06 1024.38/297.06 2) 'Best' failed due to the following reason: 1024.38/297.06 1024.38/297.06 None of the processors succeeded. 1024.38/297.06 1024.38/297.06 Details of failed attempt(s): 1024.38/297.06 ----------------------------- 1024.38/297.06 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 1024.38/297.06 following reason: 1024.38/297.06 1024.38/297.06 Computation stopped due to timeout after 297.0 seconds. 1024.38/297.06 1024.38/297.06 2) 'Best' failed due to the following reason: 1024.38/297.06 1024.38/297.06 None of the processors succeeded. 1024.38/297.06 1024.38/297.06 Details of failed attempt(s): 1024.38/297.06 ----------------------------- 1024.38/297.06 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 1024.38/297.06 seconds)' failed due to the following reason: 1024.38/297.06 1024.38/297.06 Computation stopped due to timeout after 148.0 seconds. 1024.38/297.06 1024.38/297.06 2) 'Best' failed due to the following reason: 1024.38/297.06 1024.38/297.06 None of the processors succeeded. 1024.38/297.06 1024.38/297.06 Details of failed attempt(s): 1024.38/297.06 ----------------------------- 1024.38/297.06 1) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 1024.38/297.06 to the following reason: 1024.38/297.06 1024.38/297.06 The input cannot be shown compatible 1024.38/297.06 1024.38/297.06 2) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 1024.38/297.06 following reason: 1024.38/297.06 1024.38/297.06 The input cannot be shown compatible 1024.38/297.06 1024.38/297.06 1024.38/297.06 3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 1024.38/297.06 failed due to the following reason: 1024.38/297.06 1024.38/297.06 None of the processors succeeded. 1024.38/297.06 1024.38/297.06 Details of failed attempt(s): 1024.38/297.06 ----------------------------- 1024.38/297.06 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 1024.38/297.06 failed due to the following reason: 1024.38/297.06 1024.38/297.06 match-boundness of the problem could not be verified. 1024.38/297.06 1024.38/297.06 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 1024.38/297.06 failed due to the following reason: 1024.38/297.06 1024.38/297.06 match-boundness of the problem could not be verified. 1024.38/297.06 1024.38/297.06 1024.38/297.06 1024.38/297.06 1024.38/297.06 1024.38/297.06 Arrrr.. 1027.38/299.95 EOF