Term Rewriting System R:
[x, y]
natsactive -> nats
hdactive(x) -> hd(x)
hdactive(cons(x, y)) -> mark(x)
zerosactive -> cons(0, zeros)
zerosactive -> zeros
tlactive(x) -> tl(x)
tlactive(cons(x, y)) -> mark(y)
incractive(cons(x, y)) -> cons(s(x), incr(y))
incractive(x) -> incr(x)
mark(nats) -> natsactive
mark(zeros) -> zerosactive
mark(incr(x)) -> incractive(mark(x))
mark(hd(x)) -> hdactive(mark(x))
mark(tl(x)) -> tlactive(mark(x))
mark(0) -> 0
mark(s(x)) -> s(x)
mark(cons(x, y)) -> cons(x, y)

Innermost Termination of R to be shown.

R
Dependency Pair Analysis

R contains the following Dependency Pairs:

NATSACTIVE -> ZEROSACTIVE
HDACTIVE(cons(x, y)) -> MARK(x)
TLACTIVE(cons(x, y)) -> MARK(y)
MARK(nats) -> NATSACTIVE
MARK(zeros) -> ZEROSACTIVE
MARK(incr(x)) -> INCRACTIVE(mark(x))
MARK(incr(x)) -> MARK(x)
MARK(hd(x)) -> HDACTIVE(mark(x))
MARK(hd(x)) -> MARK(x)
MARK(tl(x)) -> TLACTIVE(mark(x))
MARK(tl(x)) -> MARK(x)

Furthermore, R contains one SCC.

R
DPs
→DP Problem 1
Argument Filtering and Ordering

Dependency Pairs:

MARK(tl(x)) -> MARK(x)
TLACTIVE(cons(x, y)) -> MARK(y)
MARK(tl(x)) -> TLACTIVE(mark(x))
MARK(hd(x)) -> MARK(x)
MARK(hd(x)) -> HDACTIVE(mark(x))
MARK(incr(x)) -> MARK(x)
HDACTIVE(cons(x, y)) -> MARK(x)

Rules:

natsactive -> nats
hdactive(x) -> hd(x)
hdactive(cons(x, y)) -> mark(x)
zerosactive -> cons(0, zeros)
zerosactive -> zeros
tlactive(x) -> tl(x)
tlactive(cons(x, y)) -> mark(y)
incractive(cons(x, y)) -> cons(s(x), incr(y))
incractive(x) -> incr(x)
mark(nats) -> natsactive
mark(zeros) -> zerosactive
mark(incr(x)) -> incractive(mark(x))
mark(hd(x)) -> hdactive(mark(x))
mark(tl(x)) -> tlactive(mark(x))
mark(0) -> 0
mark(s(x)) -> s(x)
mark(cons(x, y)) -> cons(x, y)

Strategy:

innermost

The following dependency pairs can be strictly oriented:

MARK(hd(x)) -> MARK(x)
HDACTIVE(cons(x, y)) -> MARK(x)

The following usable rules for innermost w.r.t. to the AFS can be oriented:

hdactive(x) -> hd(x)
hdactive(cons(x, y)) -> mark(x)
mark(nats) -> natsactive
mark(zeros) -> zerosactive
mark(incr(x)) -> incractive(mark(x))
mark(hd(x)) -> hdactive(mark(x))
mark(tl(x)) -> tlactive(mark(x))
mark(0) -> 0
mark(s(x)) -> s(x)
mark(cons(x, y)) -> cons(x, y)
tlactive(x) -> tl(x)
tlactive(cons(x, y)) -> mark(y)
natsactive -> nats
zerosactive -> cons(0, zeros)
zerosactive -> zeros
incractive(cons(x, y)) -> cons(s(x), incr(y))
incractive(x) -> incr(x)

Used ordering: Polynomial ordering with Polynomial interpretation:
 POL(zeros_active) =  0 POL(incr_active(x1)) =  x1 POL(hd_active(x1)) =  1 + x1 POL(MARK(x1)) =  x1 POL(TL_ACTIVE(x1)) =  x1 POL(incr(x1)) =  x1 POL(mark(x1)) =  x1 POL(tl(x1)) =  x1 POL(HD_ACTIVE(x1)) =  1 + x1 POL(add(x1)) =  x1 POL(add_active(x1)) =  x1 POL(0) =  0 POL(cons(x1, x2)) =  x1 + x2 POL(hd(x1)) =  1 + x1 POL(nats) =  0 POL(s(x1)) =  x1 POL(zeros) =  0 POL(nats_active) =  0 POL(tl_active(x1)) =  x1

resulting in one new DP problem.
Used Argument Filtering System:
HDACTIVE(x1) -> HDACTIVE(x1)
MARK(x1) -> MARK(x1)
cons(x1, x2) -> cons(x1, x2)
hd(x1) -> hd(x1)
mark(x1) -> mark(x1)
TLACTIVE(x1) -> TLACTIVE(x1)
tl(x1) -> tl(x1)
incr(x1) -> incr(x1)
hdactive(x1) -> hdactive(x1)
natsactive -> natsactive
zerosactive -> zerosactive
incractive(x1) -> incractive(x1)
tlactive(x1) -> tlactive(x1)
s(x1) -> s(x1)

