MAYBE 1050.53/297.05 MAYBE 1050.53/297.05 1050.53/297.05 We are left with following problem, upon which TcT provides the 1050.53/297.05 certificate MAYBE. 1050.53/297.05 1050.53/297.05 Strict Trs: 1050.53/297.05 { a__zeros() -> cons(0(), zeros()) 1050.53/297.05 , a__zeros() -> zeros() 1050.53/297.05 , a__U11(X) -> U11(X) 1050.53/297.05 , a__U11(tt()) -> tt() 1050.53/297.05 , a__U21(X) -> U21(X) 1050.53/297.05 , a__U21(tt()) -> tt() 1050.53/297.05 , a__U31(X) -> U31(X) 1050.53/297.05 , a__U31(tt()) -> tt() 1050.53/297.05 , a__U41(X1, X2) -> U41(X1, X2) 1050.53/297.05 , a__U41(tt(), V2) -> a__U42(a__isNatIList(V2)) 1050.53/297.05 , a__U42(X) -> U42(X) 1050.53/297.05 , a__U42(tt()) -> tt() 1050.53/297.05 , a__isNatIList(V) -> a__U31(a__isNatList(V)) 1050.53/297.05 , a__isNatIList(X) -> isNatIList(X) 1050.53/297.05 , a__isNatIList(cons(V1, V2)) -> a__U41(a__isNat(V1), V2) 1050.53/297.05 , a__isNatIList(zeros()) -> tt() 1050.53/297.05 , a__U51(X1, X2) -> U51(X1, X2) 1050.53/297.05 , a__U51(tt(), V2) -> a__U52(a__isNatList(V2)) 1050.53/297.05 , a__U52(X) -> U52(X) 1050.53/297.05 , a__U52(tt()) -> tt() 1050.53/297.05 , a__isNatList(X) -> isNatList(X) 1050.53/297.05 , a__isNatList(cons(V1, V2)) -> a__U51(a__isNat(V1), V2) 1050.53/297.05 , a__isNatList(nil()) -> tt() 1050.53/297.05 , a__U61(X1, X2, X3) -> U61(X1, X2, X3) 1050.53/297.05 , a__U61(tt(), L, N) -> a__U62(a__isNat(N), L) 1050.53/297.05 , a__U62(X1, X2) -> U62(X1, X2) 1050.53/297.05 , a__U62(tt(), L) -> s(a__length(mark(L))) 1050.53/297.05 , a__isNat(X) -> isNat(X) 1050.53/297.05 , a__isNat(0()) -> tt() 1050.53/297.05 , a__isNat(s(V1)) -> a__U21(a__isNat(V1)) 1050.53/297.05 , a__isNat(length(V1)) -> a__U11(a__isNatList(V1)) 1050.53/297.05 , a__length(X) -> length(X) 1050.53/297.05 , a__length(cons(N, L)) -> a__U61(a__isNatList(L), L, N) 1050.53/297.05 , a__length(nil()) -> 0() 1050.53/297.05 , mark(cons(X1, X2)) -> cons(mark(X1), X2) 1050.53/297.05 , mark(0()) -> 0() 1050.53/297.05 , mark(zeros()) -> a__zeros() 1050.53/297.05 , mark(tt()) -> tt() 1050.53/297.05 , mark(s(X)) -> s(mark(X)) 1050.53/297.05 , mark(length(X)) -> a__length(mark(X)) 1050.53/297.05 , mark(nil()) -> nil() 1050.53/297.05 , mark(U11(X)) -> a__U11(mark(X)) 1050.53/297.05 , mark(U21(X)) -> a__U21(mark(X)) 1050.53/297.05 , mark(U31(X)) -> a__U31(mark(X)) 1050.53/297.05 , mark(U41(X1, X2)) -> a__U41(mark(X1), X2) 1050.53/297.05 , mark(U42(X)) -> a__U42(mark(X)) 1050.53/297.05 , mark(isNatIList(X)) -> a__isNatIList(X) 1050.53/297.05 , mark(U51(X1, X2)) -> a__U51(mark(X1), X2) 1050.53/297.05 , mark(U52(X)) -> a__U52(mark(X)) 1050.53/297.05 , mark(isNatList(X)) -> a__isNatList(X) 1050.53/297.05 , mark(U61(X1, X2, X3)) -> a__U61(mark(X1), X2, X3) 1050.53/297.05 , mark(U62(X1, X2)) -> a__U62(mark(X1), X2) 1050.53/297.05 , mark(isNat(X)) -> a__isNat(X) } 1050.53/297.05 Obligation: 1050.53/297.05 innermost runtime complexity 1050.53/297.05 Answer: 1050.53/297.05 MAYBE 1050.53/297.05 1050.53/297.05 None of the processors succeeded. 1050.53/297.05 1050.53/297.05 Details of failed attempt(s): 1050.53/297.05 ----------------------------- 1050.53/297.05 1) 'empty' failed due to the following reason: 1050.53/297.05 1050.53/297.05 Empty strict component of the problem is NOT empty. 1050.53/297.05 1050.53/297.05 2) 'Best' failed due to the following reason: 1050.53/297.05 1050.53/297.05 None of the processors succeeded. 1050.53/297.05 1050.53/297.05 Details of failed attempt(s): 1050.53/297.05 ----------------------------- 1050.53/297.05 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 1050.53/297.05 following reason: 1050.53/297.05 1050.53/297.05 Computation stopped due to timeout after 297.0 seconds. 1050.53/297.05 1050.53/297.05 2) 'Best' failed due to the following reason: 1050.53/297.05 1050.53/297.05 None of the processors succeeded. 1050.53/297.05 1050.53/297.05 Details of failed attempt(s): 1050.53/297.05 ----------------------------- 1050.53/297.05 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 1050.53/297.05 seconds)' failed due to the following reason: 1050.53/297.05 1050.53/297.05 Computation stopped due to timeout after 148.0 seconds. 1050.53/297.05 1050.53/297.05 2) 'Best' failed due to the following reason: 1050.53/297.05 1050.53/297.05 None of the processors succeeded. 1050.53/297.05 1050.53/297.05 Details of failed attempt(s): 1050.53/297.05 ----------------------------- 1050.53/297.05 1) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 1050.53/297.05 to the following reason: 1050.53/297.05 1050.53/297.05 The input cannot be shown compatible 1050.53/297.05 1050.53/297.05 2) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 1050.53/297.05 following reason: 1050.53/297.05 1050.53/297.05 The input cannot be shown compatible 1050.53/297.05 1050.53/297.05 1050.53/297.05 3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 1050.53/297.05 failed due to the following reason: 1050.53/297.05 1050.53/297.05 None of the processors succeeded. 1050.53/297.05 1050.53/297.05 Details of failed attempt(s): 1050.53/297.05 ----------------------------- 1050.53/297.05 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 1050.53/297.05 failed due to the following reason: 1050.53/297.05 1050.53/297.05 match-boundness of the problem could not be verified. 1050.53/297.05 1050.53/297.05 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 1050.53/297.05 failed due to the following reason: 1050.53/297.05 1050.53/297.05 match-boundness of the problem could not be verified. 1050.53/297.05 1050.53/297.05 1050.53/297.05 1050.53/297.05 1050.53/297.05 1050.53/297.05 Arrrr.. 1053.63/301.07 EOF