YES
proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


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

(0) QTRS
(1) QTRS Reverse [EQUIVALENT, 0 ms]
(2) QTRS
(3) RFCMatchBoundsTRSProof [EQUIVALENT, 0 ms]
(4) YES


----------------------------------------

(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))
   bits(0) -> 0
   bits(s(x)) -> s(bits(half(s(x))))

Q is empty.

----------------------------------------

(1) QTRS Reverse (EQUIVALENT)
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'(bits(x)) -> 0'(x)
   s(bits(x)) -> s(half(bits(s(x))))

Q is empty.

----------------------------------------

(3) RFCMatchBoundsTRSProof (EQUIVALENT)
Termination of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 1. 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'(bits(x)) -> 0'(x)
   s(bits(x)) -> s(half(bits(s(x))))

The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
24, 25, 26, 27, 28, 29, 33, 34, 35, 36

Node 24 is start node and node 25 is final node.

Those nodes are connected through the following edges:

* 24 to 25 labelled 0'_1(0), 0'_1(1)* 24 to 26 labelled half_1(0)* 24 to 27 labelled s_1(0)* 25 to 25 labelled #_1(0)* 26 to 25 labelled s_1(0)* 26 to 33 labelled half_1(1)* 26 to 34 labelled s_1(1)* 27 to 28 labelled half_1(0)* 28 to 29 labelled bits_1(0)* 29 to 25 labelled s_1(0)* 29 to 33 labelled half_1(1)* 29 to 34 labelled s_1(1)* 33 to 25 labelled s_1(1)* 33 to 33 labelled half_1(1)* 33 to 34 labelled s_1(1)* 34 to 35 labelled half_1(1)* 35 to 36 labelled bits_1(1)* 36 to 25 labelled s_1(1)* 36 to 33 labelled half_1(1)* 36 to 34 labelled s_1(1)


----------------------------------------

(4)
YES