/export/starexec/sandbox/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES

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

Proof:
 String Reversal Processor:
  b(b(a(x1))) -> a(x1)
  a(a(x1)) -> b(b(b(x1)))
  a(b(b(x1))) -> a(b(a(x1)))
  DP Processor:
   DPs:
    a#(a(x1)) -> b#(x1)
    a#(a(x1)) -> b#(b(x1))
    a#(a(x1)) -> b#(b(b(x1)))
    a#(b(b(x1))) -> a#(x1)
    a#(b(b(x1))) -> b#(a(x1))
    a#(b(b(x1))) -> a#(b(a(x1)))
   TRS:
    b(b(a(x1))) -> a(x1)
    a(a(x1)) -> b(b(b(x1)))
    a(b(b(x1))) -> a(b(a(x1)))
   TDG Processor:
    DPs:
     a#(a(x1)) -> b#(x1)
     a#(a(x1)) -> b#(b(x1))
     a#(a(x1)) -> b#(b(b(x1)))
     a#(b(b(x1))) -> a#(x1)
     a#(b(b(x1))) -> b#(a(x1))
     a#(b(b(x1))) -> a#(b(a(x1)))
    TRS:
     b(b(a(x1))) -> a(x1)
     a(a(x1)) -> b(b(b(x1)))
     a(b(b(x1))) -> a(b(a(x1)))
    graph:
     a#(b(b(x1))) -> a#(b(a(x1))) -> a#(b(b(x1))) -> a#(b(a(x1)))
     a#(b(b(x1))) -> a#(b(a(x1))) -> a#(b(b(x1))) -> b#(a(x1))
     a#(b(b(x1))) -> a#(b(a(x1))) -> a#(b(b(x1))) -> a#(x1)
     a#(b(b(x1))) -> a#(b(a(x1))) -> a#(a(x1)) -> b#(b(b(x1)))
     a#(b(b(x1))) -> a#(b(a(x1))) -> a#(a(x1)) -> b#(b(x1))
     a#(b(b(x1))) -> a#(b(a(x1))) -> a#(a(x1)) -> b#(x1)
     a#(b(b(x1))) -> a#(x1) -> a#(b(b(x1))) -> a#(b(a(x1)))
     a#(b(b(x1))) -> a#(x1) -> a#(b(b(x1))) -> b#(a(x1))
     a#(b(b(x1))) -> a#(x1) -> a#(b(b(x1))) -> a#(x1)
     a#(b(b(x1))) -> a#(x1) -> a#(a(x1)) -> b#(b(b(x1)))
     a#(b(b(x1))) -> a#(x1) -> a#(a(x1)) -> b#(b(x1))
     a#(b(b(x1))) -> a#(x1) -> a#(a(x1)) -> b#(x1)
    SCC Processor:
     #sccs: 1
     #rules: 2
     #arcs: 12/36
     DPs:
      a#(b(b(x1))) -> a#(b(a(x1)))
      a#(b(b(x1))) -> a#(x1)
     TRS:
      b(b(a(x1))) -> a(x1)
      a(a(x1)) -> b(b(b(x1)))
      a(b(b(x1))) -> a(b(a(x1)))
     Arctic Interpretation Processor:
      dimension: 2
      usable rules:
       b(b(a(x1))) -> a(x1)
       a(a(x1)) -> b(b(b(x1)))
       a(b(b(x1))) -> a(b(a(x1)))
      interpretation:
       [a#](x0) = [-& 0 ]x0 + [0],
       
                 [-& 2 ]     [0]
       [a](x0) = [0  2 ]x0 + [1],
       
                 [0  2 ]     [1]
       [b](x0) = [0  -&]x0 + [0]
      orientation:
       a#(b(b(x1))) = [0 2]x1 + [1] >= [-& 2 ]x1 + [0] = a#(b(a(x1)))
       
       a#(b(b(x1))) = [0 2]x1 + [1] >= [-& 0 ]x1 + [0] = a#(x1)
       
                     [2 4]     [3]    [-& 2 ]     [0]        
       b(b(a(x1))) = [2 4]x1 + [3] >= [0  2 ]x1 + [1] = a(x1)
       
                  [2 4]     [3]    [2 4]     [3]              
       a(a(x1)) = [2 4]x1 + [3] >= [2 2]x1 + [2] = b(b(b(x1)))
       
                     [2 4]     [3]    [-& 4 ]     [2]              
       a(b(b(x1))) = [2 4]x1 + [3] >= [2  4 ]x1 + [3] = a(b(a(x1)))
      problem:
       DPs:
        a#(b(b(x1))) -> a#(b(a(x1)))
       TRS:
        b(b(a(x1))) -> a(x1)
        a(a(x1)) -> b(b(b(x1)))
        a(b(b(x1))) -> a(b(a(x1)))
      Restore Modifier:
       DPs:
        a#(b(b(x1))) -> a#(b(a(x1)))
       TRS:
        b(b(a(x1))) -> a(x1)
        a(a(x1)) -> b(b(b(x1)))
        a(b(b(x1))) -> a(b(a(x1)))
       EDG Processor:
        DPs:
         a#(b(b(x1))) -> a#(b(a(x1)))
        TRS:
         b(b(a(x1))) -> a(x1)
         a(a(x1)) -> b(b(b(x1)))
         a(b(b(x1))) -> a(b(a(x1)))
        graph:
         a#(b(b(x1))) -> a#(b(a(x1))) -> a#(b(b(x1))) -> a#(b(a(x1)))
        Arctic Interpretation Processor:
         dimension: 2
         usable rules:
          b(b(a(x1))) -> a(x1)
          a(a(x1)) -> b(b(b(x1)))
          a(b(b(x1))) -> a(b(a(x1)))
         interpretation:
          [a#](x0) = [-& 0 ]x0 + [0],
          
                    [-& 0 ]     [0]
          [a](x0) = [0  2 ]x0 + [2],
          
                    [-& 1 ]     [1 ]
          [b](x0) = [0  -&]x0 + [-&]
         orientation:
          a#(b(b(x1))) = [-& 1 ]x1 + [1] >= [-& 0 ]x1 + [0] = a#(b(a(x1)))
          
                        [-& 1 ]     [1]    [-& 0 ]     [0]        
          b(b(a(x1))) = [1  3 ]x1 + [3] >= [0  2 ]x1 + [2] = a(x1)
          
                     [0 2]     [2]    [-& 2 ]     [2]              
          a(a(x1)) = [2 4]x1 + [4] >= [1  -&]x1 + [1] = b(b(b(x1)))
          
                        [-& 1 ]     [1]    [-& 0 ]     [0]              
          a(b(b(x1))) = [1  3 ]x1 + [3] >= [1  3 ]x1 + [3] = a(b(a(x1)))
         problem:
          DPs:
           
          TRS:
           b(b(a(x1))) -> a(x1)
           a(a(x1)) -> b(b(b(x1)))
           a(b(b(x1))) -> a(b(a(x1)))
         Qed