MAYBE * Step 1: Failure MAYBE + Considered Problem: - Strict TRS: goal(x) -> nestinc(x) inc(Cons(x,xs)) -> Cons(Cons(Nil(),Nil()),inc(xs)) inc(Nil()) -> Cons(Nil(),Nil()) nestinc(Cons(x,xs)) -> nestinc(inc(Cons(x,xs))) nestinc(Nil()) -> number17(Nil()) number17(x) -> Cons(Nil() ,Cons(Nil() ,Cons(Nil() ,Cons(Nil() ,Cons(Nil() ,Cons(Nil() ,Cons(Nil() ,Cons(Nil() ,Cons(Nil() ,Cons(Nil() ,Cons(Nil() ,Cons(Nil() ,Cons(Nil() ,Cons(Nil() ,Cons(Nil() ,Cons(Nil() ,Cons(Nil() ,Nil()))))))))))))))))) - Signature: {goal/1,inc/1,nestinc/1,number17/1} / {Cons/2,Nil/0} - Obligation: innermost runtime complexity wrt. defined symbols {goal,inc,nestinc,number17} and constructors {Cons,Nil} + Applied Processor: Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = Z3} + Details: The input can not be schown compatible. MAYBE