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

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