YES
proof of Transformed_CSR_04_Ex5_Zan97_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, 0 ms]
(2) QTRS
(3) RisEmptyProof [EQUIVALENT, 0 ms]
(4) YES


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

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

   f(X) -> if(X, c, n__f(true))
   if(true, X, Y) -> X
   if(false, X, Y) -> activate(Y)
   f(X) -> n__f(X)
   activate(n__f(X)) -> f(X)
   activate(X) -> X

Q is empty.

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

(1) QTRSRRRProof (EQUIVALENT)
Used ordering:
Knuth-Bendix order [KBO] with precedence:f_1 > if_3 > activate_1 > false > n__f_1 > true > c

and weight map:

   c=1
   true=1
   false=2
   f_1=3
   n__f_1=1
   activate_1=3
   if_3=0

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

   f(X) -> if(X, c, n__f(true))
   if(true, X, Y) -> X
   if(false, X, Y) -> activate(Y)
   f(X) -> n__f(X)
   activate(n__f(X)) -> f(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