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

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