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

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 PisEmptyProof (⇔)
    ↳14 TRUE
  ↳15 QDP
    ↳16 QDPOrderProof (⇔)
    ↳17 QDP
    ↳18 PisEmptyProof (⇔)
    ↳19 TRUE
  ↳20 QDP

(0) Obligation:

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

plus(0, x) → x
plus(s(x), y) → s(plus(x, y))
times(0, y) → 0
times(s(x), y) → plus(y, times(x, y))
p(s(x)) → x
p(0) → 0
minus(x, 0) → x
minus(0, x) → 0
minus(x, s(y)) → p(minus(x, y))
isZero(0) → true
isZero(s(x)) → false
facIter(x, y) → if(isZero(x), minus(x, s(0)), y, times(y, x))
if(true, x, y, z) → y
if(false, x, y, z) → facIter(x, z)
factorial(x) → facIter(x, s(0))

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(s(x), y) → PLUS(x, y)
TIMES(s(x), y) → PLUS(y, times(x, y))
TIMES(s(x), y) → TIMES(x, y)
MINUS(x, s(y)) → P(minus(x, y))
MINUS(x, s(y)) → MINUS(x, y)
FACITER(x, y) → IF(isZero(x), minus(x, s(0)), y, times(y, x))
FACITER(x, y) → ISZERO(x)
FACITER(x, y) → MINUS(x, s(0))
FACITER(x, y) → TIMES(y, x)
IF(false, x, y, z) → FACITER(x, z)
FACTORIAL(x) → FACITER(x, s(0))

The TRS R consists of the following rules:

plus(0, x) → x
plus(s(x), y) → s(plus(x, y))
times(0, y) → 0
times(s(x), y) → plus(y, times(x, y))
p(s(x)) → x
p(0) → 0
minus(x, 0) → x
minus(0, x) → 0
minus(x, s(y)) → p(minus(x, y))
isZero(0) → true
isZero(s(x)) → false
facIter(x, y) → if(isZero(x), minus(x, s(0)), y, times(y, x))
if(true, x, y, z) → y
if(false, x, y, z) → facIter(x, z)
factorial(x) → facIter(x, s(0))

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 6 less nodes.

(4) Complex Obligation (AND)

(5) Obligation:

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

MINUS(x, s(y)) → MINUS(x, y)

The TRS R consists of the following rules:

plus(0, x) → x
plus(s(x), y) → s(plus(x, y))
times(0, y) → 0
times(s(x), y) → plus(y, times(x, y))
p(s(x)) → x
p(0) → 0
minus(x, 0) → x
minus(0, x) → 0
minus(x, s(y)) → p(minus(x, y))
isZero(0) → true
isZero(s(x)) → false
facIter(x, y) → if(isZero(x), minus(x, s(0)), y, times(y, x))
if(true, x, y, z) → y
if(false, x, y, z) → facIter(x, z)
factorial(x) → facIter(x, s(0))

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.


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

Lexicographic Path Order [LPO].
Precedence:
trivial

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(0, x) → x
plus(s(x), y) → s(plus(x, y))
times(0, y) → 0
times(s(x), y) → plus(y, times(x, y))
p(s(x)) → x
p(0) → 0
minus(x, 0) → x
minus(0, x) → 0
minus(x, s(y)) → p(minus(x, y))
isZero(0) → true
isZero(s(x)) → false
facIter(x, y) → if(isZero(x), minus(x, s(0)), y, times(y, x))
if(true, x, y, z) → y
if(false, x, y, z) → facIter(x, z)
factorial(x) → facIter(x, s(0))

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(s(x), y) → PLUS(x, y)

The TRS R consists of the following rules:

plus(0, x) → x
plus(s(x), y) → s(plus(x, y))
times(0, y) → 0
times(s(x), y) → plus(y, times(x, y))
p(s(x)) → x
p(0) → 0
minus(x, 0) → x
minus(0, x) → 0
minus(x, s(y)) → p(minus(x, y))
isZero(0) → true
isZero(s(x)) → false
facIter(x, y) → if(isZero(x), minus(x, s(0)), y, times(y, x))
if(true, x, y, z) → y
if(false, x, y, z) → facIter(x, z)
factorial(x) → facIter(x, s(0))

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(s(x), 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)  =  x1
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(0, x) → x
plus(s(x), y) → s(plus(x, y))
times(0, y) → 0
times(s(x), y) → plus(y, times(x, y))
p(s(x)) → x
p(0) → 0
minus(x, 0) → x
minus(0, x) → 0
minus(x, s(y)) → p(minus(x, y))
isZero(0) → true
isZero(s(x)) → false
facIter(x, y) → if(isZero(x), minus(x, s(0)), y, times(y, x))
if(true, x, y, z) → y
if(false, x, y, z) → facIter(x, z)
factorial(x) → facIter(x, s(0))

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(0, x) → x
plus(s(x), y) → s(plus(x, y))
times(0, y) → 0
times(s(x), y) → plus(y, times(x, y))
p(s(x)) → x
p(0) → 0
minus(x, 0) → x
minus(0, x) → 0
minus(x, s(y)) → p(minus(x, y))
isZero(0) → true
isZero(s(x)) → false
facIter(x, y) → if(isZero(x), minus(x, s(0)), y, times(y, x))
if(true, x, y, z) → y
if(false, x, y, z) → facIter(x, z)
factorial(x) → facIter(x, s(0))

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(0, x) → x
plus(s(x), y) → s(plus(x, y))
times(0, y) → 0
times(s(x), y) → plus(y, times(x, y))
p(s(x)) → x
p(0) → 0
minus(x, 0) → x
minus(0, x) → 0
minus(x, s(y)) → p(minus(x, y))
isZero(0) → true
isZero(s(x)) → false
facIter(x, y) → if(isZero(x), minus(x, s(0)), y, times(y, x))
if(true, x, y, z) → y
if(false, x, y, z) → facIter(x, z)
factorial(x) → facIter(x, s(0))

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:

FACITER(x, y) → IF(isZero(x), minus(x, s(0)), y, times(y, x))
IF(false, x, y, z) → FACITER(x, z)

The TRS R consists of the following rules:

plus(0, x) → x
plus(s(x), y) → s(plus(x, y))
times(0, y) → 0
times(s(x), y) → plus(y, times(x, y))
p(s(x)) → x
p(0) → 0
minus(x, 0) → x
minus(0, x) → 0
minus(x, s(y)) → p(minus(x, y))
isZero(0) → true
isZero(s(x)) → false
facIter(x, y) → if(isZero(x), minus(x, s(0)), y, times(y, x))
if(true, x, y, z) → y
if(false, x, y, z) → facIter(x, z)
factorial(x) → facIter(x, s(0))

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