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

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