MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          +(0(),y) -> y
          +(s(x),y) -> s(+(x,y))
          ++(:(x,xs),ys) -> :(x,++(xs,ys))
          ++(nil(),ys) -> ys
          -(x,0()) -> x
          -(0(),s(y)) -> 0()
          -(s(x),s(y)) -> -(x,y)
          avg(xs) -> quot(hd(sum(xs)),length(xs))
          hd(:(x,xs)) -> x
          length(:(x,xs)) -> s(length(xs))
          length(nil()) -> 0()
          quot(0(),s(y)) -> 0()
          quot(s(x),s(y)) -> s(quot(-(x,y),s(y)))
          sum(++(xs,:(x,:(y,ys)))) -> sum(++(xs,sum(:(x,:(y,ys)))))
          sum(:(x,:(y,xs))) -> sum(:(+(x,y),xs))
          sum(:(x,nil())) -> :(x,nil())
      - Signature:
          {+/2,++/2,-/2,avg/1,hd/1,length/1,quot/2,sum/1} / {0/0,:/2,nil/0,s/1}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {+,++,-,avg,hd,length,quot,sum} and constructors {0,:,nil
          ,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