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


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


YES

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

Proof:
 String Reversal Processor:
  b(a(x1)) -> a(b(x1))
  a(b(x1)) -> b(c(a(x1)))
  Bounds Processor:
   bound: 1
   enrichment: match
   automaton:
    final states: {4,1}
    transitions:
     b0(2) -> 3*
     b0(6) -> 4*
     b1(9) -> 10*
     c0(5) -> 6*
     a0(3) -> 1*
     a0(2) -> 5*
     f30() -> 2*
     c1(8) -> 9*
     a1(15) -> 16*
     a1(7) -> 8*
     16 -> 8*
     4 -> 8,5
     2 -> 7*
     1 -> 3*
     9 -> 15*
     10 -> 1*
   problem:
    
   Qed