YES
proof of SK90_4.26.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, 64 ms]
(2) QTRS
(3) QTRSRRRProof [EQUIVALENT, 0 ms]
(4) QTRS
(5) QTRSRRRProof [EQUIVALENT, 0 ms]
(6) QTRS
(7) RisEmptyProof [EQUIVALENT, 0 ms]
(8) YES


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

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

   rev(nil) -> nil
   rev(rev(x)) -> x
   rev(++(x, y)) -> ++(rev(y), rev(x))
   ++(nil, y) -> y
   ++(x, nil) -> x
   ++(.(x, y), z) -> .(x, ++(y, z))
   ++(x, ++(y, z)) -> ++(++(x, y), z)
   make(x) -> .(x, nil)

Q is empty.

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

(1) QTRSRRRProof (EQUIVALENT)
Used ordering:
Polynomial interpretation [POLO]:

   POL(++(x_1, x_2)) = 2 + x_1 + x_2
   POL(.(x_1, x_2)) = x_1 + x_2
   POL(make(x_1)) = 1 + 2*x_1
   POL(nil) = 0
   POL(rev(x_1)) = 1 + 2*x_1
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

   rev(nil) -> nil
   rev(rev(x)) -> x
   rev(++(x, y)) -> ++(rev(y), rev(x))
   ++(nil, y) -> y
   ++(x, nil) -> x
   make(x) -> .(x, nil)




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

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

   ++(.(x, y), z) -> .(x, ++(y, z))
   ++(x, ++(y, z)) -> ++(++(x, y), z)

Q is empty.

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

(3) QTRSRRRProof (EQUIVALENT)
Used ordering:
Polynomial interpretation [POLO]:

   POL(++(x_1, x_2)) = 1 + x_1 + 2*x_2
   POL(.(x_1, x_2)) = x_1 + x_2
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

   ++(x, ++(y, z)) -> ++(++(x, y), z)




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

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

   ++(.(x, y), z) -> .(x, ++(y, z))

Q is empty.

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

(5) QTRSRRRProof (EQUIVALENT)
Used ordering:
Knuth-Bendix order [KBO] with precedence:++_2 > ._2

and weight map:

   ._2=0
   ++_2=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:

   ++(.(x, y), z) -> .(x, ++(y, z))




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

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

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

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

(8)
YES