MAYBE

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

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