/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(g(x)) -> g(g(f(x)))
 f(g(x)) -> g(g(g(x)))

Proof:
 Bounds Processor:
  bound: 0
  enrichment: match
  automaton:
   final states: {5,1}
   transitions:
    f20() -> 2*
    g0(7) -> 5*
    g0(2) -> 6*
    g0(4) -> 1*
    g0(6) -> 7*
    g0(3) -> 4*
    f0(2) -> 3*
    1 -> 3*
    5 -> 3*
  problem:
   
  Qed