MAYBE 1018.59/299.43 MAYBE 1018.59/299.43 1018.59/299.43 We are left with following problem, upon which TcT provides the 1018.59/299.43 certificate MAYBE. 1018.59/299.43 1018.59/299.43 Strict Trs: 1018.59/299.43 { a____(X1, X2) -> __(X1, X2) 1018.59/299.43 , a____(X, nil()) -> mark(X) 1018.59/299.43 , a____(__(X, Y), Z) -> a____(mark(X), a____(mark(Y), mark(Z))) 1018.59/299.43 , a____(nil(), X) -> mark(X) 1018.59/299.43 , mark(__(X1, X2)) -> a____(mark(X1), mark(X2)) 1018.59/299.43 , mark(nil()) -> nil() 1018.59/299.43 , mark(tt()) -> tt() 1018.59/299.43 , mark(a()) -> a() 1018.59/299.43 , mark(e()) -> e() 1018.59/299.43 , mark(i()) -> i() 1018.59/299.43 , mark(o()) -> o() 1018.59/299.43 , mark(u()) -> u() 1018.59/299.43 , mark(U11(X)) -> a__U11(mark(X)) 1018.59/299.43 , mark(U21(X1, X2)) -> a__U21(mark(X1), X2) 1018.59/299.43 , mark(U22(X)) -> a__U22(mark(X)) 1018.59/299.43 , mark(isList(X)) -> a__isList(X) 1018.59/299.43 , mark(U31(X)) -> a__U31(mark(X)) 1018.59/299.43 , mark(U41(X1, X2)) -> a__U41(mark(X1), X2) 1018.59/299.43 , mark(U42(X)) -> a__U42(mark(X)) 1018.59/299.43 , mark(isNeList(X)) -> a__isNeList(X) 1018.59/299.43 , mark(U51(X1, X2)) -> a__U51(mark(X1), X2) 1018.59/299.43 , mark(U52(X)) -> a__U52(mark(X)) 1018.59/299.43 , mark(U61(X)) -> a__U61(mark(X)) 1018.59/299.43 , mark(U71(X1, X2)) -> a__U71(mark(X1), X2) 1018.59/299.43 , mark(U72(X)) -> a__U72(mark(X)) 1018.59/299.43 , mark(isPal(X)) -> a__isPal(X) 1018.59/299.43 , mark(U81(X)) -> a__U81(mark(X)) 1018.59/299.43 , mark(isQid(X)) -> a__isQid(X) 1018.59/299.43 , mark(isNePal(X)) -> a__isNePal(X) 1018.59/299.43 , a__U11(X) -> U11(X) 1018.59/299.43 , a__U11(tt()) -> tt() 1018.59/299.43 , a__U21(X1, X2) -> U21(X1, X2) 1018.59/299.43 , a__U21(tt(), V2) -> a__U22(a__isList(V2)) 1018.59/299.43 , a__U22(X) -> U22(X) 1018.59/299.43 , a__U22(tt()) -> tt() 1018.59/299.43 , a__isList(V) -> a__U11(a__isNeList(V)) 1018.59/299.43 , a__isList(X) -> isList(X) 1018.59/299.43 , a__isList(__(V1, V2)) -> a__U21(a__isList(V1), V2) 1018.59/299.43 , a__isList(nil()) -> tt() 1018.59/299.43 , a__U31(X) -> U31(X) 1018.59/299.43 , a__U31(tt()) -> tt() 1018.59/299.43 , a__U41(X1, X2) -> U41(X1, X2) 1018.59/299.43 , a__U41(tt(), V2) -> a__U42(a__isNeList(V2)) 1018.59/299.43 , a__U42(X) -> U42(X) 1018.59/299.43 , a__U42(tt()) -> tt() 1018.59/299.43 , a__isNeList(V) -> a__U31(a__isQid(V)) 1018.59/299.43 , a__isNeList(X) -> isNeList(X) 1018.59/299.43 , a__isNeList(__(V1, V2)) -> a__U41(a__isList(V1), V2) 1018.59/299.43 , a__isNeList(__(V1, V2)) -> a__U51(a__isNeList(V1), V2) 1018.59/299.43 , a__U51(X1, X2) -> U51(X1, X2) 1018.59/299.43 , a__U51(tt(), V2) -> a__U52(a__isList(V2)) 1018.59/299.43 , a__U52(X) -> U52(X) 1018.59/299.43 , a__U52(tt()) -> tt() 1018.59/299.43 , a__U61(X) -> U61(X) 1018.59/299.43 , a__U61(tt()) -> tt() 1018.59/299.43 , a__U71(X1, X2) -> U71(X1, X2) 1018.59/299.43 , a__U71(tt(), P) -> a__U72(a__isPal(P)) 1018.59/299.43 , a__U72(X) -> U72(X) 1018.59/299.43 , a__U72(tt()) -> tt() 1018.59/299.43 , a__isPal(V) -> a__U81(a__isNePal(V)) 1018.59/299.43 , a__isPal(X) -> isPal(X) 1018.59/299.43 , a__isPal(nil()) -> tt() 1018.59/299.43 , a__U81(X) -> U81(X) 1018.59/299.43 , a__U81(tt()) -> tt() 1018.59/299.43 , a__isQid(X) -> isQid(X) 1018.59/299.43 , a__isQid(a()) -> tt() 1018.59/299.43 , a__isQid(e()) -> tt() 1018.59/299.43 , a__isQid(i()) -> tt() 1018.59/299.43 , a__isQid(o()) -> tt() 1018.59/299.43 , a__isQid(u()) -> tt() 1018.59/299.43 , a__isNePal(V) -> a__U61(a__isQid(V)) 1018.59/299.43 , a__isNePal(X) -> isNePal(X) 1018.59/299.43 , a__isNePal(__(I, __(P, I))) -> a__U71(a__isQid(I), P) } 1018.59/299.43 Obligation: 1018.59/299.43 runtime complexity 1018.59/299.43 Answer: 1018.59/299.43 MAYBE 1018.59/299.43 1018.59/299.43 The input is overlay and right-linear. Switching to innermost 1018.59/299.43 rewriting. 1018.59/299.43 1018.59/299.43 We are left with following problem, upon which TcT provides the 1018.59/299.43 certificate MAYBE. 1018.59/299.43 1018.59/299.43 Strict Trs: 1018.59/299.43 { a____(X1, X2) -> __(X1, X2) 1018.59/299.43 , a____(X, nil()) -> mark(X) 1018.59/299.43 , a____(__(X, Y), Z) -> a____(mark(X), a____(mark(Y), mark(Z))) 1018.59/299.43 , a____(nil(), X) -> mark(X) 1018.59/299.43 , mark(__(X1, X2)) -> a____(mark(X1), mark(X2)) 1018.59/299.43 , mark(nil()) -> nil() 1018.59/299.43 , mark(tt()) -> tt() 1018.59/299.43 , mark(a()) -> a() 1018.59/299.43 , mark(e()) -> e() 1018.59/299.43 , mark(i()) -> i() 1018.59/299.43 , mark(o()) -> o() 1018.59/299.43 , mark(u()) -> u() 1018.59/299.43 , mark(U11(X)) -> a__U11(mark(X)) 1018.59/299.43 , mark(U21(X1, X2)) -> a__U21(mark(X1), X2) 1018.59/299.43 , mark(U22(X)) -> a__U22(mark(X)) 1018.59/299.43 , mark(isList(X)) -> a__isList(X) 1018.59/299.43 , mark(U31(X)) -> a__U31(mark(X)) 1018.59/299.43 , mark(U41(X1, X2)) -> a__U41(mark(X1), X2) 1018.59/299.43 , mark(U42(X)) -> a__U42(mark(X)) 1018.59/299.43 , mark(isNeList(X)) -> a__isNeList(X) 1018.59/299.43 , mark(U51(X1, X2)) -> a__U51(mark(X1), X2) 1018.59/299.43 , mark(U52(X)) -> a__U52(mark(X)) 1018.59/299.43 , mark(U61(X)) -> a__U61(mark(X)) 1018.59/299.43 , mark(U71(X1, X2)) -> a__U71(mark(X1), X2) 1018.59/299.43 , mark(U72(X)) -> a__U72(mark(X)) 1018.59/299.43 , mark(isPal(X)) -> a__isPal(X) 1018.59/299.43 , mark(U81(X)) -> a__U81(mark(X)) 1018.59/299.43 , mark(isQid(X)) -> a__isQid(X) 1018.59/299.43 , mark(isNePal(X)) -> a__isNePal(X) 1018.59/299.43 , a__U11(X) -> U11(X) 1018.59/299.43 , a__U11(tt()) -> tt() 1018.59/299.43 , a__U21(X1, X2) -> U21(X1, X2) 1018.59/299.43 , a__U21(tt(), V2) -> a__U22(a__isList(V2)) 1018.59/299.43 , a__U22(X) -> U22(X) 1018.59/299.43 , a__U22(tt()) -> tt() 1018.59/299.43 , a__isList(V) -> a__U11(a__isNeList(V)) 1018.59/299.43 , a__isList(X) -> isList(X) 1018.59/299.43 , a__isList(__(V1, V2)) -> a__U21(a__isList(V1), V2) 1018.59/299.43 , a__isList(nil()) -> tt() 1018.59/299.43 , a__U31(X) -> U31(X) 1018.59/299.43 , a__U31(tt()) -> tt() 1018.59/299.43 , a__U41(X1, X2) -> U41(X1, X2) 1018.59/299.43 , a__U41(tt(), V2) -> a__U42(a__isNeList(V2)) 1018.59/299.43 , a__U42(X) -> U42(X) 1018.59/299.43 , a__U42(tt()) -> tt() 1018.59/299.43 , a__isNeList(V) -> a__U31(a__isQid(V)) 1018.59/299.43 , a__isNeList(X) -> isNeList(X) 1018.59/299.43 , a__isNeList(__(V1, V2)) -> a__U41(a__isList(V1), V2) 1018.59/299.43 , a__isNeList(__(V1, V2)) -> a__U51(a__isNeList(V1), V2) 1018.59/299.43 , a__U51(X1, X2) -> U51(X1, X2) 1018.59/299.43 , a__U51(tt(), V2) -> a__U52(a__isList(V2)) 1018.59/299.43 , a__U52(X) -> U52(X) 1018.59/299.43 , a__U52(tt()) -> tt() 1018.59/299.43 , a__U61(X) -> U61(X) 1018.59/299.43 , a__U61(tt()) -> tt() 1018.59/299.43 , a__U71(X1, X2) -> U71(X1, X2) 1018.59/299.43 , a__U71(tt(), P) -> a__U72(a__isPal(P)) 1018.59/299.43 , a__U72(X) -> U72(X) 1018.59/299.43 , a__U72(tt()) -> tt() 1018.59/299.43 , a__isPal(V) -> a__U81(a__isNePal(V)) 1018.59/299.43 , a__isPal(X) -> isPal(X) 1018.59/299.43 , a__isPal(nil()) -> tt() 1018.59/299.43 , a__U81(X) -> U81(X) 1018.59/299.43 , a__U81(tt()) -> tt() 1018.59/299.43 , a__isQid(X) -> isQid(X) 1018.59/299.43 , a__isQid(a()) -> tt() 1018.59/299.43 , a__isQid(e()) -> tt() 1018.59/299.43 , a__isQid(i()) -> tt() 1018.59/299.43 , a__isQid(o()) -> tt() 1018.59/299.43 , a__isQid(u()) -> tt() 1018.59/299.43 , a__isNePal(V) -> a__U61(a__isQid(V)) 1018.59/299.43 , a__isNePal(X) -> isNePal(X) 1018.59/299.43 , a__isNePal(__(I, __(P, I))) -> a__U71(a__isQid(I), P) } 1018.59/299.43 Obligation: 1018.59/299.43 innermost runtime complexity 1018.59/299.43 Answer: 1018.59/299.43 MAYBE 1018.59/299.43 1018.59/299.43 None of the processors succeeded. 1018.59/299.43 1018.59/299.43 Details of failed attempt(s): 1018.59/299.43 ----------------------------- 1018.59/299.43 1) 'empty' failed due to the following reason: 1018.59/299.43 1018.59/299.43 Empty strict component of the problem is NOT empty. 1018.59/299.43 1018.59/299.43 2) 'Best' failed due to the following reason: 1018.59/299.43 1018.59/299.43 None of the processors succeeded. 1018.59/299.43 1018.59/299.43 Details of failed attempt(s): 1018.59/299.43 ----------------------------- 1018.59/299.43 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 1018.59/299.43 following reason: 1018.59/299.43 1018.59/299.43 Computation stopped due to timeout after 297.0 seconds. 1018.59/299.43 1018.59/299.43 2) 'Best' failed due to the following reason: 1018.59/299.43 1018.59/299.43 None of the processors succeeded. 1018.59/299.43 1018.59/299.43 Details of failed attempt(s): 1018.59/299.43 ----------------------------- 1018.59/299.43 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 1018.59/299.43 seconds)' failed due to the following reason: 1018.59/299.43 1018.59/299.43 Computation stopped due to timeout after 148.0 seconds. 1018.59/299.43 1018.59/299.43 2) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 1018.59/299.43 failed due to the following reason: 1018.59/299.43 1018.59/299.43 Computation stopped due to timeout after 24.0 seconds. 1018.59/299.43 1018.59/299.43 3) 'Best' failed due to the following reason: 1018.59/299.43 1018.59/299.43 None of the processors succeeded. 1018.59/299.43 1018.59/299.43 Details of failed attempt(s): 1018.59/299.43 ----------------------------- 1018.59/299.43 1) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 1018.59/299.43 to the following reason: 1018.59/299.43 1018.59/299.43 The input cannot be shown compatible 1018.59/299.43 1018.59/299.43 2) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 1018.59/299.43 following reason: 1018.59/299.43 1018.59/299.43 The input cannot be shown compatible 1018.59/299.43 1018.59/299.43 1018.59/299.43 1018.59/299.43 1018.59/299.43 1018.59/299.43 Arrrr.. 1019.29/301.67 EOF