MAYBE

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

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