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


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


YES

Problem:
 3(1(x1)) -> 4(1(x1))
 5(9(x1)) -> 2(6(5(x1)))
 3(5(x1)) -> 8(9(7(x1)))
 9(x1) -> 3(2(3(x1)))
 8(4(x1)) -> 6(x1)
 2(6(x1)) -> 4(3(x1))
 3(8(x1)) -> 3(2(7(x1)))
 9(x1) -> 5(0(2(x1)))
 8(8(4(x1))) -> 1(9(x1))
 7(1(x1)) -> 6(9(x1))
 3(9(x1)) -> 9(3(x1))
 7(5(x1)) -> 1(0(x1))

Proof:
 String Reversal Processor:
  1(3(x1)) -> 1(4(x1))
  9(5(x1)) -> 5(6(2(x1)))
  5(3(x1)) -> 7(9(8(x1)))
  9(x1) -> 3(2(3(x1)))
  4(8(x1)) -> 6(x1)
  6(2(x1)) -> 3(4(x1))
  8(3(x1)) -> 7(2(3(x1)))
  9(x1) -> 2(0(5(x1)))
  4(8(8(x1))) -> 9(1(x1))
  1(7(x1)) -> 9(6(x1))
  9(3(x1)) -> 3(9(x1))
  5(7(x1)) -> 0(1(x1))
  Matrix Interpretation Processor: dim=3
   
   interpretation:
              [1 0 1]  
    [5](x0) = [0 0 0]x0
              [0 1 0]  ,
    
              [1 1 0]     [0]
    [8](x0) = [1 1 0]x0 + [1]
              [0 0 1]     [0],
    
              [1 0 0]  
    [3](x0) = [0 0 1]x0
              [0 1 1]  ,
    
              [1 0 1]  
    [9](x0) = [0 0 0]x0
              [0 0 0]  ,
    
              [1 0 0]  
    [6](x0) = [0 0 0]x0
              [0 0 0]  ,
    
              [1 0 0]  
    [1](x0) = [0 0 1]x0
              [0 0 0]  ,
    
              [1 0 0]  
    [7](x0) = [0 0 0]x0
              [0 0 1]  ,
    
              [1 1 0]  
    [0](x0) = [0 0 0]x0
              [0 0 0]  ,
    
              [1 1 0]  
    [2](x0) = [0 0 0]x0
              [0 0 0]  ,
    
              [1 0 0]  
    [4](x0) = [0 0 0]x0
              [0 0 0]  
   orientation:
               [1 0 0]      [1 0 0]             
    1(3(x1)) = [0 1 1]x1 >= [0 0 0]x1 = 1(4(x1))
               [0 0 0]      [0 0 0]             
    
               [1 1 1]      [1 1 0]                
    9(5(x1)) = [0 0 0]x1 >= [0 0 0]x1 = 5(6(2(x1)))
               [0 0 0]      [0 0 0]                
    
               [1 1 1]      [1 1 1]                
    5(3(x1)) = [0 0 0]x1 >= [0 0 0]x1 = 7(9(8(x1)))
               [0 0 1]      [0 0 0]                
    
            [1 0 1]      [1 0 1]                
    9(x1) = [0 0 0]x1 >= [0 0 0]x1 = 3(2(3(x1)))
            [0 0 0]      [0 0 0]                
    
               [1 1 0]      [1 0 0]          
    4(8(x1)) = [0 0 0]x1 >= [0 0 0]x1 = 6(x1)
               [0 0 0]      [0 0 0]          
    
               [1 1 0]      [1 0 0]             
    6(2(x1)) = [0 0 0]x1 >= [0 0 0]x1 = 3(4(x1))
               [0 0 0]      [0 0 0]             
    
               [1 0 1]     [0]    [1 0 1]                
    8(3(x1)) = [1 0 1]x1 + [1] >= [0 0 0]x1 = 7(2(3(x1)))
               [0 1 1]     [0]    [0 0 0]                
    
            [1 0 1]      [1 0 1]                
    9(x1) = [0 0 0]x1 >= [0 0 0]x1 = 2(0(5(x1)))
            [0 0 0]      [0 0 0]                
    
                  [2 2 0]     [1]    [1 0 0]             
    4(8(8(x1))) = [0 0 0]x1 + [0] >= [0 0 0]x1 = 9(1(x1))
                  [0 0 0]     [0]    [0 0 0]             
    
               [1 0 0]      [1 0 0]             
    1(7(x1)) = [0 0 1]x1 >= [0 0 0]x1 = 9(6(x1))
               [0 0 0]      [0 0 0]             
    
               [1 1 1]      [1 0 1]             
    9(3(x1)) = [0 0 0]x1 >= [0 0 0]x1 = 3(9(x1))
               [0 0 0]      [0 0 0]             
    
               [1 0 1]      [1 0 1]             
    5(7(x1)) = [0 0 0]x1 >= [0 0 0]x1 = 0(1(x1))
               [0 0 0]      [0 0 0]             
   problem:
    1(3(x1)) -> 1(4(x1))
    9(5(x1)) -> 5(6(2(x1)))
    5(3(x1)) -> 7(9(8(x1)))
    9(x1) -> 3(2(3(x1)))
    4(8(x1)) -> 6(x1)
    6(2(x1)) -> 3(4(x1))
    8(3(x1)) -> 7(2(3(x1)))
    9(x1) -> 2(0(5(x1)))
    1(7(x1)) -> 9(6(x1))
    9(3(x1)) -> 3(9(x1))
    5(7(x1)) -> 0(1(x1))
   String Reversal Processor:
    3(1(x1)) -> 4(1(x1))
    5(9(x1)) -> 2(6(5(x1)))
    3(5(x1)) -> 8(9(7(x1)))
    9(x1) -> 3(2(3(x1)))
    8(4(x1)) -> 6(x1)
    2(6(x1)) -> 4(3(x1))
    3(8(x1)) -> 3(2(7(x1)))
    9(x1) -> 5(0(2(x1)))
    7(1(x1)) -> 6(9(x1))
    3(9(x1)) -> 9(3(x1))
    7(5(x1)) -> 1(0(x1))
    Matrix Interpretation Processor: dim=1
     
     interpretation:
      [5](x0) = 2x0 + 4,
      
      [8](x0) = x0,
      
      [3](x0) = x0,
      
      [9](x0) = 2x0 + 4,
      
      [6](x0) = x0,
      
      [1](x0) = 2x0 + 4,
      
      [7](x0) = x0,
      
      [0](x0) = x0,
      
      [2](x0) = x0,
      
      [4](x0) = x0
     orientation:
      3(1(x1)) = 2x1 + 4 >= 2x1 + 4 = 4(1(x1))
      
      5(9(x1)) = 4x1 + 12 >= 2x1 + 4 = 2(6(5(x1)))
      
      3(5(x1)) = 2x1 + 4 >= 2x1 + 4 = 8(9(7(x1)))
      
      9(x1) = 2x1 + 4 >= x1 = 3(2(3(x1)))
      
      8(4(x1)) = x1 >= x1 = 6(x1)
      
      2(6(x1)) = x1 >= x1 = 4(3(x1))
      
      3(8(x1)) = x1 >= x1 = 3(2(7(x1)))
      
      9(x1) = 2x1 + 4 >= 2x1 + 4 = 5(0(2(x1)))
      
      7(1(x1)) = 2x1 + 4 >= 2x1 + 4 = 6(9(x1))
      
      3(9(x1)) = 2x1 + 4 >= 2x1 + 4 = 9(3(x1))
      
      7(5(x1)) = 2x1 + 4 >= 2x1 + 4 = 1(0(x1))
     problem:
      3(1(x1)) -> 4(1(x1))
      3(5(x1)) -> 8(9(7(x1)))
      8(4(x1)) -> 6(x1)
      2(6(x1)) -> 4(3(x1))
      3(8(x1)) -> 3(2(7(x1)))
      9(x1) -> 5(0(2(x1)))
      7(1(x1)) -> 6(9(x1))
      3(9(x1)) -> 9(3(x1))
      7(5(x1)) -> 1(0(x1))
     String Reversal Processor:
      1(3(x1)) -> 1(4(x1))
      5(3(x1)) -> 7(9(8(x1)))
      4(8(x1)) -> 6(x1)
      6(2(x1)) -> 3(4(x1))
      8(3(x1)) -> 7(2(3(x1)))
      9(x1) -> 2(0(5(x1)))
      1(7(x1)) -> 9(6(x1))
      9(3(x1)) -> 3(9(x1))
      5(7(x1)) -> 0(1(x1))
      Bounds Processor:
       bound: 2
       enrichment: match
       automaton:
        final states: {18,16,15,12,9,8,7,4,1}
        transitions:
         00(19) -> 18*
         00(13) -> 14*
         02(81) -> 82*
         02(89) -> 90*
         02(57) -> 58*
         12(88) -> 89*
         40(2) -> 3*
         10(2) -> 19*
         10(3) -> 1*
         31(78) -> 79*
         31(70) -> 71*
         f100() -> 2*
         91(45) -> 46*
         91(77) -> 78*
         81(44) -> 45*
         90(5) -> 6*
         90(7) -> 15*
         90(2) -> 17*
         41(63) -> 64*
         70(6) -> 4*
         70(11) -> 9*
         50(2) -> 13*
         51(32) -> 33*
         51(20) -> 21*
         51(36) -> 37*
         80(2) -> 5*
         52(80) -> 81*
         52(56) -> 57*
         71(72) -> 73*
         71(46) -> 47*
         01(37) -> 38*
         01(33) -> 34*
         01(98) -> 99*
         01(21) -> 22*
         22(58) -> 59*
         22(82) -> 83*
         60(2) -> 7*
         11(64) -> 65*
         11(97) -> 98*
         20(10) -> 11*
         20(14) -> 12*
         30(2) -> 10*
         30(17) -> 16*
         30(3) -> 8*
         21(34) -> 35*
         21(71) -> 72*
         21(22) -> 23*
         21(38) -> 39*
         47 -> 81,21
         83 -> 78*
         35 -> 17*
         7 -> 3,20
         77 -> 80*
         16 -> 17*
         45 -> 56*
         4 -> 33,13
         11 -> 97*
         2 -> 32*
         72 -> 88*
         79 -> 78,15
         73 -> 45,56
         8 -> 7,20
         1 -> 19*
         99 -> 37*
         90 -> 57*
         65 -> 1,19
         59 -> 46*
         5 -> 36*
         9 -> 5,36
         3 -> 77,70,63,44
         39 -> 6*
         18 -> 33,13
         15 -> 19*
         23 -> 15*
       problem:
        
       Qed