YES
0 QTRS
↳1 RFCMatchBoundsTRSProof (⇔, 0 ms)
↳2 YES
f(f(X)) → c
c → d
h(X) → c
f(f(X)) → c
c → d
h(X) → c
The certificate consists of the following enumerated nodes:
2, 4
Node 2 is start node and node 4 is final node.
Those nodes are connected through the following edges: