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

0 QTRS
↳1 QTRS Reverse (⇔)
↳2 QTRS
↳3 RFCMatchBoundsTRSProof (⇔)
↳4 TRUE

(0) Obligation:

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

half(0) → 0
half(s(0)) → 0
half(s(s(x))) → s(half(x))
s(log(0)) → s(0)
log(s(x)) → s(log(half(s(x))))

Q is empty.

(1) QTRS Reverse (EQUIVALENT transformation)

We applied the QTRS Reverse Processor [REVERSE].

(2) Obligation:

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

0'(half(x)) → 0'(x)
0'(s(half(x))) → 0'(x)
s(s(half(x))) → half(s(x))
0'(log(s(x))) → 0'(s(x))
s(log(x)) → s(half(log(s(x))))

Q is empty.

(3) RFCMatchBoundsTRSProof (EQUIVALENT transformation)

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

0'(half(x)) → 0'(x)
0'(s(half(x))) → 0'(x)
s(s(half(x))) → half(s(x))
0'(log(s(x))) → 0'(s(x))
s(log(x)) → s(half(log(s(x))))

The certificate found is represented by the following graph.

The certificate consists of the following enumerated nodes:

2651054, 2651055, 2651056, 2651059, 2651057, 2651058, 2651060, 2651061, 2651062, 2651063

Node 2651054 is start node and node 2651055 is final node.

Those nodes are connect through the following edges:

  • 2651054 to 2651056 labelled half_1(0), 0'_1(0)
  • 2651054 to 2651055 labelled 0'_1(0), 0'_1(1)
  • 2651054 to 2651057 labelled s_1(0)
  • 2651054 to 2651060 labelled 0'_1(1), 0'_1(2)
  • 2651054 to 2651062 labelled 0'_1(1), 0'_1(2)
  • 2651055 to 2651055 labelled #_1(0)
  • 2651056 to 2651055 labelled s_1(0)
  • 2651056 to 2651060 labelled half_1(1)
  • 2651056 to 2651061 labelled s_1(1)
  • 2651059 to 2651055 labelled s_1(0)
  • 2651059 to 2651060 labelled half_1(1)
  • 2651059 to 2651061 labelled s_1(1)
  • 2651057 to 2651058 labelled half_1(0)
  • 2651058 to 2651059 labelled log_1(0)
  • 2651060 to 2651055 labelled s_1(1), s_1(2)
  • 2651060 to 2651060 labelled half_1(1)
  • 2651060 to 2651061 labelled s_1(1), s_1(2)
  • 2651061 to 2651062 labelled half_1(1)
  • 2651062 to 2651063 labelled log_1(1)
  • 2651063 to 2651055 labelled s_1(1)
  • 2651063 to 2651060 labelled half_1(1)
  • 2651063 to 2651061 labelled s_1(1)

(4) TRUE