R
DPs
→DP Problem 1
AFS
→DP Problem 2
Dependency Graph

Dependency Pairs:

MARK(tl(x)) -> MARK(x)
TLACTIVE(cons(x, y)) -> MARK(y)
MARK(tl(x)) -> TLACTIVE(mark(x))
MARK(hd(x)) -> HDACTIVE(mark(x))
MARK(incr(x)) -> MARK(x)

Rules:

natsactive -> nats
hdactive(x) -> hd(x)
hdactive(cons(x, y)) -> mark(x)
zerosactive -> cons(0, zeros)
zerosactive -> zeros
tlactive(x) -> tl(x)
tlactive(cons(x, y)) -> mark(y)
incractive(cons(x, y)) -> cons(s(x), incr(y))
incractive(x) -> incr(x)
mark(nats) -> natsactive
mark(zeros) -> zerosactive
mark(incr(x)) -> incractive(mark(x))
mark(hd(x)) -> hdactive(mark(x))
mark(tl(x)) -> tlactive(mark(x))
mark(0) -> 0
mark(s(x)) -> s(x)
mark(cons(x, y)) -> cons(x, y)

Strategy:

innermost

Using the Dependency Graph the DP problem was split into 1 DP problems.

R
DPs
→DP Problem 1
AFS
→DP Problem 2
DGraph
...
→DP Problem 3
Argument Filtering and Ordering

Dependency Pairs:

TLACTIVE(cons(x, y)) -> MARK(y)
MARK(tl(x)) -> TLACTIVE(mark(x))
MARK(incr(x)) -> MARK(x)
MARK(tl(x)) -> MARK(x)

Rules:

natsactive -> nats
hdactive(x) -> hd(x)
hdactive(cons(x, y)) -> mark(x)
zerosactive -> cons(0, zeros)
zerosactive -> zeros
tlactive(x) -> tl(x)
tlactive(cons(x, y)) -> mark(y)
incractive(cons(x, y)) -> cons(s(x), incr(y))
incractive(x) -> incr(x)
mark(nats) -> natsactive
mark(zeros) -> zerosactive
mark(incr(x)) -> incractive(mark(x))
mark(hd(x)) -> hdactive(mark(x))
mark(tl(x)) -> tlactive(mark(x))
mark(0) -> 0
mark(s(x)) -> s(x)
mark(cons(x, y)) -> cons(x, y)

Strategy:

innermost

The following dependency pairs can be strictly oriented:

TLACTIVE(cons(x, y)) -> MARK(y)
MARK(tl(x)) -> MARK(x)

The following usable rules for innermost w.r.t. to the AFS can be oriented:

hdactive(x) -> hd(x)
hdactive(cons(x, y)) -> mark(x)
mark(nats) -> natsactive
mark(zeros) -> zerosactive
mark(incr(x)) -> incractive(mark(x))
mark(hd(x)) -> hdactive(mark(x))
mark(tl(x)) -> tlactive(mark(x))
mark(0) -> 0
mark(s(x)) -> s(x)
mark(cons(x, y)) -> cons(x, y)
tlactive(x) -> tl(x)
tlactive(cons(x, y)) -> mark(y)
natsactive -> nats
zerosactive -> cons(0, zeros)
zerosactive -> zeros
incractive(cons(x, y)) -> cons(s(x), incr(y))
incractive(x) -> incr(x)

Used ordering: Polynomial ordering with Polynomial interpretation:
 POL(zeros_active) =  0 POL(incr_active(x1)) =  x1 POL(hd_active(x1)) =  x1 POL(MARK(x1)) =  x1 POL(TL_ACTIVE(x1)) =  1 + x1 POL(incr(x1)) =  x1 POL(tl(x1)) =  1 + x1 POL(mark(x1)) =  x1 POL(add(x1)) =  x1 POL(add_active(x1)) =  x1 POL(0) =  0 POL(cons(x1, x2)) =  x1 + x2 POL(hd(x1)) =  x1 POL(nats) =  0 POL(s(x1)) =  x1 POL(zeros) =  0 POL(nats_active) =  0 POL(tl_active(x1)) =  1 + x1

resulting in one new DP problem.
Used Argument Filtering System:
TLACTIVE(x1) -> TLACTIVE(x1)
MARK(x1) -> MARK(x1)
cons(x1, x2) -> cons(x1, x2)
tl(x1) -> tl(x1)
mark(x1) -> mark(x1)
incr(x1) -> incr(x1)
hdactive(x1) -> hdactive(x1)
hd(x1) -> hd(x1)
natsactive -> natsactive
zerosactive -> zerosactive
incractive(x1) -> incractive(x1)
tlactive(x1) -> tlactive(x1)
s(x1) -> s(x1)

