YES
proof of Transformed_CSR_04_Ex4_7_56_Bor03_Z.trs
# AProVE Commit ID: c69e44bd14796315568835c1ffa2502984884775 jera 20211004 unpublished


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

(0) QTRS
(1) QTRSRRRProof [EQUIVALENT, 60 ms]
(2) QTRS
(3) RisEmptyProof [EQUIVALENT, 0 ms]
(4) YES


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

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

   from(X) -> cons(X, n__from(s(X)))
   after(0, XS) -> XS
   after(s(N), cons(X, XS)) -> after(N, activate(XS))
   from(X) -> n__from(X)
   activate(n__from(X)) -> from(X)
   activate(X) -> X

Q is empty.

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

(1) QTRSRRRProof (EQUIVALENT)
Used ordering:
Quasi precedence:
after_2 > activate_1 > from_1 > [cons_2, n__from_1, s_1]
0 > [cons_2, n__from_1, s_1]


Status:
from_1: [1]
cons_2: [2,1]
n__from_1: multiset status
s_1: [1]
after_2: [1,2]
0: multiset status
activate_1: multiset status

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

   from(X) -> cons(X, n__from(s(X)))
   after(0, XS) -> XS
   after(s(N), cons(X, XS)) -> after(N, activate(XS))
   from(X) -> n__from(X)
   activate(n__from(X)) -> from(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