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


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


YES

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

Proof:
 String Reversal Processor:
  b(b(x1)) -> d(c(x1))
  c(c(x1)) -> d(d(d(x1)))
  c(x1) -> g(x1)
  d(d(x1)) -> f(c(x1))
  d(d(d(x1))) -> c(g(x1))
  f(x1) -> g(a(x1))
  g(x1) -> b(a(d(x1)))
  g(g(x1)) -> c(b(x1))
  Matrix Interpretation Processor: dim=2
   
   interpretation:
              [1 0]     [1]
    [f](x0) = [0 0]x0 + [1],
    
              [1 2]     [0]
    [d](x0) = [0 0]x0 + [1],
    
              [1 2]     [1]
    [g](x0) = [0 0]x0 + [1],
    
              [1 0]  
    [a](x0) = [0 0]x0,
    
              [1 2]     [1]
    [b](x0) = [0 0]x0 + [1],
    
              [1 2]     [1]
    [c](x0) = [0 0]x0 + [1]
   orientation:
               [1 2]     [4]    [1 2]     [3]           
    b(b(x1)) = [0 0]x1 + [1] >= [0 0]x1 + [1] = d(c(x1))
    
               [1 2]     [4]    [1 2]     [4]              
    c(c(x1)) = [0 0]x1 + [1] >= [0 0]x1 + [1] = d(d(d(x1)))
    
            [1 2]     [1]    [1 2]     [1]        
    c(x1) = [0 0]x1 + [1] >= [0 0]x1 + [1] = g(x1)
    
               [1 2]     [2]    [1 2]     [2]           
    d(d(x1)) = [0 0]x1 + [1] >= [0 0]x1 + [1] = f(c(x1))
    
                  [1 2]     [4]    [1 2]     [4]           
    d(d(d(x1))) = [0 0]x1 + [1] >= [0 0]x1 + [1] = c(g(x1))
    
            [1 0]     [1]    [1 0]     [1]           
    f(x1) = [0 0]x1 + [1] >= [0 0]x1 + [1] = g(a(x1))
    
            [1 2]     [1]    [1 2]     [1]              
    g(x1) = [0 0]x1 + [1] >= [0 0]x1 + [1] = b(a(d(x1)))
    
               [1 2]     [4]    [1 2]     [4]           
    g(g(x1)) = [0 0]x1 + [1] >= [0 0]x1 + [1] = c(b(x1))
   problem:
    c(c(x1)) -> d(d(d(x1)))
    c(x1) -> g(x1)
    d(d(x1)) -> f(c(x1))
    d(d(d(x1))) -> c(g(x1))
    f(x1) -> g(a(x1))
    g(x1) -> b(a(d(x1)))
    g(g(x1)) -> c(b(x1))
   String Reversal Processor:
    c(c(x1)) -> d(d(d(x1)))
    c(x1) -> g(x1)
    d(d(x1)) -> c(f(x1))
    d(d(d(x1))) -> g(c(x1))
    f(x1) -> a(g(x1))
    g(x1) -> d(a(b(x1)))
    g(g(x1)) -> b(c(x1))
    Matrix Interpretation Processor: dim=3
     
     interpretation:
                [1 0 1]     [0]
      [f](x0) = [0 0 0]x0 + [1]
                [0 1 0]     [0],
      
                [1 0 1]     [0]
      [d](x0) = [0 0 0]x0 + [1]
                [0 1 0]     [1],
      
                [1 0 1]     [0]
      [g](x0) = [0 0 0]x0 + [1]
                [0 0 0]     [1],
      
                [1 0 0]  
      [a](x0) = [0 0 0]x0
                [0 0 0]  ,
      
                [1 0 0]  
      [b](x0) = [0 0 0]x0
                [0 0 0]  ,
      
                [1 0 1]     [1]
      [c](x0) = [0 0 0]x0 + [1]
                [0 1 0]     [1]
     orientation:
                 [1 1 1]     [3]    [1 1 1]     [3]              
      c(c(x1)) = [0 0 0]x1 + [1] >= [0 0 0]x1 + [1] = d(d(d(x1)))
                 [0 0 0]     [2]    [0 0 0]     [2]              
      
              [1 0 1]     [1]    [1 0 1]     [0]        
      c(x1) = [0 0 0]x1 + [1] >= [0 0 0]x1 + [1] = g(x1)
              [0 1 0]     [1]    [0 0 0]     [1]        
      
                 [1 1 1]     [1]    [1 1 1]     [1]           
      d(d(x1)) = [0 0 0]x1 + [1] >= [0 0 0]x1 + [1] = c(f(x1))
                 [0 0 0]     [2]    [0 0 0]     [2]           
      
                    [1 1 1]     [3]    [1 1 1]     [2]           
      d(d(d(x1))) = [0 0 0]x1 + [1] >= [0 0 0]x1 + [1] = g(c(x1))
                    [0 0 0]     [2]    [0 0 0]     [1]           
      
              [1 0 1]     [0]    [1 0 1]             
      f(x1) = [0 0 0]x1 + [1] >= [0 0 0]x1 = a(g(x1))
              [0 1 0]     [0]    [0 0 0]             
      
              [1 0 1]     [0]    [1 0 0]     [0]              
      g(x1) = [0 0 0]x1 + [1] >= [0 0 0]x1 + [1] = d(a(b(x1)))
              [0 0 0]     [1]    [0 0 0]     [1]              
      
                 [1 0 1]     [1]    [1 0 1]     [1]           
      g(g(x1)) = [0 0 0]x1 + [1] >= [0 0 0]x1 + [0] = b(c(x1))
                 [0 0 0]     [1]    [0 0 0]     [0]           
     problem:
      c(c(x1)) -> d(d(d(x1)))
      d(d(x1)) -> c(f(x1))
      f(x1) -> a(g(x1))
      g(x1) -> d(a(b(x1)))
      g(g(x1)) -> b(c(x1))
     String Reversal Processor:
      c(c(x1)) -> d(d(d(x1)))
      d(d(x1)) -> f(c(x1))
      f(x1) -> g(a(x1))
      g(x1) -> b(a(d(x1)))
      g(g(x1)) -> c(b(x1))
      Bounds Processor:
       bound: 5
       enrichment: match
       automaton:
        final states: {7}
        transitions:
         d2(45) -> 46*
         d2(44) -> 45*
         d2(95) -> 96*
         d2(43) -> 44*
         c0(7) -> 7*
         d5(193) -> 194*
         d5(197) -> 198*
         c3(113) -> 114*
         c3(110) -> 111*
         g4(163) -> 164*
         g4(170) -> 171*
         g2(89) -> 90*
         a1(23) -> 24*
         a1(26) -> 27*
         a5(194) -> 195*
         a5(198) -> 199*
         b3(149) -> 150*
         g1(24) -> 25*
         f0(7) -> 7*
         b5(199) -> 200*
         b5(195) -> 196*
         b4(181) -> 182*
         b4(185) -> 186*
         b4(174) -> 175*
         d0(7) -> 7*
         b1(160) -> 161*
         b1(33) -> 34*
         b1(27) -> 28*
         b1(191) -> 192*
         b1(99) -> 100*
         c1(34) -> 35*
         c1(16) -> 17*
         c1(61) -> 62*
         a4(162) -> 163*
         a4(169) -> 170*
         a4(184) -> 185*
         a4(180) -> 181*
         a4(173) -> 174*
         g0(7) -> 7*
         a3(148) -> 149*
         a3(136) -> 137*
         a3(124) -> 125*
         a3(133) -> 134*
         c2(54) -> 55*
         c2(68) -> 69*
         c2(51) -> 52*
         c2(120) -> 121*
         b0(7) -> 7*
         d3(147) -> 148*
         f3(114) -> 115*
         f3(111) -> 112*
         a0(7) -> 7*
         f1(17) -> 18*
         d4(172) -> 173*
         d4(183) -> 184*
         d4(179) -> 180*
         g3(137) -> 138*
         g3(134) -> 135*
         g3(125) -> 126*
         b2(97) -> 98*
         a2(96) -> 97*
         a2(88) -> 89*
         f2(69) -> 70*
         f2(52) -> 53*
         f2(55) -> 56*
         d1(14) -> 15*
         d1(13) -> 14*
         d1(12) -> 13*
         d1(36) -> 37*
         196 -> 164,115
         192 -> 34*
         56 -> 13,26
         163 -> 193*
         70 -> 15,7,23,12,16,33
         43 -> 110*
         24 -> 99,95
         164 -> 115,46
         17 -> 88*
         115 -> 46,17
         35 -> 7*
         46 -> 52,17
         137 -> 172*
         126 -> 70,15,88
         182 -> 135,14
         69 -> 124*
         7 -> 33,23,16,12
         100 -> 34*
         112 -> 45*
         12 -> 51*
         14 -> 61,54
         114 -> 162*
         28 -> 7*
         53 -> 14*
         52 -> 133*
         171 -> 112,45
         121 -> 52*
         150 -> 90,7,68,26
         138 -> 56,13,26,68
         186 -> 126,70,88
         161 -> 34*
         170 -> 197*
         36 -> 120*
         125 -> 191,183
         135 -> 53,14,61
         44 -> 113*
         13 -> 68,26
         62 -> 17*
         90 -> 18,7
         175 -> 138*
         55 -> 136*
         34 -> 43,36
         37 -> 13*
         134 -> 179*
         18 -> 13,26,7
         15 -> 52,17,7
         98 -> 25*
         89 -> 160,147
         200 -> 171,45
         25 -> 7*
         111 -> 169*
       problem:
        
       Qed