MAYBE
* Step 1: WeightGap MAYBE
    + Considered Problem:
        - Strict TRS:
            +(0(),x) -> x
            +(1(),x) -> +(+(0(),1()),x)
        - Signature:
            {+/2} / {0/0,1/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {+} and constructors {0,1}
    + Applied Processor:
        WeightGap {wgDimension = 1, wgDegree = 1, wgKind = Algebraic, wgUArgs = UArgs, wgOn = WgOnAny}
    + Details:
        The weightgap principle applies using the following nonconstant growth matrix-interpretation:
          We apply a matrix interpretation of kind constructor based matrix interpretation:
          The following argument positions are considered usable:
            uargs(+) = {1}
          
          Following symbols are considered usable:
            all
          TcT has computed the following interpretation:
            p(+) = [1] x1 + [2] x2 + [12]
            p(0) = [2]                   
            p(1) = [1]                   
          
          Following rules are strictly oriented:
          +(0(),x) = [2] x + [14]
                   > [1] x + [0] 
                   = x           
          
          
          Following rules are (at-least) weakly oriented:
          +(1(),x) =  [2] x + [13]   
                   >= [2] x + [28]   
                   =  +(+(0(),1()),x)
          
        Further, it can be verified that all rules not oriented are covered by the weightgap condition.
* Step 2: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          +(1(),x) -> +(+(0(),1()),x)
      - Weak TRS:
          +(0(),x) -> x
      - Signature:
          {+/2} / {0/0,1/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {+} and constructors {0,1}
  + Applied Processor:
      EmptyProcessor
  + Details:
      The problem is still open.
MAYBE