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


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


YES

Problem:
 strict:
  f(g(f(x))) -> f(g(g(g(f(x)))))
 weak:
  g(x) -> g(g(x))

Proof:
 Bounds Processor:
  bound: 1
  enrichment: match-rt
  automaton:
   final states: {2,1}
   transitions:
    f1(4) -> 5*
    f1(18) -> 19*
    f1(8) -> 9*
    g1(25) -> 26*
    g1(20) -> 21*
    g1(5) -> 6*
    g1(7) -> 8*
    g1(26) -> 27*
    g1(6) -> 7*
    g1(28) -> 29*
    f0(2) -> 1*
    f0(1) -> 1*
    g0(2) -> 2*
    g0(1) -> 2*
    1 -> 25,18
    2 -> 28,4
    7 -> 21,6
    9 -> 5,20,1
    19 -> 5*
    21 -> 6*
    27 -> 29,2
    29 -> 26*
  problem:
   strict:
    
   weak:
    g(x) -> g(g(x))
  Qed