Termination w.r.t. Q proof of /tmp/tmp9H7Yzh/Ex5_Zan97

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 QDPOrderProof (⇔)

    ↳9 QDP

    ↳10 QDPOrderProof (⇔)

    ↳11 QDP

    ↳12 PisEmptyProof (⇔)

    ↳13 TRUE

  ↳14 QDP

    ↳15 QDPOrderProof (⇔)

    ↳16 QDP

    ↳17 QDPOrderProof (⇔)

    ↳18 QDP

    ↳19 PisEmptyProof (⇔)

    ↳20 TRUE

  ↳21 QDP

    ↳22 QDPOrderProof (⇔)

    ↳23 QDP

    ↳24 PisEmptyProof (⇔)

    ↳25 TRUE

  ↳26 QDP

    ↳27 QDPOrderProof (⇔)

    ↳28 QDP

    ↳29 QDPOrderProof (⇔)

    ↳30 QDP

    ↳31 PisEmptyProof (⇔)

    ↳32 TRUE

  ↳33 QDP

(0) Obligation:

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

active(f(X)) → mark(if(X, c, f(true)))
active(if(true, X, Y)) → mark(X)
active(if(false, X, Y)) → mark(Y)
active(f(X)) → f(active(X))
active(if(X1, X2, X3)) → if(active(X1), X2, X3)
active(if(X1, X2, X3)) → if(X1, active(X2), X3)
f(mark(X)) → mark(f(X))
if(mark(X1), X2, X3) → mark(if(X1, X2, X3))
if(X1, mark(X2), X3) → mark(if(X1, X2, X3))
proper(f(X)) → f(proper(X))
proper(if(X1, X2, X3)) → if(proper(X1), proper(X2), proper(X3))
proper(c) → ok(c)
proper(true) → ok(true)
proper(false) → ok(false)
f(ok(X)) → ok(f(X))
if(ok(X1), ok(X2), ok(X3)) → ok(if(X1, X2, X3))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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:

