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

Proof:
 Matrix Interpretation Processor: dim=1
  
  interpretation:
   [f](x0) = x0 + 10,
   
   [d](x0) = x0 + 8,
   
   [b](x0) = x0 + 10,
   
   [c](x0) = x0 + 12,
   
   [a](x0) = x0 + 11
  orientation:
   a(a(x1)) = x1 + 22 >= x1 + 22 = b(c(x1))
   
   b(b(x1)) = x1 + 20 >= x1 + 20 = c(d(x1))
   
   c(c(x1)) = x1 + 24 >= x1 + 24 = d(d(d(x1)))
   
   d(c(x1)) = x1 + 20 >= x1 + 20 = b(f(x1))
   
   d(d(d(x1))) = x1 + 24 >= x1 + 23 = a(c(x1))
   
   f(f(x1)) = x1 + 20 >= x1 + 20 = f(b(x1))
  problem:
   a(a(x1)) -> b(c(x1))
   b(b(x1)) -> c(d(x1))
   c(c(x1)) -> d(d(d(x1)))
   d(c(x1)) -> b(f(x1))
   f(f(x1)) -> f(b(x1))
  Bounds Processor:
   bound: 0
   enrichment: match
   automaton:
    final states: {10,8,6,4,1}
    transitions:
     f50() -> 2*
     b0(2) -> 11*
     b0(9) -> 8*
     b0(3) -> 1*
     c0(5) -> 4*
     c0(2) -> 3*
     d0(5) -> 7*
     d0(7) -> 6*
     d0(2) -> 5*
     f0(2) -> 9*
     f0(11) -> 10*
     4 -> 11*
     6 -> 3*
     8 -> 5*
     10 -> 9*
   problem:
    
   Qed