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