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


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


YES
proof of /export/starexec/sandbox2/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) QTRSRRRProof [EQUIVALENT, 27 ms]
(2) QTRS
(3) RisEmptyProof [EQUIVALENT, 0 ms]
(4) YES


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

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

   2nd(cons(X, n__cons(Y, Z))) -> activate(Y)
   from(X) -> cons(X, n__from(n__s(X)))
   cons(X1, X2) -> n__cons(X1, X2)
   from(X) -> n__from(X)
   s(X) -> n__s(X)
   activate(n__cons(X1, X2)) -> cons(activate(X1), X2)
   activate(n__from(X)) -> from(activate(X))
   activate(n__s(X)) -> s(activate(X))
   activate(X) -> X

Q is empty.

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

(1) QTRSRRRProof (EQUIVALENT)
Used ordering:
Quasi precedence:
[2nd_1, activate_1] > from_1 > cons_2 > n__cons_2
[2nd_1, activate_1] > from_1 > n__from_1 > n__cons_2
[2nd_1, activate_1] > from_1 > n__s_1 > n__cons_2
[2nd_1, activate_1] > s_1 > n__s_1 > n__cons_2


Status:
2nd_1: multiset status
cons_2: multiset status
n__cons_2: multiset status
activate_1: multiset status
from_1: multiset status
n__from_1: multiset status
n__s_1: multiset status
s_1: multiset status

With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

   2nd(cons(X, n__cons(Y, Z))) -> activate(Y)
   from(X) -> cons(X, n__from(n__s(X)))
   cons(X1, X2) -> n__cons(X1, X2)
   from(X) -> n__from(X)
   s(X) -> n__s(X)
   activate(n__cons(X1, X2)) -> cons(activate(X1), X2)
   activate(n__from(X)) -> from(activate(X))
   activate(n__s(X)) -> s(activate(X))
   activate(X) -> X




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

(2)
Obligation:
Q restricted rewrite system:
R is empty.
Q is empty.

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

(3) RisEmptyProof (EQUIVALENT)
The TRS R is empty. Hence, termination is trivially proven.
----------------------------------------

(4)
YES