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

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