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