WORST_CASE(?,O(n^1))
* Step 1: NaturalPI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            dfsAcc#3(Leaf(x8),x16) -> Cons(x8,x16)
            dfsAcc#3(Node(x6,x4),x2) -> dfsAcc#3(x4,dfsAcc#3(x6,x2))
            main(x1) -> revApp#2(dfsAcc#3(x1,Nil()),Nil())
            revApp#2(Cons(x6,x4),x2) -> revApp#2(x4,Cons(x6,x2))
            revApp#2(Nil(),x16) -> x16
        - Signature:
            {dfsAcc#3/2,main/1,revApp#2/2} / {Cons/2,Leaf/1,Nil/0,Node/2}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {dfsAcc#3,main,revApp#2} and constructors {Cons,Leaf,Nil
            ,Node}
    + Applied Processor:
        NaturalPI {shape = Linear, restrict = NoRestrict, uargs = UArgs, urules = URules, selector = Nothing}
    + Details:
        We apply a polynomial interpretation of kind constructor-based(linear):
        The following argument positions are considered usable:
          uargs(dfsAcc#3) = {2},
          uargs(revApp#2) = {1}
        
        Following symbols are considered usable:
          {dfsAcc#3,main,revApp#2}
        TcT has computed the following interpretation:
              p(Cons) = 4 + x2         
              p(Leaf) = 10 + x1        
               p(Nil) = 0              
              p(Node) = 1 + x1 + x2    
          p(dfsAcc#3) = x1 + x2        
              p(main) = 9 + 4*x1       
          p(revApp#2) = 2 + 4*x1 + 2*x2
        
        Following rules are strictly oriented:
          dfsAcc#3(Leaf(x8),x16) = 10 + x16 + x8                     
                                 > 4 + x16                           
                                 = Cons(x8,x16)                      
        
        dfsAcc#3(Node(x6,x4),x2) = 1 + x2 + x4 + x6                  
                                 > x2 + x4 + x6                      
                                 = dfsAcc#3(x4,dfsAcc#3(x6,x2))      
        
                        main(x1) = 9 + 4*x1                          
                                 > 2 + 4*x1                          
                                 = revApp#2(dfsAcc#3(x1,Nil()),Nil())
        
        revApp#2(Cons(x6,x4),x2) = 18 + 2*x2 + 4*x4                  
                                 > 10 + 2*x2 + 4*x4                  
                                 = revApp#2(x4,Cons(x6,x2))          
        
             revApp#2(Nil(),x16) = 2 + 2*x16                         
                                 > x16                               
                                 = x16                               
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^1))