MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          f(c(s(x),y)) -> f(c(x,s(y)))
          f(c(s(x),s(y))) -> g(c(x,y))
          g(c(x,s(y))) -> g(c(s(x),y))
          g(c(s(x),s(y))) -> f(c(x,y))
      - Signature:
          {f/1,g/1} / {c/2,s/1}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {f,g} and constructors {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