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

Proof:
 Matrix Interpretation Processor: dim=1
  
  interpretation:
   [d](x0) = x0 + 6,
   
   [c](x0) = x0 + 12,
   
   [b](x0) = x0 + 4,
   
   [a](x0) = x0 + 3
  orientation:
   a(a(a(x1))) = x1 + 9 >= x1 + 8 = b(b(x1))
   
   b(b(b(x1))) = x1 + 12 >= x1 + 12 = c(x1)
   
   c(x1) = x1 + 12 >= x1 + 12 = d(d(x1))
   
   d(x1) = x1 + 6 >= x1 + 6 = a(a(x1))
  problem:
   b(b(b(x1))) -> c(x1)
   c(x1) -> d(d(x1))
   d(x1) -> a(a(x1))
  Bounds Processor:
   bound: 3
   enrichment: match
   automaton:
    final states: {5}
    transitions:
     a1(17) -> 18*
     a1(18) -> 19*
     d1(10) -> 11*
     d1(11) -> 12*
     c1(8) -> 9*
     a2(35) -> 36*
     a2(29) -> 30*
     a2(36) -> 37*
     a2(28) -> 29*
     d2(20) -> 21*
     d2(21) -> 22*
     b0(5) -> 5*
     a3(47) -> 48*
     a3(39) -> 40*
     a3(46) -> 47*
     a3(38) -> 39*
     c0(5) -> 5*
     d0(5) -> 5*
     a0(5) -> 5*
     5 -> 17,10,8
     8 -> 20*
     9 -> 5*
     10 -> 35*
     11 -> 28*
     12 -> 5*
     19 -> 5*
     20 -> 46*
     21 -> 38*
     22 -> 9,5
     30 -> 12*
     37 -> 11*
     40 -> 22*
     48 -> 21*
   problem:
    
   Qed