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

(0) Obligation:

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

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

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:

PLUS(x, s(y)) → PLUS(x, y)
TIMES(s(x), y) → PLUS(times(x, y), y)
TIMES(s(x), y) → TIMES(x, y)
P(s(s(x))) → P(s(x))
FAC(s(x)) → TIMES(fac(p(s(x))), s(x))
FAC(s(x)) → FAC(p(s(x)))
FAC(s(x)) → P(s(x))

The TRS R consists of the following rules:

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

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 4 SCCs with 3 less nodes.

(4) Complex Obligation (AND)

(5) Obligation:

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

P(s(s(x))) → P(s(x))

The TRS R consists of the following rules:

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

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.

P(s(s(x))) → P(s(x))

The remaining pairs can at least be oriented weakly.
Used ordering: Lexicographic Path Order [LPO].
Precedence:

P₁ > s₁

The following usable rules [FROCOS05] were oriented: none

(7) Obligation:

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

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

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:

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

The TRS R consists of the following rules:

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

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.

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

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
PLUS(x1, x2)  =  x2
s(x1)  =  s(x1)

Lexicographic Path Order [LPO].
Precedence:

trivial

The following usable rules [FROCOS05] were oriented: none

(12) Obligation:

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

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

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

(13) PisEmptyProof (EQUIVALENT transformation)

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

(14) TRUE

(15) Obligation:

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

TIMES(s(x), y) → TIMES(x, y)

The TRS R consists of the following rules:

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

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

(16) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

TIMES(s(x), y) → TIMES(x, y)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
TIMES(x1, x2)  =  x1
s(x1)  =  s(x1)

Lexicographic Path Order [LPO].
Precedence:

trivial

The following usable rules [FROCOS05] were oriented: none

(17) Obligation:

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

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

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

(18) PisEmptyProof (EQUIVALENT transformation)

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

(19) TRUE

(20) Obligation:

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

FAC(s(x)) → FAC(p(s(x)))

The TRS R consists of the following rules:

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

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