/export/starexec/sandbox/solver/bin/starexec_run_ttt2 /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES

Problem:
 a(b(x1)) -> C(x1)
 b(c(x1)) -> A(x1)
 c(a(x1)) -> B(x1)
 A(C(x1)) -> b(x1)
 C(B(x1)) -> a(x1)
 B(A(x1)) -> c(x1)
 a(a(a(a(a(x1))))) -> A(A(A(x1)))
 A(A(A(A(x1)))) -> a(a(a(a(x1))))
 b(b(b(b(b(x1))))) -> B(B(B(x1)))
 B(B(B(B(x1)))) -> b(b(b(b(x1))))
 c(c(c(c(c(x1))))) -> C(C(C(x1)))
 C(C(C(C(x1)))) -> c(c(c(c(x1))))
 B(a(a(a(a(x1))))) -> c(A(A(A(x1))))
 A(A(A(b(x1)))) -> a(a(a(a(C(x1)))))
 C(b(b(b(b(x1))))) -> a(B(B(B(x1))))
 B(B(B(c(x1)))) -> b(b(b(b(A(x1)))))
 A(c(c(c(c(x1))))) -> b(C(C(C(x1))))
 C(C(C(a(x1)))) -> c(c(c(c(B(x1)))))
 a(A(x1)) -> x1
 A(a(x1)) -> x1
 b(B(x1)) -> x1
 B(b(x1)) -> x1
 c(C(x1)) -> x1
 C(c(x1)) -> x1

Proof:
 Matrix Interpretation Processor: dim=1
  
  interpretation:
   [A](x0) = x0 + 3,
   
   [a](x0) = x0 + 2,
   
   [c](x0) = x0 + 2,
   
   [B](x0) = x0 + 3,
   
   [b](x0) = x0 + 2,
   
   [C](x0) = x0 + 3
  orientation:
   a(b(x1)) = x1 + 4 >= x1 + 3 = C(x1)
   
   b(c(x1)) = x1 + 4 >= x1 + 3 = A(x1)
   
   c(a(x1)) = x1 + 4 >= x1 + 3 = B(x1)
   
   A(C(x1)) = x1 + 6 >= x1 + 2 = b(x1)
   
   C(B(x1)) = x1 + 6 >= x1 + 2 = a(x1)
   
   B(A(x1)) = x1 + 6 >= x1 + 2 = c(x1)
   
   a(a(a(a(a(x1))))) = x1 + 10 >= x1 + 9 = A(A(A(x1)))
   
   A(A(A(A(x1)))) = x1 + 12 >= x1 + 8 = a(a(a(a(x1))))
   
   b(b(b(b(b(x1))))) = x1 + 10 >= x1 + 9 = B(B(B(x1)))
   
   B(B(B(B(x1)))) = x1 + 12 >= x1 + 8 = b(b(b(b(x1))))
   
   c(c(c(c(c(x1))))) = x1 + 10 >= x1 + 9 = C(C(C(x1)))
   
   C(C(C(C(x1)))) = x1 + 12 >= x1 + 8 = c(c(c(c(x1))))
   
   B(a(a(a(a(x1))))) = x1 + 11 >= x1 + 11 = c(A(A(A(x1))))
   
   A(A(A(b(x1)))) = x1 + 11 >= x1 + 11 = a(a(a(a(C(x1)))))
   
   C(b(b(b(b(x1))))) = x1 + 11 >= x1 + 11 = a(B(B(B(x1))))
   
   B(B(B(c(x1)))) = x1 + 11 >= x1 + 11 = b(b(b(b(A(x1)))))
   
   A(c(c(c(c(x1))))) = x1 + 11 >= x1 + 11 = b(C(C(C(x1))))
   
   C(C(C(a(x1)))) = x1 + 11 >= x1 + 11 = c(c(c(c(B(x1)))))
   
   a(A(x1)) = x1 + 5 >= x1 = x1
   
   A(a(x1)) = x1 + 5 >= x1 = x1
   
   b(B(x1)) = x1 + 5 >= x1 = x1
   
   B(b(x1)) = x1 + 5 >= x1 = x1
   
   c(C(x1)) = x1 + 5 >= x1 = x1
   
   C(c(x1)) = x1 + 5 >= x1 = x1
  problem:
   B(a(a(a(a(x1))))) -> c(A(A(A(x1))))
   A(A(A(b(x1)))) -> a(a(a(a(C(x1)))))
   C(b(b(b(b(x1))))) -> a(B(B(B(x1))))
   B(B(B(c(x1)))) -> b(b(b(b(A(x1)))))
   A(c(c(c(c(x1))))) -> b(C(C(C(x1))))
   C(C(C(a(x1)))) -> c(c(c(c(B(x1)))))
  String Reversal Processor:
   a(a(a(a(B(x1))))) -> A(A(A(c(x1))))
   b(A(A(A(x1)))) -> C(a(a(a(a(x1)))))
   b(b(b(b(C(x1))))) -> B(B(B(a(x1))))
   c(B(B(B(x1)))) -> A(b(b(b(b(x1)))))
   c(c(c(c(A(x1))))) -> C(C(C(b(x1))))
   a(C(C(C(x1)))) -> B(c(c(c(c(x1)))))
   Bounds Processor:
    bound: 0
    enrichment: match
    automaton:
     final states: {22,19,14,11,6,1}
     transitions:
      A0(5) -> 1*
      A0(3) -> 4*
      A0(4) -> 5*
      A0(18) -> 14*
      f60() -> 2*
      b0(15) -> 16*
      b0(17) -> 18*
      b0(2) -> 15*
      b0(16) -> 17*
      B0(12) -> 13*
      B0(13) -> 11*
      B0(7) -> 12*
      B0(25) -> 22*
      c0(24) -> 25*
      c0(2) -> 3*
      c0(3) -> 23*
      c0(23) -> 24*
      a0(7) -> 8*
      a0(9) -> 10*
      a0(8) -> 9*
      a0(2) -> 7*
      C0(20) -> 21*
      C0(10) -> 6*
      C0(15) -> 20*
      C0(21) -> 19*
      19 -> 3,23,24,25
      14 -> 3*
      11 -> 15,16,17,18
      22 -> 7*
      6 -> 15*
      1 -> 7,8,9,10
    problem:
     
    Qed