MAYBE
* Step 1: DependencyPairs MAYBE
    + Considered Problem:
        - Strict TRS:
            g(f(x,y)) -> f(f(g(g(x)),g(g(y))),f(g(g(x)),g(g(y))))
        - Signature:
            {g/1} / {f/2}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {g} and constructors {f}
    + Applied Processor:
        DependencyPairs {dpKind_ = DT}
    + Details:
        We add the following dependency tuples:
        
        Strict DPs
          g#(f(x,y)) -> c_1(g#(g(x)),g#(x),g#(g(y)),g#(y),g#(g(x)),g#(x),g#(g(y)),g#(y))
        Weak DPs
          
        
        and mark the set of starting terms.
* Step 2: Failure MAYBE
  + Considered Problem:
      - Strict DPs:
          g#(f(x,y)) -> c_1(g#(g(x)),g#(x),g#(g(y)),g#(y),g#(g(x)),g#(x),g#(g(y)),g#(y))
      - Weak TRS:
          g(f(x,y)) -> f(f(g(g(x)),g(g(y))),f(g(g(x)),g(g(y))))
      - Signature:
          {g/1,g#/1} / {f/2,c_1/8}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {g#} and constructors {f}
  + Applied Processor:
      EmptyProcessor
  + Details:
      The problem is still open.
MAYBE