/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:
 g(c(x1)) -> g(f(c(x1)))
 g(f(c(x1))) -> g(f(f(c(x1))))
 g(g(x1)) -> g(f(g(x1)))
 f(f(g(x1))) -> g(f(x1))

Proof:
 Bounds Processor:
  bound: 2
  enrichment: match
  automaton:
   final states: {10,7,5,1}
   transitions:
    g1(30) -> 31*
    g1(15) -> 16*
    g1(26) -> 27*
    g1(28) -> 29*
    f1(27) -> 28*
    f1(34) -> 35*
    f1(14) -> 15*
    f1(13) -> 14*
    c1(12) -> 13*
    g2(42) -> 43*
    g2(44) -> 45*
    f2(43) -> 44*
    f30() -> 2*
    g0(2) -> 8*
    g0(9) -> 7*
    g0(4) -> 1*
    g0(11) -> 10*
    g0(6) -> 5*
    f0(2) -> 11*
    f0(4) -> 6*
    f0(8) -> 9*
    f0(3) -> 4*
    c0(2) -> 3*
    1 -> 8*
    2 -> 12*
    5 -> 10*
    6 -> 30*
    7 -> 8*
    10 -> 11*
    11 -> 26*
    16 -> 1*
    28 -> 42*
    29 -> 27,34,10,11
    31 -> 27*
    35 -> 28*
    45 -> 27*
  problem:
   
  Qed