/export/starexec/sandbox/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


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


YES

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

Proof:
 String Reversal Processor:
  strict:
   a(c(b(x1))) -> b(a(b(a(x1))))
   a(a(x1)) -> a(b(c(a(x1))))
  weak:
   b(x1) -> b(c(x1))
  Bounds Processor:
   bound: 2
   enrichment: match-rt
   automaton:
    final states: {4}
    transitions:
     b1(60) -> 61*
     b1(22) -> 23*
     b1(58) -> 59*
     a1(20) -> 21*
     a1(89) -> 90*
     a1(59) -> 60*
     a1(173) -> 174*
     a1(23) -> 24*
     c1(25) -> 26*
     c1(76) -> 77*
     c1(21) -> 22*
     a2(40) -> 41*
     a2(142) -> 143*
     a2(137) -> 138*
     a2(37) -> 38*
     a2(139) -> 140*
     a2(109) -> 110*
     a2(106) -> 107*
     a0(4) -> 4*
     b2(112) -> 113*
     b2(74) -> 75*
     b2(39) -> 40*
     b2(121) -> 122*
     b2(138) -> 139*
     b2(108) -> 109*
     b2(140) -> 141*
     c0(4) -> 4*
     c2(192) -> 193*
     c2(107) -> 108*
     c2(87) -> 88*
     c2(194) -> 195*
     c2(216) -> 217*
     c2(111) -> 112*
     c2(218) -> 219*
     c2(123) -> 124*
     c2(73) -> 74*
     c2(38) -> 39*
     c2(175) -> 176*
     c2(120) -> 121*
     b0(4) -> 4*
     4 -> 76,20
     21 -> 58*
     22 -> 73*
     23 -> 37*
     24 -> 21,25,4
     26 -> 22*
     39 -> 87*
     41 -> 21*
     58 -> 111*
     59 -> 106*
     60 -> 142,120,89
     61 -> 143,90,21,4
     74 -> 123*
     75 -> 23*
     77 -> 60*
     88 -> 39*
     90 -> 58*
     108 -> 192*
     110 -> 143,90
     112 -> 194*
     113 -> 59*
     121 -> 175,173,137
     122 -> 61*
     124 -> 74*
     138 -> 218*
     140 -> 216*
     141 -> 143,90
     143 -> 138*
     174 -> 58*
     176 -> 121*
     193 -> 108*
     195 -> 112*
     217 -> 140*
     219 -> 138*
   problem:
    strict:
     a(c(b(x1))) -> b(a(b(a(x1))))
    weak:
     b(x1) -> b(c(x1))
   Bounds Processor:
    bound: 2
    enrichment: match-rt
    automaton:
     final states: {4}
     transitions:
      b1(11) -> 12*
      b1(13) -> 14*
      a1(55) -> 56*
      a1(15) -> 16*
      a1(10) -> 11*
      a1(12) -> 13*
      c1(25) -> 26*
      c1(44) -> 45*
      c1(21) -> 22*
      a2(27) -> 28*
      a2(29) -> 30*
      a2(53) -> 54*
      a0(4) -> 4*
      b2(30) -> 31*
      b2(62) -> 63*
      b2(49) -> 50*
      b2(28) -> 29*
      c0(4) -> 4*
      c2(70) -> 71*
      c2(72) -> 73*
      c2(64) -> 65*
      c2(61) -> 62*
      c2(46) -> 47*
      c2(48) -> 49*
      b0(4) -> 4*
      4 -> 25,10
      11 -> 61,44
      13 -> 48,27,21,15
      14 -> 28,16,11,4
      16 -> 11*
      22 -> 13*
      26 -> 13*
      28 -> 46*
      30 -> 64*
      31 -> 28,16
      45 -> 11*
      47 -> 28*
      49 -> 72,55,53
      50 -> 14*
      54 -> 28*
      56 -> 11*
      62 -> 70*
      63 -> 12*
      65 -> 30*
      71 -> 62*
      73 -> 49*
    problem:
     strict:
      
     weak:
      b(x1) -> b(c(x1))
    Qed