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


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


YES

Problem:
 f(f(X)) -> f(g(f(g(f(X)))))
 f(g(f(X))) -> f(g(X))

Proof:
 Bounds Processor:
  bound: 1
  enrichment: match
  automaton:
   final states: {7,1}
   transitions:
    f1(16) -> 17*
    f1(13) -> 14*
    f20() -> 2*
    f0(6) -> 1*
    f0(2) -> 3*
    f0(4) -> 5*
    f0(8) -> 7*
    g0(3) -> 4*
    g0(2) -> 8*
    g0(5) -> 6*
    g1(12) -> 13*
    g1(33) -> 34*
    g1(27) -> 28*
    g1(29) -> 30*
    g1(23) -> 24*
    g1(15) -> 16*
    24 -> 16*
    17 -> 1*
    30 -> 13*
    7 -> 3*
    14 -> 5*
    16 -> 27*
    28 -> 13*
    4 -> 15*
    2 -> 12*
    6 -> 29*
    13 -> 23*
    8 -> 33*
    1 -> 3*
    34 -> 13*
  problem:
   
  Qed