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


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


YES

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

Proof:
 String Reversal Processor:
  b(b(a(a(x1)))) -> a(a(a(b(b(b(x1))))))
  Bounds Processor:
   bound: 3
   enrichment: match
   automaton:
    final states: {1}
    transitions:
     a1(34) -> 35*
     a1(11) -> 12*
     a1(32) -> 33*
     a1(12) -> 13*
     a1(33) -> 34*
     a1(13) -> 14*
     a2(41) -> 42*
     a2(60) -> 61*
     a2(40) -> 41*
     a2(39) -> 40*
     a2(62) -> 63*
     a2(61) -> 62*
     b1(30) -> 31*
     b1(31) -> 32*
     b1(10) -> 11*
     b1(29) -> 30*
     b1(8) -> 9*
     b1(9) -> 10*
     f20() -> 2*
     b0(3) -> 4*
     b0(4) -> 5*
     b0(2) -> 3*
     a0(5) -> 6*
     a0(6) -> 7*
     a0(7) -> 1*
     b2(57) -> 58*
     b2(36) -> 37*
     b2(38) -> 39*
     b2(58) -> 59*
     b2(37) -> 38*
     b2(59) -> 60*
     b3(65) -> 66*
     b3(66) -> 67*
     b3(64) -> 65*
     a3(69) -> 70*
     a3(68) -> 69*
     a3(67) -> 68*
     70 -> 39*
     35 -> 10*
     42 -> 31*
     63 -> 37*
     14 -> 5*
     11 -> 36*
     6 -> 8*
     13 -> 29*
     1 -> 3,4
     61 -> 64*
     33 -> 57*
   problem:
    
   Qed