MAYBE

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

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