MAYBE

Problem:
 p(a(x0),p(b(x1),p(a(x2),x3))) -> p(x2,p(a(a(x0)),p(b(x1),x3)))

Proof:
 DP Processor:
  DPs:
   p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(b(x1),x3)
   p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(a(a(x0)),p(b(x1),x3))
   p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(x2,p(a(a(x0)),p(b(x1),x3)))
  TRS:
   p(a(x0),p(b(x1),p(a(x2),x3))) -> p(x2,p(a(a(x0)),p(b(x1),x3)))
  ADG Processor:
   DPs:
    p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(b(x1),x3)
    p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(a(a(x0)),p(b(x1),x3))
    p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(x2,p(a(a(x0)),p(b(x1),x3)))
   TRS:
    p(a(x0),p(b(x1),p(a(x2),x3))) -> p(x2,p(a(a(x0)),p(b(x1),x3)))
   graph:
    p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(a(a(x0)),p(b(x1),x3)) ->
    p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(b(x1),x3)
    p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(a(a(x0)),p(b(x1),x3)) ->
    p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(a(a(x0)),p(b(x1),x3))
    p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(a(a(x0)),p(b(x1),x3)) ->
    p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(x2,p(a(a(x0)),p(b(x1),x3)))
    p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(x2,p(a(a(x0)),p(b(x1),x3))) ->
    p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(b(x1),x3)
    p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(x2,p(a(a(x0)),p(b(x1),x3))) ->
    p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(a(a(x0)),p(b(x1),x3))
    p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(x2,p(a(a(x0)),p(b(x1),x3))) ->
    p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(x2,p(a(a(x0)),p(b(x1),x3)))
   Restore Modifier:
    DPs:
     p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(b(x1),x3)
     p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(a(a(x0)),p(b(x1),x3))
     p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(x2,p(a(a(x0)),p(b(x1),x3)))
    TRS:
     p(a(x0),p(b(x1),p(a(x2),x3))) -> p(x2,p(a(a(x0)),p(b(x1),x3)))
    SCC Processor:
     #sccs: 1
     #rules: 2
     #arcs: 6/9
     DPs:
      p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(a(a(x0)),p(b(x1),x3))
      p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(x2,p(a(a(x0)),p(b(x1),x3)))
     TRS:
      p(a(x0),p(b(x1),p(a(x2),x3))) -> p(x2,p(a(a(x0)),p(b(x1),x3)))
     Matrix Interpretation Processor:
      dimension: 1
      interpretation:
       [p#](x0, x1) = x1,
       
       [p](x0, x1) = x1 + 1,
       
       [b](x0) = 0,
       
       [a](x0) = 0
      orientation:
       p#(a(x0),p(b(x1),p(a(x2),x3))) = x3 + 2 >= x3 + 1 = p#(a(a(x0)),p(b(x1),x3))
       
       p#(a(x0),p(b(x1),p(a(x2),x3))) = x3 + 2 >= x3 + 2 = p#(x2,p(a(a(x0)),p(b(x1),x3)))
       
       p(a(x0),p(b(x1),p(a(x2),x3))) = x3 + 3 >= x3 + 3 = p(x2,p(a(a(x0)),p(b(x1),x3)))
      problem:
       DPs:
        p#(a(x0),p(b(x1),p(a(x2),x3))) -> p#(x2,p(a(a(x0)),p(b(x1),x3)))
       TRS:
        p(a(x0),p(b(x1),p(a(x2),x3))) -> p(x2,p(a(a(x0)),p(b(x1),x3)))
      Open