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


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


YES

Problem:
 a(a(a(x1))) -> b(b(x1))
 b(b(b(x1))) -> c(d(x1))
 c(x1) -> a(a(x1))
 d(x1) -> c(x1)

Proof:
 Matrix Interpretation Processor: dim=1
  
  interpretation:
   [b](x0) = x0 + 3,
   
   [c](x0) = x0 + 4,
   
   [a](x0) = x0 + 2,
   
   [d](x0) = x0 + 5
  orientation:
   a(a(a(x1))) = x1 + 6 >= x1 + 6 = b(b(x1))
   
   b(b(b(x1))) = x1 + 9 >= x1 + 9 = c(d(x1))
   
   c(x1) = x1 + 4 >= x1 + 4 = a(a(x1))
   
   d(x1) = x1 + 5 >= x1 + 4 = c(x1)
  problem:
   a(a(a(x1))) -> b(b(x1))
   b(b(b(x1))) -> c(d(x1))
   c(x1) -> a(a(x1))
  Bounds Processor:
   bound: 1
   enrichment: match
   automaton:
    final states: {6,4,1}
    transitions:
     b0(3) -> 1*
     b0(2) -> 3*
     d0(2) -> 5*
     b1(17) -> 18*
     b1(18) -> 19*
     a1(12) -> 13*
     a1(11) -> 12*
     a0(2) -> 7*
     a0(7) -> 6*
     f40() -> 2*
     c0(5) -> 4*
     19 -> 6*
     4 -> 3,1
     11 -> 17*
     13 -> 4*
     1 -> 7,6
     5 -> 11*
   problem:
    
   Qed