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:

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))

Q is empty.

(1) Overlay + Local Confluence (EQUIVALENT transformation)

The TRS is overlay and locally confluent. By [NOC] we can switch to innermost.

(2) Obligation:

Q restricted rewrite system:
The TRS R consists of the following 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 set Q consists of the following terms:

f(0)
f(1)
f(s(x0))
if(true, x0, x1)
if(false, x0, x1)
g(s(x0), s(x1))
g(x0, c(x1))

(3) DependencyPairsProof (EQUIVALENT transformation)

Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.

(4) Obligation:

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

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)

The TRS R consists of the following 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 set Q consists of the following terms:

f(0)
f(1)
f(s(x0))
if(true, x0, x1)
if(false, x0, x1)
g(s(x0), s(x1))
g(x0, c(x1))

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

(5) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 2 SCCs with 2 less nodes.

(6) Complex Obligation (AND)

(7) Obligation:

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

F(s(x)) → F(x)

The TRS R consists of the following 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 set Q consists of the following terms:

f(0)
f(1)
f(s(x0))
if(true, x0, x1)
if(false, x0, x1)
g(s(x0), s(x1))
g(x0, c(x1))

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

(8) Obligation:

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

G(x, c(y)) → G(s(c(y)), y)
G(x, c(y)) → G(x, g(s(c(y)), y))

The TRS R consists of the following 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 set Q consists of the following terms:

f(0)
f(1)
f(s(x0))
if(true, x0, x1)
if(false, x0, x1)
g(s(x0), s(x1))
g(x0, c(x1))

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

(9) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

G(x, c(y)) → G(s(c(y)), y)
G(x, c(y)) → G(x, g(s(c(y)), y))

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
G(x1, x2)  =  x2
c(x1)  =  c(x1)
g(x1, x2)  =  g
f(x1)  =  f
0  =  0
true  =  true
1  =  1
false  =  false
s(x1)  =  s
if(x1, x2, x3)  =  if(x2, x3)

Lexicographic path order with status [LPO].
Precedence:

c₁ > g > if₂
c₁ > g > s
f > true
f > false

Status:

trivial

The following usable rules [FROCOS05] were oriented:

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))

(10) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following 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 set Q consists of the following terms:

f(0)
f(1)
f(s(x0))
if(true, x0, x1)
if(false, x0, x1)
g(s(x0), s(x1))
g(x0, c(x1))

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

(11) PisEmptyProof (EQUIVALENT transformation)

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

(12) TRUE