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


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


YES

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

Proof:
 String Reversal Processor:
  b(c(c(b(a(b(x1)))))) -> a(b(c(c(b(b(a(x1)))))))
  Bounds Processor:
   bound: 1
   enrichment: match
   automaton:
    final states: {4}
    transitions:
     a1(19) -> 20*
     a1(21) -> 22*
     a1(13) -> 14*
     c1(16) -> 17*
     c1(17) -> 18*
     b1(15) -> 16*
     b1(18) -> 19*
     b1(14) -> 15*
     b0(4) -> 4*
     a0(4) -> 4*
     c0(4) -> 4*
     4 -> 13*
     22 -> 14*
     20 -> 4*
     18 -> 21*
   problem:
    
   Qed