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


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


YES

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

Proof:
 String Reversal Processor:
  a(c(b(x1))) -> c(b(a(b(a(x1)))))
  b(x1) -> c(c(x1))
  d(c(x1)) -> a(c(b(a(x1))))
  a(a(x1)) -> a(b(c(a(x1))))
  Bounds Processor:
   bound: 2
   enrichment: match
   automaton:
    final states: {11,9,7,1}
    transitions:
     c0(4) -> 10*
     c0(3) -> 12*
     c0(2) -> 8*
     c0(6) -> 1*
     c0(8) -> 7*
     c2(64) -> 65*
     c2(51) -> 52*
     c2(85) -> 86*
     c2(65) -> 66*
     c2(102) -> 103*
     c2(48) -> 49*
     c2(103) -> 104*
     c2(89) -> 90*
     c2(50) -> 51*
     c2(88) -> 89*
     c2(86) -> 87*
     c2(47) -> 48*
     a0(13) -> 11*
     a0(4) -> 5*
     a0(10) -> 9*
     a0(2) -> 3*
     a1(22) -> 23*
     a1(108) -> 109*
     a1(60) -> 61*
     a1(76) -> 77*
     a1(98) -> 99*
     a1(78) -> 79*
     a1(20) -> 21*
     b1(100) -> 101*
     b1(23) -> 24*
     b1(62) -> 63*
     b1(79) -> 80*
     b1(21) -> 22*
     b1(77) -> 78*
     c1(39) -> 40*
     c1(24) -> 25*
     c1(27) -> 28*
     c1(61) -> 62*
     c1(80) -> 81*
     c1(36) -> 37*
     c1(38) -> 39*
     c1(99) -> 100*
     c1(35) -> 36*
     c1(26) -> 27*
     f40() -> 2*
     b0(12) -> 13*
     b0(5) -> 6*
     b0(3) -> 4*
     100 -> 102*
     104 -> 101,76
     77 -> 88*
     12 -> 38*
     63 -> 20*
     66 -> 63,20
     28 -> 6*
     4 -> 98*
     11 -> 3*
     2 -> 60*
     52 -> 24*
     109 -> 61*
     21 -> 47*
     79 -> 85*
     101 -> 76*
     13 -> 108*
     40 -> 13*
     1 -> 61,3
     49 -> 22*
     62 -> 64*
     90 -> 78*
     37 -> 4*
     5 -> 76,26
     3 -> 35,20
     87 -> 80*
     81 -> 21,47
     25 -> 9*
     23 -> 50*
   problem:
    
   Qed