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