MAYBE 1033.12/297.05 MAYBE 1033.12/297.05 1033.12/297.05 We are left with following problem, upon which TcT provides the 1033.12/297.05 certificate MAYBE. 1033.12/297.05 1033.12/297.05 Strict Trs: 1033.12/297.05 { a__and(X1, X2) -> and(X1, X2) 1033.12/297.05 , a__and(tt(), T) -> mark(T) 1033.12/297.05 , mark(tt()) -> tt() 1033.12/297.05 , mark(0()) -> 0() 1033.12/297.05 , mark(s(X)) -> s(mark(X)) 1033.12/297.05 , mark(length(X)) -> a__length(mark(X)) 1033.12/297.05 , mark(zeros()) -> a__zeros() 1033.12/297.05 , mark(cons(X1, X2)) -> cons(mark(X1), X2) 1033.12/297.05 , mark(nil()) -> nil() 1033.12/297.05 , mark(take(X1, X2)) -> a__take(mark(X1), mark(X2)) 1033.12/297.05 , mark(and(X1, X2)) -> a__and(mark(X1), mark(X2)) 1033.12/297.05 , mark(isNatIList(X)) -> a__isNatIList(X) 1033.12/297.05 , mark(isNatList(X)) -> a__isNatList(X) 1033.12/297.05 , mark(isNat(X)) -> a__isNat(X) 1033.12/297.05 , mark(uTake1(X)) -> a__uTake1(mark(X)) 1033.12/297.05 , mark(uTake2(X1, X2, X3, X4)) -> a__uTake2(mark(X1), X2, X3, X4) 1033.12/297.05 , mark(uLength(X1, X2)) -> a__uLength(mark(X1), X2) 1033.12/297.05 , a__isNatIList(IL) -> a__isNatList(IL) 1033.12/297.05 , a__isNatIList(X) -> isNatIList(X) 1033.12/297.05 , a__isNatIList(zeros()) -> tt() 1033.12/297.05 , a__isNatIList(cons(N, IL)) -> 1033.12/297.05 a__and(a__isNat(N), a__isNatIList(IL)) 1033.12/297.05 , a__isNatList(X) -> isNatList(X) 1033.12/297.05 , a__isNatList(cons(N, L)) -> a__and(a__isNat(N), a__isNatList(L)) 1033.12/297.05 , a__isNatList(nil()) -> tt() 1033.12/297.05 , a__isNatList(take(N, IL)) -> 1033.12/297.05 a__and(a__isNat(N), a__isNatIList(IL)) 1033.12/297.05 , a__isNat(X) -> isNat(X) 1033.12/297.05 , a__isNat(0()) -> tt() 1033.12/297.05 , a__isNat(s(N)) -> a__isNat(N) 1033.12/297.05 , a__isNat(length(L)) -> a__isNatList(L) 1033.12/297.05 , a__zeros() -> zeros() 1033.12/297.05 , a__zeros() -> cons(0(), zeros()) 1033.12/297.05 , a__take(X1, X2) -> take(X1, X2) 1033.12/297.05 , a__take(0(), IL) -> a__uTake1(a__isNatIList(IL)) 1033.12/297.05 , a__take(s(M), cons(N, IL)) -> 1033.12/297.05 a__uTake2(a__and(a__isNat(M), 1033.12/297.05 a__and(a__isNat(N), a__isNatIList(IL))), 1033.12/297.05 M, 1033.12/297.05 N, 1033.12/297.05 IL) 1033.12/297.05 , a__uTake1(X) -> uTake1(X) 1033.12/297.05 , a__uTake1(tt()) -> nil() 1033.12/297.05 , a__uTake2(X1, X2, X3, X4) -> uTake2(X1, X2, X3, X4) 1033.12/297.05 , a__uTake2(tt(), M, N, IL) -> cons(mark(N), take(M, IL)) 1033.12/297.05 , a__length(X) -> length(X) 1033.12/297.05 , a__length(cons(N, L)) -> 1033.12/297.05 a__uLength(a__and(a__isNat(N), a__isNatList(L)), L) 1033.12/297.05 , a__uLength(X1, X2) -> uLength(X1, X2) 1033.12/297.05 , a__uLength(tt(), L) -> s(a__length(mark(L))) } 1033.12/297.05 Obligation: 1033.12/297.05 innermost runtime complexity 1033.12/297.05 Answer: 1033.12/297.05 MAYBE 1033.12/297.05 1033.12/297.05 None of the processors succeeded. 1033.12/297.05 1033.12/297.05 Details of failed attempt(s): 1033.12/297.05 ----------------------------- 1033.12/297.05 1) 'empty' failed due to the following reason: 1033.12/297.05 1033.12/297.05 Empty strict component of the problem is NOT empty. 1033.12/297.05 1033.12/297.05 2) 'Best' failed due to the following reason: 1033.12/297.05 1033.12/297.05 None of the processors succeeded. 1033.12/297.05 1033.12/297.05 Details of failed attempt(s): 1033.12/297.05 ----------------------------- 1033.12/297.05 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 1033.12/297.05 following reason: 1033.12/297.05 1033.12/297.05 Computation stopped due to timeout after 297.0 seconds. 1033.12/297.05 1033.12/297.05 2) 'Best' failed due to the following reason: 1033.12/297.05 1033.12/297.05 None of the processors succeeded. 1033.12/297.05 1033.12/297.05 Details of failed attempt(s): 1033.12/297.05 ----------------------------- 1033.12/297.05 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 1033.12/297.05 seconds)' failed due to the following reason: 1033.12/297.05 1033.12/297.05 Computation stopped due to timeout after 148.0 seconds. 1033.12/297.05 1033.12/297.05 2) 'Best' failed due to the following reason: 1033.12/297.05 1033.12/297.05 None of the processors succeeded. 1033.12/297.05 1033.12/297.05 Details of failed attempt(s): 1033.12/297.05 ----------------------------- 1033.12/297.05 1) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 1033.12/297.05 following reason: 1033.12/297.05 1033.12/297.05 The input cannot be shown compatible 1033.12/297.05 1033.12/297.05 2) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 1033.12/297.05 to the following reason: 1033.12/297.05 1033.12/297.05 The input cannot be shown compatible 1033.12/297.05 1033.12/297.05 1033.12/297.05 3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 1033.12/297.05 failed due to the following reason: 1033.12/297.05 1033.12/297.05 None of the processors succeeded. 1033.12/297.05 1033.12/297.05 Details of failed attempt(s): 1033.12/297.05 ----------------------------- 1033.12/297.05 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 1033.12/297.05 failed due to the following reason: 1033.12/297.05 1033.12/297.05 match-boundness of the problem could not be verified. 1033.12/297.05 1033.12/297.05 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 1033.12/297.05 failed due to the following reason: 1033.12/297.05 1033.12/297.05 match-boundness of the problem could not be verified. 1033.12/297.05 1033.12/297.05 1033.12/297.05 1033.12/297.05 1033.12/297.05 1033.12/297.05 Arrrr.. 1035.99/299.83 EOF