ACTIVE(f(X)) → IF(X, c, f(true))
ACTIVE(f(X)) → F(true)
ACTIVE(f(X)) → F(active(X))
ACTIVE(f(X)) → ACTIVE(X)
ACTIVE(if(X1, X2, X3)) → IF(active(X1), X2, X3)
ACTIVE(if(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(if(X1, X2, X3)) → IF(X1, active(X2), X3)
ACTIVE(if(X1, X2, X3)) → ACTIVE(X2)
F(mark(X)) → F(X)
IF(mark(X1), X2, X3) → IF(X1, X2, X3)
IF(X1, mark(X2), X3) → IF(X1, X2, X3)
PROPER(f(X)) → F(proper(X))
PROPER(f(X)) → PROPER(X)
PROPER(if(X1, X2, X3)) → IF(proper(X1), proper(X2), proper(X3))
PROPER(if(X1, X2, X3)) → PROPER(X1)
PROPER(if(X1, X2, X3)) → PROPER(X2)
PROPER(if(X1, X2, X3)) → PROPER(X3)
F(ok(X)) → F(X)
IF(ok(X1), ok(X2), ok(X3)) → IF(X1, X2, X3)
TOP(mark(X)) → TOP(proper(X))
TOP(mark(X)) → PROPER(X)
TOP(ok(X)) → TOP(active(X))
TOP(ok(X)) → ACTIVE(X)

The TRS R consists of the following rules:

active(f(X)) → mark(if(X, c, f(true)))
active(if(true, X, Y)) → mark(X)
active(if(false, X, Y)) → mark(Y)
active(f(X)) → f(active(X))
active(if(X1, X2, X3)) → if(active(X1), X2, X3)
active(if(X1, X2, X3)) → if(X1, active(X2), X3)
f(mark(X)) → mark(f(X))
if(mark(X1), X2, X3) → mark(if(X1, X2, X3))
if(X1, mark(X2), X3) → mark(if(X1, X2, X3))
proper(f(X)) → f(proper(X))
proper(if(X1, X2, X3)) → if(proper(X1), proper(X2), proper(X3))
proper(c) → ok(c)
proper(true) → ok(true)
proper(false) → ok(false)
f(ok(X)) → ok(f(X))
if(ok(X1), ok(X2), ok(X3)) → ok(if(X1, X2, X3))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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 5 SCCs with 9 less nodes.

(4) Complex Obligation (AND)

(5) Obligation:

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

IF(X1, mark(X2), X3) → IF(X1, X2, X3)
IF(mark(X1), X2, X3) → IF(X1, X2, X3)
IF(ok(X1), ok(X2), ok(X3)) → IF(X1, X2, X3)

The TRS R consists of the following rules:

active(f(X)) → mark(if(X, c, f(true)))
active(if(true, X, Y)) → mark(X)
active(if(false, X, Y)) → mark(Y)
active(f(X)) → f(active(X))
active(if(X1, X2, X3)) → if(active(X1), X2, X3)
active(if(X1, X2, X3)) → if(X1, active(X2), X3)
f(mark(X)) → mark(f(X))
if(mark(X1), X2, X3) → mark(if(X1, X2, X3))
if(X1, mark(X2), X3) → mark(if(X1, X2, X3))
proper(f(X)) → f(proper(X))
proper(if(X1, X2, X3)) → if(proper(X1), proper(X2), proper(X3))
proper(c) → ok(c)
proper(true) → ok(true)
proper(false) → ok(false)
f(ok(X)) → ok(f(X))
if(ok(X1), ok(X2), ok(X3)) → ok(if(X1, X2, X3))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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.

IF(ok(X1), ok(X2), ok(X3)) → IF(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
IF(x1, x2, x3) = IF(x3)
mark(x1) = mark
ok(x1) = ok(x1)
active(x1) = x1
f(x1) = f(x1)
if(x1, x2, x3) = if(x3)
c = c
true = true
false = false
proper(x1) = proper(x1)
top(x1) = top

Recursive Path Order [RPO].
Precedence:

false > mark > IF₁
false > ok₁ > IF₁
proper₁ > f₁ > mark > IF₁
proper₁ > f₁ > ok₁ > IF₁
proper₁ > f₁ > true > IF₁
proper₁ > if₁ > mark > IF₁
proper₁ > if₁ > ok₁ > IF₁
proper₁ > c > ok₁ > IF₁
top > IF₁

The following usable rules [FROCOS05] were oriented:

active(f(X)) → mark(if(X, c, f(true)))
active(if(true, X, Y)) → mark(X)
active(if(false, X, Y)) → mark(Y)
active(f(X)) → f(active(X))
active(if(X1, X2, X3)) → if(active(X1), X2, X3)
active(if(X1, X2, X3)) → if(X1, active(X2), X3)
f(mark(X)) → mark(f(X))
if(mark(X1), X2, X3) → mark(if(X1, X2, X3))
if(X1, mark(X2), X3) → mark(if(X1, X2, X3))
proper(f(X)) → f(proper(X))
proper(if(X1, X2, X3)) → if(proper(X1), proper(X2), proper(X3))
proper(c) → ok(c)
proper(true) → ok(true)
proper(false) → ok(false)
f(ok(X)) → ok(f(X))
if(ok(X1), ok(X2), ok(X3)) → ok(if(X1, X2, X3))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(7) Obligation:

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

IF(X1, mark(X2), X3) → IF(X1, X2, X3)
IF(mark(X1), X2, X3) → IF(X1, X2, X3)

The TRS R consists of the following rules:

active(f(X)) → mark(if(X, c, f(true)))
active(if(true, X, Y)) → mark(X)
active(if(false, X, Y)) → mark(Y)
active(f(X)) → f(active(X))
active(if(X1, X2, X3)) → if(active(X1), X2, X3)
active(if(X1, X2, X3)) → if(X1, active(X2), X3)
f(mark(X)) → mark(f(X))
if(mark(X1), X2, X3) → mark(if(X1, X2, X3))
if(X1, mark(X2), X3) → mark(if(X1, X2, X3))
proper(f(X)) → f(proper(X))
proper(if(X1, X2, X3)) → if(proper(X1), proper(X2), proper(X3))
proper(c) → ok(c)
proper(true) → ok(true)
proper(false) → ok(false)
f(ok(X)) → ok(f(X))
if(ok(X1), ok(X2), ok(X3)) → ok(if(X1, X2, X3))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(8) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

IF(X1, mark(X2), X3) → IF(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
IF(x1, x2, x3) = IF(x2)
mark(x1) = mark(x1)
active(x1) = active(x1)
f(x1) = f(x1)
if(x1, x2, x3) = if(x1, x2, x3)
c = c
true = true
false = false
proper(x1) = proper(x1)
ok(x1) = ok
top(x1) = top

Recursive Path Order [RPO].
Precedence:

proper₁ > false > mark₁ > IF₁
proper₁ > ok > active₁ > f₁ > mark₁ > IF₁
proper₁ > ok > active₁ > f₁ > c > IF₁
proper₁ > ok > active₁ > if₃ > mark₁ > IF₁
proper₁ > ok > active₁ > true > mark₁ > IF₁
proper₁ > ok > top > IF₁

The following usable rules [FROCOS05] were oriented:

active(f(X)) → mark(if(X, c, f(true)))
active(if(true, X, Y)) → mark(X)
active(if(false, X, Y)) → mark(Y)
active(f(X)) → f(active(X))
active(if(X1, X2, X3)) → if(active(X1), X2, X3)
active(if(X1, X2, X3)) → if(X1, active(X2), X3)
f(mark(X)) → mark(f(X))
if(mark(X1), X2, X3) → mark(if(X1, X2, X3))
if(X1, mark(X2), X3) → mark(if(X1, X2, X3))
proper(f(X)) → f(proper(X))
proper(if(X1, X2, X3)) → if(proper(X1), proper(X2), proper(X3))
proper(c) → ok(c)
proper(true) → ok(true)
proper(false) → ok(false)
f(ok(X)) → ok(f(X))
if(ok(X1), ok(X2), ok(X3)) → ok(if(X1, X2, X3))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(9) Obligation:

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

IF(mark(X1), X2, X3) → IF(X1, X2, X3)

The TRS R consists of the following rules:

active(f(X)) → mark(if(X, c, f(true)))
active(if(true, X, Y)) → mark(X)
active(if(false, X, Y)) → mark(Y)
active(f(X)) → f(active(X))
active(if(X1, X2, X3)) → if(active(X1), X2, X3)
active(if(X1, X2, X3)) → if(X1, active(X2), X3)
f(mark(X)) → mark(f(X))
if(mark(X1), X2, X3) → mark(if(X1, X2, X3))
if(X1, mark(X2), X3) → mark(if(X1, X2, X3))
proper(f(X)) → f(proper(X))
proper(if(X1, X2, X3)) → if(proper(X1), proper(X2), proper(X3))
proper(c) → ok(c)
proper(true) → ok(true)
proper(false) → ok(false)
f(ok(X)) → ok(f(X))
if(ok(X1), ok(X2), ok(X3)) → ok(if(X1, X2, X3))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(10) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

IF(mark(X1), X2, X3) → IF(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
IF(x1, x2, x3) = IF(x1, x2, x3)
mark(x1) = mark(x1)
active(x1) = active(x1)
f(x1) = x1
if(x1, x2, x3) = if(x1, x2, x3)
c = c
true = true
false = false
proper(x1) = x1
ok(x1) = x1
top(x1) = top

Recursive Path Order [RPO].
Precedence:

false > mark₁
top > active₁ > if₃ > mark₁
top > active₁ > c
top > active₁ > true > mark₁

The following usable rules [FROCOS05] were oriented:

active(f(X)) → mark(if(X, c, f(true)))
active(if(true, X, Y)) → mark(X)
active(if(false, X, Y)) → mark(Y)
active(f(X)) → f(active(X))
active(if(X1, X2, X3)) → if(active(X1), X2, X3)
active(if(X1, X2, X3)) → if(X1, active(X2), X3)
f(mark(X)) → mark(f(X))
if(mark(X1), X2, X3) → mark(if(X1, X2, X3))
if(X1, mark(X2), X3) → mark(if(X1, X2, X3))
proper(f(X)) → f(proper(X))
proper(if(X1, X2, X3)) → if(proper(X1), proper(X2), proper(X3))
proper(c) → ok(c)
proper(true) → ok(true)
proper(false) → ok(false)
f(ok(X)) → ok(f(X))
if(ok(X1), ok(X2), ok(X3)) → ok(if(X1, X2, X3))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(11) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(f(X)) → mark(if(X, c, f(true)))
active(if(true, X, Y)) → mark(X)
active(if(false, X, Y)) → mark(Y)
active(f(X)) → f(active(X))
active(if(X1, X2, X3)) → if(active(X1), X2, X3)
active(if(X1, X2, X3)) → if(X1, active(X2), X3)
f(mark(X)) → mark(f(X))
if(mark(X1), X2, X3) → mark(if(X1, X2, X3))
if(X1, mark(X2), X3) → mark(if(X1, X2, X3))
proper(f(X)) → f(proper(X))
proper(if(X1, X2, X3)) → if(proper(X1), proper(X2), proper(X3))
proper(c) → ok(c)
proper(true) → ok(true)
proper(false) → ok(false)
f(ok(X)) → ok(f(X))
if(ok(X1), ok(X2), ok(X3)) → ok(if(X1, X2, X3))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(12) PisEmptyProof (EQUIVALENT transformation)

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

(13) TRUE

(14) Obligation:

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

F(ok(X)) → F(X)
F(mark(X)) → F(X)

The TRS R consists of the following rules:

active(f(X)) → mark(if(X, c, f(true)))
active(if(true, X, Y)) → mark(X)
active(if(false, X, Y)) → mark(Y)
active(f(X)) → f(active(X))
active(if(X1, X2, X3)) → if(active(X1), X2, X3)
active(if(X1, X2, X3)) → if(X1, active(X2), X3)
f(mark(X)) → mark(f(X))
if(mark(X1), X2, X3) → mark(if(X1, X2, X3))
if(X1, mark(X2), X3) → mark(if(X1, X2, X3))
proper(f(X)) → f(proper(X))
proper(if(X1, X2, X3)) → if(proper(X1), proper(X2), proper(X3))
proper(c) → ok(c)
proper(true) → ok(true)
proper(false) → ok(false)
f(ok(X)) → ok(f(X))
if(ok(X1), ok(X2), ok(X3)) → ok(if(X1, X2, X3))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(15) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

F(mark(X)) → F(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
F(x1) = F(x1)
ok(x1) = x1
mark(x1) = mark(x1)
active(x1) = active(x1)
f(x1) = f(x1)
if(x1, x2, x3) = if(x1, x2, x3)
c = c
true = true
false = false
proper(x1) = proper(x1)
top(x1) = top

Recursive Path Order [RPO].
Precedence:

active₁ > f₁ > mark₁
active₁ > f₁ > c
active₁ > if₃ > mark₁
active₁ > true > mark₁
proper₁ > f₁ > mark₁
proper₁ > f₁ > c
proper₁ > if₃ > mark₁
proper₁ > true > mark₁
proper₁ > false > mark₁

The following usable rules [FROCOS05] were oriented:

active(f(X)) → mark(if(X, c, f(true)))
active(if(true, X, Y)) → mark(X)
active(if(false, X, Y)) → mark(Y)
active(f(X)) → f(active(X))
active(if(X1, X2, X3)) → if(active(X1), X2, X3)
active(if(X1, X2, X3)) → if(X1, active(X2), X3)
f(mark(X)) → mark(f(X))
if(mark(X1), X2, X3) → mark(if(X1, X2, X3))
if(X1, mark(X2), X3) → mark(if(X1, X2, X3))
proper(f(X)) → f(proper(X))
proper(if(X1, X2, X3)) → if(proper(X1), proper(X2), proper(X3))
proper(c) → ok(c)
proper(true) → ok(true)
proper(false) → ok(false)
f(ok(X)) → ok(f(X))
if(ok(X1), ok(X2), ok(X3)) → ok(if(X1, X2, X3))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(16) Obligation:

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

F(ok(X)) → F(X)

The TRS R consists of the following rules:

active(f(X)) → mark(if(X, c, f(true)))
active(if(true, X, Y)) → mark(X)
active(if(false, X, Y)) → mark(Y)
active(f(X)) → f(active(X))
active(if(X1, X2, X3)) → if(active(X1), X2, X3)
active(if(X1, X2, X3)) → if(X1, active(X2), X3)
f(mark(X)) → mark(f(X))
if(mark(X1), X2, X3) → mark(if(X1, X2, X3))
if(X1, mark(X2), X3) → mark(if(X1, X2, X3))
proper(f(X)) → f(proper(X))
proper(if(X1, X2, X3)) → if(proper(X1), proper(X2), proper(X3))
proper(c) → ok(c)
proper(true) → ok(true)
proper(false) → ok(false)
f(ok(X)) → ok(f(X))
if(ok(X1), ok(X2), ok(X3)) → ok(if(X1, X2, X3))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(17) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

F(ok(X)) → F(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
F(x1) = F(x1)
ok(x1) = ok(x1)
active(x1) = active(x1)
f(x1) = x1
mark(x1) = mark(x1)
if(x1, x2, x3) = if(x1, x2, x3)
c = c
true = true
false = false
proper(x1) = proper(x1)
top(x1) = top

Recursive Path Order [RPO].
Precedence:

active₁ > if₃ > ok₁ > top
active₁ > if₃ > mark₁
active₁ > c > ok₁ > top
active₁ > true
proper₁ > if₃ > ok₁ > top
proper₁ > if₃ > mark₁
proper₁ > c > ok₁ > top
proper₁ > true
proper₁ > false

The following usable rules [FROCOS05] were oriented:

active(f(X)) → mark(if(X, c, f(true)))
active(if(true, X, Y)) → mark(X)
active(if(false, X, Y)) → mark(Y)
active(f(X)) → f(active(X))
active(if(X1, X2, X3)) → if(active(X1), X2, X3)
active(if(X1, X2, X3)) → if(X1, active(X2), X3)
f(mark(X)) → mark(f(X))
if(mark(X1), X2, X3) → mark(if(X1, X2, X3))
if(X1, mark(X2), X3) → mark(if(X1, X2, X3))
proper(f(X)) → f(proper(X))
proper(if(X1, X2, X3)) → if(proper(X1), proper(X2), proper(X3))
proper(c) → ok(c)
proper(true) → ok(true)
proper(false) → ok(false)
f(ok(X)) → ok(f(X))
if(ok(X1), ok(X2), ok(X3)) → ok(if(X1, X2, X3))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(18) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(f(X)) → mark(if(X, c, f(true)))
active(if(true, X, Y)) → mark(X)
active(if(false, X, Y)) → mark(Y)
active(f(X)) → f(active(X))
active(if(X1, X2, X3)) → if(active(X1), X2, X3)
active(if(X1, X2, X3)) → if(X1, active(X2), X3)
f(mark(X)) → mark(f(X))
if(mark(X1), X2, X3) → mark(if(X1, X2, X3))
if(X1, mark(X2), X3) → mark(if(X1, X2, X3))
proper(f(X)) → f(proper(X))
proper(if(X1, X2, X3)) → if(proper(X1), proper(X2), proper(X3))
proper(c) → ok(c)
proper(true) → ok(true)
proper(false) → ok(false)
f(ok(X)) → ok(f(X))
if(ok(X1), ok(X2), ok(X3)) → ok(if(X1, X2, X3))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(19) PisEmptyProof (EQUIVALENT transformation)

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

(20) TRUE

(21) Obligation:

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

PROPER(if(X1, X2, X3)) → PROPER(X1)
PROPER(f(X)) → PROPER(X)
PROPER(if(X1, X2, X3)) → PROPER(X2)
PROPER(if(X1, X2, X3)) → PROPER(X3)

The TRS R consists of the following rules:

active(f(X)) → mark(if(X, c, f(true)))
active(if(true, X, Y)) → mark(X)
active(if(false, X, Y)) → mark(Y)
active(f(X)) → f(active(X))
active(if(X1, X2, X3)) → if(active(X1), X2, X3)
active(if(X1, X2, X3)) → if(X1, active(X2), X3)
f(mark(X)) → mark(f(X))
if(mark(X1), X2, X3) → mark(if(X1, X2, X3))
if(X1, mark(X2), X3) → mark(if(X1, X2, X3))
proper(f(X)) → f(proper(X))
proper(if(X1, X2, X3)) → if(proper(X1), proper(X2), proper(X3))
proper(c) → ok(c)
proper(true) → ok(true)
proper(false) → ok(false)
f(ok(X)) → ok(f(X))
if(ok(X1), ok(X2), ok(X3)) → ok(if(X1, X2, X3))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(22) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PROPER(if(X1, X2, X3)) → PROPER(X1)
PROPER(f(X)) → PROPER(X)
PROPER(if(X1, X2, X3)) → PROPER(X2)
PROPER(if(X1, X2, X3)) → PROPER(X3)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
PROPER(x1) = PROPER(x1)
if(x1, x2, x3) = if(x1, x2, x3)
f(x1) = f(x1)
active(x1) = active(x1)
mark(x1) = x1
c = c
true = true
false = false
proper(x1) = proper(x1)
ok(x1) = ok
top(x1) = top

Recursive Path Order [RPO].
Precedence:

proper₁ > false > PROPER₁
proper₁ > ok > active₁ > if₃ > PROPER₁
proper₁ > ok > active₁ > f₁ > PROPER₁
proper₁ > ok > active₁ > c > PROPER₁
proper₁ > ok > active₁ > true > PROPER₁
proper₁ > ok > top > PROPER₁

The following usable rules [FROCOS05] were oriented:

active(f(X)) → mark(if(X, c, f(true)))
active(if(true, X, Y)) → mark(X)
active(if(false, X, Y)) → mark(Y)
active(f(X)) → f(active(X))
active(if(X1, X2, X3)) → if(active(X1), X2, X3)
active(if(X1, X2, X3)) → if(X1, active(X2), X3)
f(mark(X)) → mark(f(X))
if(mark(X1), X2, X3) → mark(if(X1, X2, X3))
if(X1, mark(X2), X3) → mark(if(X1, X2, X3))
proper(f(X)) → f(proper(X))
proper(if(X1, X2, X3)) → if(proper(X1), proper(X2), proper(X3))
proper(c) → ok(c)
proper(true) → ok(true)
proper(false) → ok(false)
f(ok(X)) → ok(f(X))
if(ok(X1), ok(X2), ok(X3)) → ok(if(X1, X2, X3))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(23) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(f(X)) → mark(if(X, c, f(true)))
active(if(true, X, Y)) → mark(X)
active(if(false, X, Y)) → mark(Y)
active(f(X)) → f(active(X))
active(if(X1, X2, X3)) → if(active(X1), X2, X3)
active(if(X1, X2, X3)) → if(X1, active(X2), X3)
f(mark(X)) → mark(f(X))
if(mark(X1), X2, X3) → mark(if(X1, X2, X3))
if(X1, mark(X2), X3) → mark(if(X1, X2, X3))
proper(f(X)) → f(proper(X))
proper(if(X1, X2, X3)) → if(proper(X1), proper(X2), proper(X3))
proper(c) → ok(c)
proper(true) → ok(true)
proper(false) → ok(false)
f(ok(X)) → ok(f(X))
if(ok(X1), ok(X2), ok(X3)) → ok(if(X1, X2, X3))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(24) PisEmptyProof (EQUIVALENT transformation)

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

(25) TRUE

(26) Obligation:

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

ACTIVE(if(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(f(X)) → ACTIVE(X)
ACTIVE(if(X1, X2, X3)) → ACTIVE(X2)

The TRS R consists of the following rules:

active(f(X)) → mark(if(X, c, f(true)))
active(if(true, X, Y)) → mark(X)
active(if(false, X, Y)) → mark(Y)
active(f(X)) → f(active(X))
active(if(X1, X2, X3)) → if(active(X1), X2, X3)
active(if(X1, X2, X3)) → if(X1, active(X2), X3)
f(mark(X)) → mark(f(X))
if(mark(X1), X2, X3) → mark(if(X1, X2, X3))
if(X1, mark(X2), X3) → mark(if(X1, X2, X3))
proper(f(X)) → f(proper(X))
proper(if(X1, X2, X3)) → if(proper(X1), proper(X2), proper(X3))
proper(c) → ok(c)
proper(true) → ok(true)
proper(false) → ok(false)
f(ok(X)) → ok(f(X))
if(ok(X1), ok(X2), ok(X3)) → ok(if(X1, X2, X3))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(27) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(if(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(if(X1, X2, X3)) → ACTIVE(X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
ACTIVE(x1) = x1
if(x1, x2, x3) = if(x1, x2)
f(x1) = x1
active(x1) = active(x1)
mark(x1) = mark
c = c
true = true
false = false
proper(x1) = proper(x1)
ok(x1) = x1
top(x1) = top

Recursive Path Order [RPO].
Precedence:

active₁ > if₂ > mark
active₁ > c
active₁ > true
false > mark
proper₁ > if₂ > mark
proper₁ > c
proper₁ > true

The following usable rules [FROCOS05] were oriented:

active(f(X)) → mark(if(X, c, f(true)))
active(if(true, X, Y)) → mark(X)
active(if(false, X, Y)) → mark(Y)
active(f(X)) → f(active(X))
active(if(X1, X2, X3)) → if(active(X1), X2, X3)
active(if(X1, X2, X3)) → if(X1, active(X2), X3)
f(mark(X)) → mark(f(X))
if(mark(X1), X2, X3) → mark(if(X1, X2, X3))
if(X1, mark(X2), X3) → mark(if(X1, X2, X3))
proper(f(X)) → f(proper(X))
proper(if(X1, X2, X3)) → if(proper(X1), proper(X2), proper(X3))
proper(c) → ok(c)
proper(true) → ok(true)
proper(false) → ok(false)
f(ok(X)) → ok(f(X))
if(ok(X1), ok(X2), ok(X3)) → ok(if(X1, X2, X3))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(28) Obligation:

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

ACTIVE(f(X)) → ACTIVE(X)

The TRS R consists of the following rules:

active(f(X)) → mark(if(X, c, f(true)))
active(if(true, X, Y)) → mark(X)
active(if(false, X, Y)) → mark(Y)
active(f(X)) → f(active(X))
active(if(X1, X2, X3)) → if(active(X1), X2, X3)
active(if(X1, X2, X3)) → if(X1, active(X2), X3)
f(mark(X)) → mark(f(X))
if(mark(X1), X2, X3) → mark(if(X1, X2, X3))
if(X1, mark(X2), X3) → mark(if(X1, X2, X3))
proper(f(X)) → f(proper(X))
proper(if(X1, X2, X3)) → if(proper(X1), proper(X2), proper(X3))
proper(c) → ok(c)
proper(true) → ok(true)
proper(false) → ok(false)
f(ok(X)) → ok(f(X))
if(ok(X1), ok(X2), ok(X3)) → ok(if(X1, X2, X3))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(29) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(f(X)) → ACTIVE(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
ACTIVE(x1) = ACTIVE(x1)
f(x1) = f(x1)
active(x1) = active(x1)
mark(x1) = mark(x1)
if(x1, x2, x3) = if(x1, x2, x3)
c = c
true = true
false = false
proper(x1) = proper(x1)
ok(x1) = x1
top(x1) = top

Recursive Path Order [RPO].
Precedence:

top > active₁ > f₁ > ACTIVE₁ > true
top > active₁ > f₁ > if₃ > mark₁ > true
top > active₁ > c > true
top > proper₁ > f₁ > ACTIVE₁ > true
top > proper₁ > f₁ > if₃ > mark₁ > true
top > proper₁ > false > true

The following usable rules [FROCOS05] were oriented:

active(f(X)) → mark(if(X, c, f(true)))
active(if(true, X, Y)) → mark(X)
active(if(false, X, Y)) → mark(Y)
active(f(X)) → f(active(X))
active(if(X1, X2, X3)) → if(active(X1), X2, X3)
active(if(X1, X2, X3)) → if(X1, active(X2), X3)
f(mark(X)) → mark(f(X))
if(mark(X1), X2, X3) → mark(if(X1, X2, X3))
if(X1, mark(X2), X3) → mark(if(X1, X2, X3))
proper(f(X)) → f(proper(X))
proper(if(X1, X2, X3)) → if(proper(X1), proper(X2), proper(X3))
proper(c) → ok(c)
proper(true) → ok(true)
proper(false) → ok(false)
f(ok(X)) → ok(f(X))
if(ok(X1), ok(X2), ok(X3)) → ok(if(X1, X2, X3))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(30) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(f(X)) → mark(if(X, c, f(true)))
active(if(true, X, Y)) → mark(X)
active(if(false, X, Y)) → mark(Y)
active(f(X)) → f(active(X))
active(if(X1, X2, X3)) → if(active(X1), X2, X3)
active(if(X1, X2, X3)) → if(X1, active(X2), X3)
f(mark(X)) → mark(f(X))
if(mark(X1), X2, X3) → mark(if(X1, X2, X3))
if(X1, mark(X2), X3) → mark(if(X1, X2, X3))
proper(f(X)) → f(proper(X))
proper(if(X1, X2, X3)) → if(proper(X1), proper(X2), proper(X3))
proper(c) → ok(c)
proper(true) → ok(true)
proper(false) → ok(false)
f(ok(X)) → ok(f(X))
if(ok(X1), ok(X2), ok(X3)) → ok(if(X1, X2, X3))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(31) PisEmptyProof (EQUIVALENT transformation)

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

(32) TRUE

(33) Obligation:

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

TOP(ok(X)) → TOP(active(X))
TOP(mark(X)) → TOP(proper(X))

The TRS R consists of the following rules:

active(f(X)) → mark(if(X, c, f(true)))
active(if(true, X, Y)) → mark(X)
active(if(false, X, Y)) → mark(Y)
active(f(X)) → f(active(X))
active(if(X1, X2, X3)) → if(active(X1), X2, X3)
active(if(X1, X2, X3)) → if(X1, active(X2), X3)
f(mark(X)) → mark(f(X))
if(mark(X1), X2, X3) → mark(if(X1, X2, X3))
if(X1, mark(X2), X3) → mark(if(X1, X2, X3))
proper(f(X)) → f(proper(X))
proper(if(X1, X2, X3)) → if(proper(X1), proper(X2), proper(X3))
proper(c) → ok(c)
proper(true) → ok(true)
proper(false) → ok(false)
f(ok(X)) → ok(f(X))
if(ok(X1), ok(X2), ok(X3)) → ok(if(X1, X2, X3))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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