Term Rewriting System R:
[x, y]
f(0) -> true
f(1) -> false
f(s(x)) -> f(x)
if(true, x, y) -> x
if(false, x, y) -> y
g(s(x), s(y)) -> if(f(x), s(x), s(y))
g(x, c(y)) -> g(x, g(s(c(y)), y))

Termination of R to be shown.



   R
Dependency Pair Analysis



R contains the following Dependency Pairs:

F(s(x)) -> F(x)
G(s(x), s(y)) -> IF(f(x), s(x), s(y))
G(s(x), s(y)) -> F(x)
G(x, c(y)) -> G(x, g(s(c(y)), y))
G(x, c(y)) -> G(s(c(y)), y)

Furthermore, R contains two SCCs.


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


Dependency Pair:

F(s(x)) -> F(x)


Rules:


f(0) -> true
f(1) -> false
f(s(x)) -> f(x)
if(true, x, y) -> x
if(false, x, y) -> y
g(s(x), s(y)) -> if(f(x), s(x), s(y))
g(x, c(y)) -> g(x, g(s(c(y)), y))





The following dependency pair can be strictly oriented:

F(s(x)) -> F(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:
F(x1) -> F(x1)
s(x1) -> s(x1)


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


Dependency Pair:


Rules:


f(0) -> true
f(1) -> false
f(s(x)) -> f(x)
if(true, x, y) -> x
if(false, x, y) -> y
g(s(x), s(y)) -> if(f(x), s(x), s(y))
g(x, c(y)) -> g(x, g(s(c(y)), y))





Using the Dependency Graph resulted in no new DP problems.


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


Dependency Pairs:

G(x, c(y)) -> G(s(c(y)), y)
G(x, c(y)) -> G(x, g(s(c(y)), y))


Rules:


f(0) -> true
f(1) -> false
f(s(x)) -> f(x)
if(true, x, y) -> x
if(false, x, y) -> y
g(s(x), s(y)) -> if(f(x), s(x), s(y))
g(x, c(y)) -> g(x, g(s(c(y)), y))





The following dependency pairs can be strictly oriented:

G(x, c(y)) -> G(s(c(y)), y)
G(x, c(y)) -> G(x, g(s(c(y)), y))


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

g(s(x), s(y)) -> if(f(x), s(x), s(y))
g(x, c(y)) -> g(x, g(s(c(y)), y))
if(true, x, y) -> x
if(false, x, y) -> y
f(0) -> true
f(1) -> false
f(s(x)) -> f(x)


Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:
{c, s} > {f, true, false}
{c, s} > {if, g}
{c, s} > G

resulting in one new DP problem.
Used Argument Filtering System:
G(x1, x2) -> G(x1, x2)
c(x1) -> c(x1)
g(x1, x2) -> g(x1, x2)
s(x1) -> s
if(x1, x2, x3) -> if(x1, x2, x3)
f(x1) -> f


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


Dependency Pair:


Rules:


f(0) -> true
f(1) -> false
f(s(x)) -> f(x)
if(true, x, y) -> x
if(false, x, y) -> y
g(s(x), s(y)) -> if(f(x), s(x), s(y))
g(x, c(y)) -> g(x, g(s(c(y)), y))





Using the Dependency Graph resulted in no new DP problems.

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