MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          f(Cons(x,xs),y) -> h(Cons(x,xs),y)
          f(Nil(),y) -> g(Nil(),y)
          g(Cons(x,xs),y) -> Cons(x,xs)
          g(Nil(),y) -> h(Nil(),y)
          h(Cons(x,xs),y) -> f(Cons(x,xs),y)
          h(Nil(),y) -> h(Nil(),y)
          r(x,y) -> x
          sp1(x,y) -> f(x,y)
      - Signature:
          {f/2,g/2,h/2,r/2,sp1/2} / {Cons/2,Nil/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {f,g,h,r,sp1} and constructors {Cons,Nil}
  + Applied Processor:
      Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = Z3}
  + Details:
      The input can not be schown compatible.
MAYBE