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


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


YES

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

Proof:
 String Reversal Processor:
  a(a(c(b(c(b(x1)))))) -> c(b(c(b(c(b(a(a(a(x1)))))))))
  Bounds Processor:
   bound: 3
   enrichment: match
   automaton:
    final states: {1}
    transitions:
     b0(7) -> 8*
     b0(9) -> 10*
     b0(5) -> 6*
     c3(95) -> 96*
     c3(97) -> 98*
     c3(99) -> 100*
     a3(91) -> 92*
     a3(93) -> 94*
     a3(92) -> 93*
     c1(47) -> 48*
     c1(45) -> 46*
     c1(15) -> 16*
     c1(17) -> 18*
     c1(19) -> 20*
     c1(49) -> 50*
     a0(4) -> 5*
     a0(2) -> 3*
     a0(3) -> 4*
     a2(81) -> 82*
     a2(51) -> 52*
     a2(52) -> 53*
     a2(83) -> 84*
     a2(82) -> 83*
     a2(53) -> 54*
     b2(56) -> 57*
     b2(84) -> 85*
     b2(54) -> 55*
     b2(88) -> 89*
     b2(86) -> 87*
     b2(58) -> 59*
     c0(6) -> 7*
     c0(10) -> 1*
     c0(8) -> 9*
     f30() -> 2*
     b1(16) -> 17*
     b1(44) -> 45*
     b1(48) -> 49*
     b1(18) -> 19*
     b1(46) -> 47*
     b1(14) -> 15*
     c2(57) -> 58*
     c2(55) -> 56*
     c2(89) -> 90*
     c2(85) -> 86*
     c2(59) -> 60*
     c2(87) -> 88*
     a1(12) -> 13*
     a1(43) -> 44*
     a1(13) -> 14*
     a1(42) -> 43*
     a1(41) -> 42*
     a1(11) -> 12*
     b3(98) -> 99*
     b3(94) -> 95*
     b3(96) -> 97*
     46 -> 81*
     7 -> 11*
     100 -> 54*
     14 -> 51*
     86 -> 91*
     60 -> 43*
     1 -> 3,4
     20 -> 5*
     90 -> 52*
     50 -> 13*
     18 -> 41*
   problem:
    
   Qed