MAYBE * Step 1: Failure MAYBE + Considered Problem: - Strict TRS: f(a()) -> b() f(c()) -> d() f(g(x,y)) -> g(f(x),f(y)) f(h(x,y)) -> g(h(y,f(x)),h(x,f(y))) g(x,x) -> h(e(),x) - Signature: {f/1,g/2} / {a/0,b/0,c/0,d/0,e/0,h/2} - Obligation: innermost runtime complexity wrt. defined symbols {f,g} and constructors {a,b,c,d,e,h} + Applied Processor: Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = Z3} + Details: The input can not be schown compatible. MAYBE