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

0 QTRS
↳1 DependencyPairsProof (⇔)
↳2 QDP
↳3 DependencyGraphProof (⇔)
↳4 AND
    ↳5 QDP
        ↳6 QDPOrderProof (⇔)
        ↳7 QDP
        ↳8 PisEmptyProof (⇔)
        ↳9 TRUE
    ↳10 QDP
        ↳11 QDPOrderProof (⇔)
        ↳12 QDP
        ↳13 QDPOrderProof (⇔)
        ↳14 QDP
        ↳15 QDPOrderProof (⇔)
        ↳16 QDP
        ↳17 PisEmptyProof (⇔)
        ↳18 TRUE

(0) Obligation:

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

times(x, plus(y, s(z))) → plus(times(x, plus(y, times(s(z), 0))), times(x, s(z)))
times(x, 0) → 0
times(x, s(y)) → plus(times(x, y), x)
plus(x, 0) → x
plus(x, s(y)) → s(plus(x, y))

Q is empty.

(1) DependencyPairsProof (EQUIVALENT transformation)

Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.

(2) Obligation:

Q DP problem:
The TRS P consists of the following rules:

TIMES(x, plus(y, s(z))) → PLUS(times(x, plus(y, times(s(z), 0))), times(x, s(z)))
TIMES(x, plus(y, s(z))) → TIMES(x, plus(y, times(s(z), 0)))
TIMES(x, plus(y, s(z))) → PLUS(y, times(s(z), 0))
TIMES(x, plus(y, s(z))) → TIMES(s(z), 0)
TIMES(x, plus(y, s(z))) → TIMES(x, s(z))
TIMES(x, s(y)) → PLUS(times(x, y), x)
TIMES(x, s(y)) → TIMES(x, y)
PLUS(x, s(y)) → PLUS(x, y)

The TRS R consists of the following rules:

times(x, plus(y, s(z))) → plus(times(x, plus(y, times(s(z), 0))), times(x, s(z)))
times(x, 0) → 0
times(x, s(y)) → plus(times(x, y), x)
plus(x, 0) → x
plus(x, s(y)) → s(plus(x, y))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(3) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 2 SCCs with 4 less nodes.

(4) Complex Obligation (AND)

(5) Obligation:

Q DP problem:
The TRS P consists of the following rules:

PLUS(x, s(y)) → PLUS(x, y)

The TRS R consists of the following rules:

times(x, plus(y, s(z))) → plus(times(x, plus(y, times(s(z), 0))), times(x, s(z)))
times(x, 0) → 0
times(x, s(y)) → plus(times(x, y), x)
plus(x, 0) → x
plus(x, s(y)) → s(plus(x, y))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(6) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


PLUS(x, s(y)) → PLUS(x, y)
The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
PLUS(x1, x2)  =  PLUS(x2)

Tags:
PLUS has tags [1,1]

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Lexicographic path order with status [LPO].
Quasi-Precedence:
trivial

Status:
s1: [1]


The following usable rules [FROCOS05] were oriented: none

(7) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

times(x, plus(y, s(z))) → plus(times(x, plus(y, times(s(z), 0))), times(x, s(z)))
times(x, 0) → 0
times(x, s(y)) → plus(times(x, y), x)
plus(x, 0) → x
plus(x, s(y)) → s(plus(x, y))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(8) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(9) TRUE

(10) Obligation:

Q DP problem:
The TRS P consists of the following rules:

TIMES(x, plus(y, s(z))) → TIMES(x, s(z))
TIMES(x, s(y)) → TIMES(x, y)
TIMES(x, plus(y, s(z))) → TIMES(x, plus(y, times(s(z), 0)))

The TRS R consists of the following rules:

times(x, plus(y, s(z))) → plus(times(x, plus(y, times(s(z), 0))), times(x, s(z)))
times(x, 0) → 0
times(x, s(y)) → plus(times(x, y), x)
plus(x, 0) → x
plus(x, s(y)) → s(plus(x, y))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(11) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


TIMES(x, plus(y, s(z))) → TIMES(x, s(z))
The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
TIMES(x1, x2)  =  TIMES(x2)

Tags:
TIMES has tags [0,1]

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Combined order from the following AFS and order.
plus(x1, x2)  =  plus(x1, x2)
s(x1)  =  x1
times(x1, x2)  =  x1
0  =  0

Lexicographic path order with status [LPO].
Quasi-Precedence:
plus2 > 0

Status:
plus2: [2,1]
0: []


The following usable rules [FROCOS05] were oriented:

times(x, 0) → 0
plus(x, 0) → x
plus(x, s(y)) → s(plus(x, y))

(12) Obligation:

Q DP problem:
The TRS P consists of the following rules:

TIMES(x, s(y)) → TIMES(x, y)
TIMES(x, plus(y, s(z))) → TIMES(x, plus(y, times(s(z), 0)))

The TRS R consists of the following rules:

times(x, plus(y, s(z))) → plus(times(x, plus(y, times(s(z), 0))), times(x, s(z)))
times(x, 0) → 0
times(x, s(y)) → plus(times(x, y), x)
plus(x, 0) → x
plus(x, s(y)) → s(plus(x, y))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(13) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


TIMES(x, s(y)) → TIMES(x, y)
The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
TIMES(x1, x2)  =  TIMES(x2)

Tags:
TIMES has tags [0,1]

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Combined order from the following AFS and order.
s(x1)  =  s(x1)
plus(x1, x2)  =  plus(x1, x2)
times(x1, x2)  =  times(x2)
0  =  0

Lexicographic path order with status [LPO].
Quasi-Precedence:
plus2 > [s1, times1] > 0

Status:
s1: [1]
plus2: [1,2]
times1: [1]
0: []


The following usable rules [FROCOS05] were oriented:

times(x, 0) → 0
plus(x, 0) → x
plus(x, s(y)) → s(plus(x, y))

(14) Obligation:

Q DP problem:
The TRS P consists of the following rules:

TIMES(x, plus(y, s(z))) → TIMES(x, plus(y, times(s(z), 0)))

The TRS R consists of the following rules:

times(x, plus(y, s(z))) → plus(times(x, plus(y, times(s(z), 0))), times(x, s(z)))
times(x, 0) → 0
times(x, s(y)) → plus(times(x, y), x)
plus(x, 0) → x
plus(x, s(y)) → s(plus(x, y))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(15) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


TIMES(x, plus(y, s(z))) → TIMES(x, plus(y, times(s(z), 0)))
The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
TIMES(x1, x2)  =  TIMES(x2)

Tags:
TIMES has tags [1,0]

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Combined order from the following AFS and order.
plus(x1, x2)  =  plus(x1, x2)
s(x1)  =  s
times(x1, x2)  =  times
0  =  0

Lexicographic path order with status [LPO].
Quasi-Precedence:
plus2 > s > times > 0

Status:
plus2: [1,2]
s: []
times: []
0: []


The following usable rules [FROCOS05] were oriented:

times(x, 0) → 0
plus(x, 0) → x
plus(x, s(y)) → s(plus(x, y))

(16) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

times(x, plus(y, s(z))) → plus(times(x, plus(y, times(s(z), 0))), times(x, s(z)))
times(x, 0) → 0
times(x, s(y)) → plus(times(x, y), x)
plus(x, 0) → x
plus(x, s(y)) → s(plus(x, y))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(17) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(18) TRUE