MAYBE

Problem:
 a(x1) -> x1
 a(b(x1)) -> a(c(b(b(c(x1)))))
 b(x1) -> x1
 c(c(x1)) -> a(x1)

Proof:
 DP Processor:
  DPs:
   a#(b(x1)) -> c#(x1)
   a#(b(x1)) -> b#(c(x1))
   a#(b(x1)) -> b#(b(c(x1)))
   a#(b(x1)) -> c#(b(b(c(x1))))
   a#(b(x1)) -> a#(c(b(b(c(x1)))))
   c#(c(x1)) -> a#(x1)
  TRS:
   a(x1) -> x1
   a(b(x1)) -> a(c(b(b(c(x1)))))
   b(x1) -> x1
   c(c(x1)) -> a(x1)
  TDG Processor:
   DPs:
    a#(b(x1)) -> c#(x1)
    a#(b(x1)) -> b#(c(x1))
    a#(b(x1)) -> b#(b(c(x1)))
    a#(b(x1)) -> c#(b(b(c(x1))))
    a#(b(x1)) -> a#(c(b(b(c(x1)))))
    c#(c(x1)) -> a#(x1)
   TRS:
    a(x1) -> x1
    a(b(x1)) -> a(c(b(b(c(x1)))))
    b(x1) -> x1
    c(c(x1)) -> a(x1)
   graph:
    c#(c(x1)) -> a#(x1) -> a#(b(x1)) -> a#(c(b(b(c(x1)))))
    c#(c(x1)) -> a#(x1) -> a#(b(x1)) -> c#(b(b(c(x1))))
    c#(c(x1)) -> a#(x1) -> a#(b(x1)) -> b#(b(c(x1)))
    c#(c(x1)) -> a#(x1) -> a#(b(x1)) -> b#(c(x1))
    c#(c(x1)) -> a#(x1) -> a#(b(x1)) -> c#(x1)
    a#(b(x1)) -> c#(b(b(c(x1)))) -> c#(c(x1)) -> a#(x1)
    a#(b(x1)) -> c#(x1) -> c#(c(x1)) -> a#(x1)
    a#(b(x1)) -> a#(c(b(b(c(x1))))) ->
    a#(b(x1)) -> a#(c(b(b(c(x1)))))
    a#(b(x1)) -> a#(c(b(b(c(x1))))) -> a#(b(x1)) -> c#(b(b(c(x1))))
    a#(b(x1)) -> a#(c(b(b(c(x1))))) -> a#(b(x1)) -> b#(b(c(x1)))
    a#(b(x1)) -> a#(c(b(b(c(x1))))) -> a#(b(x1)) -> b#(c(x1))
    a#(b(x1)) -> a#(c(b(b(c(x1))))) -> a#(b(x1)) -> c#(x1)
   SCC Processor:
    #sccs: 1
    #rules: 4
    #arcs: 12/36
    DPs:
     c#(c(x1)) -> a#(x1)
     a#(b(x1)) -> c#(x1)
     a#(b(x1)) -> c#(b(b(c(x1))))
     a#(b(x1)) -> a#(c(b(b(c(x1)))))
    TRS:
     a(x1) -> x1
     a(b(x1)) -> a(c(b(b(c(x1)))))
     b(x1) -> x1
     c(c(x1)) -> a(x1)
    Open