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