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

Proof:
 String Reversal Processor:
  a(c(b(x1))) -> b(a(x1))
  b(b(b(x1))) -> c(a(c(x1)))
  d(c(x1)) -> c(d(x1))
  b(d(c(x1))) -> c(c(d(x1)))
  c(d(x1)) -> b(b(b(x1)))
  b(c(x1)) -> a(d(x1))
  c(b(d(x1))) -> a(a(x1))
  a(d(x1)) -> b(x1)
  Matrix Interpretation Processor: dim=1
   
   interpretation:
    [d](x0) = x0 + 2,
    
    [b](x0) = x0 + 1,
    
    [c](x0) = x0 + 1,
    
    [a](x0) = x0
   orientation:
    a(c(b(x1))) = x1 + 2 >= x1 + 1 = b(a(x1))
    
    b(b(b(x1))) = x1 + 3 >= x1 + 2 = c(a(c(x1)))
    
    d(c(x1)) = x1 + 3 >= x1 + 3 = c(d(x1))
    
    b(d(c(x1))) = x1 + 4 >= x1 + 4 = c(c(d(x1)))
    
    c(d(x1)) = x1 + 3 >= x1 + 3 = b(b(b(x1)))
    
    b(c(x1)) = x1 + 2 >= x1 + 2 = a(d(x1))
    
    c(b(d(x1))) = x1 + 4 >= x1 = a(a(x1))
    
    a(d(x1)) = x1 + 2 >= x1 + 1 = b(x1)
   problem:
    d(c(x1)) -> c(d(x1))
    b(d(c(x1))) -> c(c(d(x1)))
    c(d(x1)) -> b(b(b(x1)))
    b(c(x1)) -> a(d(x1))
   Bounds Processor:
    bound: 2
    enrichment: match
    automaton:
     final states: {8,5,4,1}
     transitions:
      b1(10) -> 11*
      b1(9) -> 10*
      b1(11) -> 12*
      a1(21) -> 22*
      d1(20) -> 21*
      c1(23) -> 24*
      b2(32) -> 33*
      b2(31) -> 32*
      b2(33) -> 34*
      f40() -> 2*
      c0(1) -> 4*
      c0(3) -> 1*
      d0(2) -> 3*
      b0(7) -> 5*
      b0(2) -> 6*
      b0(6) -> 7*
      a0(3) -> 8*
      1 -> 32,10,6,3
      2 -> 9*
      3 -> 20*
      8 -> 10,6
      12 -> 1*
      20 -> 31*
      21 -> 23*
      22 -> 33,11,32,7
      24 -> 21*
      34 -> 24,21,23
    problem:
     
    Qed