/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


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


YES

Problem:
 f(X) -> g(n__h(n__f(X)))
 h(X) -> n__h(X)
 f(X) -> n__f(X)
 activate(n__h(X)) -> h(activate(X))
 activate(n__f(X)) -> f(activate(X))
 activate(X) -> X

Proof:
 String Reversal Processor:
  f(X) -> n__f(n__h(g(X)))
  h(X) -> n__h(X)
  f(X) -> n__f(X)
  n__h(activate(X)) -> activate(h(X))
  n__f(activate(X)) -> activate(f(X))
  activate(X) -> X
  Bounds Processor:
   bound: 1
   enrichment: match
   automaton:
    final states: {2,9,7,6,5,1}
    transitions:
     n__f1(23) -> 24*
     n__f1(13) -> 14*
     n__h1(12) -> 13*
     n__h1(21) -> 22*
     g1(11) -> 12*
     f60() -> 2*
     n__f0(2) -> 6*
     n__f0(4) -> 1*
     n__h0(2) -> 5*
     n__h0(3) -> 4*
     g0(2) -> 3*
     activate0(10) -> 9*
     activate0(8) -> 7*
     h0(2) -> 8*
     f0(2) -> 10*
     2 -> 23,21,11
     7 -> 22,8,5
     8 -> 7*
     9 -> 24,10,6
     10 -> 9*
     14 -> 10*
     22 -> 8*
     24 -> 10*
   problem:
    
   Qed