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


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


YES

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

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