MAYBE

Problem:
 t(f(x1)) -> t(c(n(x1)))
 n(f(x1)) -> f(n(x1))
 o(f(x1)) -> f(o(x1))
 n(s(x1)) -> f(s(x1))
 o(s(x1)) -> f(s(x1))
 c(f(x1)) -> f(c(x1))
 c(n(x1)) -> n(c(x1))
 c(o(x1)) -> o(c(x1))
 c(o(x1)) -> o(x1)

Proof:
 Complexity Transformation Processor:
  strict:
   t(f(x1)) -> t(c(n(x1)))
   n(f(x1)) -> f(n(x1))
   o(f(x1)) -> f(o(x1))
   n(s(x1)) -> f(s(x1))
   o(s(x1)) -> f(s(x1))
   c(f(x1)) -> f(c(x1))
   c(n(x1)) -> n(c(x1))
   c(o(x1)) -> o(c(x1))
   c(o(x1)) -> o(x1)
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   max_matrix:
    1
    interpretation:
     [s](x0) = x0,
     
     [o](x0) = x0 + 1,
     
     [c](x0) = x0 + 1,
     
     [n](x0) = x0 + 1,
     
     [t](x0) = x0,
     
     [f](x0) = x0
    orientation:
     t(f(x1)) = x1 >= x1 + 2 = t(c(n(x1)))
     
     n(f(x1)) = x1 + 1 >= x1 + 1 = f(n(x1))
     
     o(f(x1)) = x1 + 1 >= x1 + 1 = f(o(x1))
     
     n(s(x1)) = x1 + 1 >= x1 = f(s(x1))
     
     o(s(x1)) = x1 + 1 >= x1 = f(s(x1))
     
     c(f(x1)) = x1 + 1 >= x1 + 1 = f(c(x1))
     
     c(n(x1)) = x1 + 2 >= x1 + 2 = n(c(x1))
     
     c(o(x1)) = x1 + 2 >= x1 + 2 = o(c(x1))
     
     c(o(x1)) = x1 + 2 >= x1 + 1 = o(x1)
    problem:
     strict:
      t(f(x1)) -> t(c(n(x1)))
      n(f(x1)) -> f(n(x1))
      o(f(x1)) -> f(o(x1))
      c(f(x1)) -> f(c(x1))
      c(n(x1)) -> n(c(x1))
      c(o(x1)) -> o(c(x1))
     weak:
      n(s(x1)) -> f(s(x1))
      o(s(x1)) -> f(s(x1))
      c(o(x1)) -> o(x1)
    Matrix Interpretation Processor:
     dimension: 2
     max_matrix:
      [1 1]
      [0 1]
      interpretation:
                 [1 1]  
       [s](x0) = [0 0]x0,
       
                 [1 1]     [0]
       [o](x0) = [0 1]x0 + [1],
       
                   
       [c](x0) = x0,
       
                      [0]
       [n](x0) = x0 + [1],
       
                 [1 0]  
       [t](x0) = [0 0]x0,
       
                      [0]
       [f](x0) = x0 + [1]
      orientation:
                  [1 0]      [1 0]                
       t(f(x1)) = [0 0]x1 >= [0 0]x1 = t(c(n(x1)))
       
                       [0]         [0]           
       n(f(x1)) = x1 + [2] >= x1 + [2] = f(n(x1))
       
                  [1 1]     [1]    [1 1]     [0]           
       o(f(x1)) = [0 1]x1 + [2] >= [0 1]x1 + [2] = f(o(x1))
       
                       [0]         [0]           
       c(f(x1)) = x1 + [1] >= x1 + [1] = f(c(x1))
       
                       [0]         [0]           
       c(n(x1)) = x1 + [1] >= x1 + [1] = n(c(x1))
       
                  [1 1]     [0]    [1 1]     [0]           
       c(o(x1)) = [0 1]x1 + [1] >= [0 1]x1 + [1] = o(c(x1))
       
                  [1 1]     [0]    [1 1]     [0]           
       n(s(x1)) = [0 0]x1 + [1] >= [0 0]x1 + [1] = f(s(x1))
       
                  [1 1]     [0]    [1 1]     [0]           
       o(s(x1)) = [0 0]x1 + [1] >= [0 0]x1 + [1] = f(s(x1))
       
                  [1 1]     [0]    [1 1]     [0]        
       c(o(x1)) = [0 1]x1 + [1] >= [0 1]x1 + [1] = o(x1)
      problem:
       strict:
        t(f(x1)) -> t(c(n(x1)))
        n(f(x1)) -> f(n(x1))
        c(f(x1)) -> f(c(x1))
        c(n(x1)) -> n(c(x1))
        c(o(x1)) -> o(c(x1))
       weak:
        o(f(x1)) -> f(o(x1))
        n(s(x1)) -> f(s(x1))
        o(s(x1)) -> f(s(x1))
        c(o(x1)) -> o(x1)
      Matrix Interpretation Processor:
       dimension: 3
       max_matrix:
        [1 1 1]
        [0 1 1]
        [0 0 1]
        interpretation:
                   [1 0 0]     [0]
         [s](x0) = [0 0 1]x0 + [1]
                   [0 0 0]     [0],
         
                   [1 1 0]     [0]
         [o](x0) = [0 1 0]x0 + [1]
                   [0 0 1]     [1],
         
                   [1 0 1]  
         [c](x0) = [0 1 0]x0
                   [0 0 1]  ,
         
                        [0]
         [n](x0) = x0 + [1]
                        [0],
         
                   [1 0 1]  
         [t](x0) = [0 0 0]x0
                   [0 0 0]  ,
         
                   [1 0 1]     [0]
         [f](x0) = [0 1 0]x0 + [1]
                   [0 0 1]     [0]
        orientation:
                    [1 0 2]      [1 0 2]                
         t(f(x1)) = [0 0 0]x1 >= [0 0 0]x1 = t(c(n(x1)))
                    [0 0 0]      [0 0 0]                
         
                    [1 0 1]     [0]    [1 0 1]     [0]           
         n(f(x1)) = [0 1 0]x1 + [2] >= [0 1 0]x1 + [2] = f(n(x1))
                    [0 0 1]     [0]    [0 0 1]     [0]           
         
                    [1 0 2]     [0]    [1 0 2]     [0]           
         c(f(x1)) = [0 1 0]x1 + [1] >= [0 1 0]x1 + [1] = f(c(x1))
                    [0 0 1]     [0]    [0 0 1]     [0]           
         
                    [1 0 1]     [0]    [1 0 1]     [0]           
         c(n(x1)) = [0 1 0]x1 + [1] >= [0 1 0]x1 + [1] = n(c(x1))
                    [0 0 1]     [0]    [0 0 1]     [0]           
         
                    [1 1 1]     [1]    [1 1 1]     [0]           
         c(o(x1)) = [0 1 0]x1 + [1] >= [0 1 0]x1 + [1] = o(c(x1))
                    [0 0 1]     [1]    [0 0 1]     [1]           
         
                    [1 1 1]     [1]    [1 1 1]     [1]           
         o(f(x1)) = [0 1 0]x1 + [2] >= [0 1 0]x1 + [2] = f(o(x1))
                    [0 0 1]     [1]    [0 0 1]     [1]           
         
                    [1 0 0]     [0]    [1 0 0]     [0]           
         n(s(x1)) = [0 0 1]x1 + [2] >= [0 0 1]x1 + [2] = f(s(x1))
                    [0 0 0]     [0]    [0 0 0]     [0]           
         
                    [1 0 1]     [1]    [1 0 0]     [0]           
         o(s(x1)) = [0 0 1]x1 + [2] >= [0 0 1]x1 + [2] = f(s(x1))
                    [0 0 0]     [1]    [0 0 0]     [0]           
         
                    [1 1 1]     [1]    [1 1 0]     [0]        
         c(o(x1)) = [0 1 0]x1 + [1] >= [0 1 0]x1 + [1] = o(x1)
                    [0 0 1]     [1]    [0 0 1]     [1]        
        problem:
         strict:
          t(f(x1)) -> t(c(n(x1)))
          n(f(x1)) -> f(n(x1))
          c(f(x1)) -> f(c(x1))
          c(n(x1)) -> n(c(x1))
         weak:
          c(o(x1)) -> o(c(x1))
          o(f(x1)) -> f(o(x1))
          n(s(x1)) -> f(s(x1))
          o(s(x1)) -> f(s(x1))
          c(o(x1)) -> o(x1)
        Open