/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(b(x1))) -> a(x1)
 a(b(a(x1))) -> b(b(a(x1)))
 b(b(x1)) -> a(a(a(x1)))

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