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


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


YES

Problem:
 0(1(2(3(4(x1))))) -> 0(2(1(3(4(x1)))))
 0(5(1(2(4(3(x1)))))) -> 0(5(2(1(4(3(x1))))))
 0(5(2(4(1(3(x1)))))) -> 0(1(5(2(4(3(x1))))))
 0(5(3(1(2(4(x1)))))) -> 0(1(5(3(2(4(x1))))))
 0(5(4(1(3(2(x1)))))) -> 0(5(4(3(1(2(x1))))))

Proof:
 String Reversal Processor:
  4(3(2(1(0(x1))))) -> 4(3(1(2(0(x1)))))
  3(4(2(1(5(0(x1)))))) -> 3(4(1(2(5(0(x1))))))
  3(1(4(2(5(0(x1)))))) -> 3(4(2(5(1(0(x1))))))
  4(2(1(3(5(0(x1)))))) -> 4(2(3(5(1(0(x1))))))
  2(3(1(4(5(0(x1)))))) -> 2(1(3(4(5(0(x1))))))
  Bounds Processor:
   bound: 0
   enrichment: match
   automaton:
    final states: {20,17,12,7,1}
    transitions:
     00(2) -> 3*
     40(15) -> 16*
     40(6) -> 1*
     40(8) -> 21*
     40(19) -> 17*
     40(10) -> 11*
     20(3) -> 4*
     20(23) -> 20*
     20(14) -> 15*
     20(18) -> 19*
     20(8) -> 9*
     10(22) -> 23*
     10(4) -> 5*
     10(9) -> 10*
     10(3) -> 13*
     30(16) -> 12*
     30(5) -> 6*
     30(21) -> 22*
     30(11) -> 7*
     30(14) -> 18*
     50(13) -> 14*
     50(3) -> 8*
     f60() -> 2*
   problem:
    
   Qed