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