MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          ++(x,++(y,z)) -> ++(++(x,y),z)
          ++(x,nil()) -> x
          ++(.(x,y),z) -> .(x,++(y,z))
          ++(nil(),y) -> y
          make(x) -> .(x,nil())
          rev(++(x,y)) -> ++(rev(y),rev(x))
          rev(nil()) -> nil()
          rev(rev(x)) -> x
      - Signature:
          {++/2,make/1,rev/1} / {./2,nil/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {++,make,rev} and constructors {.,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