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