/export/starexec/sandbox/solver/bin/starexec_run_ttt2-1.17+nonreach /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:
   [c](x0) = x0 + 12,
   
   [d](x0) = x0 + 15,
   
   [b](x0) = x0 + 9,
   
   [a](x0) = x0 + 6
  orientation:
   a(a(a(x1))) = x1 + 18 >= x1 + 18 = b(b(x1))
   
   b(b(b(x1))) = x1 + 27 >= x1 + 27 = c(d(x1))
   
   c(x1) = x1 + 12 >= x1 + 12 = a(a(x1))
   
   d(x1) = x1 + 15 >= x1 + 12 = 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:
     f40() -> 2*
     b0(2) -> 3*
     b0(3) -> 1*
     c0(5) -> 4*
     d0(2) -> 5*
     a0(7) -> 6*
     a0(2) -> 7*
     a1(12) -> 13*
     a1(11) -> 12*
     b1(17) -> 18*
     b1(18) -> 19*
     1 -> 7,6
     4 -> 3,1
     5 -> 11*
     11 -> 17*
     13 -> 4*
     19 -> 6*
   problem:
    
   Qed