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