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