/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:
 a(b(x1)) -> d(x1)
 b(a(x1)) -> a(b(x1))
 d(c(x1)) -> f(a(b(b(c(x1)))))
 d(f(x1)) -> f(a(b(x1)))
 a(f(x1)) -> a(x1)

Proof:
 Bounds Processor:
  bound: 1
  enrichment: match
  automaton:
   final states: {11,10,5,3,1}
   transitions:
    d1(12) -> 13*
    d1(18) -> 19*
    a1(22) -> 23*
    a1(24) -> 25*
    f50() -> 2*
    d0(2) -> 1*
    a0(2) -> 11*
    a0(4) -> 3*
    a0(8) -> 9*
    b0(7) -> 8*
    b0(2) -> 4*
    b0(6) -> 7*
    f0(9) -> 5*
    f0(3) -> 10*
    c0(2) -> 6*
    1 -> 11*
    2 -> 18*
    3 -> 24,4
    5 -> 19,1,3
    7 -> 12*
    9 -> 22*
    10 -> 19,1,3
    13 -> 9*
    19 -> 3*
    23 -> 25,3,4
    25 -> 3,4
  problem:
   
  Qed