MAYBE

Problem:
 a(a(x)) -> b(b(x))
 b(b(a(x))) -> a(b(b(x)))

Proof:
 DP Processor:
  DPs:
   a#(a(x)) -> b#(x)
   a#(a(x)) -> b#(b(x))
   b#(b(a(x))) -> b#(x)
   b#(b(a(x))) -> b#(b(x))
   b#(b(a(x))) -> a#(b(b(x)))
  TRS:
   a(a(x)) -> b(b(x))
   b(b(a(x))) -> a(b(b(x)))
  ADG Processor:
   DPs:
    a#(a(x)) -> b#(x)
    a#(a(x)) -> b#(b(x))
    b#(b(a(x))) -> b#(x)
    b#(b(a(x))) -> b#(b(x))
    b#(b(a(x))) -> a#(b(b(x)))
   TRS:
    a(a(x)) -> b(b(x))
    b(b(a(x))) -> a(b(b(x)))
   graph:
    b#(b(a(x))) -> b#(b(x)) -> b#(b(a(x))) -> b#(x)
    b#(b(a(x))) -> b#(b(x)) -> b#(b(a(x))) -> b#(b(x))
    b#(b(a(x))) -> b#(b(x)) -> b#(b(a(x))) -> a#(b(b(x)))
    b#(b(a(x))) -> b#(x) -> b#(b(a(x))) -> b#(x)
    b#(b(a(x))) -> b#(x) -> b#(b(a(x))) -> b#(b(x))
    b#(b(a(x))) -> b#(x) -> b#(b(a(x))) -> a#(b(b(x)))
    b#(b(a(x))) -> a#(b(b(x))) -> a#(a(x)) -> b#(x)
    b#(b(a(x))) -> a#(b(b(x))) -> a#(a(x)) -> b#(b(x))
    a#(a(x)) -> b#(b(x)) -> b#(b(a(x))) -> b#(x)
    a#(a(x)) -> b#(b(x)) -> b#(b(a(x))) -> b#(b(x))
    a#(a(x)) -> b#(b(x)) -> b#(b(a(x))) -> a#(b(b(x)))
    a#(a(x)) -> b#(x) -> b#(b(a(x))) -> b#(x)
    a#(a(x)) -> b#(x) -> b#(b(a(x))) -> b#(b(x))
    a#(a(x)) -> b#(x) -> b#(b(a(x))) -> a#(b(b(x)))
   Restore Modifier:
    DPs:
     a#(a(x)) -> b#(x)
     a#(a(x)) -> b#(b(x))
     b#(b(a(x))) -> b#(x)
     b#(b(a(x))) -> b#(b(x))
     b#(b(a(x))) -> a#(b(b(x)))
    TRS:
     a(a(x)) -> b(b(x))
     b(b(a(x))) -> a(b(b(x)))
    SCC Processor:
     #sccs: 1
     #rules: 5
     #arcs: 14/25
     DPs:
      b#(b(a(x))) -> b#(b(x))
      b#(b(a(x))) -> a#(b(b(x)))
      a#(a(x)) -> b#(b(x))
      b#(b(a(x))) -> b#(x)
      a#(a(x)) -> b#(x)
     TRS:
      a(a(x)) -> b(b(x))
      b(b(a(x))) -> a(b(b(x)))
     Open