MAYBE

Problem:
 f(f(x)) -> f(c(f(x)))
 f(f(x)) -> f(d(f(x)))
 g(c(x)) -> x
 g(d(x)) -> x
 g(c(0())) -> g(d(1()))
 g(c(1())) -> g(d(0()))

Proof:
 DP Processor:
  DPs:
   f#(f(x)) -> f#(c(f(x)))
   f#(f(x)) -> f#(d(f(x)))
   g#(c(0())) -> g#(d(1()))
   g#(c(1())) -> g#(d(0()))
  TRS:
   f(f(x)) -> f(c(f(x)))
   f(f(x)) -> f(d(f(x)))
   g(c(x)) -> x
   g(d(x)) -> x
   g(c(0())) -> g(d(1()))
   g(c(1())) -> g(d(0()))
  Usable Rule Processor:
   DPs:
    f#(f(x)) -> f#(c(f(x)))
    f#(f(x)) -> f#(d(f(x)))
    g#(c(0())) -> g#(d(1()))
    g#(c(1())) -> g#(d(0()))
   TRS:
    f(f(x)) -> f(c(f(x)))
    f(f(x)) -> f(d(f(x)))
   TDG Processor:
    DPs:
     f#(f(x)) -> f#(c(f(x)))
     f#(f(x)) -> f#(d(f(x)))
     g#(c(0())) -> g#(d(1()))
     g#(c(1())) -> g#(d(0()))
    TRS:
     f(f(x)) -> f(c(f(x)))
     f(f(x)) -> f(d(f(x)))
    graph:
     g#(c(1())) -> g#(d(0())) -> g#(c(1())) -> g#(d(0()))
     g#(c(1())) -> g#(d(0())) -> g#(c(0())) -> g#(d(1()))
     g#(c(0())) -> g#(d(1())) -> g#(c(1())) -> g#(d(0()))
     g#(c(0())) -> g#(d(1())) -> g#(c(0())) -> g#(d(1()))
     f#(f(x)) -> f#(d(f(x))) -> f#(f(x)) -> f#(d(f(x)))
     f#(f(x)) -> f#(d(f(x))) -> f#(f(x)) -> f#(c(f(x)))
     f#(f(x)) -> f#(c(f(x))) -> f#(f(x)) -> f#(d(f(x)))
     f#(f(x)) -> f#(c(f(x))) -> f#(f(x)) -> f#(c(f(x)))
    Restore Modifier:
     DPs:
      f#(f(x)) -> f#(c(f(x)))
      f#(f(x)) -> f#(d(f(x)))
      g#(c(0())) -> g#(d(1()))
      g#(c(1())) -> g#(d(0()))
     TRS:
      f(f(x)) -> f(c(f(x)))
      f(f(x)) -> f(d(f(x)))
      g(c(x)) -> x
      g(d(x)) -> x
      g(c(0())) -> g(d(1()))
      g(c(1())) -> g(d(0()))
     SCC Processor:
      #sccs: 2
      #rules: 4
      #arcs: 8/16
      DPs:
       f#(f(x)) -> f#(d(f(x)))
       f#(f(x)) -> f#(c(f(x)))
      TRS:
       f(f(x)) -> f(c(f(x)))
       f(f(x)) -> f(d(f(x)))
       g(c(x)) -> x
       g(d(x)) -> x
       g(c(0())) -> g(d(1()))
       g(c(1())) -> g(d(0()))
      Open
      
      DPs:
       g#(c(1())) -> g#(d(0()))
       g#(c(0())) -> g#(d(1()))
      TRS:
       f(f(x)) -> f(c(f(x)))
       f(f(x)) -> f(d(f(x)))
       g(c(x)) -> x
       g(d(x)) -> x
       g(c(0())) -> g(d(1()))
       g(c(1())) -> g(d(0()))
      Matrix Interpretation Processor:
       dimension: 1
       interpretation:
        [g#](x0) = x0,
        
        [1] = 0,
        
        [0] = 1,
        
        [g](x0) = x0,
        
        [d](x0) = x0,
        
        [c](x0) = x0 + 1,
        
        [f](x0) = 0
       orientation:
        g#(c(1())) = 1 >= 1 = g#(d(0()))
        
        g#(c(0())) = 2 >= 0 = g#(d(1()))
        
        f(f(x)) = 0 >= 0 = f(c(f(x)))
        
        f(f(x)) = 0 >= 0 = f(d(f(x)))
        
        g(c(x)) = x + 1 >= x = x
        
        g(d(x)) = x >= x = x
        
        g(c(0())) = 2 >= 0 = g(d(1()))
        
        g(c(1())) = 1 >= 1 = g(d(0()))
       problem:
        DPs:
         g#(c(1())) -> g#(d(0()))
        TRS:
         f(f(x)) -> f(c(f(x)))
         f(f(x)) -> f(d(f(x)))
         g(c(x)) -> x
         g(d(x)) -> x
         g(c(0())) -> g(d(1()))
         g(c(1())) -> g(d(0()))
       Matrix Interpretation Processor:
        dimension: 1
        interpretation:
         [g#](x0) = x0,
         
         [1] = 0,
         
         [0] = 0,
         
         [g](x0) = x0,
         
         [d](x0) = x0,
         
         [c](x0) = x0 + 1,
         
         [f](x0) = 1
        orientation:
         g#(c(1())) = 1 >= 0 = g#(d(0()))
         
         f(f(x)) = 1 >= 1 = f(c(f(x)))
         
         f(f(x)) = 1 >= 1 = f(d(f(x)))
         
         g(c(x)) = x + 1 >= x = x
         
         g(d(x)) = x >= x = x
         
         g(c(0())) = 1 >= 0 = g(d(1()))
         
         g(c(1())) = 1 >= 0 = g(d(0()))
        problem:
         DPs:
          
         TRS:
          f(f(x)) -> f(c(f(x)))
          f(f(x)) -> f(d(f(x)))
          g(c(x)) -> x
          g(d(x)) -> x
          g(c(0())) -> g(d(1()))
          g(c(1())) -> g(d(0()))
        Qed