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


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


YES

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

Proof:
 String Reversal Processor:
  b(a(b(a(a(b(x1)))))) -> a(b(a(b(a(b(a(x1)))))))
  Bounds Processor:
   bound: 1
   enrichment: match
   automaton:
    final states: {1}
    transitions:
     a1(23) -> 24*
     a1(25) -> 26*
     a1(19) -> 20*
     a1(27) -> 28*
     a1(49) -> 50*
     a1(21) -> 22*
     a1(31) -> 32*
     a1(51) -> 52*
     a1(55) -> 56*
     a1(17) -> 18*
     a1(29) -> 30*
     a1(53) -> 54*
     f20() -> 2*
     a0(6) -> 7*
     a0(2) -> 3*
     a0(4) -> 5*
     a0(8) -> 1*
     b0(3) -> 4*
     b0(7) -> 8*
     b0(5) -> 6*
     b1(30) -> 31*
     b1(20) -> 21*
     b1(52) -> 53*
     b1(54) -> 55*
     b1(26) -> 27*
     b1(18) -> 19*
     b1(50) -> 51*
     b1(22) -> 23*
     b1(28) -> 29*
     56 -> 29*
     24 -> 8*
     7 -> 17*
     1 -> 53,4,6
     5 -> 25*
     3 -> 49*
     32 -> 21*
   problem:
    
   Qed