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

Proof:
 Matrix Interpretation Processor: dim=2
  
  interpretation:
             [1 0]  
   [c](x0) = [0 0]x0,
   
             [1 1]  
   [a](x0) = [0 1]x0,
   
             [1 1]     [0]
   [b](x0) = [0 3]x0 + [3]
  orientation:
              [1 4]     [3]    [1 4]     [0]                 
   a(b(x1)) = [0 3]x1 + [3] >= [0 3]x1 + [3] = b(a(a(a(x1))))
   
              [1 2]     [0]    [1 2]             
   b(a(x1)) = [0 3]x1 + [3] >= [0 1]x1 = a(a(x1))
   
              [1 2]      [1 1]                
   a(a(x1)) = [0 1]x1 >= [0 0]x1 = a(c(b(x1)))
  problem:
   b(a(x1)) -> a(a(x1))
   a(a(x1)) -> a(c(b(x1)))
  Bounds Processor:
   bound: 1
   enrichment: match
   automaton:
    final states: {4,1}
    transitions:
     a1(9) -> 10*
     c1(8) -> 9*
     b1(15) -> 16*
     b1(7) -> 8*
     f30() -> 2*
     a0(2) -> 3*
     a0(6) -> 4*
     a0(3) -> 1*
     c0(5) -> 6*
     b0(2) -> 5*
     1 -> 8,5
     2 -> 7*
     4 -> 3*
     6 -> 15*
     10 -> 1*
     16 -> 8*
   problem:
    
   Qed