*** 1 Progress [(?,O(n^1))]  ***
    Considered Problem:
      Strict DP Rules:
        
      Strict TRS Rules:
        quot(x,0(),s(z)) -> s(quot(x,s(z),s(z)))
        quot(0(),s(y),s(z)) -> 0()
        quot(s(x),s(y),z) -> quot(x,y,z)
      Weak DP Rules:
        
      Weak TRS Rules:
        
      Signature:
        {quot/3} / {0/0,s/1}
      Obligation:
        Full
        basic terms: {quot}/{0,s}
    Applied Processor:
      DependencyPairs {dpKind_ = WIDP}
    Proof:
      We add the following weak dependency pairs:
      
      Strict DPs
        quot#(x,0(),s(z)) -> c_1(quot#(x,s(z),s(z)))
        quot#(0(),s(y),s(z)) -> c_2()
        quot#(s(x),s(y),z) -> c_3(quot#(x,y,z))
      Weak DPs
        
      
      and mark the set of starting terms.
*** 1.1 Progress [(?,O(n^1))]  ***
    Considered Problem:
      Strict DP Rules:
        quot#(x,0(),s(z)) -> c_1(quot#(x,s(z),s(z)))
        quot#(0(),s(y),s(z)) -> c_2()
        quot#(s(x),s(y),z) -> c_3(quot#(x,y,z))
      Strict TRS Rules:
        quot(x,0(),s(z)) -> s(quot(x,s(z),s(z)))
        quot(0(),s(y),s(z)) -> 0()
        quot(s(x),s(y),z) -> quot(x,y,z)
      Weak DP Rules:
        
      Weak TRS Rules:
        
      Signature:
        {quot/3,quot#/3} / {0/0,s/1,c_1/1,c_2/0,c_3/1}
      Obligation:
        Full
        basic terms: {quot#}/{0,s}
    Applied Processor:
      UsableRules
    Proof:
      We replace rewrite rules by usable rules:
        quot#(x,0(),s(z)) -> c_1(quot#(x,s(z),s(z)))
        quot#(0(),s(y),s(z)) -> c_2()
        quot#(s(x),s(y),z) -> c_3(quot#(x,y,z))
*** 1.1.1 Progress [(?,O(n^1))]  ***
    Considered Problem:
      Strict DP Rules:
        quot#(x,0(),s(z)) -> c_1(quot#(x,s(z),s(z)))
        quot#(0(),s(y),s(z)) -> c_2()
        quot#(s(x),s(y),z) -> c_3(quot#(x,y,z))
      Strict TRS Rules:
        
      Weak DP Rules:
        
      Weak TRS Rules:
        
      Signature:
        {quot/3,quot#/3} / {0/0,s/1,c_1/1,c_2/0,c_3/1}
      Obligation:
        Full
        basic terms: {quot#}/{0,s}
    Applied Processor:
      Succeeding
    Proof:
      ()
*** 1.1.1.1 Progress [(?,O(n^1))]  ***
    Considered Problem:
      Strict DP Rules:
        quot#(x,0(),s(z)) -> c_1(quot#(x,s(z),s(z)))
        quot#(0(),s(y),s(z)) -> c_2()
        quot#(s(x),s(y),z) -> c_3(quot#(x,y,z))
      Strict TRS Rules:
        
      Weak DP Rules:
        
      Weak TRS Rules:
        
      Signature:
        {quot/3,quot#/3} / {0/0,s/1,c_1/1,c_2/0,c_3/1}
      Obligation:
        Full
        basic terms: {quot#}/{0,s}
    Applied Processor:
      PredecessorEstimation {onSelection = all simple predecessor estimation selector}
    Proof:
      We estimate the number of application of
        {2}
      by application of
        Pre({2}) = {1,3}.
      Here rules are labelled as follows:
        1: quot#(x,0(),s(z)) -> c_1(quot#(x     
                                         ,s(z)  
                                         ,s(z)))
        2: quot#(0(),s(y),s(z)) -> c_2()        
        3: quot#(s(x),s(y),z) ->                
             c_3(quot#(x,y,z))                  
*** 1.1.1.1.1 Progress [(?,O(n^1))]  ***
    Considered Problem:
      Strict DP Rules:
        quot#(x,0(),s(z)) -> c_1(quot#(x,s(z),s(z)))
        quot#(s(x),s(y),z) -> c_3(quot#(x,y,z))
      Strict TRS Rules:
        
      Weak DP Rules:
        quot#(0(),s(y),s(z)) -> c_2()
      Weak TRS Rules:
        
      Signature:
        {quot/3,quot#/3} / {0/0,s/1,c_1/1,c_2/0,c_3/1}
      Obligation:
        Full
        basic terms: {quot#}/{0,s}
    Applied Processor:
      RemoveWeakSuffixes
    Proof:
      Consider the dependency graph
        1:S:quot#(x,0(),s(z)) -> c_1(quot#(x,s(z),s(z)))
           -->_1 quot#(s(x),s(y),z) -> c_3(quot#(x,y,z)):2
           -->_1 quot#(0(),s(y),s(z)) -> c_2():3
        
        2:S:quot#(s(x),s(y),z) -> c_3(quot#(x,y,z))
           -->_1 quot#(0(),s(y),s(z)) -> c_2():3
           -->_1 quot#(s(x),s(y),z) -> c_3(quot#(x,y,z)):2
           -->_1 quot#(x,0(),s(z)) -> c_1(quot#(x,s(z),s(z))):1
        
        3:W:quot#(0(),s(y),s(z)) -> c_2()
           
        
      The following weak DPs constitute a sub-graph of the DG that is closed under successors. The DPs are removed.
        3: quot#(0(),s(y),s(z)) -> c_2()
*** 1.1.1.1.1.1 Progress [(?,O(n^1))]  ***
    Considered Problem:
      Strict DP Rules:
        quot#(x,0(),s(z)) -> c_1(quot#(x,s(z),s(z)))
        quot#(s(x),s(y),z) -> c_3(quot#(x,y,z))
      Strict TRS Rules:
        
      Weak DP Rules:
        
      Weak TRS Rules:
        
      Signature:
        {quot/3,quot#/3} / {0/0,s/1,c_1/1,c_2/0,c_3/1}
      Obligation:
        Full
        basic terms: {quot#}/{0,s}
    Applied Processor:
      PredecessorEstimationCP {onSelectionCP = any intersect of rules of CDG leaf and strict-rules, withComplexityPair = NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing, greedy = NoGreedy}}
    Proof:
      We first use the processor NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing, greedy = NoGreedy} to orient following rules strictly:
        2: quot#(s(x),s(y),z) ->
             c_3(quot#(x,y,z))  
        
      Consider the set of all dependency pairs
        1: quot#(x,0(),s(z)) -> c_1(quot#(x     
                                         ,s(z)  
                                         ,s(z)))
        2: quot#(s(x),s(y),z) ->                
             c_3(quot#(x,y,z))                  
      Processor NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing, greedy = NoGreedy}induces the complexity certificateTIME (?,O(n^1))
      SPACE(?,?)on application of the dependency pairs
        {2}
      These cover all (indirect) predecessors of dependency pairs
        {1,2}
      their number of applications is equally bounded.
      The dependency pairs are shifted into the weak component.
  *** 1.1.1.1.1.1.1 Progress [(?,O(n^1))]  ***
      Considered Problem:
        Strict DP Rules:
          quot#(x,0(),s(z)) -> c_1(quot#(x,s(z),s(z)))
          quot#(s(x),s(y),z) -> c_3(quot#(x,y,z))
        Strict TRS Rules:
          
        Weak DP Rules:
          
        Weak TRS Rules:
          
        Signature:
          {quot/3,quot#/3} / {0/0,s/1,c_1/1,c_2/0,c_3/1}
        Obligation:
          Full
          basic terms: {quot#}/{0,s}
      Applied Processor:
        NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Just first alternative for predecessorEstimation any intersect of rules of CDG leaf and strict-rules, greedy = NoGreedy}
      Proof:
        We apply a matrix interpretation of kind constructor based matrix interpretation:
        The following argument positions are considered usable:
          uargs(c_1) = {1},
          uargs(c_3) = {1}
        
        Following symbols are considered usable:
          {}
        TcT has computed the following interpretation:
              p(0) = [0]                  
           p(quot) = [1] x1 + [8] x2 + [0]
              p(s) = [1] x1 + [2]         
          p(quot#) = [8] x1 + [0]         
            p(c_1) = [1] x1 + [0]         
            p(c_2) = [4]                  
            p(c_3) = [1] x1 + [12]        
        
        Following rules are strictly oriented:
        quot#(s(x),s(y),z) = [8] x + [16]     
                           > [8] x + [12]     
                           = c_3(quot#(x,y,z))
        
        
        Following rules are (at-least) weakly oriented:
        quot#(x,0(),s(z)) =  [8] x + [0]            
                          >= [8] x + [0]            
                          =  c_1(quot#(x,s(z),s(z)))
        
  *** 1.1.1.1.1.1.1.1 Progress [(?,O(1))]  ***
      Considered Problem:
        Strict DP Rules:
          quot#(x,0(),s(z)) -> c_1(quot#(x,s(z),s(z)))
        Strict TRS Rules:
          
        Weak DP Rules:
          quot#(s(x),s(y),z) -> c_3(quot#(x,y,z))
        Weak TRS Rules:
          
        Signature:
          {quot/3,quot#/3} / {0/0,s/1,c_1/1,c_2/0,c_3/1}
        Obligation:
          Full
          basic terms: {quot#}/{0,s}
      Applied Processor:
        Assumption
      Proof:
        ()
  
  *** 1.1.1.1.1.1.2 Progress [(O(1),O(1))]  ***
      Considered Problem:
        Strict DP Rules:
          
        Strict TRS Rules:
          
        Weak DP Rules:
          quot#(x,0(),s(z)) -> c_1(quot#(x,s(z),s(z)))
          quot#(s(x),s(y),z) -> c_3(quot#(x,y,z))
        Weak TRS Rules:
          
        Signature:
          {quot/3,quot#/3} / {0/0,s/1,c_1/1,c_2/0,c_3/1}
        Obligation:
          Full
          basic terms: {quot#}/{0,s}
      Applied Processor:
        RemoveWeakSuffixes
      Proof:
        Consider the dependency graph
          1:W:quot#(x,0(),s(z)) -> c_1(quot#(x,s(z),s(z)))
             -->_1 quot#(s(x),s(y),z) -> c_3(quot#(x,y,z)):2
          
          2:W:quot#(s(x),s(y),z) -> c_3(quot#(x,y,z))
             -->_1 quot#(s(x),s(y),z) -> c_3(quot#(x,y,z)):2
             -->_1 quot#(x,0(),s(z)) -> c_1(quot#(x,s(z),s(z))):1
          
        The following weak DPs constitute a sub-graph of the DG that is closed under successors. The DPs are removed.
          1: quot#(x,0(),s(z)) -> c_1(quot#(x     
                                           ,s(z)  
                                           ,s(z)))
          2: quot#(s(x),s(y),z) ->                
               c_3(quot#(x,y,z))                  
  *** 1.1.1.1.1.1.2.1 Progress [(O(1),O(1))]  ***
      Considered Problem:
        Strict DP Rules:
          
        Strict TRS Rules:
          
        Weak DP Rules:
          
        Weak TRS Rules:
          
        Signature:
          {quot/3,quot#/3} / {0/0,s/1,c_1/1,c_2/0,c_3/1}
        Obligation:
          Full
          basic terms: {quot#}/{0,s}
      Applied Processor:
        EmptyProcessor
      Proof:
        The problem is already closed. The intended complexity is O(1).