R
DPs
→DP Problem 1
AFS
→DP Problem 2
DGraph
...
→DP Problem 4
Dependency Graph

Dependency Pairs:

MARK(tl(x)) -> TLACTIVE(mark(x))
MARK(incr(x)) -> MARK(x)

Rules:

natsactive -> nats
hdactive(x) -> hd(x)
hdactive(cons(x, y)) -> mark(x)
zerosactive -> cons(0, zeros)
zerosactive -> zeros
tlactive(x) -> tl(x)
tlactive(cons(x, y)) -> mark(y)
incractive(cons(x, y)) -> cons(s(x), incr(y))
incractive(x) -> incr(x)
mark(nats) -> natsactive
mark(zeros) -> zerosactive
mark(incr(x)) -> incractive(mark(x))
mark(hd(x)) -> hdactive(mark(x))
mark(tl(x)) -> tlactive(mark(x))
mark(0) -> 0
mark(s(x)) -> s(x)
mark(cons(x, y)) -> cons(x, y)

Strategy:

innermost

Using the Dependency Graph the DP problem was split into 1 DP problems.

R
DPs
→DP Problem 1
AFS
→DP Problem 2
DGraph
...
→DP Problem 5
Argument Filtering and Ordering

Dependency Pairs:

MARK(incr(x)) -> MARK(x)

Rules:

natsactive -> nats
hdactive(x) -> hd(x)
hdactive(cons(x, y)) -> mark(x)
zerosactive -> cons(0, zeros)
zerosactive -> zeros
tlactive(x) -> tl(x)
tlactive(cons(x, y)) -> mark(y)
incractive(cons(x, y)) -> cons(s(x), incr(y))
incractive(x) -> incr(x)
mark(nats) -> natsactive
mark(zeros) -> zerosactive
mark(incr(x)) -> incractive(mark(x))
mark(hd(x)) -> hdactive(mark(x))
mark(tl(x)) -> tlactive(mark(x))
mark(0) -> 0
mark(s(x)) -> s(x)
mark(cons(x, y)) -> cons(x, y)

Strategy:

innermost

The following dependency pair can be strictly oriented:

There are no usable rules for innermost w.r.t. to the AFS that need to be oriented.
Used ordering: Polynomial ordering with Polynomial interpretation:
 POL(MARK(x1)) =  x1 POL(incr(x1)) =  x1 POL(add(x1)) =  1 + x1

resulting in one new DP problem.
Used Argument Filtering System:
MARK(x1) -> MARK(x1)
incr(x1) -> incr(x1)

R
DPs
→DP Problem 1
AFS
→DP Problem 2
DGraph
...
→DP Problem 6
Argument Filtering and Ordering

Dependency Pair:

MARK(incr(x)) -> MARK(x)

Rules:

natsactive -> nats
hdactive(x) -> hd(x)
hdactive(cons(x, y)) -> mark(x)
zerosactive -> cons(0, zeros)
zerosactive -> zeros
tlactive(x) -> tl(x)
tlactive(cons(x, y)) -> mark(y)
incractive(cons(x, y)) -> cons(s(x), incr(y))
incractive(x) -> incr(x)
mark(nats) -> natsactive
mark(zeros) -> zerosactive
mark(incr(x)) -> incractive(mark(x))
mark(hd(x)) -> hdactive(mark(x))
mark(tl(x)) -> tlactive(mark(x))
mark(0) -> 0
mark(s(x)) -> s(x)
mark(cons(x, y)) -> cons(x, y)

Strategy:

innermost

The following dependency pair can be strictly oriented:

MARK(incr(x)) -> MARK(x)

There are no usable rules for innermost w.r.t. to the AFS that need to be oriented.
Used ordering: Polynomial ordering with Polynomial interpretation:
 POL(MARK(x1)) =  x1 POL(incr(x1)) =  1 + x1

resulting in one new DP problem.
Used Argument Filtering System:
MARK(x1) -> MARK(x1)
incr(x1) -> incr(x1)

R
DPs
→DP Problem 1
AFS
→DP Problem 2
DGraph
...
→DP Problem 7
Dependency Graph

Dependency Pair:

Rules:

natsactive -> nats
hdactive(x) -> hd(x)
hdactive(cons(x, y)) -> mark(x)
zerosactive -> cons(0, zeros)
zerosactive -> zeros
tlactive(x) -> tl(x)
tlactive(cons(x, y)) -> mark(y)
incractive(cons(x, y)) -> cons(s(x), incr(y))
incractive(x) -> incr(x)
mark(nats) -> natsactive
mark(zeros) -> zerosactive
mark(incr(x)) -> incractive(mark(x))
mark(hd(x)) -> hdactive(mark(x))
mark(tl(x)) -> tlactive(mark(x))
mark(0) -> 0
mark(s(x)) -> s(x)
mark(cons(x, y)) -> cons(x, y)

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

Innermost Termination of R successfully shown.
Duration:
0:00 minutes