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