YES Termination w.r.t. Q proof of Transformed_CSR_04_Ex6_GM04_iGM.ari

Termination w.r.t. Q of the given QTRS could be proven:

0 QTRS
↳1 RFCMatchBoundsTRSProof (⇔, 0 ms)
↳2 YES

(0) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

active(c) → mark(f(g(c)))
active(f(g(X))) → mark(g(X))
mark(c) → active(c)
mark(f(X)) → active(f(X))
mark(g(X)) → active(g(X))
f(mark(X)) → f(X)
f(active(X)) → f(X)
g(mark(X)) → g(X)
g(active(X)) → g(X)

Q is empty.

(1) RFCMatchBoundsTRSProof (EQUIVALENT transformation)

Termination of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 3. This implies Q-termination of R.
The following rules were used to construct the certificate:

active(c) → mark(f(g(c)))
active(f(g(X))) → mark(g(X))
mark(c) → active(c)
mark(f(X)) → active(f(X))
mark(g(X)) → active(g(X))
f(mark(X)) → f(X)
f(active(X)) → f(X)
g(mark(X)) → g(X)
g(active(X)) → g(X)

The certificate found is represented by the following graph.

The certificate consists of the following enumerated nodes:

1, 3, 6, 8, 10, 14, 16, 17, 18, 19, 22, 23

Node 1 is start node and node 3 is final node.

Those nodes are connected through the following edges:

  • 1 to 6 labelled mark_1(0), active_1(0), mark_1(1), active_1(1)
  • 1 to 10 labelled active_1(0)
  • 1 to 3 labelled f_1(0), g_1(0), f_1(1), g_1(1)
  • 1 to 14 labelled active_1(1)
  • 1 to 16 labelled mark_1(1)
  • 1 to 19 labelled active_1(2)
  • 1 to 22 labelled mark_1(2)
  • 1 to 23 labelled active_1(3)
  • 3 to 3 labelled #_1(0)
  • 6 to 8 labelled f_1(0)
  • 6 to 3 labelled g_1(0), g_1(1)
  • 8 to 10 labelled g_1(0)
  • 10 to 3 labelled c(0), f_1(0), f_1(1)
  • 14 to 8 labelled f_1(1)
  • 14 to 3 labelled g_1(1)
  • 16 to 17 labelled f_1(1)
  • 16 to 10 labelled g_1(1)
  • 17 to 18 labelled g_1(1)
  • 18 to 3 labelled c(1)
  • 19 to 3 labelled g_1(2), g_1(1)
  • 19 to 17 labelled f_1(2)
  • 19 to 10 labelled g_1(2)
  • 22 to 18 labelled g_1(2)
  • 23 to 18 labelled g_1(3)

(2) YES