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

(0) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

*(i(x), x) → 1
*(1, y) → y
*(x, 0) → 0
*(*(x, y), z) → *(x, *(y, z))

Q is empty.

(1) QTRSRRRProof (EQUIVALENT transformation)

Used ordering:
Polynomial interpretation [POLO]:

POL(*(x₁, x₂)) = 1 + x₁ + x₂   
POL(0) = 0   
POL(1) = 0   
POL(i(x₁)) = x₁   

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

*(i(x), x) → 1
*(1, y) → y
*(x, 0) → 0

(2) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

*(*(x, y), z) → *(x, *(y, z))

Q is empty.

(3) QTRSRRRProof (EQUIVALENT transformation)

Used ordering:
Polynomial interpretation [POLO]:

POL(*(x₁, x₂)) = 2 + 2·x₁ + x₂   

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:
R is empty.
Q is empty.

(5) RisEmptyProof (EQUIVALENT transformation)

The TRS R is empty. Hence, termination is trivially proven.

(6) TRUE

(7) RisEmptyProof (EQUIVALENT transformation)

The TRS R is empty. Hence, termination is trivially proven.

(8) TRUE