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

Proof:
 Matrix Interpretation Processor: dim=1
  
  interpretation:
   [d](x0) = x0 + 6,
   
   [b](x0) = x0 + 9,
   
   [c](x0) = x0 + 9,
   
   [a](x0) = x0 + 9
  orientation:
   a(a(x1)) = x1 + 18 >= x1 + 18 = b(c(x1))
   
   b(b(x1)) = x1 + 18 >= x1 + 15 = c(d(x1))
   
   c(c(x1)) = x1 + 18 >= x1 + 18 = d(d(d(x1)))
   
   d(d(d(x1))) = x1 + 18 >= x1 + 18 = a(c(x1))
  problem:
   a(a(x1)) -> b(c(x1))
   c(c(x1)) -> d(d(d(x1)))
   d(d(d(x1))) -> a(c(x1))
  String Reversal Processor:
   a(a(x1)) -> c(b(x1))
   c(c(x1)) -> d(d(d(x1)))
   d(d(d(x1))) -> c(a(x1))
   Bounds Processor:
    bound: 2
    enrichment: match
    automaton:
     final states: {7,4,1}
     transitions:
      c1(10) -> 11*
      a1(9) -> 10*
      a1(31) -> 32*
      a1(33) -> 34*
      d1(15) -> 16*
      d1(17) -> 18*
      d1(16) -> 17*
      c2(27) -> 28*
      a2(26) -> 27*
      f40() -> 2*
      c0(8) -> 7*
      c0(3) -> 1*
      b0(2) -> 3*
      d0(5) -> 6*
      d0(2) -> 5*
      d0(6) -> 4*
      a0(2) -> 8*
      1 -> 10,8
      2 -> 9*
      3 -> 15*
      7 -> 5,6
      11 -> 6,4
      15 -> 26*
      16 -> 31*
      17 -> 33*
      18 -> 11,4,7
      28 -> 18,7
      32 -> 10*
      34 -> 10*
    problem:
     
    Qed