/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


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


YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 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, 26 ms]
(4) YES


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

(0)
Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:

   f(f(X)) -> c(n__f(g(n__f(X))))
   c(X) -> d(activate(X))
   h(X) -> c(n__d(X))
   f(X) -> n__f(X)
   d(X) -> n__d(X)
   activate(n__f(X)) -> f(X)
   activate(n__d(X)) -> d(X)
   activate(X) -> 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:

   f(f(X)) -> n__f(g(n__f(c(X))))
   c(X) -> activate(d(X))
   h(X) -> n__d(c(X))
   f(X) -> n__f(X)
   d(X) -> n__d(X)
   n__f(activate(X)) -> f(X)
   n__d(activate(X)) -> d(X)
   activate(X) -> X

Q is empty.

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

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

   f(f(X)) -> n__f(g(n__f(c(X))))
   c(X) -> activate(d(X))
   h(X) -> n__d(c(X))
   f(X) -> n__f(X)
   d(X) -> n__d(X)
   n__f(activate(X)) -> f(X)
   n__d(activate(X)) -> d(X)
   activate(X) -> X

The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
3, 4, 13, 14, 15, 16, 17, 19, 20, 21, 22, 26

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

Those nodes are connected through the following edges:

* 3 to 13 labelled n__f_1(0)* 3 to 16 labelled activate_1(0)* 3 to 15 labelled n__d_1(0)* 3 to 4 labelled n__f_1(0), n__d_1(0), f_1(0), d_1(0), g_1(0), c_1(0), activate_1(0), h_1(0), n__f_1(1), n__d_1(1), d_1(1), f_1(1), g_1(1), c_1(1), activate_1(1), h_1(1), n__d_1(2), n__f_1(2), c_1(2), d_1(2), n__d_1(3), d_1(3), n__d_1(4), d_1(4), n__d_1(5)* 3 to 17 labelled activate_1(1), d_1(1), n__d_1(2)* 3 to 19 labelled n__f_1(1)* 3 to 22 labelled activate_1(2), f_1(1), d_1(1), activate_1(1), f_1(2), d_1(2), d_1(3), f_1(3), n__f_1(2), n__d_1(2), n__f_1(3), n__d_1(3), n__d_1(4), n__f_1(4), n__d_1(1), d_1(4), n__d_1(5)* 3 to 26 labelled activate_1(3), f_1(1), d_1(1), activate_1(1), f_1(2), d_1(2), activate_1(2), d_1(3), f_1(3), d_1(4), n__f_1(2), n__d_1(2), n__f_1(3), n__d_1(3), n__d_1(4), n__f_1(4), n__d_1(5), n__d_1(1)* 4 to 4 labelled #_1(0), c_1(1), c_1(2), d_1(3), n__d_1(4), n__d_1(3), d_1(4), n__d_1(5), d_1(1), d_1(2), n__d_1(2)* 4 to 22 labelled activate_1(2), d_1(3), n__d_1(4), n__d_1(3), d_1(4), n__d_1(5)* 4 to 26 labelled activate_1(3), d_1(4), d_1(3), n__d_1(5), n__d_1(4), n__d_1(3)* 13 to 14 labelled g_1(0)* 14 to 15 labelled n__f_1(0)* 14 to 17 labelled f_1(1), n__f_1(2)* 15 to 4 labelled c_1(0), d_1(2), n__d_1(3), n__d_1(2), d_1(1)* 15 to 17 labelled activate_1(1)* 15 to 22 labelled d_1(3), d_1(2), n__d_1(4), n__d_1(3), n__d_1(2)* 15 to 26 labelled d_1(4), d_1(3), n__d_1(5), n__d_1(4), d_1(2), n__d_1(3), n__d_1(2)* 16 to 4 labelled d_1(0), n__d_1(1), d_1(1), n__d_1(2)* 16 to 22 labelled d_1(2), n__d_1(3), d_1(3), n__d_1(4)* 16 to 26 labelled d_1(2), d_1(3), n__d_1(3), n__d_1(4)* 17 to 4 labelled d_1(1), n__d_1(2)* 17 to 22 labelled d_1(3), n__d_1(4)* 17 to 26 labelled d_1(3), n__d_1(4)* 19 to 20 labelled g_1(1)* 20 to 21 labelled n__f_1(1)* 20 to 22 labelled f_1(2), n__f_1(3)* 21 to 4 labelled c_1(1), d_1(3), n__d_1(4), n__d_1(3), d_1(1), d_1(2), n__d_1(2)* 21 to 22 labelled activate_1(2), d_1(3), n__d_1(4), n__d_1(3)* 21 to 26 labelled d_1(4), d_1(3), n__d_1(5), n__d_1(4), n__d_1(3)* 22 to 4 labelled d_1(2), n__d_1(3), d_1(1), n__d_1(2)* 22 to 22 labelled d_1(3), n__d_1(4)* 22 to 26 labelled d_1(4), n__d_1(5), d_1(3), n__d_1(4)* 26 to 4 labelled d_1(3), n__d_1(4), d_1(1), n__d_1(2)* 26 to 22 labelled d_1(3), n__d_1(4)* 26 to 26 labelled d_1(4), n__d_1(5), d_1(3), n__d_1(4)


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

(4)
YES