half(0) -> 0

half(s(s(

log(s(0)) -> 0

log(s(s(

R

↳Dependency Pair Analysis

HALF(s(s(x))) -> HALF(x)

LOG(s(s(x))) -> LOG(s(half(x)))

LOG(s(s(x))) -> HALF(x)

Furthermore,

R

↳DPs

→DP Problem 1

↳Argument Filtering and Ordering

→DP Problem 2

↳AFS

**HALF(s(s( x))) -> HALF(x)**

half(0) -> 0

half(s(s(x))) -> s(half(x))

log(s(0)) -> 0

log(s(s(x))) -> s(log(s(half(x))))

The following dependency pair can be strictly oriented:

HALF(s(s(x))) -> HALF(x)

There are no usable rules w.r.t. to the AFS that need to be oriented.

Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:

trivial

resulting in one new DP problem.

Used Argument Filtering System:

HALF(x) -> HALF(_{1}x)_{1}

s(x) -> s(_{1}x)_{1}

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 3

↳Dependency Graph

→DP Problem 2

↳AFS

half(0) -> 0

half(s(s(x))) -> s(half(x))

log(s(0)) -> 0

log(s(s(x))) -> s(log(s(half(x))))

Using the Dependency Graph resulted in no new DP problems.

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳Argument Filtering and Ordering

**LOG(s(s( x))) -> LOG(s(half(x)))**

half(0) -> 0

half(s(s(x))) -> s(half(x))

log(s(0)) -> 0

log(s(s(x))) -> s(log(s(half(x))))

The following dependency pair can be strictly oriented:

LOG(s(s(x))) -> LOG(s(half(x)))

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

half(0) -> 0

half(s(s(x))) -> s(half(x))

Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:

s > half

resulting in one new DP problem.

Used Argument Filtering System:

LOG(x) -> LOG(_{1}x)_{1}

s(x) -> s(_{1}x)_{1}

half(x) -> half(_{1}x)_{1}

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳AFS

→DP Problem 4

↳Dependency Graph

half(0) -> 0

half(s(s(x))) -> s(half(x))

log(s(0)) -> 0

log(s(s(x))) -> s(log(s(half(x))))

Using the Dependency Graph resulted in no new DP problems.

Duration:

0:00 minutes