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